結果
問題 | No.1304 あなたは基本が何か知っていますか?私は知っています. |
ユーザー | mkawa2 |
提出日時 | 2020-12-03 01:36:39 |
言語 | Python3 (3.11.6 + numpy 1.26.0 + scipy 1.11.3) |
結果 |
AC
|
実行時間 | 185 ms / 2,000 ms |
コード長 | 1,502 bytes |
コンパイル時間 | 407 ms |
コンパイル使用メモリ | 10,820 KB |
実行使用メモリ | 8,972 KB |
最終ジャッジ日時 | 2023-09-03 04:04:02 |
合計ジャッジ時間 | 33,345 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
8,804 KB |
testcase_01 | AC | 27 ms
8,800 KB |
testcase_02 | AC | 22 ms
8,800 KB |
testcase_03 | AC | 50 ms
8,972 KB |
testcase_04 | AC | 185 ms
8,796 KB |
testcase_05 | AC | 96 ms
8,852 KB |
testcase_06 | AC | 23 ms
8,800 KB |
testcase_07 | AC | 159 ms
8,872 KB |
testcase_08 | AC | 36 ms
8,892 KB |
testcase_09 | AC | 139 ms
8,776 KB |
testcase_10 | AC | 114 ms
8,880 KB |
testcase_11 | AC | 152 ms
8,872 KB |
testcase_12 | AC | 128 ms
8,880 KB |
testcase_13 | AC | 85 ms
8,784 KB |
testcase_14 | AC | 107 ms
8,732 KB |
testcase_15 | AC | 103 ms
8,880 KB |
testcase_16 | AC | 114 ms
8,816 KB |
testcase_17 | AC | 39 ms
8,744 KB |
testcase_18 | AC | 115 ms
8,720 KB |
testcase_19 | AC | 68 ms
8,752 KB |
testcase_20 | AC | 28 ms
8,780 KB |
testcase_21 | AC | 65 ms
8,728 KB |
testcase_22 | AC | 127 ms
8,832 KB |
testcase_23 | AC | 145 ms
8,864 KB |
testcase_24 | AC | 173 ms
8,860 KB |
testcase_25 | AC | 33 ms
8,868 KB |
testcase_26 | AC | 34 ms
8,860 KB |
testcase_27 | AC | 40 ms
8,916 KB |
testcase_28 | AC | 34 ms
8,916 KB |
testcase_29 | AC | 33 ms
8,924 KB |
testcase_30 | AC | 29 ms
8,768 KB |
testcase_31 | AC | 37 ms
8,764 KB |
testcase_32 | AC | 40 ms
8,788 KB |
testcase_33 | AC | 32 ms
8,744 KB |
testcase_34 | AC | 39 ms
8,876 KB |
testcase_35 | AC | 31 ms
8,728 KB |
testcase_36 | AC | 35 ms
8,752 KB |
testcase_37 | AC | 31 ms
8,776 KB |
testcase_38 | AC | 26 ms
8,864 KB |
testcase_39 | AC | 34 ms
8,952 KB |
testcase_40 | AC | 32 ms
8,816 KB |
testcase_41 | AC | 35 ms
8,784 KB |
testcase_42 | AC | 32 ms
8,852 KB |
testcase_43 | AC | 33 ms
8,768 KB |
testcase_44 | AC | 35 ms
8,920 KB |
04_evil_A_01 | RE | - |
04_evil_A_02 | RE | - |
04_evil_A_03 | RE | - |
04_evil_A_04 | RE | - |
04_evil_A_05 | RE | - |
04_evil_A_06 | RE | - |
04_evil_A_07 | RE | - |
04_evil_A_08 | RE | - |
04_evil_A_09 | RE | - |
04_evil_A_10 | RE | - |
05_evil_B_01 | RE | - |
05_evil_B_02 | RE | - |
05_evil_B_03 | RE | - |
05_evil_B_04 | RE | - |
05_evil_B_05 | RE | - |
05_evil_B_06 | RE | - |
05_evil_B_07 | RE | - |
05_evil_B_08 | RE | - |
05_evil_B_09 | RE | - |
05_evil_B_10 | RE | - |
06_evil_C_01 | TLE | - |
06_evil_C_02 | TLE | - |
06_evil_C_03 | TLE | - |
06_evil_C_04 | TLE | - |
06_evil_C_05 | TLE | - |
06_evil_C_06 | TLE | - |
06_evil_C_07 | TLE | - |
06_evil_C_08 | TLE | - |
06_evil_C_09 | TLE | - |
06_evil_C_10 | AC | 28 ms
8,780 KB |
ソースコード
# from operator import itemgetter # from itertools import * # from bisect import * from collections import * from heapq import * import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def MI(): return map(int, sys.stdin.buffer.readline().split()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def MI1(): return map(int1, sys.stdin.buffer.readline().split()) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() def inval(ni, nj, h, w): if ni < 0 or ni >= h or nj < 0 or nj >= w: return True return False dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] inf = 10**16 # md = 10 ** 9 + 7 md = 998244353 n, k, x, y = MI() aa = LI() mx = 1 << 10 aa = list(set(aa)) # dp[i][j]...i個みたあとにxorがjになるものの数 dp = [[0]*mx for _ in range(n+1)] dp[0][0] = 1 for i in range(n): for j in range(mx): if i+1 > 2: dp[i+1][j] = (sum(dp[i][j ^ a] for a in aa)-dp[i-1][j]*(len(aa)-1))%md elif i+1 == 2 and j == 0: dp[2][0] = 0 else: dp[i+1][j] = sum(dp[i][j ^ a] for a in aa)%md ans = sum(dp[-1][j] for j in range(x, min(1023, y)+1))%md print(ans)