#510157 (C#(csc)) No.1109 調の判定

提出ソース

結果

問題	No.1109 調の判定
ユーザー	eSeF
提出日時	2020-07-10 22:50:48
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	31 ms / 2,000 ms
コード長	7,852 bytes
コンパイル時間	2,730 ms
コンパイル使用メモリ	118,512 KB
実行使用メモリ	28,956 KB
最終ジャッジ日時	2024-10-11 10:09:14
合計ジャッジ時間	4,414 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	30 ms 25,128 KB
testcase_01	AC	30 ms 24,868 KB
testcase_02	AC	30 ms 26,096 KB
testcase_03	AC	31 ms 27,024 KB
testcase_04	AC	30 ms 25,972 KB
testcase_05	AC	30 ms 24,052 KB
testcase_06	AC	30 ms 24,048 KB
testcase_07	AC	30 ms 25,972 KB
testcase_08	AC	30 ms 27,028 KB
testcase_09	AC	31 ms 27,028 KB
testcase_10	AC	30 ms 25,836 KB
testcase_11	AC	30 ms 26,352 KB
testcase_12	AC	30 ms 24,052 KB
testcase_13	AC	31 ms 27,168 KB
testcase_14	AC	31 ms 28,012 KB
testcase_15	AC	30 ms 26,916 KB
testcase_16	AC	30 ms 28,100 KB
testcase_17	AC	30 ms 24,996 KB
testcase_18	AC	30 ms 26,092 KB
testcase_19	AC	30 ms 25,844 KB
testcase_20	AC	30 ms 25,972 KB
testcase_21	AC	30 ms 25,788 KB
testcase_22	AC	31 ms 27,160 KB
testcase_23	AC	31 ms 28,268 KB
testcase_24	AC	31 ms 28,832 KB
testcase_25	AC	31 ms 26,904 KB
testcase_26	AC	31 ms 27,048 KB
testcase_27	AC	31 ms 26,896 KB
testcase_28	AC	30 ms 26,096 KB
testcase_29	AC	29 ms 26,924 KB
testcase_30	AC	30 ms 24,876 KB
testcase_31	AC	30 ms 26,048 KB
testcase_32	AC	30 ms 26,092 KB
testcase_33	AC	30 ms 23,924 KB
testcase_34	AC	30 ms 28,012 KB
testcase_35	AC	30 ms 24,996 KB
testcase_36	AC	30 ms 28,104 KB
testcase_37	AC	30 ms 24,872 KB
testcase_38	AC	31 ms 28,956 KB
testcase_39	AC	30 ms 26,220 KB
testcase_40	AC	30 ms 25,968 KB
testcase_41	AC	31 ms 26,916 KB
testcase_42	AC	30 ms 28,008 KB
testcase_43	AC	30 ms 27,040 KB
testcase_44	AC	31 ms 28,088 KB
testcase_45	AC	30 ms 27,968 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

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

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
using static System.Math;
using static System.Array;
using static AtCoder.Sc_out;
using static AtCoder.Tool;
using static AtCoder.ModInt;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        //const int MOD = 998244353;

        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };
        static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };
        //static List<List<int>> G = new List<List<int>>();
        //static List<List<Edge>> G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw);

            var th = new Thread(Run, 1 << 26);
            th.Start();
            th.Join();

            //Run();
            Console.Out.Flush();
        }
        static void Run()
        {
            int Testcase = 1;
            for (var _ = 0; _ < Testcase; _++) Solve();
        }
        static void Solve()
        {
            int N = Cin.Int;
            var T = Cin.ReadSplitInt;
            int[] inc = { 0, 2, 4, 5, 7, 9, 11 };
            var ans = new List<int>();
            for(var D = 0; D < 12; D++)
            {
                int cnt = 0;
                for(var i = 0; i < N; i++)
                {
                    var ok = false;
                    for (var j = 0; j < inc.Length; j++)
                    {
                        ok |= T[i] == (D + inc[j]) % 12;
                    }
                    if (ok) cnt++;
                }
                if (cnt == N) ans.Add(D);
            }
            OutL(ans.Count() != 1 ? -1 : ans[0]);
        }
        public struct Edge
        {
            public int from;

            public int to;
            public long dist;

            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }
        }
    }
    struct ModInt
    {
        public long value;
        private const int MOD = 1000000007;
        //private const int MOD = 998244353;
        public ModInt(long value) { this.value = value; }
        public static implicit operator ModInt(long a)
        {
            var ret = a % MOD;
            return new ModInt(ret < 0 ? (ret + MOD) : ret);
        }
        public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);
        public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);
        public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);
        public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);
        public static ModInt operator <<(ModInt a, int n) => (a.value << n);
        public static ModInt operator >>(ModInt a, int n) => (a.value >> n);
        public static ModInt operator ++(ModInt a) => a.value + 1;
        public static ModInt operator --(ModInt a) => a.value - 1;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt Modpow(ModInt a, long n)
        {
            var k = a;
            ModInt ret = 1;
            while (n > 0)
            {
                if ((n & 1) != 0) ret *= k;
                k *= k;
                n >>= 1;
            }
            return ret;
        }
        private static readonly List<long> Factorials = new List<long>() { 1 };
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt Fac(long n)
        {
            for (var i = Factorials.Count(); i <= n; i++)
            {
                Factorials.Add((Factorials[i - 1] * i) % MOD);
            }
            return Factorials[(int)n];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt nCr(long n, long r)
        {
            return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));
        }
        public static explicit operator int(ModInt a) => (int)a.value;
    }
    static class Cin
    {
        public static string[] ReadSplit => Console.ReadLine().Split();
        public static int[] ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);
        public static long[] ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);
        public static double[] ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);
        public static string Str => Console.ReadLine();
        public static int Int => int.Parse(Console.ReadLine());
        public static long Long => long.Parse(Console.ReadLine());
        public static double Double => double.Parse(Console.ReadLine());
        public static T Conv<T>(string input)
        {
            if (typeof(T).Equals(typeof(ModInt)))
            {
                return (T)(dynamic)(long.Parse(input));
            }
            return (T)Convert.ChangeType(input, typeof(T));
        }
        public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());
        public static void Input<T, U>(out T a, out U b)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); }
        public static void Input<T, U, V>(out T a, out U b, out V c)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); }
        public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); }
        public static void Input<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); e = Conv<X>(q[4]); }
    }
    static class Sc_out
    {
        public static void OutL(object s) => Console.WriteLine(s);
        public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));
        public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_One(object s) => Console.Write($"{s} ");
        public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");
        public static void Endl() => Console.WriteLine();
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            array = ConvertAll(array, x => initialvalue);
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }
        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }
        static public long Gcd(long a, long b)
        {
            if (a == 0 || b == 0) return Max(a, b);
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        static public long LPow(int a, int b) => (long)Pow(a, b);
        static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;
        static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a));
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード