oj.uz

Submission #849388

# Submission time Handle Problem Language Result Execution time Memory
849388 2023-09-14T14:47:41 Z vjudge1 Političari (COCI20_politicari) C++17
10 / 70
 18 ms 6232 KB 
#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)
    {
        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(v);
        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);
}

Subtask #1
10.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 4 ms 5208 KB Output isn't correct
3 Incorrect 8 ms 5724 KB Output isn't correct
4 Incorrect 11 ms 5976 KB Output isn't correct
5 Incorrect 12 ms 6232 KB Output isn't correct
6 Incorrect 18 ms 6232 KB Output isn't correct
7 Correct 1 ms 4440 KB Output is correct
8 Incorrect 1 ms 4700 KB Output isn't correct
9 Incorrect 4 ms 5208 KB Output isn't correct
10 Incorrect 11 ms 5976 KB Output isn't correct
11 Incorrect 12 ms 6232 KB Output isn't correct
12 Incorrect 14 ms 6232 KB Output isn't correct
13 Incorrect 1 ms 4440 KB Output isn't correct
14 Incorrect 2 ms 5208 KB Output isn't correct