oj.uz

Submission #849371

# Submission time Handle Problem Language Result Execution time Memory
849371 2023-09-14T14:25:37 Z vjudge1 Političari (COCI20_politicari) C++17
15 / 70
 14 ms 4316 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];
vector<int> elt;
int vt[505];
int n,k;

void dfs(int u,int v)
{
    if (danhdau[v]>n)
    {
        int l=vt[v];
        int r=vt[u];
        int leng=r-l+1;
        k-=l;
        k%=leng;
        cout << elt[k+l] << '\n';
        return;
    }
    else
    {
        danhdau[v]++;
        elt.push_back(v);
        vt[v]=elt.size()-1;
        if (vt[v]==k)
        {
            cout << v;
            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]=0;
    danhdau[1]++;
    dfs(1,2);
}

Subtask #1
15.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Incorrect 3 ms 1624 KB Output isn't correct
3 Correct 10 ms 3320 KB Output is correct
4 Incorrect 11 ms 3160 KB Output isn't correct
5 Incorrect 14 ms 4316 KB Output isn't correct
6 Incorrect 13 ms 3808 KB Output isn't correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 2 ms 1116 KB Output isn't correct
9 Incorrect 4 ms 2136 KB Output isn't correct
10 Incorrect 11 ms 3296 KB Output isn't correct
11 Incorrect 13 ms 4316 KB Output isn't correct
12 Correct 13 ms 3416 KB Output is correct
13 Incorrect 1 ms 600 KB Output isn't correct
14 Incorrect 2 ms 1112 KB Output isn't correct