Submission #1240197
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> list = new ArrayList<Long>(); list.add(a); long[] f = new long[(int)N]; f[0] = a; long presence = a; long s = 0; long g = 1; for(int i = 0; i < N; i++) { presence = b[(int)presence - 1]; f[i + 1] = presence; if(list.contains(presence)) { for(int j = 0; j < N; j++) { if(f[j] == presence) { s = (long)j; g = (long)(i + 1) - s; break; } } break; } else { list.add(presence); } } long ans = 0; // s+tをgで割った余り long r = func(k, g); while(r < s) { r += g; } ans = f[(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 | 1361 Byte |
Status | RE |
Exec Time | 2097 ms |
Memory | 454352 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 | AC | 398 ms | 48352 KB |
subtask0_1.txt | AC | 364 ms | 46804 KB |
subtask0_2.txt | AC | 390 ms | 48792 KB |
subtask0_3.txt | AC | 356 ms | 44780 KB |
subtask0_4.txt | AC | 404 ms | 47124 KB |
subtask0_5.txt | AC | 371 ms | 44408 KB |
subtask0_6.txt | AC | 346 ms | 46676 KB |
subtask0_7.txt | AC | 391 ms | 50708 KB |
subtask0_8.txt | AC | 358 ms | 43752 KB |
subtask0_9.txt | AC | 398 ms | 48144 KB |
subtask0_sample_01.txt | AC | 93 ms | 19924 KB |
subtask0_sample_03.txt | WA | 92 ms | 21844 KB |
subtask1_0.txt | MLE | 1446 ms | 394728 KB |
subtask1_1.txt | MLE | 1824 ms | 427120 KB |
subtask1_10.txt | TLE | 2097 ms | 454352 KB |
subtask1_11.txt | RE | 94 ms | 19668 KB |
subtask1_2.txt | MLE | 1071 ms | 393472 KB |
subtask1_3.txt | MLE | 971 ms | 379404 KB |
subtask1_4.txt | MLE | 1078 ms | 385864 KB |
subtask1_5.txt | MLE | 1301 ms | 392208 KB |
subtask1_6.txt | MLE | 1996 ms | 420624 KB |
subtask1_7.txt | MLE | 1851 ms | 415296 KB |
subtask1_8.txt | MLE | 1066 ms | 366320 KB |
subtask1_9.txt | MLE | 1366 ms | 384864 KB |
subtask1_sample_02.txt | RE | 95 ms | 19028 KB |