Submission #2715364
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; #define rep(i, n) for(int i = 0; i < (int)(n); i++) int a[100010]; bool pushed[100010]; int N; int main() { int count = 0; cin >> N; for (int i = 1; i <= N; i++) { cin >> a[i]; }; int i = 1; while(i != 2) { if (pushed[i]) { count = -1; break; } pushed[i] = true; i = a[i]; count++; } cout << count << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Trained? |
User | Toriatama |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 450 Byte |
Status | AC |
Exec Time | 39 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 37 ms | 768 KB |
02.txt | AC | 36 ms | 768 KB |
03.txt | AC | 36 ms | 768 KB |
04.txt | AC | 37 ms | 768 KB |
05.txt | AC | 36 ms | 768 KB |
06.txt | AC | 36 ms | 768 KB |
07.txt | AC | 37 ms | 768 KB |
08.txt | AC | 36 ms | 768 KB |
09.txt | AC | 36 ms | 768 KB |
10.txt | AC | 39 ms | 768 KB |
11.txt | AC | 37 ms | 768 KB |
12.txt | AC | 35 ms | 768 KB |
13.txt | AC | 36 ms | 768 KB |
14.txt | AC | 37 ms | 768 KB |
15.txt | AC | 36 ms | 640 KB |
16.txt | AC | 36 ms | 768 KB |
17.txt | AC | 35 ms | 640 KB |
18.txt | AC | 36 ms | 768 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |