結果
問題 | No.2091 Shio Ramen (Easy) |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 23:24:12 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,687 bytes |
コンパイル時間 | 274 ms |
コンパイル使用メモリ | 86,704 KB |
実行使用メモリ | 92,444 KB |
最終ジャッジ日時 | 2023-08-18 01:18:13 |
合計ジャッジ時間 | 4,939 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,268 KB |
testcase_01 | AC | 246 ms
92,276 KB |
testcase_02 | AC | 240 ms
92,192 KB |
testcase_03 | AC | 240 ms
92,416 KB |
testcase_04 | AC | 239 ms
92,300 KB |
testcase_05 | AC | 242 ms
92,164 KB |
testcase_06 | AC | 243 ms
92,288 KB |
testcase_07 | AC | 244 ms
92,176 KB |
testcase_08 | AC | 241 ms
92,360 KB |
testcase_09 | AC | 239 ms
92,444 KB |
testcase_10 | AC | 243 ms
92,352 KB |
testcase_11 | WA | - |
testcase_12 | AC | 249 ms
92,188 KB |
testcase_13 | AC | 240 ms
92,352 KB |
testcase_14 | WA | - |
ソースコード
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, S, K = i_map() A = [int(input()) for i in range(N)] p = INF for i in range(N): cost = A[i] - S if cost >= 0: p = min(p, cost) if p > K: print('Unlucky!') else: for i in range(N): cost = A[i] - S if cost == p: print(i+1) exit() if __name__ == '__main__': main()