oj.uz

Submission #201442

# Submission time Handle Problem Language Result Execution time Memory
201442 2020-02-10T14:58:57 Z ami Političari (COCI20_politicari) C++17
70 / 70
 31 ms 2300 KB 
#include <bits/stdc++.h>
#define sz(c)       int(c.size())
#define rep(i,a,b)  for (int i=a; i<(b); ++i)
#define per(i,a,b)  for (int i=(b)-1; i>=(a); --i)
#define fore(c,...) for (auto __VA_ARGS__:(c))
using namespace std;
typedef long long ll;



int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	cout<<fixed<<setprecision(10);

	int N;
	ll K;
	cin>>N>>K;

	vector<vector<int>> a(N,vector<int>(N));
	rep(i,0,N) rep(j,0,N) cin>>a[i][j], a[i][j]--;

	vector<vector<int>> pre(N,vector<int>(N,-1));
	vector<int> ord;
	ord.emplace_back(0);
	ord.emplace_back(1);
	pre[0][1]=0;
	int x=0,y=1,l=1;
	while (pre[y][a[y][x]]==-1) {
		int z=a[y][x];
		pre[y][z]=l++;
		x=y;
		y=z;
		ord.emplace_back(z);
	}

	K--;
	if (K<sz(ord)) {
		cout<<ord[K]+1<<'\n';
		return 0;
	}

	int p=pre[y][a[y][x]];
	K-=p;
	K%=l-p;
	assert(p+K<sz(ord)-1);
	cout<<ord[p+K]+1<<'\n';
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 9 ms 760 KB Output is correct
3 Correct 18 ms 1656 KB Output is correct
4 Correct 23 ms 1912 KB Output is correct
5 Correct 27 ms 2300 KB Output is correct
6 Correct 29 ms 2296 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 7 ms 504 KB Output is correct
9 Correct 11 ms 760 KB Output is correct
10 Correct 22 ms 1916 KB Output is correct
11 Correct 31 ms 2296 KB Output is correct
12 Correct 26 ms 2296 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 ms 504 KB Output is correct