結果
問題 | No.647 明太子 |
ユーザー | McGregorsh |
提出日時 | 2023-04-11 22:39:01 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,715 bytes |
コンパイル時間 | 169 ms |
コンパイル使用メモリ | 82,400 KB |
実行使用メモリ | 91,576 KB |
最終ジャッジ日時 | 2024-04-16 18:18:50 |
合計ジャッジ時間 | 5,600 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
89,472 KB |
testcase_01 | AC | 142 ms
89,600 KB |
testcase_02 | WA | - |
testcase_03 | AC | 142 ms
89,600 KB |
testcase_04 | AC | 143 ms
89,472 KB |
testcase_05 | AC | 141 ms
89,472 KB |
testcase_06 | AC | 144 ms
89,728 KB |
testcase_07 | AC | 147 ms
89,600 KB |
testcase_08 | AC | 147 ms
89,984 KB |
testcase_09 | AC | 161 ms
89,344 KB |
testcase_10 | AC | 171 ms
91,136 KB |
testcase_11 | AC | 158 ms
90,596 KB |
testcase_12 | AC | 172 ms
90,496 KB |
testcase_13 | AC | 183 ms
90,624 KB |
testcase_14 | AC | 263 ms
91,232 KB |
testcase_15 | AC | 195 ms
91,008 KB |
testcase_16 | AC | 163 ms
90,496 KB |
testcase_17 | AC | 281 ms
91,136 KB |
testcase_18 | AC | 296 ms
90,880 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 254 ms
90,988 KB |
testcase_23 | AC | 156 ms
90,624 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 = int(input()) nums = [i_list() for i in range(N)] M = int(input()) ans = [] for i in range(M): x, y = i_map() p = 0 for j in range(N): a, b = nums[j] if x <= a and b <= y: p += 1 ans.append(p) maxnum = max(ans) for i in range(M): if ans[i] == maxnum: print(i+1) if __name__ == '__main__': main()