Submission #1240450
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long N = sc.nextLong(); long a = sc.nextLong(); String k = sc.next(); long[] b = new long[(int)N]; for(int i = 0; i < N; i++) { b[i] = sc.nextLong(); } ArrayList<Long> f = new ArrayList<Long>(); f.add(a); long presence = a; long s = 0; long g = 1; for(int i = 0; i < N; i++) { presence = b[(int)presence - 1]; if(f.contains(presence)) { for(int j = 0; j < N; j++) { if(f.get(j) == presence) { s = (long)j; g = (long)(i + 1) - s; break; } } break; } else { f.add(presence); } } long ans = 0; if(k.length() <= 6) { int step = Integer.parseInt(k); int p = (int)a; for(int i = 0; i < step; i++) { p = (int)b[p - 1]; } ans = p; } /** else { // s+tをgで割った余り long r = func(k, g); while(r < s) { r += g; } ans = f.get((int)r); } */ System.out.println(ans); } public static long func(String k, long g) { if(k.length() <= 18) return (Long.parseLong(k)) % g; String sub = k.substring(0, k.length() - 1); long d = Long.parseLong(String.valueOf(k.charAt(k.length() - 1))); long a = (func(sub, g) * 10 + d) % g; return a; } }
Submission Info
Submission Time | |
---|---|
Task | D - へんてこ辞書 |
User | takeya |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 1516 Byte |
Status | WA |
Exec Time | 486 ms |
Memory | 51448 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 | 408 ms | 45588 KB |
subtask0_1.txt | WA | 374 ms | 47024 KB |
subtask0_2.txt | WA | 405 ms | 48056 KB |
subtask0_3.txt | WA | 359 ms | 46052 KB |
subtask0_4.txt | WA | 411 ms | 51448 KB |
subtask0_5.txt | WA | 367 ms | 45796 KB |
subtask0_6.txt | WA | 355 ms | 45828 KB |
subtask0_7.txt | WA | 407 ms | 44144 KB |
subtask0_8.txt | WA | 366 ms | 44612 KB |
subtask0_9.txt | WA | 388 ms | 47460 KB |
subtask0_sample_01.txt | AC | 92 ms | 21844 KB |
subtask0_sample_03.txt | AC | 93 ms | 21844 KB |
subtask1_0.txt | WA | 406 ms | 48296 KB |
subtask1_1.txt | WA | 444 ms | 48092 KB |
subtask1_10.txt | WA | 420 ms | 48892 KB |
subtask1_11.txt | WA | 96 ms | 20820 KB |
subtask1_2.txt | WA | 400 ms | 50296 KB |
subtask1_3.txt | WA | 348 ms | 45364 KB |
subtask1_4.txt | WA | 344 ms | 45444 KB |
subtask1_5.txt | WA | 433 ms | 51096 KB |
subtask1_6.txt | WA | 339 ms | 41128 KB |
subtask1_7.txt | WA | 390 ms | 45964 KB |
subtask1_8.txt | WA | 408 ms | 49432 KB |
subtask1_9.txt | WA | 486 ms | 47988 KB |
subtask1_sample_02.txt | WA | 92 ms | 21076 KB |