結果
問題 | No.429 CupShuffle |
ユーザー | McGregorsh |
提出日時 | 2022-06-23 12:05:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 283 ms / 2,000 ms |
コード長 | 1,955 bytes |
コンパイル時間 | 373 ms |
コンパイル使用メモリ | 82,604 KB |
実行使用メモリ | 114,920 KB |
最終ジャッジ日時 | 2024-11-07 02:17:21 |
合計ジャッジ時間 | 4,647 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 152 ms
89,300 KB |
testcase_01 | AC | 124 ms
83,232 KB |
testcase_02 | AC | 122 ms
83,496 KB |
testcase_03 | AC | 121 ms
83,552 KB |
testcase_04 | AC | 144 ms
88,904 KB |
testcase_05 | AC | 124 ms
83,116 KB |
testcase_06 | AC | 153 ms
89,032 KB |
testcase_07 | AC | 151 ms
88,736 KB |
testcase_08 | AC | 124 ms
83,688 KB |
testcase_09 | AC | 148 ms
88,996 KB |
testcase_10 | AC | 189 ms
90,588 KB |
testcase_11 | AC | 283 ms
113,628 KB |
testcase_12 | AC | 274 ms
114,428 KB |
testcase_13 | AC | 281 ms
114,920 KB |
testcase_14 | AC | 256 ms
112,576 KB |
testcase_15 | AC | 127 ms
83,380 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n, k, x = i_map() mae = [] for i in range(k): a, b = input().split() if a == '?' and b == '?': line = i break mae.append([int(a)-1, int(b)-1]) usiro = [] for i in range(k - (line + 1)): a, b = i_map() usiro.append([a-1, b-1]) usiro = usiro[::-1] start = [i for i in range(1, n+1)] last = i_list() for i in range(len(mae)): hidari = mae[i][0] migi = mae[i][1] start[migi], start[hidari] = start[hidari], start[migi] for i in range(len(usiro)): hidari = usiro[i][0] migi = usiro[i][1] last[hidari], last[migi] = last[migi], last[hidari] ans = [] for i in range(n): if start[i] != last[i]: ans.append(i+1) print(*ans) if __name__ == '__main__': main()