oj.uz

답안 #238070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
238070 2020-06-09T21:33:52 Z Haunted_Cpp Političari (COCI20_politicari) C++17
70 / 70
 24 ms 1408 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 5e2 + 5;

bitset<N> vis [N];
vector<pair<int, int> > who;

int g [N][N];

int ciclo = -1;

void dfs (int node, int p) {
  if (vis[node][p]) {
 //   cout << "YH: " << node << ' ' << p << '\n';
    ciclo = find (who.begin(), who.end(), make_pair(node, p) ) - who.begin();
    return;
  }
  who.emplace_back(node, p);
  vis[node][p] = 1;
  dfs (g[node][p], node);
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  long long k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> g[i][j];
      --g[i][j];
    }
  }
  who.emplace_back(0, -1);
  dfs (1, 0);
  --k;
 // for (auto to : who) cout << to.first << ' '<< to.second << '\n';
  if (k < ciclo) {
    cout << who[k].first + 1 << '\n';
  } else {
    k -= ciclo;
    int t = (int) who.size() - ciclo;
    k %= t;
 //   cout << "Y: " << t << ' ' << k << '\n';
    cout << who[ciclo + k].first + 1 << '\n';
  }
  return 0;
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 8 ms 896 KB Output is correct
3 Correct 16 ms 1152 KB Output is correct
4 Correct 18 ms 1280 KB Output is correct
5 Correct 22 ms 1408 KB Output is correct
6 Correct 23 ms 1408 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 18 ms 1280 KB Output is correct
11 Correct 22 ms 1408 KB Output is correct
12 Correct 24 ms 1408 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 640 KB Output is correct