結果

問題 No.1066 #いろいろな色 / Red and Blue and more various colors (Easy)
ユーザー fairy_lettuce
提出日時 2020-05-29 21:52:56
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,115 ms / 2,000 ms
コード長 4,762 bytes
コンパイル時間 2,962 ms
コンパイル使用メモリ 115,848 KB
実行使用メモリ 26,956 KB
最終ジャッジ日時 2024-11-06 04:05:08
合計ジャッジ時間 11,213 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Diagnostics;
namespace AtCoder.Contest.D
{
    static class Program
    {
        public static void Main(string[] args)
        {
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(sw);
            var cin = new Scanner();
            ModInt.MOD = 998244353;
            int n = cin.NextInt();
            int q = cin.NextInt();
            var a = cin.ArrayInt(n);
            var b = cin.ArrayInt(q);
            var dp = new List<ModInt>();
            for (int i = 0; i < n + 1; i++)
            {
                dp.Add(0);
            }
            dp[0] = a[0] - 1;
            dp[1] = 1;
            for (int i = 1; i < n; i++)
            {
                for (int j = i; j >= 0; j--)
                {
                    dp[j + 1] += dp[j];
                    dp[j] *= a[i] - 1;
                }
            }
            for (int i = 0; i < q; i++)
            {
                Console.WriteLine(dp[b[i]]);
            }
            Console.Out.Flush();
        }
    }
    public struct ModInt : IComparable<ModInt>, IEquatable<ModInt>
    {
        public static long MOD = 1000000007;
        private readonly long num;
        public ModInt(long n) { num = n; }
        public override string ToString() => num.ToString();
        public static ModInt operator +(ModInt l, ModInt r)
        {
            long x = l.num + r.num;
            if (x >= MOD) x -= MOD;
            return new ModInt(x);
        }
        public static ModInt operator -(ModInt l, ModInt r)
        {
            long x = l.num - r.num;
            if (x < 0) x += MOD;
            return new ModInt(x);
        }
        public static ModInt operator *(ModInt l, ModInt r) => new ModInt((l.num * r.num) % MOD);
        public static ModInt operator /(ModInt l, ModInt r) => l * r.Inverse();
        public static ModInt operator ++(ModInt x)
        {
            var tmp = x + new ModInt(1);
            return tmp;
        }
        public static ModInt operator --(ModInt x)
        {
            var tmp = x - new ModInt(1);
            return tmp;
        }
        public static bool operator >(ModInt l, ModInt r) => l.CompareTo(r) > 0;
        public static bool operator <(ModInt l, ModInt r) => l.CompareTo(r) < 0;
        public static bool operator >=(ModInt l, ModInt r) => l.CompareTo(r) >= 0;
        public static bool operator <=(ModInt l, ModInt r) => l.CompareTo(r) <= 0;
        public static bool operator ==(ModInt l, ModInt r) => l.Equals(r);
        public static bool operator !=(ModInt l, ModInt r) => !l.Equals(r);
        public static implicit operator long(ModInt x) => x.num;
        public static implicit operator ModInt(long n)
        {
            n %= MOD;
            if (n < 0) n += MOD;
            return new ModInt(n);
        }
        public ModInt Inverse() => Inverse(this, MOD);
        public static ModInt Inverse(ModInt x) => Inverse(x.num, MOD);
        public static long Inverse(long x, long m)
        {
            if (x % m == 0) throw new DivideByZeroException();
            long a = x, b = m, u = 1, v = 0;
            while (b > 0)
            {
                long t = a / b;
                a -= t * b;
                long p = a; a = b; b = p;   // swap(a, b);
                u -= t * v;
                p = u; u = v; v = p;        // swap(u, v);
            }
            u %= m;
            if (u < 0) u += m;
            return u;
        }
        public static ModInt Pow(ModInt x, long n) => Pow(x.num, n);
        public static ModInt Pow(long x, long n)
        {
            if (n == 0) return x;
            long now = 1;
            for (n %= MOD - 1; n > 0; n /= 2, x = x * x % MOD)
            {
                if (n % 2 == 1) now = now * x % MOD;
            }
            return new ModInt(now);
        }
        public int CompareTo(ModInt x)
        {
            if (num == x.num) return 0;
            if (num > x.num) return 1;
            return -1;
        }
        public bool Equals(ModInt x) => num == x.num;
        public override bool Equals(object obj) => obj is ModInt m && num == m.num;
        public override int GetHashCode()
        {
            return HashCode.Combine(num);
        }
    }
    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);
            if (s.Length == 0) return Next();
            i = 0;
            return s[i++];
        }
        public int NextInt()
        {
            return int.Parse(Next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = NextInt() + add;
            }
            return Array;
        }
        public long NextLong()
        {
            return long.Parse(Next());
        }
        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = NextLong() + add;
            }
            return Array;
        }
        public double NextDouble()
        {
            return double.Parse(Next());
        }
        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = NextDouble() + add;
            }
            return Array;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0