結果
問題 | No.1795 AtCoder Heuristic Rating coloring |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 15:53:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 823 ms / 2,000 ms |
コード長 | 1,652 bytes |
コンパイル時間 | 2,041 ms |
コンパイル使用メモリ | 86,468 KB |
実行使用メモリ | 131,124 KB |
最終ジャッジ日時 | 2023-08-17 20:50:26 |
合計ジャッジ時間 | 29,747 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
92,316 KB |
testcase_01 | AC | 238 ms
92,012 KB |
testcase_02 | AC | 244 ms
92,076 KB |
testcase_03 | AC | 242 ms
92,144 KB |
testcase_04 | AC | 297 ms
94,808 KB |
testcase_05 | AC | 296 ms
94,956 KB |
testcase_06 | AC | 295 ms
94,444 KB |
testcase_07 | AC | 292 ms
94,616 KB |
testcase_08 | AC | 291 ms
94,440 KB |
testcase_09 | AC | 283 ms
94,408 KB |
testcase_10 | AC | 294 ms
94,196 KB |
testcase_11 | AC | 284 ms
94,564 KB |
testcase_12 | AC | 238 ms
92,084 KB |
testcase_13 | AC | 239 ms
92,236 KB |
testcase_14 | AC | 240 ms
92,196 KB |
testcase_15 | AC | 241 ms
92,128 KB |
testcase_16 | AC | 243 ms
92,236 KB |
testcase_17 | AC | 249 ms
92,124 KB |
testcase_18 | AC | 246 ms
92,036 KB |
testcase_19 | AC | 241 ms
92,140 KB |
testcase_20 | AC | 243 ms
92,108 KB |
testcase_21 | AC | 244 ms
92,280 KB |
testcase_22 | AC | 243 ms
92,228 KB |
testcase_23 | AC | 241 ms
92,424 KB |
testcase_24 | AC | 241 ms
92,152 KB |
testcase_25 | AC | 242 ms
92,076 KB |
testcase_26 | AC | 238 ms
92,328 KB |
testcase_27 | AC | 242 ms
92,340 KB |
testcase_28 | AC | 242 ms
92,116 KB |
testcase_29 | AC | 240 ms
92,176 KB |
testcase_30 | AC | 247 ms
92,180 KB |
testcase_31 | AC | 244 ms
92,284 KB |
testcase_32 | AC | 468 ms
106,944 KB |
testcase_33 | AC | 417 ms
103,856 KB |
testcase_34 | AC | 567 ms
113,644 KB |
testcase_35 | AC | 510 ms
111,404 KB |
testcase_36 | AC | 545 ms
113,556 KB |
testcase_37 | AC | 471 ms
105,436 KB |
testcase_38 | AC | 444 ms
106,284 KB |
testcase_39 | AC | 558 ms
115,436 KB |
testcase_40 | AC | 470 ms
108,312 KB |
testcase_41 | AC | 544 ms
115,912 KB |
testcase_42 | AC | 466 ms
106,676 KB |
testcase_43 | AC | 484 ms
107,732 KB |
testcase_44 | AC | 548 ms
113,448 KB |
testcase_45 | AC | 472 ms
106,736 KB |
testcase_46 | AC | 593 ms
116,596 KB |
testcase_47 | AC | 367 ms
100,376 KB |
testcase_48 | AC | 467 ms
109,216 KB |
testcase_49 | AC | 619 ms
117,188 KB |
testcase_50 | AC | 453 ms
107,044 KB |
testcase_51 | AC | 419 ms
105,012 KB |
testcase_52 | AC | 629 ms
121,724 KB |
testcase_53 | AC | 627 ms
121,504 KB |
testcase_54 | AC | 790 ms
130,712 KB |
testcase_55 | AC | 808 ms
130,716 KB |
testcase_56 | AC | 799 ms
131,124 KB |
testcase_57 | AC | 823 ms
130,916 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, M = i_map() juge = defaultdict(int) for i in range(N): s, a = s_map() juge[s] = a for i in range(M): t, b = s_map() juge[t] = b ans = [] for key, value in juge.items(): ans.append([key, value]) ans.sort() for i in ans: print(*i) if __name__ == '__main__': main()