結果

問題 No.1223 I hate Golf
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-06 15:00:53
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 2,098 bytes
コンパイル時間 173 ms
コンパイル使用メモリ 82,456 KB
実行使用メモリ 64,384 KB
最終ジャッジ日時 2024-07-21 00:26:59
合計ジャッジ時間 1,928 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time
setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize=None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
def I(): return int(readline())
def S(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x)-1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x)-1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
ret = [[] for _ in [0] * N]
for _ in [0] * edge:
a, b = SPII()
ret[a].append(b)
ret[b].append(a)
return ret
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx]
def imax(A, idx = -1, m = -1<<30):
for i, a in enumerate(A): m, idx = (a, i) if m < a else (m, idx)
return idx
def imin(A, idx = -1, m = 1<<30):
for i, a in enumerate(A): m, idx = (a, i) if m > a else (m, idx)
return idx
def cmin(dp, i, x):
if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
if x > dp[i]: dp[i] = x
def gen(x, *args):
ret = [x] * args[-1]
for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
return ret
def puts(E):
for e in E: print(e)
def pprint(E):
print()
puts(E)
def yn(x): print("Yes" if x else "No")
def blank(arr): print(" ".join(map(str, arr)))
def debug(*args):
if DEBUG:
for e in args: print(e)
DEBUG = False
####################################################################
def solve():
N, K, T = SPI()
time = (abs(N)+K-1) // K
return time <= T
yn(solve())
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0