結果

問題 No.1708 Quality of Contest
ユーザー McGregorshMcGregorsh
提出日時 2023-05-22 14:35:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,633 ms / 2,000 ms
コード長 2,357 bytes
コンパイル時間 191 ms
コンパイル使用メモリ 82,436 KB
実行使用メモリ 206,440 KB
最終ジャッジ日時 2024-06-01 20:43:13
合計ジャッジ時間 24,619 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 130 ms
89,508 KB
testcase_01 AC 130 ms
89,080 KB
testcase_02 AC 131 ms
89,396 KB
testcase_03 AC 293 ms
94,172 KB
testcase_04 AC 309 ms
93,656 KB
testcase_05 AC 307 ms
93,300 KB
testcase_06 AC 259 ms
92,732 KB
testcase_07 AC 278 ms
92,960 KB
testcase_08 AC 134 ms
89,508 KB
testcase_09 AC 845 ms
203,112 KB
testcase_10 AC 796 ms
190,740 KB
testcase_11 AC 1,141 ms
170,652 KB
testcase_12 AC 1,102 ms
179,804 KB
testcase_13 AC 870 ms
162,188 KB
testcase_14 AC 1,165 ms
184,416 KB
testcase_15 AC 1,499 ms
206,440 KB
testcase_16 AC 1,279 ms
190,672 KB
testcase_17 AC 1,182 ms
177,696 KB
testcase_18 AC 1,222 ms
172,048 KB
testcase_19 AC 1,253 ms
184,288 KB
testcase_20 AC 1,126 ms
171,100 KB
testcase_21 AC 1,400 ms
191,388 KB
testcase_22 AC 1,358 ms
173,208 KB
testcase_23 AC 1,633 ms
201,432 KB
testcase_24 AC 769 ms
148,548 KB
testcase_25 AC 773 ms
148,644 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, M, X = i_map()
   
   ques = [defaultdict(int) for i in range(M)]
   maxpoints = [INF] * M
   for i in range(N):
   	  a, b = i_map()
   	  b -= 1
   	  ques[b][-a] += 1
   	  maxpoints[b] = min(maxpoints[b], -a)
   
   maxque = []
   for i in range(M):
   	  heappush(maxque, (maxpoints[i], i))
   
   base = [0] * (N+1)
   have = []
   heappush(have, 0)
   nokori = M
   for i in range(N):
   	  p = heappop(have)
   	  if nokori > 0:
   	  	  score, point = heappop(maxque)
   	  else:
   	  	  score = INF
   	  if score - X < p:
   	  	  nokori -= 1
   	  	  base[i+1] = abs(score - X)
   	  	  heappush(have, p)
   	  	  ques[point][score] -= 1
   	  	  for key, value in ques[point].items():
   	  	  	  for j in range(value):
   	  	  	  	  heappush(have, key)
   	  else:
   	  	  base[i+1] = abs(p)
   	  	  heappush(maxque, (score, point))
   
   AB = list(accumulate(base))
   
   K = int(input())
   C = i_list()
   ans = 0
   for i in range(K):
   	  ans += AB[C[i]]
   print(ans)
   
   
   
if __name__ == '__main__':
    main()
0