# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731643 | vjudge1 | Političari (COCI20_politicari) | C++14 | 22 ms | 3412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<map>
#include<set>
#include<climits>
#include<numeric>
#include<queue>
#include<unordered_map>
#include<string>
#include<climits>
#include<unordered_set>
#include<bitset>
#include<cstring>
#include<cmath>
#include<stack>
#if 1
#define pb push_back
#define st first
#define nd second
#define endl '\n'
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MAXN ((int)(2e5+5))
#define int long long int
using namespace std;
const int inf = 1e17 + 5;
#endif
void fileio(string s){
#ifndef ONLINE_JUDGE
freopen((s+string(".in")).c_str(),"r",stdin);
freopen((s+string(".out")).c_str(),"w",stdout);
#endif
}
signed main(){
//fileio("test");
fio;
int n, k;
cin >> n >> k;
int a[n + 1][n + 1];
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
cin >> a[i][j];
}
}
bool vis[n + 1][n + 1];
memset(vis, false, sizeof(vis));
vector<int>fst(2), cycle;
int i = 1, cur = 2, prev = 1;
fst[1] = vis[1][0] = 1;
while(!vis[cur][prev]){
vis[cur][prev] = true;
fst.pb(cur);
int new_cur = a[cur][prev];
prev = cur;
cur = new_cur;
}
memset(vis, false, sizeof(vis));
while(!vis[cur][prev]){
vis[cur][prev] = true;
cycle.pb(cur);
int new_cur = a[cur][prev];
prev = cur;
cur = new_cur;
}
int f = fst.size(), c = cycle.size();
if(k < f){
cout << fst[k] << endl;
}
else{
k -= f;
cout << cycle[k % c] << endl;
}
}
/*
1 2 4 2 1 4 3
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |