| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 253852 | blacktulip | Političari (COCI20_politicari) | C++17 | 42 ms | 3448 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 <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define int long long
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 505;
const lo mod = 1000000007;
int n,m,b[li],a[li][li],k,flag,t,vis[li][li];
int cev;
string s;
vector<int> v;
main(void){
	scanf("%lld %lld",&n,&k);
	FOR{
		for(int j=1;j<=n;j++){
			scanf("%lld",&a[i][j]);
		}
	}
	if(k==1){printf("1\n");return 0;}
	int gel=1;
	int node=2;
	cev=2;
	v.pb(1);
	v.pb(2);
	while(cev<k){
		int at=node;
		if(vis[node][gel]){
			printf("%lld\n",v[vis[node][gel]+(k-vis[node][gel])%(cev-vis[node][gel])-1]);
			return 0;
		}
		vis[node][gel]=cev;
		node=a[node][gel];
		gel=at;
		cev++;
		v.pb(node);
	}
	printf("%lld\n",node);
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
