結果
問題 | No.938 賢人を探せ |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 13:52:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 286 ms / 2,000 ms |
コード長 | 1,655 bytes |
コンパイル時間 | 526 ms |
コンパイル使用メモリ | 87,180 KB |
実行使用メモリ | 98,040 KB |
最終ジャッジ日時 | 2023-08-23 11:39:54 |
合計ジャッジ時間 | 8,981 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 286 ms
97,916 KB |
testcase_01 | AC | 234 ms
92,736 KB |
testcase_02 | AC | 235 ms
92,548 KB |
testcase_03 | AC | 235 ms
92,620 KB |
testcase_04 | AC | 236 ms
92,636 KB |
testcase_05 | AC | 236 ms
92,776 KB |
testcase_06 | AC | 230 ms
92,720 KB |
testcase_07 | AC | 236 ms
92,556 KB |
testcase_08 | AC | 271 ms
96,980 KB |
testcase_09 | AC | 271 ms
97,388 KB |
testcase_10 | AC | 228 ms
92,652 KB |
testcase_11 | AC | 281 ms
97,328 KB |
testcase_12 | AC | 279 ms
97,072 KB |
testcase_13 | AC | 275 ms
96,580 KB |
testcase_14 | AC | 281 ms
97,036 KB |
testcase_15 | AC | 273 ms
96,912 KB |
testcase_16 | AC | 275 ms
96,768 KB |
testcase_17 | AC | 271 ms
96,936 KB |
testcase_18 | AC | 273 ms
96,528 KB |
testcase_19 | AC | 281 ms
96,948 KB |
testcase_20 | AC | 281 ms
96,988 KB |
testcase_21 | AC | 272 ms
96,552 KB |
testcase_22 | AC | 278 ms
98,040 KB |
ソースコード
import sys, re 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 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()) siteru = set() sareta = [] for i in range(n): a, b = input().split() siteru.add(a) sareta.append(b) rog = set() for i in range(n): num = sareta[i] if num not in siteru: if num not in rog: print(num) rog.add(num) if __name__ == '__main__': main()