Submission #214298

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;
using System.Diagnostics;
using Enu = System.Linq.Enumerable;

class Program
{
    void Solve()
    {
        int N = reader.Int(), M = reader.Int(), Pow = reader.Int();
        int[] after = new int[N];
        var Eindex = Enu.Range(0, N).Select(i => new List<int>()).ToArray();
        var Eto = Enu.Range(0, N).Select(i => new List<int>()).ToArray();

        for (int i = 0; i < M; i++)
        {
            int R = reader.Int();
            Eindex[R - 1].Add(i);
            Eto[R - 1].Add(R);
            Eindex[R].Add(i);
            Eto[R].Add(R - 1);
        }
        for (int i = 0; i < N; i++)
        {
            int curr = i;
            int ei = 0;
            while (true)
            {
                int index = LowerBound(Eindex[curr], ei);
                if (index >= Eindex[curr].Count) break;
                ei = Eindex[curr][index] + 1;
                curr = Eto[curr][index];
            }
            after[i] = curr;
        }

        int[] res = (int[])after.Clone();
        Pow--;
        while (Pow > 0)
        {
            if (Pow % 2 == 1) res = Next(res, after);
            after = Next(after, after);
            Pow /= 2;
        }
        res = res.Select(x => x + 1).ToArray();

        Console.WriteLine(string.Join("\n", res));
        Console.ReadLine();
    }

    int[] Next(int[] a, int[] b)
    {
        int[] res = new int[a.Length];
        for (int i = 0; i < res.Length; i++)
            res[i] = b[a[i]];
        return res;
    }

    static int LowerBound<T>(List<T> a, T val)
    {
        var comp = Comparer<T>.Default;
        int left = -1, right = a.Count;
        while (right - left > 1)
        {
            int mid = (left + right) / 2;
            if (comp.Compare(a[mid], val) >= 0) { right = mid; }
            else { left = mid; }
        }
        return right;
    }



    static void Main() { new Program().Solve(); }
    Reader reader = new Reader(Console.In);
    class Reader
    {
        private readonly TextReader reader;
        private readonly char[] separator = new char[] { ' ' };
        private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;
        private string[] A = new string[0];
        private int i;

        public Reader(TextReader r) { reader = r; }
        public bool HasNext() { return Enqueue(); }
        public string String() { return Dequeue(); }
        public int Int() { return int.Parse(Dequeue()); }
        public long Long() { return long.Parse(Dequeue()); }
        public double Double() { return double.Parse(Dequeue()); }
        public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }
        public int[] IntArray(int N) { return Enumerable.Range(0, N).Select(i => Int()).ToArray(); }
        public int[][] IntGrid(int H) { return Enumerable.Range(0, H).Select(i => IntLine()).ToArray(); }
        public string[] StringArray(int N) { return Enumerable.Range(0, N).Select(i => Line()).ToArray(); }
        public string Line() { return reader.ReadLine().Trim(); }
        private string[] Split(string s) { return s.Split(separator, removeOp); }
        private bool Enqueue()
        {
            if (i < A.Length) return true;
            string line = reader.ReadLine();
            if (line == null) return false;
            if (line == "") return Enqueue();
            A = Split(line);
            i = 0;
            return true;
        }
        private string Dequeue() { Enqueue(); return A[i++]; }
    }
}

Submission Info

Judge Result