結果
問題 | No.2109 Special Week |
ユーザー | McGregorsh |
提出日時 | 2022-10-28 21:38:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 266 ms / 2,000 ms |
コード長 | 2,382 bytes |
コンパイル時間 | 523 ms |
コンパイル使用メモリ | 86,856 KB |
実行使用メモリ | 92,588 KB |
最終ジャッジ日時 | 2023-09-20 04:28:41 |
合計ジャッジ時間 | 12,486 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 256 ms
92,444 KB |
testcase_01 | AC | 252 ms
92,516 KB |
testcase_02 | AC | 253 ms
92,472 KB |
testcase_03 | AC | 245 ms
92,236 KB |
testcase_04 | AC | 252 ms
92,484 KB |
testcase_05 | AC | 245 ms
92,324 KB |
testcase_06 | AC | 253 ms
92,232 KB |
testcase_07 | AC | 252 ms
92,376 KB |
testcase_08 | AC | 262 ms
92,224 KB |
testcase_09 | AC | 255 ms
92,436 KB |
testcase_10 | AC | 255 ms
92,324 KB |
testcase_11 | AC | 244 ms
92,492 KB |
testcase_12 | AC | 255 ms
92,352 KB |
testcase_13 | AC | 245 ms
92,440 KB |
testcase_14 | AC | 256 ms
92,480 KB |
testcase_15 | AC | 253 ms
92,440 KB |
testcase_16 | AC | 258 ms
92,584 KB |
testcase_17 | AC | 247 ms
92,468 KB |
testcase_18 | AC | 255 ms
92,524 KB |
testcase_19 | AC | 249 ms
92,472 KB |
testcase_20 | AC | 253 ms
92,284 KB |
testcase_21 | AC | 246 ms
92,436 KB |
testcase_22 | AC | 253 ms
92,404 KB |
testcase_23 | AC | 246 ms
92,412 KB |
testcase_24 | AC | 255 ms
92,452 KB |
testcase_25 | AC | 244 ms
92,524 KB |
testcase_26 | AC | 253 ms
92,364 KB |
testcase_27 | AC | 244 ms
92,376 KB |
testcase_28 | AC | 252 ms
92,436 KB |
testcase_29 | AC | 244 ms
92,472 KB |
testcase_30 | AC | 266 ms
92,588 KB |
testcase_31 | AC | 245 ms
92,576 KB |
testcase_32 | AC | 256 ms
92,536 KB |
testcase_33 | AC | 246 ms
92,472 KB |
testcase_34 | AC | 256 ms
92,288 KB |
testcase_35 | AC | 244 ms
92,468 KB |
testcase_36 | AC | 252 ms
92,328 KB |
testcase_37 | AC | 243 ms
92,236 KB |
testcase_38 | AC | 259 ms
92,584 KB |
testcase_39 | AC | 246 ms
92,316 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(): M, D, K = i_map() nums = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] lines = set() if nums[M] < D + 6: mo = str(M).zfill(2) for o in range(2): lines.add(mo[o]) cou = 0 for i in range(D, nums[M]+1): strs = str(i).zfill(2) cou += 1 for j in range(2): lines.add(strs[j]) nokori = 7 - cou nxt = str((M + 1) % 12).zfill(2) for k in range(2): lines.add(nxt[k]) for l in range(1, nokori+1): strs1 = str(l).zfill(2) for m in range(2): lines.add(strs1[m]) #print(lines) if len(lines) >= K: print('Yes') else: print('No') else: for i in range(D, D+7): strs = str(i).zfill(2) for j in range(2): lines.add(strs[j]) mo = str(M).zfill(2) for o in range(2): lines.add(mo[o]) if len(lines) >= K: print('Yes') else: print('No') if __name__ == '__main__': main()