結果

問題 No.1043 直列大学
ユーザー eSeFeSeF
提出日時 2020-06-18 00:58:05
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 371 ms / 2,000 ms
コード長 8,867 bytes
コンパイル時間 1,214 ms
コンパイル使用メモリ 121,632 KB
実行使用メモリ 28,784 KB
最終ジャッジ日時 2024-06-02 03:20:36
合計ジャッジ時間 8,232 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 35 ms
26,356 KB
testcase_01 AC 32 ms
26,676 KB
testcase_02 AC 43 ms
24,496 KB
testcase_03 AC 33 ms
28,528 KB
testcase_04 AC 32 ms
28,472 KB
testcase_05 AC 33 ms
26,472 KB
testcase_06 AC 32 ms
28,396 KB
testcase_07 AC 38 ms
26,668 KB
testcase_08 AC 39 ms
28,712 KB
testcase_09 AC 177 ms
26,416 KB
testcase_10 AC 197 ms
26,540 KB
testcase_11 AC 292 ms
28,532 KB
testcase_12 AC 371 ms
26,556 KB
testcase_13 AC 294 ms
26,476 KB
testcase_14 AC 307 ms
28,656 KB
testcase_15 AC 337 ms
26,552 KB
testcase_16 AC 324 ms
26,612 KB
testcase_17 AC 227 ms
26,544 KB
testcase_18 AC 237 ms
26,548 KB
testcase_19 AC 294 ms
28,784 KB
testcase_20 AC 220 ms
26,424 KB
testcase_21 AC 272 ms
28,404 KB
testcase_22 AC 285 ms
26,552 KB
testcase_23 AC 337 ms
28,348 KB
testcase_24 AC 249 ms
26,420 KB
testcase_25 AC 292 ms
26,424 KB
testcase_26 AC 303 ms
26,420 KB
testcase_27 AC 150 ms
26,616 KB
testcase_28 AC 300 ms
26,732 KB
testcase_29 AC 110 ms
28,660 KB
testcase_30 AC 246 ms
26,548 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;
using System.Threading;
using static System.Math;
using static System.Array;
using static AtCoder.IO_ShortCut;
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, M;
            Input(out N, out M);
            var V = _ReadSplitLong;
            var R = _ReadSplitLong;
            long A, B;
            Input(out A, out B);
            long MX = 1000 * 100;
            var dp_v = new long[MX + 1];
            dp_v[0] = 1;
            var dp_r = new long[MX + 1];
            dp_r[0] = 1;
            for (var i = 0; i < N; i++)
            {
                for(var j = MX; j >= 0; j--)
                {
                    if (j + V[i] <= MX)
                    {
                        dp_v[j + V[i]] += dp_v[j];
                        dp_v[j + V[i]] %= MOD;
                    }
                }
            }
            for(var i = 0; i < M; i++)
            {
                for(var j = MX; j >= 0; j--)
                {
                    if (j + R[i] <= MX)
                    {
                        dp_r[j + R[i]] += dp_r[j];
                        dp_r[j + R[i]] %= MOD;
                    }
                }
            }
            dp_r[0] = dp_v[0] = 0;
            for (var i = 0; i < MX; i++) dp_r[i + 1] = (dp_r[i + 1] + dp_r[i]) % MOD;
            ModInt ans = 0;
            for(var i = 0; i <= MX; i++)
            {
                if (dp_v[i] == 0) continue;
                long l = -1;
                long r = MX + 1;
                while (r - l > 1)
                {
                    var med = (l + r) / 2;
                    if (med * B < i) l = med;
                    else r = med;
                }
                if (l >= 0) ans -= new ModInt(dp_r[l]) * dp_v[i];
                l = -1;
                r = MX + 1;
                while (r - l > 1)
                {
                    var med = (l + r) / 2;
                    if (med * A <= i) l = med;
                    else r = med;
                }
                ans += new ModInt(dp_r[l]) * dp_v[i];
            }
            OutL(ans.value);

        }
        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;
        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 };
        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];
        }
        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 IO_ShortCut
    {
        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]); }

        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));
    }
}
0