結果
問題 | No.647 明太子 |
ユーザー | McGregorsh |
提出日時 | 2023-04-11 22:41:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 316 ms / 4,500 ms |
コード長 | 1,762 bytes |
コンパイル時間 | 326 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 91,520 KB |
最終ジャッジ日時 | 2024-04-16 18:20:10 |
合計ジャッジ時間 | 6,103 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 159 ms
89,472 KB |
testcase_01 | AC | 159 ms
89,472 KB |
testcase_02 | AC | 160 ms
89,216 KB |
testcase_03 | AC | 160 ms
89,600 KB |
testcase_04 | AC | 162 ms
89,600 KB |
testcase_05 | AC | 163 ms
89,728 KB |
testcase_06 | AC | 159 ms
89,600 KB |
testcase_07 | AC | 165 ms
89,728 KB |
testcase_08 | AC | 164 ms
89,728 KB |
testcase_09 | AC | 181 ms
89,984 KB |
testcase_10 | AC | 193 ms
91,264 KB |
testcase_11 | AC | 181 ms
91,008 KB |
testcase_12 | AC | 189 ms
90,752 KB |
testcase_13 | AC | 200 ms
91,008 KB |
testcase_14 | AC | 288 ms
91,008 KB |
testcase_15 | AC | 224 ms
90,752 KB |
testcase_16 | AC | 184 ms
90,624 KB |
testcase_17 | AC | 305 ms
91,264 KB |
testcase_18 | AC | 316 ms
91,136 KB |
testcase_19 | AC | 216 ms
91,520 KB |
testcase_20 | AC | 233 ms
91,264 KB |
testcase_21 | AC | 207 ms
90,880 KB |
testcase_22 | AC | 278 ms
91,136 KB |
testcase_23 | AC | 184 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) if maxnum == 0: print(0) exit() for i in range(M): if ans[i] == maxnum: print(i+1) if __name__ == '__main__': main()