Submission #1812058
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i)) using ll = long long; using P = pair<int, int>; using namespace std; template<class T> void vin(vector<T>& v, int n) { v.resize(n); for (int i = 0; i < n; ++i) { cin >> v[i]; } } bool used[100001]; int main() { ll N, a; string k; cin >> N >> a >> k; a--; vector<int> b(N); rep(i, N) { cin >> b[i]; b[i]--; } vector<int> v; ll T = 0; ll next = a; rep(i, N) { if (used[next]) { rep(j, v.size()) { if (v[j] == next) { T = j; break; } } break; } else { v.push_back(next); used[next] = 1; next = b[next]; } } ll mod = 0; bool f = false; rep(i, k.length()) { mod = (mod * 10 + (k[i] - '0')); if (mod > N) { mod %= (v.size() - T); f = true; } } if (f) { int add = 0; while (add < N) add += (v.size() - T); mod += add; } next = a; rep(i, mod) { next = b[next]; } cout << next+1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - へんてこ辞書 |
User | dsytk7 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1329 Byte |
Status | AC |
Exec Time | 32 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 50 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_03.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask1_sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 26 ms | 640 KB |
subtask0_1.txt | AC | 21 ms | 640 KB |
subtask0_2.txt | AC | 24 ms | 640 KB |
subtask0_3.txt | AC | 18 ms | 512 KB |
subtask0_4.txt | AC | 26 ms | 640 KB |
subtask0_5.txt | AC | 21 ms | 640 KB |
subtask0_6.txt | AC | 18 ms | 512 KB |
subtask0_7.txt | AC | 23 ms | 640 KB |
subtask0_8.txt | AC | 18 ms | 512 KB |
subtask0_9.txt | AC | 25 ms | 640 KB |
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 21 ms | 768 KB |
subtask1_1.txt | AC | 25 ms | 768 KB |
subtask1_10.txt | AC | 31 ms | 896 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_2.txt | AC | 20 ms | 640 KB |
subtask1_3.txt | AC | 17 ms | 640 KB |
subtask1_4.txt | AC | 19 ms | 640 KB |
subtask1_5.txt | AC | 26 ms | 896 KB |
subtask1_6.txt | AC | 20 ms | 768 KB |
subtask1_7.txt | AC | 18 ms | 768 KB |
subtask1_8.txt | AC | 32 ms | 768 KB |
subtask1_9.txt | AC | 30 ms | 896 KB |
subtask1_sample_02.txt | AC | 1 ms | 256 KB |