#42880 (C#(csc)) No.261 ぐるぐるぐるぐる！あみだくじ！

• 問題: No.261 ぐるぐるぐるぐる！あみだくじ！
• ユーザー: 紙ぺーぱー
• 提出日時: 2015-08-09 21:19:51
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 27 ms / 5,000 ms
• コード長: 8,093 bytes
• コンパイル時間: 1,037 ms
• コンパイル使用メモリ: 118,548 KB
• 実行使用メモリ: 19,200 KB
• 最終ジャッジ日時: 2024-07-18 06:17:15
• 合計ジャッジ時間: 3,346 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	25 ms; 18,688 KB
testcase_01	AC	26 ms; 18,560 KB
testcase_02	AC	24 ms; 18,688 KB
testcase_03	AC	25 ms; 18,688 KB
testcase_04	AC	25 ms; 19,072 KB
testcase_05	AC	25 ms; 18,688 KB
testcase_06	AC	26 ms; 19,200 KB
testcase_07	AC	26 ms; 19,072 KB
testcase_08	AC	26 ms; 18,816 KB
testcase_09	AC	25 ms; 18,688 KB
testcase_10	AC	25 ms; 18,944 KB
testcase_11	AC	25 ms; 18,688 KB
testcase_12	AC	25 ms; 19,072 KB
testcase_13	AC	26 ms; 18,944 KB
testcase_14	AC	25 ms; 18,944 KB
testcase_15	AC	26 ms; 18,816 KB
testcase_16	AC	27 ms; 19,072 KB
testcase_17	AC	25 ms; 19,072 KB
testcase_18	AC	26 ms; 18,816 KB
testcase_19	AC	26 ms; 19,072 KB
testcase_20	AC	27 ms; 19,072 KB
testcase_21	AC	27 ms; 19,200 KB
testcase_22	AC	27 ms; 19,072 KB
testcase_23	AC	26 ms; 18,944 KB
testcase_24	AC	26 ms; 19,072 KB
testcase_25	AC	25 ms; 19,072 KB
testcase_26	AC	25 ms; 18,944 KB
testcase_27	AC	25 ms; 18,816 KB
testcase_28	AC	25 ms; 18,816 KB
testcase_29	AC	26 ms; 18,944 KB
testcase_30	AC	25 ms; 19,200 KB
testcase_31	AC	26 ms; 18,944 KB
testcase_32	AC	26 ms; 18,816 KB
testcase_33	AC	26 ms; 18,688 KB
testcase_34	AC	25 ms; 19,072 KB
testcase_35	AC	26 ms; 18,816 KB
testcase_36	AC	26 ms; 18,688 KB
testcase_37	AC	26 ms; 18,944 KB
testcase_38	AC	25 ms; 19,072 KB
testcase_39	AC	26 ms; 19,072 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = Enumerate(n, x => x);
            var k = sc.Integer();
            for (int i = 0; i < k; i++)
            {
                var x = sc.Integer() - 1;
                var y = sc.Integer() - 1;
                Swap(ref a[x], ref a[y]);
            }
            var to = new int[n];
            for (int i = 0; i < n; i++)
                to[a[i]] = i;
            var go = Enumerate(n, x => Enumerable.Repeat(-1, n).ToArray());
            var T = new long[n];
            for (int i = 0; i < n; i++)
            {
                var p = i;
                for (int j = 1; j <= n; j++)
                {
                    var next = to[p];
                    go[i][next] = j;
                    p = next;
                    if (p == i) { T[i] = j; break; }
                }
            }

            var m = sc.Integer();
            for (int i = 0; i < m; i++)
            {
                var q = sc.Integer(n);
                var enable = true;
                var A = Enumerate(n, x => 1L);
                var B = new long[n];
                for (int j = 0; j < n; j++)
                {
                    var v = q[j] - 1;
                    if (go[v][j] == -1) { enable = false; break; }
                    B[v] = go[v][j];
                }
                if (!enable)
                    IO.Printer.Out.WriteLine(-1);
                else IO.Printer.Out.WriteLine(LinearCongruence.MathEX.LiniearCongruence(A, B, T).Key);
            }


        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion


#region LinearCongruence
namespace LinearCongruence
{
    using Number = Int64;
    static public partial class MathEX
    {
        static Number _gcd(Number x, Number y)
        {
            byte i = 0;
            while (x != 0 && y != 0)
            {
                if (i == 0)
                    y %= x;
                else x %= y;
                i ^= 1;
            }
            return x == 0 ? y : x;
        }


        //O(log n)
        /// <summary>
        /// ax+by=gcd(a,b)を解く，戻り値は,return x,y
        /// </summary>
        static Number _exgcd(Number a, Number b, out Number x, out Number y)
        {
            var u = new Number[] { a, 1, 0 };
            var v = new Number[] { b, 0, 1 };
            while (v[0] != 0)
            {
                var t = u[0] / v[0];
                for (int i = 0; i < 3; i++)
                {
                    var tmp = u[i] - t * v[i];
                    u[i] = v[i];
                    v[i] = tmp;
                }
            }
            x = u[1];
            y = u[2];
            if (u[0] > 0)
                return u[0];
            for (long i = 0; i < 3; i++)
                u[i] = -u[i];
            return u[0];

        }
        static Number _inverse(Number num, Number mod)
        {
            Number p, q;
            _exgcd(num, mod, out p, out q);
            return (p % mod + mod) % mod;
        }


        /// <summary>
        /// (A_i)x≡B_i mod(M_i)を解く
        /// 返り値はx(Mod M)のペア
        /// </summary>
        static public KeyValuePair<Number, Number> LiniearCongruence(Number[] A, Number[] B, Number[] M)
        {
            Number x = 0;
            Number m = 1;
            var n = A.Length;
            for (int i = 0; i < n; i++)
            {
                var a = A[i] * m;
                var b = B[i] - A[i] * x;
                var d = _gcd(M[i], a);
                if (b % d != 0) return new KeyValuePair<Number, Number>(-1, -1);
                var t = ((b / d) * _inverse(a / d, M[i] / d)) % (M[i] / d);
                x = x + m * t;
                m *= M[i] / d;

            }
            while (x < 0)
                x += m;
            x %= m;
            if (x == 0)
                x += m;
            return new KeyValuePair<Number, Number>(x, m);
        }
    }
}
#endregion