結果

問題 No.995 タピオカオイシクナーレ
ユーザー eSeFeSeF
提出日時 2020-02-21 22:15:51
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 98 ms / 2,000 ms
コード長 6,092 bytes
コンパイル時間 882 ms
コンパイル使用メモリ 66,160 KB
実行使用メモリ 29,076 KB
最終ジャッジ日時 2023-07-30 06:26:36
合計ジャッジ時間 4,049 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
20,696 KB
testcase_01 AC 56 ms
20,916 KB
testcase_02 AC 58 ms
22,752 KB
testcase_03 AC 56 ms
20,752 KB
testcase_04 AC 58 ms
20,828 KB
testcase_05 AC 57 ms
22,824 KB
testcase_06 AC 57 ms
20,892 KB
testcase_07 AC 56 ms
22,868 KB
testcase_08 AC 61 ms
20,760 KB
testcase_09 AC 57 ms
20,924 KB
testcase_10 AC 58 ms
20,760 KB
testcase_11 AC 58 ms
18,784 KB
testcase_12 AC 58 ms
20,752 KB
testcase_13 AC 58 ms
20,824 KB
testcase_14 AC 58 ms
20,880 KB
testcase_15 AC 57 ms
18,624 KB
testcase_16 AC 96 ms
24,912 KB
testcase_17 AC 94 ms
27,016 KB
testcase_18 AC 94 ms
22,976 KB
testcase_19 AC 95 ms
24,816 KB
testcase_20 AC 96 ms
26,924 KB
testcase_21 AC 98 ms
29,076 KB
testcase_22 AC 97 ms
27,060 KB
testcase_23 AC 95 ms
24,920 KB
testcase_24 AC 96 ms
22,940 KB
testcase_25 AC 96 ms
25,028 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;
using static AtCoder.CalcL;
namespace AtCoder
{
    class AC
    {
        const long 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 };
        static readonly int[] dJ = { 1, 0, -1, 0 };
        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 cin = new Scanner();

            var input = cin.ReadSplitLong();
            int N = (int)input[0];
            int M = (int)input[1];
            long K = input[2];
            long p = input[3];
            long q = input[4];

            long ans1 = 0;
            long ans2 = 0;
            var md = new Modulo(1);
            for(var i = 0; i < N; i++)
            {
                var b = long.Parse(Console.ReadLine());
                ans1 += b;ans1 %= MOD;
                if (i < M) { ans2 += b;ans2 %= MOD; }
                else
                {
                    ans2 = (ans2 - b + MOD) % MOD;
                }
            }
            var X = md.Pow(Abs(q - 2 * p), K);
            var Y = md.Pow(q, K);
            long ans = ans1;
            long r = (q - 2 * p > 0) || (K % 2 == 0) ? 1 : -1;
            if (r * ans2 >= 0)
            {
                ans += md.Mul(md.Div(X, Y), ans2);
                ans %= MOD;
            }
            else
            {
                long k = md.Mul(md.Div(X, Y), Abs(ans2));
                ans = (ans - k + MOD) % MOD;
            }
            ans = md.Div(ans, 2);
            Console.WriteLine(ans);
            //Console.WriteLine(MOD);
            //Console.Out.Flush();
        }
        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;
            }

        }
    }
    public class Scanner
    {
        public int[] ReadSplitInt()
        {
            return ConvertAll(Console.ReadLine().Split(), int.Parse);
        }
        public long[] ReadSplitLong()
        {
            return ConvertAll(Console.ReadLine().Split(), long.Parse);
        }
        public double[] ReadSplit_Double()
        {
            return ConvertAll(Console.ReadLine().Split(), double.Parse);
        }
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            for (var i = 0; i < array.Length; i++)
            {
                array[i] = 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 LPow(int a, int b)
        {
            return (long)Pow(a, b);
        }
    }
    static public class CalcI
    {
        public static int Gcd(int a, int b)
        {
            if (a * b == 0) { return Max(a, b); }
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        public static int Lcm(int a, int b)
        {
            int g = Gcd(a, b);
            return a / g * b;
        }
        public static int Ceil(int n, int div)
        {
            return (n + div - 1) / div;
        }
    }
    static public class CalcL
    {
        public static long Gcd(long a, long b)
        {
            if (a * b == 0) { return Max(a, b); }
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        public static long Lcm(long a, long b)
        {
            long g = Gcd(a, b);
            return a / g * b;
        }
        public static long Ceil(long n, long div)
        {
            return (n + div - 1) / div;
        }
    }
    class Modulo
    {
        private const long M = 1000000007;
        //private const int M = 998244353;
        private readonly long[] m_facs;
        public long Mul(long a, long b)
        {
            return ((a * b) % M);
        }
        public Modulo(long n)
        {
            m_facs = new long[n + 1];
            m_facs[0] = 1;
            for (long i = 1; i <= n; ++i)
            {
                m_facs[i] = Mul(m_facs[i - 1], i);
            }
        }
        public long Fac(long n)
        {
            return m_facs[n];
        }
        public long Pow(long a, long m)
        {
            switch (m)
            {
                case 0:
                    return 1L;
                case 1:
                    return a;
                default:
                    long p1 = Pow(a, m / 2);
                    long p2 = Mul(p1, p1);
                    return ((m % 2) == 0) ? p2 : Mul(p2, a);
            }
        }
        public long Div(long a, long b)
        {
            return Mul(a, Pow(b, M - 2));
        }
        public long Ncr(long n, long r)
        {
            if (n < r) { return 0; }
            if (n == r) { return 1; }
            long res = Fac(n);
            res = Div(res, Fac(r));
            res = Div(res, Fac(n - r));
            return res;
        }
        public Modulo() { }
    }
}
0