kattis/medium/congaline.cpp at main · dombinks/kattis · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <iostream>
#include <list>
#include <algorithm>
#include <map>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, q;
    cin >> n >> q;

    map<string,string> partner;
    list<string> line;

    for(int i = 0; i < n; i++)
    {
        string a, b;
        cin >> a >> b;

        partner[a] = b;
        partner[b] = a;

        line.push_back(a);
        line.push_back(b);
    }

    string instructions;
    cin >> instructions;

    list<string>::iterator mic = line.begin();

    for(char inst : instructions)
    {
        if(inst == 'F')
        {
            mic--;
        }
        else if(inst == 'B')
        {
            mic++;
        }
        else if(inst == 'R')
        {
            string person = *mic;
            mic++;
            if(mic == line.end())
            {
                mic = line.begin();
            }
            else
            {
                line.erase(find(line.begin(), line.end(), person));
                line.push_back(person);
            }
        }
        else if(inst == 'C')
        {
            string person = *mic;
            mic++;
            if(mic == line.end())
            {
                mic = line.begin();
            }
            else
            {
                line.erase(find(line.begin(), line.end(), person));
                list<string>::iterator index = find(line.begin(), line.end(),partner[person]);
                index++;
                line.insert(index, person);
            }
        }
        else if(inst == 'P')
        {
            cout << partner[*mic] << endl;
        }
    }

    cout << endl;
    for(string person : line)
    {
        cout << person << endl;
    }

    return 0;
}