#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll)x.size()
#define f first
#define s second
const ll MAXN=510;
const ll MAXK=100000;
const ll INF = 1e9;
const ll MOD = 1e9+7;
ll N,M,K,Q,R,C,a,b,c,OX;
ll A[MAXN][MAXN];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>N>>K;
for(int i=1;i<=N;++i)for(int j=1;j<=N;++j)cin>>A[i][j];
pi t=mp(2,1);
for(int i=2;i<K;++i){
int x=A[t.f][t.s];
t=mp(x,t.f);
}
cout<<t.f;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Execution timed out |
1086 ms |
1408 KB |
Time limit exceeded |
3 |
Execution timed out |
1091 ms |
2560 KB |
Time limit exceeded |
4 |
Execution timed out |
1089 ms |
2944 KB |
Time limit exceeded |
5 |
Execution timed out |
1091 ms |
3328 KB |
Time limit exceeded |
6 |
Execution timed out |
1091 ms |
3328 KB |
Time limit exceeded |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
6 ms |
896 KB |
Output is correct |
9 |
Correct |
9 ms |
1408 KB |
Output is correct |
10 |
Correct |
20 ms |
2888 KB |
Output is correct |
11 |
Correct |
24 ms |
3328 KB |
Output is correct |
12 |
Correct |
24 ms |
3328 KB |
Output is correct |
13 |
Execution timed out |
1089 ms |
512 KB |
Time limit exceeded |
14 |
Execution timed out |
1095 ms |
896 KB |
Time limit exceeded |