| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 291272 | penguinhacker | Političari (COCI20_politicari) | C++17 | 276 ms | 60152 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;
#define ll long long
#define ar array
const int mxN=500;
int n, nxt[mxN*mxN][60];
ll k;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k, --k;
	for (int i=0; i<n; ++i) for (int j=0; j<n; ++j) {
		cin >> nxt[n*j+i][0], --nxt[n*j+i][0];
		if (i==j) continue;
		nxt[n*j+i][0]+=n*i;
	}
	for (int j=1; j<60; ++j) for (int i=0; i<n*n; ++i) if (i/n!=i%n) nxt[i][j]=nxt[nxt[i][j-1]][j-1];
	int cur=1;
	for (int j=0; j<60; ++j) {
		if ((k>>j)&1) {
			cur=nxt[cur][j];
		}
	}
	int ans=(cur/n)+1;
	cout << ans << "\n";
	return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
