| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 849427 | vjudge1 | Političari (COCI20_politicari) | C++17 | 18 ms | 6492 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 int long long
#define ll pair<int,int>
using namespace std;
long long a[505][505];
long long danhdau[505][505];
vector<int> elt;
int vt[505][505];
int n,k;
void dfs(int u,int v)
{
    if (danhdau[u][v]==1)
    {
        // k++;
        //elt.pop_back();
        int l=vt[u][v];
        int r=elt.size()-1;
        int leng=r-l+1;
        k-=l;
        k%=leng;
        cout << elt[k+l] << '\n';
        return;
    }
    else
    {
        danhdau[u][v]=1;
        elt.push_back(u);
        vt[u][v]=elt.size()-1;
        if (vt[u][v]==k)
        {
            cout << u;
            return;
        }
        dfs(v,a[v][u]);
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> k;
    k--;
    for (int i=1;i<=n;i++)
    {
        for (int i2=1;i2<=n;i2++)
        {
            cin >> a[i][i2];
        }
    }
    // elt.push_back(1);
    // vt[1][2]=0;
    // danhdau[1]++;
    dfs(1,2);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
