Submission #1501173
Source Code Expand
using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.Text; class TEST{ static void Main(){ Sol mySol =new Sol(); mySol.Solve(); } } class Sol{ public void Solve(){ int[] vis = new int[N]; for(int i=0;i<N;i++) vis[i] = -1; int peri = 0; int lpstart = 0; int now = A; var L = new List<int>(); for(int i=0;i<N+2;i++){ if(vis[now] == -1){ L.Add(now); vis[now] = i; now = B[now]; continue; } lpstart = vis[now]; peri = i - vis[now]; break; } //Console.WriteLine(String.Join(" ",L)); if(K.Length < 8){ int kl = int.Parse(K); if(kl < L.Count){ Console.WriteLine(L[kl] + 1); return; } } long mm = 0; long keta = 1; for(int i=K.Length-1;i>=0;i--){ mm += (keta * (K[i] - '0')); mm %= peri; keta *= 10; keta %= peri; } mm = (mm - lpstart) % peri; if(mm < 0) mm += peri; Console.WriteLine(L[(int)mm + lpstart] + 1); } int N,A; String K; int[] B; public Sol(){ var d = ria(); N = d[0]; A = d[1] - 1;//0-indexed K = rs(); B = ria(); for(int i=0;i<N;i++) B[i] = B[i] - 1;//0-indexed } static String rs(){return Console.ReadLine();} static int ri(){return int.Parse(Console.ReadLine());} static long rl(){return long.Parse(Console.ReadLine());} static double rd(){return double.Parse(Console.ReadLine());} static String[] rsa(){return Console.ReadLine().Split(' ');} static int[] ria(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>int.Parse(e));} static long[] rla(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>long.Parse(e));} static double[] rda(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>double.Parse(e));} }
Submission Info
Submission Time | |
---|---|
Task | D - へんてこ辞書 |
User | kuuso |
Language | C# (Mono 4.6.2.0) |
Score | 100 |
Code Size | 1823 Byte |
Status | AC |
Exec Time | 53 ms |
Memory | 18784 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 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 | 48 ms | 14688 KB |
subtask0_1.txt | AC | 43 ms | 14048 KB |
subtask0_2.txt | AC | 47 ms | 14432 KB |
subtask0_3.txt | AC | 40 ms | 13536 KB |
subtask0_4.txt | AC | 50 ms | 14816 KB |
subtask0_5.txt | AC | 44 ms | 15968 KB |
subtask0_6.txt | AC | 40 ms | 15584 KB |
subtask0_7.txt | AC | 46 ms | 14432 KB |
subtask0_8.txt | AC | 40 ms | 11488 KB |
subtask0_9.txt | AC | 49 ms | 18784 KB |
subtask0_sample_01.txt | AC | 21 ms | 9172 KB |
subtask0_sample_03.txt | AC | 21 ms | 11220 KB |
subtask1_0.txt | AC | 44 ms | 15968 KB |
subtask1_1.txt | AC | 47 ms | 16480 KB |
subtask1_10.txt | AC | 53 ms | 17376 KB |
subtask1_11.txt | AC | 21 ms | 9172 KB |
subtask1_2.txt | AC | 41 ms | 11744 KB |
subtask1_3.txt | AC | 38 ms | 13280 KB |
subtask1_4.txt | AC | 41 ms | 11616 KB |
subtask1_5.txt | AC | 49 ms | 16736 KB |
subtask1_6.txt | AC | 40 ms | 13664 KB |
subtask1_7.txt | AC | 39 ms | 13536 KB |
subtask1_8.txt | AC | 52 ms | 15200 KB |
subtask1_9.txt | AC | 52 ms | 17248 KB |
subtask1_sample_02.txt | AC | 21 ms | 11220 KB |