Submission #477030

#	Time	Username	Problem	Language	Result	Execution time	Memory
477030		mychecksedad	Političari (COCI20_politicari)	C++17	5 / 70	24 ms	2552 KiB

politicari

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 550, M = 1e5+10, F = 2147483646, K = 20;


int n, arr[N][N];
ll k;
vector<int> ans;
bool b[N][N];
void dfs(int x, int y){
    if(b[y][x]){
        return;
    }
    dfs(arr[x][y], x);
}
int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    cin >> n >> k;
    for(int i = 1; i <= n; i++) for(int j = 0; j <= n; j++) cin >> arr[i][j];
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) b[i][j] = 0;
    ans.pb(1);
    b[1][2] = 1;
    dfs(2, 1);
    ll a = (k % ll(ans.size()) == 0 ? ll(ans.size()) - 1 : k % ll(ans.size()));
    cout << ans[a];

    return 0;
}

• Subtask 1: 5 / 70