Submission #2710987
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> using namespace std; typedef long long int ll; int main() { int n, a; scanf("%d %d", &n, &a); string k; cin>>k; int d=k.length(); int b[100001]; for(int i=1; i<=n; i++){ scanf("%d", &b[i]); } int m, a1[100001]; a1[0]=a; for(int i=1; i<=n; i++){ a1[i]=b[a1[i-1]]; } for(int i=n-1; i>=0; i--){ if(a1[i]==a1[n]){ i=m; break; } } if(d<=6){ int k0=stoi(k); if(k0<=n){ printf("%d\n", a1[k0]); }else{ printf("%d\n", a1[m+(k0-m)%(n-m)]); } return 0; } int x=1; int kmod=0; for(int i=0; i<d; i++){ kmod+=(x*(int)(k[d-1-i]-'0')); kmod%=(n-m); x*=10; x%=(n-m); } kmod=((kmod-m%(n-m)+n-m)%(n-m)); printf("%d\n", a1[m+kmod]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - へんてこ辞書 |
User | chocorusk |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 980 Byte |
Status | WA |
Exec Time | 14 ms |
Memory | 1152 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:17:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &n, &a); ^ ./Main.cpp:23:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &b[i]); ^
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 | 9 ms | 896 KB |
subtask0_1.txt | WA | 8 ms | 768 KB |
subtask0_2.txt | WA | 9 ms | 896 KB |
subtask0_3.txt | WA | 7 ms | 768 KB |
subtask0_4.txt | WA | 10 ms | 1024 KB |
subtask0_5.txt | WA | 8 ms | 768 KB |
subtask0_6.txt | WA | 7 ms | 768 KB |
subtask0_7.txt | WA | 9 ms | 896 KB |
subtask0_8.txt | WA | 7 ms | 768 KB |
subtask0_9.txt | WA | 9 ms | 896 KB |
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | WA | 10 ms | 896 KB |
subtask1_1.txt | WA | 12 ms | 1024 KB |
subtask1_10.txt | WA | 14 ms | 1152 KB |
subtask1_11.txt | WA | 1 ms | 256 KB |
subtask1_2.txt | WA | 9 ms | 896 KB |
subtask1_3.txt | WA | 9 ms | 768 KB |
subtask1_4.txt | WA | 9 ms | 896 KB |
subtask1_5.txt | WA | 12 ms | 1024 KB |
subtask1_6.txt | WA | 11 ms | 896 KB |
subtask1_7.txt | WA | 10 ms | 896 KB |
subtask1_8.txt | WA | 13 ms | 1152 KB |
subtask1_9.txt | WA | 13 ms | 1152 KB |
subtask1_sample_02.txt | AC | 1 ms | 256 KB |