oj.uz

답안 #477031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477031 2021-09-29T21:03:11 Z mychecksedad Političari (COCI20_politicari) C++17
15 / 70
 18 ms 1616 KB 
#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;
    }
    ans.pb(x);
    b[y][x] = 1;
    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 = 1; 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);
    dfs(2, 1);
    // for(int v: ans) cout << v << '\n';
    --k;
    ll a = k % ll(ans.size());
    cout << ans[a];

    return 0;
}

Subtask #1
15.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 4 ms 884 KB Output isn't correct
3 Incorrect 11 ms 1336 KB Output isn't correct
4 Incorrect 14 ms 1484 KB Output isn't correct
5 Incorrect 17 ms 1604 KB Output isn't correct
6 Incorrect 16 ms 1612 KB Output isn't correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 2 ms 588 KB Output isn't correct
9 Incorrect 5 ms 972 KB Output isn't correct
10 Incorrect 13 ms 1484 KB Output isn't correct
11 Incorrect 16 ms 1612 KB Output isn't correct
12 Incorrect 18 ms 1616 KB Output isn't correct
13 Incorrect 0 ms 460 KB Output isn't correct
14 Correct 1 ms 588 KB Output is correct