結果
問題 | No.2171 OR Assignment |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-12-25 20:12:40 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 1,347 ms / 3,500 ms |
コード長 | 4,160 bytes |
コンパイル時間 | 1,704 ms |
コンパイル使用メモリ | 158,940 KB |
実行使用メモリ | 13,196 KB |
最終ジャッジ日時 | 2024-06-22 17:08:40 |
合計ジャッジ時間 | 21,320 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,940 KB |
testcase_12 | AC | 512 ms
11,272 KB |
testcase_13 | AC | 525 ms
11,980 KB |
testcase_14 | AC | 518 ms
11,024 KB |
testcase_15 | AC | 159 ms
12,896 KB |
testcase_16 | AC | 197 ms
12,620 KB |
testcase_17 | AC | 209 ms
12,152 KB |
testcase_18 | AC | 778 ms
11,904 KB |
testcase_19 | AC | 806 ms
12,188 KB |
testcase_20 | AC | 1,178 ms
13,096 KB |
testcase_21 | AC | 1,205 ms
12,156 KB |
testcase_22 | AC | 1,268 ms
12,028 KB |
testcase_23 | AC | 1,134 ms
11,980 KB |
testcase_24 | AC | 1,316 ms
11,856 KB |
testcase_25 | AC | 1,347 ms
12,248 KB |
testcase_26 | AC | 1,328 ms
13,196 KB |
testcase_27 | AC | 1,230 ms
13,124 KB |
testcase_28 | AC | 1,238 ms
11,528 KB |
testcase_29 | AC | 1,179 ms
11,020 KB |
testcase_30 | AC | 1,135 ms
11,020 KB |
testcase_31 | AC | 1,211 ms
11,408 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, 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(uint M_) { import std.conv : to; alias M = M_; uint x; this(ModInt a) { x = a.x; } this(uint x_) { x = x_ % M; } this(ulong x_) { x = cast(uint)(x_ % M); } this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; } this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); } ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); } ref ModInt opOpAssign(string op, T)(T a) { static if (is(T == ModInt)) { static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; } else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; } else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } else static if (op == "^^") { if (a < 0) return this = inv()^^(-a); ModInt b = this, c = 1U; for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; } return this = c; } else { return mixin("this " ~ op ~ "= ModInt(a)"); } } ModInt inv() const { uint a = M, b = x; int y = 0, z = 1; for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; } assert(a == 1); return ModInt(y); } ModInt opUnary(string op)() const { static if (op == "+") { return this; } else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; } else static assert(false); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0U); } string toString() const { return x.to!string; } } enum MO = 998244353; alias Mint = ModInt!MO; enum E = 30; void main() { try { for (; ; ) { const N = readInt; auto A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt; } auto app = new int[E]; app[] = -1; int[] js = [0]; Mint[] crt = [Mint(1)]; foreach (i; 0 .. N) { int[] ks = app.dup; ks.sort; int a = A[i]; int[] jjs = [i]; foreach_reverse (k; ks) if (~k) { if (a < (a | A[k])) { a |= A[k]; jjs ~= k; } } jjs.reverse; Mint[] nxt; int pos; Mint sum; foreach (jj; jjs) { for (; pos < js.length && js[pos] <= jj; ++pos) { sum += crt[pos]; } nxt ~= sum; } debug { writeln(app, " ", jjs, " ", nxt); } js = jjs; crt = nxt; foreach (e; 0 .. E) if (A[i] >> e & 1) { app[e] = i; } } const ans = crt.sum; writeln(ans); } } catch (EOFException e) { } }