結果
問題 | No.679 不思議マーケット |
ユーザー | McGregorsh |
提出日時 | 2022-11-09 15:07:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 378 ms / 2,000 ms |
コード長 | 2,302 bytes |
コンパイル時間 | 354 ms |
コンパイル使用メモリ | 87,352 KB |
実行使用メモリ | 106,620 KB |
最終ジャッジ日時 | 2023-09-30 03:07:58 |
合計ジャッジ時間 | 6,359 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 224 ms
92,644 KB |
testcase_01 | AC | 225 ms
92,536 KB |
testcase_02 | AC | 220 ms
92,652 KB |
testcase_03 | AC | 378 ms
106,620 KB |
testcase_04 | AC | 260 ms
94,800 KB |
testcase_05 | AC | 261 ms
94,684 KB |
testcase_06 | AC | 272 ms
95,200 KB |
testcase_07 | AC | 234 ms
93,480 KB |
testcase_08 | AC | 267 ms
95,336 KB |
testcase_09 | AC | 227 ms
92,664 KB |
testcase_10 | AC | 251 ms
93,732 KB |
testcase_11 | AC | 251 ms
93,404 KB |
testcase_12 | AC | 245 ms
93,520 KB |
testcase_13 | AC | 264 ms
94,648 KB |
testcase_14 | AC | 261 ms
94,064 KB |
testcase_15 | AC | 240 ms
93,124 KB |
testcase_16 | AC | 228 ms
92,564 KB |
testcase_17 | AC | 230 ms
92,532 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() nums = [deque() for i in range(N+1)] juge_nums = set() for i in range(M): g, r = i_map() juge_nums.add(g) H = i_list() for j in range(r): num = H[j] nums[g].append(num) have = set() for i in range(1, N+1): if i not in juge_nums: have.add(i) while True: plus = set() for i in range(1, N+1): bad = deque() if len(nums[i]) == 0: continue while nums[i]: num = nums[i].popleft() if num not in have: bad.append(num) while bad: po = bad.popleft() nums[i].append(po) if len(nums[i]) == 0: plus.add(i) #print(plus) if len(plus) == 0: print(len(have)) exit() lines = list(plus) for k in range(len(lines)): have.add(lines[k]) if __name__ == '__main__': main()