-
Notifications
You must be signed in to change notification settings - Fork 2
/
cruise.cpp
67 lines (62 loc) · 1.91 KB
/
cruise.cpp
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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("cruise.in", "r", stdin);
freopen("cruise.out", "w", stdout);
int N, M, K; cin >> N >> M >> K;
pii lr[N];
int go[N];
for(int i = 0; i < N; i++){
cin >> lr[i].first >> lr[i].second;
lr[i].first--; lr[i].second--;
go[i] = i;
}
for(int i = 0; i < M; i++){
char turn; cin >> turn;
for(int j = 0; j < N; j++){
if(turn == 'L'){
go[j] = lr[go[j]].first;
}else{
go[j] = lr[go[j]].second;
}
}
}
// super cool tortoise and hare fell asleep and the tortoise caught up but they are really confusing so im not implmenting it
map<int, int> been;
int ptr = 0;
int total = 0;
for(; true; total++){
if(total == K){
cout << ptr+1 << endl;
return 0;
}
if(been.find(ptr) != been.end()){
break;
}
been[ptr] = total;
ptr = go[ptr];
}
int before = been[ptr];
int cyclelen = total - been[ptr];
K -= before;
int cycidx = K % cyclelen;
for(auto it = been.begin(); it != been.end(); it++){
if(it -> second == before + cycidx){
cout << it -> first + 1 << endl;
}
}
return 0;
}