# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583626 | AGE | Političari (COCI20_politicari) | C++14 | 0 ms | 0 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>
#define F first
#define S second
#define pb push_back
#define int long long
using namespace std;
const int N=1e6,M=2e3,mod=1e9+7;
int a[1000][1000];
map<pair<int,int>,int>viss;
vector<pair<int,int>>v;
pair<int,int>anss;
main()
{
v.clear();
anss={0,0};
viss.clear();
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
v.pb({0,1});
v.pb({1,2});
viss[{0,1}]=1;
viss[{1,2}]=1;
while(1){
int x=v.size()-1;
if(viss[{v[x].S,a[v[x].S-1][v[x].F-1]}]==1){
anss.F=v[x].S;
anss.S=a[v[x].S-1][v[x].F-1];
break;
}
viss[{v[x].S,a[v[x].S-1][v[x].F-1]}]=1;
v.pb({v[x].S,a[v[x].S-1][v[x].F-1]});
}
assert(v.size()>20);
reverse(v.begin(),v.end());
while((v.size())&&((*v.rbegin()).F!=anss.F||(*v.rbegin()).S!=anss.S)&&m>0){
if((*v.rbegin()).S==51)
ok=1;
v.pop_back(),m--;
}
assert(ok!=1);
reverse(v.begin(),v.end());
int xx=m%v.size();
if(xx==0)
xx=v.size();
xx--;
// assert(v[xx].S>12);
cout<<v[xx].S<<endl;
return 0;
}