結果

問題 No.1708 Quality of Contest
ユーザー McGregorshMcGregorsh
提出日時 2023-05-22 14:35:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,960 ms / 2,000 ms
コード長 2,357 bytes
コンパイル時間 466 ms
コンパイル使用メモリ 87,168 KB
実行使用メモリ 218,964 KB
最終ジャッジ日時 2023-08-23 23:16:34
合計ジャッジ時間 30,391 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 243 ms
92,556 KB
testcase_01 AC 240 ms
92,476 KB
testcase_02 AC 241 ms
92,664 KB
testcase_03 AC 435 ms
98,636 KB
testcase_04 AC 445 ms
98,860 KB
testcase_05 AC 448 ms
98,888 KB
testcase_06 AC 388 ms
96,764 KB
testcase_07 AC 428 ms
97,304 KB
testcase_08 AC 240 ms
92,372 KB
testcase_09 AC 1,024 ms
218,964 KB
testcase_10 AC 966 ms
181,944 KB
testcase_11 AC 1,398 ms
164,368 KB
testcase_12 AC 1,337 ms
185,932 KB
testcase_13 AC 1,099 ms
164,976 KB
testcase_14 AC 1,391 ms
188,212 KB
testcase_15 AC 1,773 ms
200,640 KB
testcase_16 AC 1,496 ms
199,952 KB
testcase_17 AC 1,402 ms
190,628 KB
testcase_18 AC 1,434 ms
178,924 KB
testcase_19 AC 1,469 ms
187,680 KB
testcase_20 AC 1,360 ms
172,588 KB
testcase_21 AC 1,691 ms
180,472 KB
testcase_22 AC 1,595 ms
183,364 KB
testcase_23 AC 1,960 ms
209,948 KB
testcase_24 AC 960 ms
167,284 KB
testcase_25 AC 941 ms
166,556 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