| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 867302 | Reyam | Političari (COCI20_politicari) | C++14 | 1093 ms | 3576 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 pb push_back
#define ll long long
#define fix fixed<<setprecision(20)
#define endl'\n'
#define c(x) cout<<x<<endl
#define int ll
 //int a[200090],pre[200090],suf[200090];
 int mx[]={0,0,-1,1},my[]={-1,1,0,0};
 int a[600][600];
 bool vis[200][200];
 int n,m;
 bool inside(int i,int j){
 return (i&&i<=n&&j&&j<=m);
    }
    void dfs (int i,int j){
        vis[i][j]=1;
        for(int k=0;k<4;k++){
            int nx=i+mx[k],ny=j+my[k];
            if(inside(nx,ny)&& !vis[nx][ny]&& a[nx][ny]=='*') { vis[nx][ny]=1;
            dfs(nx,ny);}
        }
    }
int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  cin>>n;
  int k; cin>>k;
  for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    cin>>a[i][j];
     int x=2,y=1;
     int ans=0;
     for(int i=1;i<k-1;i++){
         ans= a[x][y];
         //cout<<ans<<endl;
         y=x;
         x=ans;
     }
     cout<<ans<<endl;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
