#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void solve(){
int n,k;
cin >> n >> k; --k;
vector<vector<int>> v(n),vis(n);
for(int i = 0; i < n; i++){
v[i].assign(n,0); vis[i].assign(n,-1);
for(int j = 0; j < n; j++){
cin >> v[i][j];
}
}
vector<int> cyc(1,0);
int last = 0,cur = 1;
while(vis[last][cur] == -1){
vis[last][cur] = cyc.size() - 1;
cyc.push_back(cur);
int tmp = last; last = cur;
cur = v[cur][tmp] - 1;
}
cyc.pop_back();
if(k <= vis[last][cur]){
cout << 1 + cyc[k] << endl;
return;
}
else k -= vis[last][cur];
vector<int> nw;
for(int i = vis[last][cur]; i < cyc.size(); i++){
nw.push_back(cyc[i]);
}
cout << 1 + nw[k % nw.size()] << endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--)
solve();
return 0;
}
Compilation message
politicari.cpp: In function 'void solve()':
politicari.cpp:43:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
43 | for(int i = vis[last][cur]; i < cyc.size(); i++){
| ~~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
4 ms |
980 KB |
Output is correct |
3 |
Correct |
11 ms |
2716 KB |
Output is correct |
4 |
Correct |
15 ms |
3540 KB |
Output is correct |
5 |
Correct |
16 ms |
4180 KB |
Output is correct |
6 |
Correct |
17 ms |
4180 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
2 ms |
600 KB |
Output is correct |
9 |
Correct |
5 ms |
1108 KB |
Output is correct |
10 |
Correct |
15 ms |
3412 KB |
Output is correct |
11 |
Correct |
16 ms |
4172 KB |
Output is correct |
12 |
Correct |
17 ms |
4180 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
596 KB |
Output is correct |