結果

問題 No.1043 直列大学
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2020-05-01 22:06:52
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 260 ms / 2,000 ms
コード長 6,246 bytes
コンパイル時間 2,947 ms
コンパイル使用メモリ 111,264 KB
実行使用メモリ 27,752 KB
最終ジャッジ日時 2023-08-24 05:44:16
合計ジャッジ時間 9,154 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
26,464 KB
testcase_01 AC 69 ms
25,688 KB
testcase_02 AC 74 ms
24,308 KB
testcase_03 AC 69 ms
26,404 KB
testcase_04 AC 68 ms
25,608 KB
testcase_05 AC 68 ms
24,492 KB
testcase_06 AC 68 ms
24,164 KB
testcase_07 AC 72 ms
24,044 KB
testcase_08 AC 73 ms
26,036 KB
testcase_09 AC 148 ms
24,388 KB
testcase_10 AC 166 ms
24,264 KB
testcase_11 AC 213 ms
25,652 KB
testcase_12 AC 260 ms
26,460 KB
testcase_13 AC 213 ms
26,236 KB
testcase_14 AC 226 ms
26,252 KB
testcase_15 AC 241 ms
24,092 KB
testcase_16 AC 219 ms
25,452 KB
testcase_17 AC 169 ms
26,344 KB
testcase_18 AC 173 ms
25,644 KB
testcase_19 AC 209 ms
24,188 KB
testcase_20 AC 167 ms
25,660 KB
testcase_21 AC 195 ms
23,564 KB
testcase_22 AC 202 ms
24,304 KB
testcase_23 AC 248 ms
24,280 KB
testcase_24 AC 182 ms
24,128 KB
testcase_25 AC 209 ms
27,752 KB
testcase_26 AC 223 ms
27,572 KB
testcase_27 AC 136 ms
26,488 KB
testcase_28 AC 202 ms
24,316 KB
testcase_29 AC 107 ms
25,824 KB
testcase_30 AC 174 ms
24,056 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using static System.Math;
using static System.Numerics.BigInteger;
using static Program.IO.Scanner;

using Number = System.Int64;
#region IO
namespace Program.IO {
	using System.IO;
	using System.Text;
	using System.Globalization;

	public class Printer : StreamWriter {
		public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
		public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
	}
	static public class Scanner {
		public static StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
		public static int ri => sc.Integer();
		public static long rl => sc.Long();
		public static string rs => sc.Scan();
		public static double rd => sc.Double();
	}
	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 != 0; b = (char)read()) if (b != '\r') sb.Append(b);
			return sb.ToString();
		}
		public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
		public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
		public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
	}

}

#endregion

#region main
static class Ex {
	static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
	static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
		return string.Join(st, ie);
	}

	static public void Main() {
		Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
		var solver = new Program.Solver();
		var t = new System.Threading.Thread(solver.Solve, 50000000);
		t.Start();
		t.Join();
		//*/
		//solver.Solve();
		Console.Out.Flush();
	}
}
#endregion

namespace Program {
	public class Solver {
		Random rnd = new Random(0);
		public void Solve() {
			var n = ri;
			var m = ri;
			var a = Enumerate(n, x => ri);
			var b = Enumerate(m, x => ri);
			var dp = new ModInt[100050];
			var ep = new ModInt[100050];
			dp[0] = ep[0] = 1.m();
			var L = ri; var R = ri;
			foreach (var x in a)
				for (int i = 100000; i >= 0; i--)
					if (i + x < dp.Length) dp[i + x] += dp[i];
			foreach (var x in b)
				for (int i = 100000; i >= 0; i--)
					if (i + x < ep.Length) ep[i + x] += ep[i];
			for (int i = 0; i <= 100000; i++) {
				dp[i + 1] += dp[i];
			}
			ModInt ans = 0;
			for (long i = 1; i <= 100000; i++) {
				var l = i * L - 1; var r = i * R;
				if (l >= 100000) break;
				r = Min(100000, r);
				if (l <= 100000) {
					// Debug.WriteLine($"{l} {r} {dp[r] - dp[l]}");
					ans += (dp[r] - dp[l]) * ep[i];
				}
			}
			Console.WriteLine(ans);
		}

		const long INF = 1L << 60;
		static int[] dx = { -1, 0, 1, 0 };
		static int[] dy = { 0, 1, 0, -1 };
		static T[] Enumerate<T>(int n, Func<int, T> f) {
			var a = new T[n]; for (int i = 0; i < a.Length; ++i) a[i] = f(i); return a;
		}
		static T[][] Enumerate<T>(int n, int m, Func<int, int, T> f) {
			return Enumerate(n, x => Enumerate(m, y => f(x, y)));
		}
		static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
	}
}
#region ModInt
/// <summary>
/// [0,<see cref="Mod"/>) までの値を取るような数
/// </summary>
public struct ModInt {
	public const long Mod = (int)1e9 + 7;
	public long num;
	public ModInt(long n) { num = n; }
	public override string ToString() { return num.ToString(); }
	public static ModInt operator +(ModInt l, ModInt r) { return new ModInt(l.num + r.num < Mod ? l.num + r.num : l.num + r.num - Mod); }
	public static ModInt operator -(ModInt l, ModInt r) { return new ModInt(l.num + Mod - r.num < Mod ? l.num + Mod - r.num : l.num - r.num); }
	public static ModInt operator *(ModInt l, ModInt r) { return new ModInt(l.num * r.num % Mod); }
	public static ModInt operator /(ModInt l, ModInt r) { return l * Inverse(r); }
	public static implicit operator ModInt(long n) { return n.mod(); }
	public static ModInt Pow(ModInt v, long k) { return Pow(v.num, k); }
	public static ModInt Pow(long v, long k) {
		long ret = 1;
		for (k %= Mod - 1; k > 0; k >>= 1, v = v * v % Mod)
			if ((k & 1) == 1) ret = ret * v % Mod;
		return new ModInt(ret);
	}
	public static ModInt Inverse(ModInt v) { return Pow(v, Mod - 2); }
}
public static partial class ModIntEx {
	public static ModInt mod(this long v) {
		v %= ModInt.Mod;
		if (v < 0) v += ModInt.Mod;
		return new ModInt(v);
	}
	public static ModInt mod(this int v) {
		var u = v % ModInt.Mod;
		if (u < 0) u += ModInt.Mod;
		return new ModInt(u);
	}
	public static ModInt m(this long v) { return new ModInt(v); }
	public static ModInt m(this int v) { return new ModInt(v); }
}
#endregion
#region Binomial Coefficient
public class BinomialCoefficient {
	public ModInt[] fact, ifact;
	public BinomialCoefficient(int n) {
		fact = new ModInt[n + 1];
		ifact = new ModInt[n + 1];
		fact[0] = 1.m();
		for (int i = 1; i <= n; i++)
			fact[i] = fact[i - 1] * i.m();
		ifact[n] = ModInt.Inverse(fact[n]);
		for (int i = n - 1; i >= 0; i--)
			ifact[i] = ifact[i + 1] * (i + 1).m();
		ifact[0] = ifact[1];
	}
	public ModInt this[int n, int r] {
		get {
			if (n < 0 || n >= fact.Length || r < 0 || r > n) return 0;
			return fact[n] * ifact[n - r] * ifact[r];
		}
	}
	public ModInt RepeatedCombination(int n, int k) {
		if (k == 0) return 1.m();
		return this[n + k - 1, k];
	}
}
#endregion
0