結果

問題 No.2300 Substring OR Sum
ユーザー McGregorshMcGregorsh
提出日時 2023-05-12 22:46:57
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,742 ms / 2,000 ms
コード長 1,884 bytes
コンパイル時間 214 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 259,496 KB
最終ジャッジ日時 2024-05-06 12:49:42
合計ジャッジ時間 17,511 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 142 ms
89,856 KB
testcase_01 AC 140 ms
89,216 KB
testcase_02 AC 143 ms
89,600 KB
testcase_03 AC 555 ms
115,712 KB
testcase_04 AC 482 ms
109,440 KB
testcase_05 AC 583 ms
115,840 KB
testcase_06 AC 361 ms
94,592 KB
testcase_07 AC 1,610 ms
258,324 KB
testcase_08 AC 746 ms
135,552 KB
testcase_09 AC 606 ms
113,408 KB
testcase_10 AC 1,249 ms
222,228 KB
testcase_11 AC 1,443 ms
242,672 KB
testcase_12 AC 1,577 ms
258,480 KB
testcase_13 AC 1,742 ms
259,496 KB
testcase_14 AC 217 ms
116,992 KB
testcase_15 AC 765 ms
148,608 KB
testcase_16 AC 1,276 ms
222,444 KB
testcase_17 AC 1,519 ms
257,920 KB
testcase_18 AC 155 ms
89,600 KB
testcase_19 AC 143 ms
89,088 KB
testcase_20 AC 157 ms
89,600 KB
testcase_21 AC 152 ms
89,600 KB
testcase_22 AC 155 ms
89,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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 = [[] for i in range(30)]
   Scou = [0] * 30
   for i in range(N):
   	  for j in range(30):
   	  	  if ((A[i] >> j) % 2 == 1):
   	  	  	  #pp = 2 ** j
   	  	  	  #if A[i] | pp == A[i]:
   	  	  	  S[j].append(i)
   	  	  	  Scou[j] += 1
   
   ans = 0
   for i in range(30):
   	  for j in range(N):
   	  	  nxt = bisect_right(S[i], j-1)
   	  	  if nxt == Scou[i]:
   	  	  	  continue
   	  	  cost = N - S[i][nxt]
   	  	  score = cost * (2 ** i)
   	  	  ans += score
   print(ans)
   
if __name__ == '__main__':
    main()
    
0