Submission #538535


Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;

class Myon
{

    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }

    Scanner cin;

    void calc()
    {
        cin = new Scanner();
        int N = cin.nextInt();
        int a = cin.nextInt() - 1;
        string k = cin.next();
        int[] b = new int[N];
        for (int i = 0; i < N; i++)
        {
            b[i] = cin.nextInt() - 1;
        }

        int[] visited = new int[N];
        int step = 1;
        int pos = a;
        while (visited[pos] == 0)
        {
            visited[pos] = step;
            step++;
            pos = b[pos];
        }
        int loop = step - visited[pos];

        int now = 0;
        bool check = false;
        for (int i = 0; i < k.Length; i++)
        {
            now = now * 10 + (k[i] - '0');
            if (now > N)
            {
                now %= loop;
                check = true;
            }
        }

        //減らし過ぎた分を適当に足す
        if (check)
        {
            int add = 0;
            while (add < N) add += loop;

            now += add;
        }

        pos = a;
        for (int i = 0; i < now; i++)
        {
            pos = b[pos];
        }
        Console.WriteLine(pos + 1);
    }
}





class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        i = 0;
        return next();
    }

    public int nextInt()
    {
        return int.Parse(next());
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }

}

Submission Info

Submission Time
Task D - へんてこ辞書
User chokudai
Language C# (Mono 3.2.1.0)
Score 100
Code Size 2148 Byte
Status AC
Exec Time 169 ms
Memory 19004 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 2
AC × 12
AC × 25
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 166 ms 16452 KB
subtask0_1.txt AC 157 ms 15672 KB
subtask0_2.txt AC 161 ms 16228 KB
subtask0_3.txt AC 149 ms 14392 KB
subtask0_4.txt AC 169 ms 18728 KB
subtask0_5.txt AC 152 ms 15644 KB
subtask0_6.txt AC 148 ms 14404 KB
subtask0_7.txt AC 155 ms 16084 KB
subtask0_8.txt AC 149 ms 14456 KB
subtask0_9.txt AC 157 ms 16340 KB
subtask0_sample_01.txt AC 116 ms 8868 KB
subtask0_sample_03.txt AC 116 ms 8916 KB
subtask1_0.txt AC 156 ms 15544 KB
subtask1_1.txt AC 167 ms 16676 KB
subtask1_10.txt AC 165 ms 17876 KB
subtask1_11.txt AC 116 ms 8860 KB
subtask1_2.txt AC 148 ms 15140 KB
subtask1_3.txt AC 144 ms 14012 KB
subtask1_4.txt AC 147 ms 14548 KB
subtask1_5.txt AC 162 ms 17136 KB
subtask1_6.txt AC 151 ms 14524 KB
subtask1_7.txt AC 148 ms 13732 KB
subtask1_8.txt AC 165 ms 18744 KB
subtask1_9.txt AC 169 ms 19004 KB
subtask1_sample_02.txt AC 113 ms 8888 KB