結果
| 問題 | No.856 増える演算 |
| ユーザー |
👑  hos.lyric
|
| 提出日時 | 2019-07-26 22:18:42 |
| 言語 | D (dmd 2.106.1) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 4,219 bytes |
| コンパイル時間 | 2,809 ms |
| コンパイル使用メモリ | 179,872 KB |
| 実行使用メモリ | 23,568 KB |
| 最終ジャッジ日時 | 2023-09-04 01:58:51 |
| 合計ジャッジ時間 | 14,276 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
| testcase_36 | WA | - |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
| testcase_45 | WA | - |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | WA | - |
| testcase_50 | WA | - |
| testcase_51 | WA | - |
| testcase_52 | WA | - |
| testcase_53 | WA | - |
| testcase_54 | WA | - |
| testcase_55 | WA | - |
| testcase_56 | WA | - |
| testcase_57 | WA | - |
| testcase_58 | WA | - |
| testcase_59 | WA | - |
| testcase_60 | WA | - |
| testcase_61 | WA | - |
| testcase_62 | WA | - |
| testcase_63 | WA | - |
| testcase_64 | WA | - |
| testcase_65 | WA | - |
| testcase_66 | WA | - |
| testcase_67 | WA | - |
| testcase_68 | WA | - |
| testcase_69 | WA | - |
| testcase_70 | WA | - |
| testcase_71 | WA | - |
| testcase_72 | WA | - |
| testcase_73 | WA | - |
| testcase_74 | WA | - |
| testcase_75 | WA | - |
| testcase_76 | WA | - |
| testcase_77 | WA | - |
| testcase_78 | WA | - |
| testcase_79 | WA | - |
| testcase_80 | WA | - |
| testcase_81 | WA | - |
| testcase_82 | WA | - |
コンパイルメッセージ
Main.d(138): Deprecation: function `std.math.exponential.log` is deprecated - `std.math.exponential.log` called with argument types `(long)` matches both `log(real)`, `log(double)`, and `log(float)`. Cast argument to floating point type instead. Main.d(138): Deprecation: function `std.math.exponential.log` is deprecated - `std.math.exponential.log` called with argument types `(long)` matches both `log(real)`, `log(double)`, and `log(float)`. Cast argument to floating point type instead. Main.d(124): Warning: statement is not reachable Main.d(125): Warning: statement is not reachable Main.d(128): Warning: statement is not reachable Main.d(129): Warning: statement is not reachable Main.d(134): Warning: statement is not reachable Main.d(135): Warning: statement is not reachable Main.d(136): Warning: statement is not reachable Main.d(145): Warning: statement is not reachable Main.d(146): Warning: statement is not reachable Main.d(148): Warning: statement is not reachable Main.d(124): Warning: statement is not reachable Main.d(125): Warning: statement is not reachable Main.d(128): Warning: statement is not reachable Main.d(129): Warning: statement is not reachable Main.d(134): Warning: statement is not reachable Main.d(135): Warning: statement is not reachable Main.d(136): Warning: statement is not reachable Main.d(145): Warning: statement is not reachable Main.d(146): Warning: statement is not reachable Main.d(148): Warning: statement is not reachable
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
struct ModInt(long M) {
long x;
this(in ModInt a) { x = a.x; }
this(in long a) { x = a % M; if (x < 0) x += M; }
ref ModInt opAssign(in long a) { return this = ModInt(a); }
ref ModInt opOpAssign(string op)(in ModInt a) {
static if (op == "+") { x += a.x; if (x >= M) x -= M; }
else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
else static if (op == "*") { x *= a.x; x %= M; }
else static assert(false);
return this;
}
ref ModInt opOpAssign(string op)(in long a) { return mixin("this " ~ op ~ "= ModInt(a)"); }
ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
ModInt opBinary(string op, T)(in T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
ModInt opBinaryRight(string op)(in long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
string toString() const { return x.to!string; }
}
// a^-1 (mod m)
long modInv(long a, long m)
in {
assert(m > 0, "modInv: m > 0 must hold");
}
do {
long b = m, x = 1, y = 0, t;
for (; ; ) {
t = a / b;
a -= t * b;
if (a == 0) {
assert(b == 1 || b == -1, "modInv: gcd(a, m) != 1");
if (b == -1) {
y = -y;
}
return (y < 0) ? (y + m) : y;
}
x -= t * y;
t = b / a;
b -= t * a;
if (b == 0) {
assert(a == 1 || a == -1, "modInv: gcd(a, m) != 1");
if (a == -1) {
x = -x;
}
return (x < 0) ? (x + m) : x;
}
y -= t * x;
}
}
enum long MO = 1000000007;
alias Mint = ModInt!MO;
Mint power(Mint a, long e) {
Mint x = a, y = 1;
for (; e; e >>= 1) {
if (e & 1) y *= x;
x *= x;
}
return y;
}
enum L = 2^^18;
int N;
long[] A;
void main() {
auto fft = new Fft(L);
try {
for (; ; ) {
N = readInt();
A = new long[N];
foreach (i; 0 .. N) {
A[i] = readInt();
}
auto f = new real[L];
f[] = 0.0;
foreach (i; 0 .. N) {
f[cast(int)(A[i])] += 1;
}
auto ff = fft.fft(f);
foreach (l; 0 .. L) {
ff[l] = ff[l] * ff[l];
}
auto g = fft.inverseFft(ff);
auto cnt = new int[L];
foreach (l; 0 .. L) {
cnt[l] = cast(int)(round(g[l].re));
}
foreach (i; 0 .. N) {
--cnt[cast(int)(2 * A[i])];
}
cnt[] /= 2;
debug {
writeln("cnt = ", cnt[0 .. 20]);
}
return;
Mint ans = 1;
foreach (l; 0 .. L) {
ans *= power(Mint(l), cnt[l]);
}
long ASum;
foreach_reverse (i; 0 .. N) {
ans *= power(Mint(A[i]), ASum);
ASum += A[i];
}
long AMin = long.max;
auto opt = tuple(real.infinity, 0L, 0L);
foreach_reverse (i; 0 .. N) {
if (i < N - 1) {
chmin(opt, tuple(log(A[i] + AMin) + log(A[i]) * AMin, A[i], AMin));
}
chmin(AMin, A[i]);
}
debug {
writeln("opt = ", opt);
}
Mint dnm = (opt[1] + opt[2]) * power(Mint(opt[1]), opt[2]);
ans *= modInv(dnm.x, MO);
writeln(ans);
}
} catch (EOFException e) {
}
}