結果
問題 | No.2300 Substring OR Sum |
ユーザー | McGregorsh |
提出日時 | 2023-05-12 22:54:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 618 ms / 2,000 ms |
コード長 | 1,752 bytes |
コンパイル時間 | 473 ms |
コンパイル使用メモリ | 87,196 KB |
実行使用メモリ | 168,548 KB |
最終ジャッジ日時 | 2023-08-19 05:46:39 |
合計ジャッジ時間 | 10,853 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 203 ms
92,472 KB |
testcase_01 | AC | 200 ms
92,512 KB |
testcase_02 | AC | 199 ms
92,240 KB |
testcase_03 | AC | 331 ms
113,712 KB |
testcase_04 | AC | 300 ms
110,392 KB |
testcase_05 | AC | 324 ms
115,480 KB |
testcase_06 | AC | 267 ms
103,516 KB |
testcase_07 | AC | 618 ms
164,432 KB |
testcase_08 | AC | 358 ms
123,200 KB |
testcase_09 | AC | 332 ms
116,312 KB |
testcase_10 | AC | 505 ms
152,408 KB |
testcase_11 | AC | 539 ms
155,012 KB |
testcase_12 | AC | 566 ms
165,028 KB |
testcase_13 | AC | 475 ms
168,548 KB |
testcase_14 | AC | 458 ms
167,664 KB |
testcase_15 | AC | 384 ms
125,632 KB |
testcase_16 | AC | 528 ms
152,492 KB |
testcase_17 | AC | 568 ms
163,428 KB |
testcase_18 | AC | 209 ms
92,228 KB |
testcase_19 | AC | 213 ms
92,264 KB |
testcase_20 | AC | 203 ms
92,448 KB |
testcase_21 | AC | 203 ms
92,372 KB |
testcase_22 | AC | 201 ms
92,248 KB |
ソースコード
import sys, re from fractions import Fraction 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 from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] 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 def main(): N = int(input()) A = i_list() S = [[False] * N for i in range(30)] for i in range(N): for j in range(30): if ((A[i] >> j) % 2 == 1): S[j][i] = True ans = 0 for i in range(30): cost = 0 for j in range(N-1, -1, -1): if S[i][j]: cost = N - j score = cost * (2 ** i) ans += score print(ans) if __name__ == '__main__': main()