結果
問題 | No.1189 Sum is XOR |
ユーザー | McGregorsh |
提出日時 | 2023-07-13 22:40:18 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,821 bytes |
コンパイル時間 | 1,083 ms |
コンパイル使用メモリ | 86,692 KB |
実行使用メモリ | 123,712 KB |
最終ジャッジ日時 | 2023-10-13 11:30:41 |
合計ジャッジ時間 | 10,085 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | AC | 225 ms
90,136 KB |
testcase_22 | AC | 218 ms
89,936 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, K = i_map() A = i_list() AA = [0] + list(accumulate(A)) AAA = [0, A[0]] for i in range(1, N): AAA.append(AAA[-1] ^ A[i]) ans = 0 for i in range(1, N+1): top = 10 ** 18 under = 0 while top - under > 1: mid = (top + under) // 2 score = mid + i if score > N: top = mid else: p1 = AA[score] - AA[i-1] p2 = AAA[score] ^ AAA[i-1] if p1 == p2: under = mid else: top = mid ans += under ans %= MOD2 print(ans) if __name__ == '__main__': main()