Submission #1518051
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> #include <cstring> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define CLR(mat) memset(mat, 0, sizeof(mat)) typedef long long ll; int main() { int N, a; ll K; cin >> N >> a >> K; if(K > 0 && K <= 1e18) { int b[100][N+1]; FOR(i,1,N+1) cin >> b[0][i]; FOR(k,1,100) { FOR(i,1,N+1) { b[k][i] = b[k-1][b[k-1][i]]; } } FOR(i,0,100) { if((K>>i)&1) { a = b[i][a]; } } cout << a << '\n'; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - へんてこ辞書 |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 793 Byte |
Status | WA |
Exec Time | 47 ms |
Memory | 35968 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 50 | 0 / 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 | WA | 44 ms | 34560 KB |
subtask0_1.txt | WA | 37 ms | 28544 KB |
subtask0_2.txt | WA | 42 ms | 32256 KB |
subtask0_3.txt | WA | 31 ms | 23808 KB |
subtask0_4.txt | WA | 47 ms | 35968 KB |
subtask0_5.txt | WA | 36 ms | 27776 KB |
subtask0_6.txt | WA | 31 ms | 23808 KB |
subtask0_7.txt | AC | 43 ms | 31744 KB |
subtask0_8.txt | WA | 31 ms | 23936 KB |
subtask0_9.txt | WA | 43 ms | 33920 KB |
subtask0_sample_01.txt | WA | 1 ms | 256 KB |
subtask0_sample_03.txt | WA | 1 ms | 256 KB |
subtask1_0.txt | WA | 3 ms | 256 KB |
subtask1_1.txt | WA | 4 ms | 256 KB |
subtask1_10.txt | WA | 4 ms | 256 KB |
subtask1_11.txt | WA | 1 ms | 256 KB |
subtask1_2.txt | WA | 3 ms | 256 KB |
subtask1_3.txt | WA | 3 ms | 256 KB |
subtask1_4.txt | WA | 3 ms | 256 KB |
subtask1_5.txt | WA | 3 ms | 256 KB |
subtask1_6.txt | WA | 4 ms | 256 KB |
subtask1_7.txt | WA | 4 ms | 256 KB |
subtask1_8.txt | WA | 3 ms | 256 KB |
subtask1_9.txt | WA | 3 ms | 256 KB |
subtask1_sample_02.txt | WA | 1 ms | 256 KB |