結果
問題 | No.714 回転寿司屋のシミュレート |
ユーザー | McGregorsh |
提出日時 | 2022-07-02 16:06:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 311 ms / 2,000 ms |
コード長 | 1,894 bytes |
コンパイル時間 | 655 ms |
コンパイル使用メモリ | 87,288 KB |
実行使用メモリ | 97,072 KB |
最終ジャッジ日時 | 2023-08-18 07:06:39 |
合計ジャッジ時間 | 12,257 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,484 KB |
testcase_01 | AC | 237 ms
92,528 KB |
testcase_02 | AC | 237 ms
92,980 KB |
testcase_03 | AC | 252 ms
94,596 KB |
testcase_04 | AC | 252 ms
93,256 KB |
testcase_05 | AC | 264 ms
94,148 KB |
testcase_06 | AC | 266 ms
94,172 KB |
testcase_07 | AC | 293 ms
97,072 KB |
testcase_08 | AC | 311 ms
96,332 KB |
testcase_09 | AC | 293 ms
96,504 KB |
testcase_10 | AC | 286 ms
96,296 KB |
testcase_11 | AC | 257 ms
93,976 KB |
testcase_12 | AC | 284 ms
96,528 KB |
testcase_13 | AC | 275 ms
94,868 KB |
testcase_14 | AC | 269 ms
94,304 KB |
testcase_15 | AC | 266 ms
94,656 KB |
testcase_16 | AC | 270 ms
94,148 KB |
testcase_17 | AC | 292 ms
96,588 KB |
testcase_18 | AC | 275 ms
94,240 KB |
testcase_19 | AC | 272 ms
94,156 KB |
testcase_20 | AC | 282 ms
93,940 KB |
testcase_21 | AC | 267 ms
94,232 KB |
testcase_22 | AC | 262 ms
93,868 KB |
testcase_23 | AC | 261 ms
94,224 KB |
testcase_24 | AC | 275 ms
94,772 KB |
testcase_25 | AC | 275 ms
95,048 KB |
testcase_26 | AC | 266 ms
94,212 KB |
testcase_27 | AC | 261 ms
93,464 KB |
testcase_28 | AC | 265 ms
94,168 KB |
testcase_29 | AC | 274 ms
94,208 KB |
testcase_30 | AC | 244 ms
92,704 KB |
testcase_31 | AC | 245 ms
92,700 KB |
testcase_32 | AC | 249 ms
92,676 KB |
testcase_33 | AC | 244 ms
92,700 KB |
testcase_34 | AC | 246 ms
92,788 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()) desk = [[] for i in range(20)] for i in range(n): query = s_list() if query[0] == '0': point = int(query[1]) point -= 1 desk[point].extend(query[3:]) elif query[0] == '1': sina = query[1] toruhito = -1 for j in range(20): if sina in desk[j]: toruhito = j+1 desk[j].remove(sina) break print(toruhito) elif query[0] == '2': basyo = int(query[1]) basyo -= 1 desk[basyo].clear() #print(desk) if __name__ == '__main__': main()