結果

問題 No.1748 Parking Lot
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-07 19:17:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 140 ms / 2,000 ms
コード長 2,534 bytes
コンパイル時間 850 ms
コンパイル使用メモリ 86,772 KB
実行使用メモリ 79,660 KB
最終ジャッジ日時 2023-09-29 20:20:12
合計ジャッジ時間 5,827 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 140 ms
79,112 KB
testcase_01 AC 140 ms
79,508 KB
testcase_02 AC 138 ms
79,092 KB
testcase_03 AC 139 ms
79,376 KB
testcase_04 AC 138 ms
79,656 KB
testcase_05 AC 139 ms
79,388 KB
testcase_06 AC 137 ms
79,356 KB
testcase_07 AC 137 ms
79,524 KB
testcase_08 AC 138 ms
79,368 KB
testcase_09 AC 138 ms
79,112 KB
testcase_10 AC 137 ms
79,400 KB
testcase_11 AC 136 ms
79,112 KB
testcase_12 AC 138 ms
79,308 KB
testcase_13 AC 138 ms
79,100 KB
testcase_14 AC 137 ms
79,660 KB
testcase_15 AC 135 ms
79,296 KB
testcase_16 AC 136 ms
79,204 KB
testcase_17 AC 136 ms
79,472 KB
testcase_18 AC 135 ms
79,108 KB
testcase_19 AC 138 ms
79,512 KB
testcase_20 AC 134 ms
79,508 KB
testcase_21 AC 137 ms
79,296 KB
testcase_22 AC 136 ms
79,296 KB
testcase_23 AC 135 ms
79,488 KB
権限があれば一括ダウンロードができます

ソースコード

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
from bisect import bisect_left, bisect_right

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)]
''' Input '''
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 

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Other'''
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 gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(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
###############################################################################################

N, K = SPI()
def solve(N, K):
    if N == 1: return N
    if K == N - 1: return N 
    return N - 1

print(solve(N, K))
0