input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
sys.setrecursionlimit(10 ** 7)
class Tree:
C, RL = {}, {}
R, N, D, S, P, T = None, None, None, None, None, None
TL = None
def __init__(s, num):
s.N = num
def set(s, a, b):
if a in s.C: s.C[a].append(b)
else: s.C[a] = [b]
if b in s.C: s.C[b].append(a)
else: s.C[b] = [... | import sys
sys.setrecursionlimit(10 ** 7)
class Tree:
C, RL = {}, {}
R, N, D, S, P, T = None, None, None, None, None, None
TL = None
def __init__(s, num):
s.N = num
def set(s, a, b):
if a in s.C: s.C[a].append(b)
else: s.C[a] = [b]
if b in s.C: s.C[b].append(a)
else: s.C[b] = [... | p02728 |
def rerooting(n, edges, identity, merge, add_node):
# 全方位木 dp
# 参考: https://qiita.com/keymoon/items/2a52f1b0fb7ef67fb89e
G = [[] for _ in range(n)]
G_idxs = [[] for _ in range(n)] # 自分を指すノードのインデックス
for a, b in edges:
G_idxs[a].append(len(G[b]))
G_idxs[b].append(len(G[a]))
... | def rerooting(n, edges, identity, merge, add_node):
# 全方位木 dp
# 参考: https://qiita.com/keymoon/items/2a52f1b0fb7ef67fb89e
G = [[] for _ in range(n)]
G_idxs = [[] for _ in range(n)] # 自分を指すノードのインデックス
for a, b in edges:
G_idxs[a].append(len(G[b]))
G_idxs[b].append(len(G[a]))
... | p02728 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02728 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
vec = [[] for _ in range(N)]
for _ in range(N - 1) :
a, b = list(map(int, input().split()))
vec[a - 1].append(b - 1)
vec[b - 1].append(a - 1)
mod = 10 ** 9 + 7
fac = [1]
for i in range(1, N + 1) :
fac.append(fac[-1] * i)
inv = [pow... | import sys
input = sys.stdin.readline
N = int(eval(input()))
vec = [[] for _ in range(N)]
for _ in range(N - 1) :
a, b = list(map(int, input().split()))
vec[a - 1].append(b - 1)
vec[b - 1].append(a - 1)
mod = 10 ** 9 + 7
fac = [1]
for i in range(1, N + 1) :
fac.append(fac[-1] * i % mod)
inv ... | p02728 |
def main():
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in [0]*(n-1)]
g = [[] for _ in [0]*n]
[g[a-1].append(b-1) for a, b in ab]
[g[b-1].append(a-1) for a, b in ab]
mod = 10**9+7
fact = [1, 1]
for i in range(2, n+1):
fact.append(fact[-1]*i % m... | def main():
from sys import stdin
input = stdin.readline
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in [0]*(n-1)]
g = [set() for _ in [0]*n]
for a, b in ab:
g[a-1].add(b-1)
g[b-1].add(a-1)
mod = 10**9+7
fact = [1, 1]
inv = [pow(i... | p02728 |
def main():
from sys import stdin
input = stdin.readline
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in [0]*(n-1)]
g = [set() for _ in [0]*n]
for a, b in ab:
g[a-1].add(b-1)
g[b-1].add(a-1)
mod = 10**9+7
fact = [1, 1]
inv = [pow(i... | def main():
from sys import stdin
input = stdin.readline
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in [0]*(n-1)]
g = [[] for _ in [0]*n]
for a, b in ab:
g[a-1].append(b-1)
g[b-1].append(a-1)
mod = 10**9+7
fact = [1, 1]
inv = [po... | p02728 |
def main():
from sys import stdin
input = stdin.readline
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in [0]*(n-1)]
g = [[] for _ in [0]*n]
for a, b in ab:
g[a-1].append(b-1)
g[b-1].append(a-1)
mod = 10**9+7
fact = [1, 1]
inv = [po... | def main():
from sys import stdin
input = stdin.readline
n = int(eval(input()))
g = [[] for _ in [0]*n]
for _ in range(n-1):
a, b = list(map(int, input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
mod = 10**9+7
fact = [1, 1]
inv = [1]*(n+1)
... | p02728 |
import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n = int(eval(input()))
e = [[] for _ in range(n)]
for _ in range(n-1):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
mod = 10**9+7
kkai = [1]
for i in range(1, 2*10 ** 5):
... | import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n = int(eval(input()))
e = [[] for _ in range(n)]
for _ in range(n-1):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
mod = 10**9+7
kkai = [1]
for i in range(1, 2*10 ** ... | p02728 |
import math
import sys
from collections import deque
to = [0]
treenum = [0]
dpv = [0]
N = 0
NMAX = 2*(10**5)
MOD = 10**9+7
fact = [0 for i in range(NMAX+1)]
fact[0] = 1
invfact = [0 for i in range(NMAX+1)]
invfact[0] = 1
def pways(v, parent):
global to, dpv, treenum, fact, invfact, MOD
if... | import math
import sys
from collections import deque
sys.setrecursionlimit(10 ** 9)
to = {0:[0]}
treenum = {(0,0):0}
dpv = {(0,0):0}
N = 0
NMAX = 2*(10**5)
MOD = 10**9+7
fact = [0 for i in range(NMAX+1)]
fact[0] = 1
invfact = [0 for i in range(NMAX+1)]
invfact[0] = 1
def pways(v, parent):
g... | p02728 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | p02728 |
def ABC67_B():
N, K = LI()
L = LI()
L.sort(reverse=True)
ans = sum(L[:K])
print(ans)
return
def ABC100_C():
def factorization_2(n):
arr = defaultdict(int)
temp = n
i = 2
if temp % i == 0:
cnt = 0
while temp % i == 0:
... | def ABC67_B():
N, K = LI()
L = LI()
L.sort(reverse=True)
ans = sum(L[:K])
print(ans)
return
def ABC100_C():
def factorization_2(n):
arr = defaultdict(int)
temp = n
i = 2
if temp % i == 0:
cnt = 0
while temp % i == 0:
... | p02728 |
MOD = 10 ** 9 + 7
MAX_N = 2 * 10 ** 5
fact = [1] * (MAX_N + 1)
inverse = [1] * (MAX_N + 1)
inv_fact = [1] * (MAX_N + 1)
for i in range(2, MAX_N + 1):
fact[i] = fact[i-1] * i % MOD
inverse[i] = -inverse[MOD % i] * (MOD // i) % MOD
inv_fact[i] = inv_fact[i-1] * inverse[i] % MOD
n = int(eval(input()))
... | MOD = 10 ** 9 + 7
MAX_N = 2 * 10 ** 5
fact = [1] * MAX_N
inverse = [1] * MAX_N
inv_fact = [1] * MAX_N
for i in range(2, MAX_N):
fact[i] = fact[i-1] * i % MOD
inverse[i] = -inverse[MOD % i] * (MOD // i) % MOD
inv_fact[i] = inv_fact[i-1] * inverse[i] % MOD
n = int(eval(input()))
edge = [[] for _ in ra... | p02728 |
MOD = 10 ** 9 + 7
MAX_N = 2 * 10 ** 5
fact = [1] * MAX_N
inverse = [1] * MAX_N
inv_fact = [1] * MAX_N
for i in range(2, MAX_N):
fact[i] = fact[i-1] * i % MOD
inverse[i] = -inverse[MOD % i] * (MOD // i) % MOD
inv_fact[i] = inv_fact[i-1] * inverse[i] % MOD
n = int(eval(input()))
edge = [[] for _ in ra... | # modulo
MOD = 10 ** 9 + 7
# number of vertices
n = int(eval(input()))
# adjacency list
edge = [[] for _ in range(n)]
# 0-index
for _ in range(n-1):
a, b = list(map(int, input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
# factorial and inverse and inverse of factorial
fact = [1] * n
i... | p02728 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
E=[[] for i in range(N+1)]
for i in range(N-1):
a,b=list(map(int,input().split()))
E[a].append(b)
E[b].append(a)
mod=10**9+7
FACT=[1]
for i in range(1,2*10**5+1):
FACT.append(FACT[-1]*i%mod)
FACT_INV=[pow(FACT[-1],mod-2,mod... | import sys
input = sys.stdin.readline
N=int(eval(input()))
E=[[] for i in range(N+1)]
for i in range(N-1):
a,b=list(map(int,input().split()))
E[a].append(b)
E[b].append(a)
mod=10**9+7
FACT=[1]
for i in range(1,2*10**5+1):
FACT.append(FACT[-1]*i%mod)
FACT_INV=[pow(FACT[-1],mod-2,mod... | p02728 |
import sys
sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i ... | import sys
sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i ... | p02728 |
# -*- coding: utf-8 -*-
"""
Created on Fri May 8 12:10:59 2020
@author: ybt07
"""
import sys
import time
sys.setrecursionlimit(3*10**5) # 繰り返し制限
# 組み合わせ
N = 2*10**5 # 問題サイズに合わせて変えておく
MOD = 10**9 + 7
# modint
# https://qiita.com/wotsushi/items/c936838df992b706084c
class ModInt:
def __init... | # -*- coding: utf-8 -*-
"""
Created on Fri May 8 12:10:59 2020
@author: ybt07
"""
import sys
import time
sys.setrecursionlimit(3*10**5) # 繰り返し制限
# 組み合わせ
N = 2*10**5 # 問題サイズに合わせて変えておく
MOD = 10**9 + 7
# modint
# https://qiita.com/wotsushi/items/c936838df992b706084c
class ModInt:
def __init... | p02728 |
# -*- coding: utf-8 -*-
"""
Created on Fri May 8 12:10:59 2020
@author: ybt07
"""
import sys
import time
sys.setrecursionlimit(3*10**5) # 繰り返し制限
# 組み合わせ
N = 2*10**5 # 問題サイズに合わせて変えておく
MOD = 10**9 + 7
# modint
# https://qiita.com/wotsushi/items/c936838df992b706084c
class ModInt:
def __init... | # -*- coding: utf-8 -*-
"""
Created on Fri May 8 12:10:59 2020
@author: ybt07
"""
import sys
sys.setrecursionlimit(3*10**5) # 繰り返し制限
# 組み合わせ
N = 2*10**5 # 問題サイズに合わせて変えておく
MOD = 10**9 + 7
# 入力高速化
input = lambda : sys.stdin.readline().rstrip()
# modint
# https://qiita.com/wotsushi/items/c936838... | p02728 |
import sys
input = lambda: sys.stdin.readline().rstrip()
#MOD
P = 10**9 + 7
N = 200001 #使う最大値+1以上にする、値に注意3*10^5とかにしとくと安心
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2, N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] ... | import sys
input = lambda: sys.stdin.readline().rstrip()
#MOD
P = 10**9 + 7
N = 200001 #使う最大値+1以上にする、値に注意3*10^5とかにしとくと安心
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2, N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] ... | p02728 |
from collections import deque
import sys
input=sys.stdin.readline
def abc():
global qqq
for i in range(len(ppp)-1,0,-1):
qqq=qqq*cmb(ppp[i],ppp[i-1])%mod
return qqq
mod=10**9+7
MAX=2*10**5+100
g1=[1,1]
g2=[1,1]
for i in range(2,MAX+1):
num_1=g1[-1]*i%mod
g1.append(num_1)
... | from collections import deque
import sys
input=sys.stdin.readline
def abc():
global qqq
for i in range(len(ppp)-1,0,-1):
qqq=qqq*cmb(ppp[i],ppp[i-1])%mod
return qqq
mod=10**9+7
MAX=2*10**5+100
g1=[1,1]
g2=[1,1]
for i in range(2,MAX+1):
num_1=g1[-1]*i%mod
g1.append(num_1)
... | p02728 |
from functools import *
from collections import *
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.buffer.readline
M = 10**9+7
@lru_cache(maxsize=None)
def mod_inv(x):
if x == 1:
return 1
return M // x * -mod_inv(M%x) % M
@lru_cache(maxsize=None)
def calc_subtree(v):
ret = 1
si... | from functools import *
from collections import *
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.buffer.readline
M = 10**9+7
N = int(eval(input()))
@lru_cache(maxsize=None)
def mod_inv(x):
if x == 1:
return 1
return M // x * -mod_inv(M%x) % M
weight = [0]*(N+1)
size = [0]*(N+1)
d... | p02728 |
from functools import *
from collections import *
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.buffer.readline
M = 10**9+7
N = int(eval(input()))
@lru_cache(maxsize=None)
def mod_inv(x):
if x == 1:
return 1
return M // x * -mod_inv(M%x) % M
weight = [0]*(N+1)
size = [0]*(N+1)
d... | from functools import *
from itertools import *
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.buffer.readline
M = 10**9+7
N = int(eval(input()))
@lru_cache(maxsize=None)
def mod_inv(x):
return 1 if x == 1 else M // x * -mod_inv(M%x) % M
Weight = [0]*(N+1)
Size = [0]*(N+1)
def calc_subtr... | p02728 |
import sys
from functools import lru_cache
sys.setrecursionlimit(1000000000)
def input(): return sys.stdin.readline().rstrip()
MOD = 10 ** 9 + 7
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
def inverse(x):... | import sys
from functools import lru_cache
sys.setrecursionlimit(1000000000)
def input(): return sys.stdin.readline().rstrip()
MOD = 10 ** 9 + 7
def memoize_fast(size):
def decorator(f):
memo = [-1] * size
def wrapper(i):
if memo[i] != -1:
return m... | p02728 |
import sys
input = sys.stdin.readline
from collections import deque
nn = 202020
mod = 10 ** 9 + 7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % mod
C = lambd... | import sys
input = sys.stdin.readline
from collections import deque
nn = 200200
mod = 10**9+7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % mod
C = lambda a, b... | p02728 |
import sys
input = sys.stdin.readline
from collections import deque
nn = 200200
mod = 10**9+7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
inv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % ... | import sys
input = sys.stdin.readline
from collections import deque
nn = 200200
mod = 10**9+7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
inv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % ... | p02728 |
import sys
input = sys.stdin.readline
from collections import deque
nn = 200200
mod = 10**9+7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
inv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % ... | import sys
input = sys.stdin.readline
from collections import deque
nn = 200200
mod = 10**9+7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
inv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % ... | p02728 |
import sys
input = sys.stdin.readline
from collections import deque
nn = 200200
mod = 10**9+7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
inv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % ... | import sys
input = sys.stdin.readline
from collections import deque
nn = 200200
mod = 10**9+7
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % mod
fainv[-1] = pow(fa[-1], mod-2, mod)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % mod
inv = lambda ... | p02728 |
import sys
input = sys.stdin.readline
from collections import deque
mod = 10 ** 9 + 7
N = int(input())
X = [[] for i in range(N)]
for i in range(N-1):
x, y = map(int, input().split())
X[x-1].append(y-1)
X[y-1].append(x-1)
P = [-1] * N
Q = deque([0])
R = []
while Q:
i = deque.popleft(Q)... | import sys
input = sys.stdin.readline
from collections import deque
mod = 10 ** 9 + 7
N = int(input())
X = [[] for i in range(N)]
for i in range(N-1):
x, y = map(int, input().split())
X[x-1].append(y-1)
X[y-1].append(x-1)
P = [-1] * N
Q = deque([0])
R = []
while Q:
i = deque.popleft(Q)... | p02728 |
import sys
input = sys.stdin.readline
from collections import deque
mod = 10 ** 9 + 7
N = int(input())
X = [[] for i in range(N)]
for i in range(N-1):
x, y = map(int, input().split())
X[x-1].append(y-1)
X[y-1].append(x-1)
P = [-1] * N
Q = deque([0])
R = []
while Q:
i = deque.popleft(Q)... | import sys
input = sys.stdin.readline
from collections import deque
mod = 10 ** 9 + 7
N = int(input())
X = [[] for i in range(N)]
for i in range(N-1):
x, y = map(int, input().split())
X[x-1].append(y-1)
X[y-1].append(x-1)
P = [-1] * N
Q = deque([0])
R = []
while Q:
i = deque.popleft(Q)... | p02728 |
def main():
import sys
from collections import deque
input = sys.stdin.readline
# comb init
mod = 1000000007
nmax = 2*10 ** 5 + 10 # change here
fac = [0] * nmax
finv = [0] * nmax
inv = [0] * nmax
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[... | def main():
import sys
input = sys.stdin.readline
# comb init
mod = 1000000007
nmax = 2 * 10 ** 5 + 10 # change here
fac = [0] * nmax
finv = [0] * nmax
inv = [0] * nmax
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, nma... | p02728 |
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from collections import deque
MOD = 10**9 + 7
N = int(input())
tree = dict(zip(range(N), [[] for i in range(N)]))
edge_id = {}
c = 0
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
tree[a].append(b)
tree[b].a... | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from collections import deque
MOD = 10**9 + 7
N = int(input())
tree = dict(zip(range(N), [[] for i in range(N)]))
edge_id = {}
c = 0
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
tree[a].append(b)
tree[b].a... | p02728 |
import sys;input=sys.stdin.readline
import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0: return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else: return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
re... | import sys;input=sys.stdin.readline
import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0: return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else: return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
re... | p02728 |
import sys;input=sys.stdin.readline
import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0: return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else: return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
re... | import sys;input=sys.stdin.readline
import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0: return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else: return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
re... | p02728 |
import sys;input=sys.stdin.readline
import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0: return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else: return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
re... | import sys;input=sys.stdin.readline
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
def div(a, b):
return mul(a, modinv(b))
def modinv(a):
b, u, v = mod, 1, 0
while b:
t = a//b
a, u = a-t*b, u-t*v
a, b, u, v =... | p02728 |
#!/usr/bin/env python3
import sys
from collections import defaultdict
from functools import lru_cache
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 1000000007 # type: int
class Graph(object):
def __init__(self, N):
self.N = N
self.E = defaultdict(list)
def add_edge(... | #!/usr/bin/env python3
import sys
from collections import defaultdict
from functools import lru_cache
from collections import deque
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 1000000007 # type: int
class Graph(object):
def __init__(self, N):
self.N = N
self.E = defau... | p02728 |
#!/usr/bin/env python3
import sys
from collections import defaultdict
from functools import lru_cache
from collections import deque
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 1000000007 # type: int
class Graph(object):
def __init__(self, N):
self.N = N
self.E = defau... | #!/usr/bin/env python3
import sys
from collections import defaultdict
from functools import lru_cache
from collections import deque
MOD = 1000000007 # type: int
class Graph(object):
def __init__(self, N):
self.N = N
self.E = defaultdict(list)
def add_edge(self, src, dest, w=1):
... | p02728 |
#!/usr/bin/env python3
import sys
from collections import defaultdict
from functools import lru_cache
MOD = 1000000007 # type: int
@lru_cache(maxsize=None)
def div(a, b):
return (a * pow(b, MOD-2, MOD)) % MOD
class Combination(object):
def __init__(self, N, mod=MOD):
fac, finv, inv ... | #!/usr/bin/env python3
import sys
from collections import defaultdict
MOD = 1000000007 # type: int
class Combination(object):
def __init__(self, N, mod=MOD):
fac, finv, inv = [0]*(N+1), [0]*(N+1), [0]*(N+1)
fac[:2] = 1, 1
finv[:2] = 1, 1
inv[1] = 1
for i in r... | p02728 |
import sys
def solve():
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)
mod = 10 ** 9 + 7
def comb(n, r):
if r > n: return 0
return fac[n] * inv[r] * inv[n - r] % mod
def dfs(v, Pa=-1):
for u in to[v]:
if u == Pa: c... | import sys
def solve():
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)
mod = 10 ** 9 + 7
def comb(n, r):
if r > n: return 0
return fac[n] * inv[r] * inv[n - r] % mod
def dfs(v, Pa=-1):
for u in to[v]:
if u == Pa: conti... | p02728 |
# _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest071-B
# TODO https://atcoder.jp/contests/abc071/tasks/abc071_b
def firstCharNotFound(givenString):
# initialize for char
checkList = [False for _ in range(0,26,+1)]
stringLength = list(range(0,len(givenString),+1))
for pos in stringLength:
charIntVers... | # Problem:
# Python Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_num... | p03624 |
diff = set(chr(ord("a") + i) for i in range(26)) - set(input().rstrip("\n"))
print(((list(sorted(diff))+["None"])[0])) | [print(un_appearence[0] if un_appearence else "None") for un_appearence in [[chr(i) for i in range(ord('a'), ord('z') + 1) if chr(i) not in string] for string in [input()]]]
| p03624 |
S = input().strip()
C = {chr(i):0 for i in range(97,123)}
for i in range(len(S)):
C[S[i]] += 1
x = "None"
for i in range(97,123):
if C[chr(i)]==0:
x = chr(i)
break
print(x) | S = input().strip()
C = {chr(i):0 for i in range(97,123)}
for i in range(len(S)):
C[S[i]] += 1
flag = 0
a = 0
for i in range(97,123):
if C[chr(i)]==0:
a = chr(i)
flag = 1
break
if flag==1:
print(a)
else:
print("None") | p03624 |
a = list(map(int, input().split()))
print(("Yes" if sum(a) == max(a) * 2 else "No"))
| a, b, c = sorted(map(int, input().split()))
print((("No", "Yes")[a + b == c])) | p03943 |
s = list(map(int, input().split()))
s.sort()
if s[0] + s[1] == s[2]:
print('Yes')
else:
print('No') | s = list(map(int, input().split()))
s.sort()
print(('Yes' if s[0] + s[1] == s[2] else'No')) | p03943 |
a = list(map(int, input().split()))
total = sum(a)
for i in a:
if total - i in a:
print("Yes")
break
else:
print("No")
| a = list(map(int, input().split()))
if max(a) == sum(a) - max(a):
print("Yes")
else:
print("No")
| p03943 |
# 書き方を少し変えたver
packs = [int(candies) for candies in input().split()]
N = int(len(packs))
if sum(packs) % 2 == 0:
half = int(sum(packs) / 2)
else:
print('No')
exit()
dp = [[False] * (half + 1)] * (N + 1)
dp[0][0] = True
for i in range(N):
for j in range(half+1):
if dp[i][j]:
... | packs = [int(candies) for candies in input().split()]
N = int(len(packs))
X = 2
if sum(packs) % X == 0:
A = int(sum(packs) / X)
else:
print('No')
exit()
dp = [[False] * (A + 1)] * (N + 1)
dp[0][0] = True
for i in range(N):
for j in range(A+1):
if dp[i][j]:
dp[i+1][... | p03943 |
a,b,c = (int(i) for i in input().split())
print(("Yes" if a+b == c or b+c == a or c+a == b else "No")) | def main():
a, b, c = (int(i) for i in input().split())
if a+b == c or b+c == a or b == c+a:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| p03943 |
a, b, c = list(map(int, input().split()))
candy_nums = sorted([a, b, c])
print(('Yes' if candy_nums[0] + candy_nums[1] == candy_nums[2] else 'No')) | a, b, c = list(map(int, input().split()))
L = sorted([a, b, c])
print(('Yes' if L[2] == L[0] + L[1] else 'No')) | p03943 |
a,b,c = list(map(int, input().split()))
x = a+b
y = b+c
z = c+a
if x ==c or y ==a or z ==b:
print('Yes')
else:
print('No')
| candy= list(map(int, input().split()))
candy.sort()
print(('Yes' if candy[0]+candy[1]==candy[2] else 'No')) | p03943 |
a,b,c = list(map(int, input().split()))
if a + b == c or a + c == b or b + c == a:
print('Yes')
else:
print('No') | a,b,c=list(map(int,input().split()))
print(('Yes' if a+b==c or b+c==a or a+c==b else 'No')) | p03943 |
a,b,c = list(map(int,input().split()))
if a+b == c or a+c == b or b+c == a:
print("Yes")
else:
print("No") | a,b,c = list(map(int,input().split()))
ans = 0
if a+b == c:
ans += 1
elif a+c == b:
ans += 1
elif b+c == a:
ans += 1
if ans >0:
print("Yes")
else:
print("No") | p03943 |
a, b, c = sorted(map(int, input().split()))
print(('Yes' if a + b == c else 'No')) | a, b, c = list(map(int, input().split()))
print(('Yes' if a == (b + c) or b == (a + c) or c == (a+b) else 'No')) | p03943 |
l=sorted(list(map(int,input().split())))
print(("Yes" if l[0]+l[1]==l[2] else "No")) | a,b,c=sorted(map(int,input().split()))
print(("Yes" if a+b==c else "No")) | p03943 |
l=sorted(map(int,input().split()))
print(("Yes" if sum(l[:2])==l[2] else "No")) | a, b, c = sorted(map(int, input().split()))
print(("Yes" if a+b == c else "No")) | p03943 |
a, b, c = list(map(int,input().split()))
if a+b==c or b+c==a or c+a==b:
print("Yes")
else:
print("No")
| a, b, c = list(map(int,input().split()))
if a==b+c or b==a+c or c==b+a:
print("Yes")
else:
print("No")
| p03943 |
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
a,b,c=list(map(int,input().split()))
for i in itertools.permutations([a,b,c],3):
if... | #!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
a,b,c=list(map(int,input().split()))
# print(0)
for i in itertools.permutations([a,b,c]... | p03943 |
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
a, b, c = list(map(int, input().split()))
for i in itertools.permutations([a, b, c], 3):
if i[0] =... | #!/usr/bin/env python3
import sys, math, itertools, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
a, b, c = list(map(int, input().split()))
for i in itertools.permutations([a, b, c], 3):
if i[0] == sum(i[1:]) ... | p03943 |
#!/usr/bin/env python3
import sys, math, itertools
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
a, b, c = list(map(int, input().split()))
for i in itertools.permutations([a, b, c], 3):
if i[0] == sum(i[1:]) or sum(... | #!/usr/bin/env python3
import sys, itertools
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
a, b, c = list(map(int, input().split()))
for i in itertools.permutations([a, b, c], 3):
if i[0] == sum(i[1:]) or sum(i[:2]... | p03943 |
# import time
# starttime=time.clock()
A,B,C =input().split()
a=int(A)
b=int(B)
c=int(C)
# print(a+c)
if a>b:
temp = a
a = b
b = temp
if b>c:
temp = b
b = c
c = temp
if (a+b)==c:
print("Yes")
# endtime = time.clock()
# print(endtime-starttime)
else:
pri... | a,b,c = list(map(int,input().split()))
if a>b:
temp = a
a = b
b = temp
if b>c:
temp = b
b = c
c = temp
if (a+b)==c:
print("Yes")
else:
print("No")
| p03943 |
A = [int(i) for i in input().split()]
print(('Yes' if sum(A) == max(A) * 2 else 'No')) | a, b, c = list(map(int, input().split()))
if a + b == c or a + c == b or b + c == a:
print('Yes')
else:
print('No') | p03943 |
while 1:
n=int(input())
if n==0:break
d={}
for _ in[0]*n:
k,v=input().strip().split()
d[k]=v
for _ in[0]*int(input()):
e=input().strip()
print(d[e]if e in d else e,end='')
print()
| while 1:
n=int(eval(input()))
if n==0:break
d={}
for _ in[0]*n:
k,v=input().strip().split()
d[k]=v
a=''
for _ in[0]*int(eval(input())):
e=input().strip()
a+=d[e]if e in d else e
print(a)
| p00424 |
import sys
s=sys.stdin.readline
for n in iter(s,'0\n'):
d={}
for _ in[0]*int(n):
k,v=s()[:-1].split()
d[k]=v
print((''.join(d.get(*[s().strip()]*2)for _ in[0]*int(s()))))
| import sys
s=sys.stdin.readline
for n in iter(s,'0\n'):
d={}
for _ in[0]*int(n):
k,v=s()[:-1].split()
d[k]=v
print((''.join(d.get(*[s()[0]]*2)for _ in[0]*int(s()))))
| p00424 |
while True:
n = int(eval(input()))
if n == 0:break
c = {}
for _ in range(n):
a,b = input().split()
c[a] = b
m = int(eval(input()))
ans = ''
for _ in range(m):
a = input()[0]
ans+=c[a] if a in c else a
print(ans) | import sys
cin = sys.stdin
while True:
n = int(cin.readline())
if n == 0:break
c = {}
for _ in range(n):
a,b = cin.readline().strip().split()
c[a] = b
m = int(cin.readline())
ans = ''
for _ in range(m):
a = cin.readline().strip()
ans+=c[a] if a in... | p00424 |
import sys
while True:
n = int(sys.stdin.readline().rstrip())
if n == 0:
break;
x = {}
for i in range(n):
k,v = sys.stdin.readline().rstrip().split()
x[k] = v
n = int(sys.stdin.readline().rstrip())
y = []
for i in range(n):
a = sys.stdin.readline... | import sys
while True:
n = int(sys.stdin.readline().rstrip())
if n == 0:
break;
x = {}
for i in range(n):
k,v = sys.stdin.readline().rstrip().split()
x[k] = v
n = int(sys.stdin.readline().rstrip())
y = []
for i in range(n):
a = sys.stdin.readline... | p00424 |
while True:
x = int(eval(input()))
if x == 0:
break
dcl = {}
for i in range(x):
inp = list(map(str, input().split()))
dcl[inp[0]] = inp[1]
ans = ""
x = int(eval(input()))
for i in range(x):
y = str(input()[0])
if y in dcl:
ans ... | while True:
n = int(eval(input()))
if n == 0:
break
d = {}
for _ in range(n):
a, b = input().split()
d[a] = b
m = int(eval(input()))
ans = ""
for _ in range(m):
a = input().strip()
ans += d.get(a, a)
print(ans) | p00424 |
while True:
n = int(eval(input()))
if n == 0:
break
d = {}
for _ in range(n):
a, b = input().split()
d[a] = b
m = int(eval(input()))
ans = ""
for _ in range(m):
a = input().strip()
try:
ans += d[a]
except:
... | while True:
n = int(eval(input()))
if n == 0:
break
d = {}
for _ in range(n):
a, b = input().split()
d[a] = b
m = int(eval(input()))
ans = ""
for _ in range(m):
a = input().strip()
ans += d[a] if a in d else a
print(ans) | p00424 |
while True:
n = int(eval(input()))
if n == 0:
break
d = {}
for _ in range(n):
a, b = input().split()
d[a] = b
m = int(eval(input()))
ans = ""
for _ in range(m):
a = input().strip()
if a in d:
ans += d[a]
else:
... | while True:
n = int(eval(input()))
if n == 0:
break
d = {}
for _ in range(n):
a, b = input().split()
d[a] = b
m = int(eval(input()))
ans = []
for _ in range(m):
a = input().strip()
if a in d:
ans.append(d[a])
else:
... | p00424 |
while True:
dict = {}
n = eval(input())
if n == 0:break
for x in range(n):
a, b = input().split()
dict[a.strip()] = b.strip()
res = ""
for x in range(eval(input())):
a = input().strip()
if a in dict:
res += dict[a]
else:
res += a
print(res) | while True:
dict = {}
n = eval(input())
if n == 0:break
for x in range(n):
a, b = input().split()
dict[a] = b
res = ""
for x in range(eval(input())):
a = input()[0]
if a in dict:
res += dict[a]
else:
res += a
print(res) | p00424 |
"""
Writer: SPD_9X2
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_e
Mの時、 a1<=a2<=a3…aN
を満たす通り数 X[M] が分かれば解ける(全ての順N!は等しいため)
当然、次のMにはa1から順に更新していくことになる(M+?にね)
Dの時
X[M] = (X[M-1] + X[M-2] + … + X[M-D]) * N
が成立かな
X[0] = 1
N=2
X[0]=1
X[1]=2
X[2]=6
N=3
X[0]=1
X[1]=9
X[M]の更新式
→これが間違っ... |
"""
Writer: SPD_9X2
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_e
Mの時、 a1<=a2<=a3…aN
を満たす通り数 X[M] が分かれば解ける(全ての順N!は等しいため)
当然、次のMにはa1から順に更新していくことになる(M+?にね)
Dの時
X[M] = (X[M-1] + X[M-2] + … + X[M-D]) * N
が成立かな
X[0] = 1
N=2
X[0]=1
X[1]=2
X[2]=6
N=3
X[0]=1
X[1]=9
X[M]の更新式
→これが間違っ... | p03009 |
while 1:
N,M = list(map(int,input().split()))
if N == 0: break
T = [[0]*1261 for i in range(N)]
for i in range(eval(input())):
t,n,m,s = list(map(int,input().split()))
for ti in range(t,1261):
T[n-1][ti] = s*m
for i in range(eval(input())):
ts,te,m = list(map(int,input().split()))
print(sum(1 ... | while 1:
N,M = list(map(int,input().split()))
if N == 0: break
T = [[0]*1261 for i in range(N)]
r = eval(input())
tnms = sorted([list(map(int,input().split())) for i in range(r)], key = lambda x:x[1])
for i in range(0,r,2):
t1,n,m,s = tnms[i]
t2,n,m,s = tnms[i+1]
T[n-1][t1:t2] = [m for j in range(t... | p00729 |
while 1:
N,M = list(map(int,input().split()))
if N == 0: break
T = [[0]*1261 for i in range(N)]
r = eval(input())
tnms = sorted([list(map(int,input().split())) for i in range(r)], key = lambda x:x[1])
for i in range(0,r,2):
t1,n,m,s = tnms[i]
t2,n,m,s = tnms[i+1]
T[n-1][t1:t2] = [m for j in range(t... | while 1:
N,M = list(map(int,input().split()))
if N == 0: break
T = [[0]*1261 for i in range(M)]
r = eval(input())
tnms = sorted([list(map(int,input().split())) for i in range(r)], key = lambda x:x[1])
for i in range(0,r,2):
t1,n,m,s = tnms[i]
t2,n,m,s = tnms[i+1]
T[m-1][t1:t2] = [1 for j in range(t... | p00729 |
while 1:
N,M = list(map(int,input().split()))
if N == 0: break
T = [[0]*1261 for i in range(M)]
r = eval(input())
tnms = sorted([list(map(int,input().split())) for i in range(r)], key = lambda x:x[1])
for i in range(0,r,2):
t1,n,m,s = tnms[i]
t2,n,m,s = tnms[i+1]
T[m-1][t1:t2] = [1 for j in range(t... | while 1:
N,M = list(map(int,input().split()))
if N == 0: break
T = [[0]*1261 for i in range(M)]
r = eval(input())
tnms = sorted([list(map(int,input().split())) for i in range(r)], key = lambda x:x[1])
for i in range(0,r,2):
t1,n,m,s = tnms[i]
t2,n,m,s = tnms[i+1]
T[m-1][t1:t2] = [1 for j in range(t... | p00729 |
l = (1260-540+1)
while True:
N,M = list(map(int,input().split(" ")))
if N == 0 and M == 0:
break
T = [[0]*l for _ in range(M)]
r = int(eval(input()))
for i in range(r):
t,n,m,s = list(map(int,input().split(" ")))
if s == 1:
T[m-1][t-540] += 1
else:
T[m-1][t-540] -= 1
T_range = [[] for... | l = (1260-540)+1
while True:
N,M = list(map(int,input().split(" ")))
if N == 0 and M == 0:
break
T = [[0]*l for _ in range(M)]
r = int(eval(input()))
for i in range(r):
t,n,m,s = list(map(int,input().split(" ")))
if s == 1:
T[m-1][t-540] += 1
else:
T[m-1][t-540] -= 1
q = int(eval(inpu... | p00729 |
N,T = list(map(int,input().split()))
order = list(map(int,input().split()))
ov = 0
for i in range(N-1):
if (order[i+1]-order[i])<T:
ov += T-(order[i+1]-order[i])
print((N*T-ov)) | N,T = list(map(int,input().split()))
last, time = 0,-T
for temp in map(int,input().split()):
if temp - last < T:
time += T - (temp - last)
last = temp
print((N*T-time)) | p03731 |
n, t = list(map(int, input().split()))
a = list(map(int, input().split()))
time = 0
for i in range(n-1):
if a[i + 1] - a[i] < t:
time += a[i + 1] - a[i]
elif a[i + 1] - a[i] >= t:
time += t
print((time + t))
| n, t = list(map(int, input().split()))
a = list(map(int, input().split()))
time = 0
for i in range(n - 1):
time += min(t, a[i + 1] - a[i])
print((time + t)) | p03731 |
def solve():
[N, T] = [int(x) for x in input().split()]
ts = [int(x) for x in input().split()]
import collections
stack = collections.deque()
for t in ts:
if not stack:
stack.append((t, t+T))
continue
last = stack.pop()
if last[1] >= t:... | def solve():
[N, T] = [int(x) for x in input().split()]
ts = [int(x) for x in input().split()]
return sum([
min(T, t2-t1) for t2, t1 in zip(ts[1:], ts[:-1])
]) + T
def main():
print((solve()))
if __name__ == '__main__':
main() | p03731 |
n,t = list(map(int, input().split()))
lst = list(map(int, input().split()))
dif = [None for i in range(n-1)]
for i in range(n-1):
dif[i] = lst[i+1]-lst[i]
ans = 0
for i in range(n-1):
ans += min(t,dif[i])
ans += t
print(ans)
| n,t = list(map(int, input().split()))
lst = list(map(int, input().split()))
dif = [None for i in range(n-1)]
ans = 0
for i in range(n-1):
ans += min(t,lst[i+1]-lst[i])
ans += t
print(ans)
| p03731 |
n,t = (int(i) for i in input().split())
ni = [int(i) for i in input().split()]
total = 0
for i in range(1,len(ni)) :
delta = ni[i] - ni[i-1]
if delta < t :
total += delta
else :
total += t
print((total+t)) | def main():
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
s, e = 0, 0
ans = 0
for i in range(N):
if t[i] <= e:
e = t[i] + T
else:
ans += e - s
s = t[i]
e = t[i] + T
ans += e - s
print(an... | p03731 |
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
s, e = 0, 0
ans = 0
for i in range(N):
if t[i] <= e:
e = t[i] + T
else:
ans += e - s
s = t[i]
e = t[i] + T
ans += e - s
print(ans)
| def main() :
n,t = (int(i) for i in input().split())
ni = [int(i) for i in input().split()]
total = 0
for i in range(1,len(ni)) :
delta = ni[i] - ni[i-1]
if delta < t :
total += delta
else :
total += t
print((total+t))
main() | p03731 |
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem C
if __name__ == '__main__':
n, intervel = list(map(int, input().split()))
ts = list(map(int, input().split()))
ts += [ts[-1] + intervel]
total_t = 0
previous_t = ts[0]
for i in range(1, n + 1):
current_t = ts... | # -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem C
if __name__ == '__main__':
n, intervel = list(map(int, input().split()))
ts = list(map(int, input().split()))
ts += [ts[-1] + intervel]
total_t = 0
previous_t = ts[0]
# See:
# https://atcoder.jp/img/arc073/edito... | p03731 |
n,t = list(map(int,input().split()))
a = [int(i) for i in input().split()]
ans = t
for i in range(1,n):
if a[i]-a[i-1] < t:
ans += a[i]-a[i-1]
else:
ans += t
print(ans) | n,t = list(map(int,input().split()))
time = list(map(int,input().split()))
ans = 0
for i in range(n-1):
ans += min(time[i+1]-time[i],t)
print((ans+t)) | p03731 |
n,t=list(map(int,input().split()))
a=list(map(int,input().split()))
a.append(10**10)
cnt=0
for i in range(n):
fir=a[i]
if a[i]+t>a[i+1]:
las=a[i+1]
else:
las=a[i]+t
cnt+=las-fir
print(cnt) | n,t=list(map(int,input().split()))
a=list(map(int,input().split()))
a.append(10**10)
cnt=0
for i in range(n):
if a[i]+t>a[i+1]:
cnt+=a[i+1]-a[i]
else:
cnt+=t
print(cnt) | p03731 |
N, T = [int(i) for i in input().split()]
t = [int(t) for t in input().split()]
total = T
for i in range(N-1):
if t[i+1] - t[i] < T:
total += t[i+1] - t[i]
else:
total += T
print(total)
| import sys
n, T, *t = list(map(int, sys.stdin.read().split()))
def main():
start = 0
will_stop = T
running_time = 0
for i in range(1, n):
cur = t[i]
if cur < will_stop:
running_time += cur - start
else:
running_time += T
start = cur... | p03731 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
s = set()
for x in t:
s |= set(range(x, x+T))
print((len(s)))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
arr = [[]] * len(t)
for i in range(len(t)):
arr[i] = [t[i], t[i]+T]
ans = arr[0][1]
for i in range(len(t)-1):
... | p03731 |
N,T = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 0
for i in range(1,N):
if A[i] > A[i-1]+T:
ans += T
else:
ans += A[i]-A[i-1]
ans += T
print(ans)
| # atcoder : python3 (3.4.3)
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
mod = 10**9+7
# main
N,T = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 0
for i in range(1,N):
if A[i] > A[i-1]+T:
ans += T
else:
ans += A[i]-A[i-1]
ans +... | p03731 |
n, t = list(map(int, input().split()))
T = list(map(int, input().split()))
counter = 0
timer = 0
T_position = 0
for i in range(T[-1] + t):
# print(counter, timer, T_position)
if T[T_position] == i:
timer = t
if T_position != len(T) - 1:
T_position += 1
if timer > 0:
counter += 1
... | n, t = list(map(int, input().split()))
T = list(map(int, input().split()))
counter = 0
for i in range(len(T) - 1):
if T[i+1] - T[i] < t:
counter += T[i+1] - T[i]
else:
counter += t
counter += t
print(counter) | p03731 |
n, T = list(map(int, input().split()))
t = tuple(map(int, input().split()))
ans = T
for i in range(n-1):
if t[i + 1] - t[i] <= T:
ans += t[i + 1] - t[i]
else:
ans += T
print(ans) | n, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = T
for i in range(n-1):
if t[i + 1] - t[i] <= T:
ans += t[i + 1] - t[i]
else:
ans += T
print(ans)
| p03731 |
n,tt=list(map(int,input().split()))
t=list(map(int,input().split()))
x=0
t1=0
for i in range(1,n):
x=x+min(t[i]-t1,tt)
t1=t[i]
print((x+tt)) |
n,t=list(map(int,input().split()))
ti=list(map(int,input().split()))
tsum=0
for i in range(1,n):
tsum=tsum+min(t,ti[i]-ti[i-1])
print((tsum+t))
| p03731 |
N,T = list(map(int, input().split()))
t = list(map(int, input().split()))
x = T
for i in range(1,N):
if t[i]-t[i-1] >= T:
x += T
elif t[i]+T > T:
x += t[i]-t[i-1]
print(x)
| N,T = list(map(int, input().split()))
t = list(map(int, input().split()))
x = T
for i in range(1,N):
if t[i]-t[i-1] >= T:
x += T
else:
x += t[i]-t[i-1]
print(x)
| p03731 |
N, T = list(map(int, input().split()))
TL = [-T] + list(map(int, input().split()))
answer = 0
for i in range(1, N+1):
answer += T
answer -= max(0, TL[i-1] + T - TL[i])
print(answer) | N, T = list(map(int, input().split()))
TL = list(map(int, input().split()))
answer = T
for i in range(N-1):
answer += min(TL[i+1] - TL[i], T)
print(answer) | p03731 |
n,t = list(map(int,input().split()))
a = [int(i) for i in input().split()]
ans = t
for i in range(n-1):
if abs(a[i+1] - a[i]) > t:
ans += t
else:
ans += abs(a[i+1] - a[i])
print(ans) | n,t = list(map(int,input().split()))
a = [int(i) for i in input().split()]
ans = t
for i in range(n-1):
ans += min(abs(a[i+1] - a[i]), t)
print(ans) | p03731 |
N,T=list(map(int,input().split()))
t=list(map(int,input().split()))
a=T
for i in range(N-1):
a+=min(T,t[i+1]-t[i])
print(a) | N,T=list(map(int,input().split()))
t=list(map(int,input().split()))
a=[min(T,t[i+1]-t[i]) for i in range(N-1)]
print((sum(a)+T)) | p03731 |
_,T,*t=list(map(int,open(0).read().split()));print((sum(min(T,j-i)for i,j in zip(t,t[1:]))+T)) | _,T,*t=list(map(int,open(0).read().split()));print((sum(min(T,j-i)for i,j in zip([-T]+t,t)))) | p03731 |
n,T,*t=list(map(int,open(0).read().split()));print((T+sum(min(j-i,T)for i,j in zip(t,t[1:])))) | _,T,b,*t=list(map(int,open(0).read().split()))
a=T
for i in t:a+=min(i-b,T);b=i
print(a) | p03731 |
def main():
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
c = t[-1] + T + 1
a = [0 for _ in range(c)]
for i in t:
a[i] += 1
a[i+T] -= 1
count = 0
for i in range(c):
if(0 < i):
a[i] += a[i - 1]
if(a[i] ... | n, t = list(map(int, input().split()))
T = list(map(int, input().split()))
ans = t
for t1, t2 in zip(T[:-1], T[1:]):
ans += min(t2 - t1, t)
print(ans) | p03731 |
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**9)
n,t=list(map(int,input().split()))
T=list(map(int,input().split()))
ans=t
for i in range(1,n):
ans+=min(T[i]-T[i-1],t)
print(ans) | n,t=list(map(int,input().split()))
T=list(map(int,input().split()))
ans=t
for i in range(1,n):
ans+=min(T[i]-T[i-1],t)
print(ans) | p03731 |
from sys import stdin
def main():
lines = stdin.readlines()
T = int(lines[0].split()[1])
tn = [int(ti) for ti in lines[1].split()]
ans = 0
for t1, t2 in zip(tn[0:], tn[1:]):
ans += min(T, t2 - t1)
ans += T
print(ans)
return
main()
| from sys import stdin
def main():
lines = stdin.readlines()
T = int(lines[0].split()[1])
tn = [int(ti) for ti in lines[1].split()]
print((tn[-1] + T - sum(t2 - t1 - T for t1, t2 in zip(tn[0:], tn[1:]) if t2 - t1 > T)))
return
main()
| p03731 |
n, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = 0
for i in range(n-1):
x = t[i+1]-t[i]
if x < T:
ans += x
else:
ans += T
print((ans+T)) | n, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = 0
for i in range(n-1):
x = t[i+1]-t[i]
ans += min(x, T)
print((ans+T)) | p03731 |
#N,Tの取得
l = list(map(int, input().split()))
N = l[0]
T = l[1]
#秒のリストを取得
tl = list(map(int, input().split()))
sw = 0 #スイッチオンオフの管理
bt = 0 #直前のスイッチを押した時間
gt = 0 #秒数総和
for i, t in enumerate(tl):
if sw == 1 and t - bt > T:
sw = 0 #全快スイッチを押してからT秒経過していたら、スイッチオフ
if sw == 0:
gt += T #スイッ... | #N,Tの取得
l = list(map(int, input().split()))
N = l[0]
T = l[1]
#秒のリストを取得
tl = list(map(int, input().split()))
bt = 0 #直前のスイッチを押した時間
gt = T #秒数総和
for t in tl[1:]:
if t - bt > T:
gt += T #スイッチオフの時はT秒追加
else:
gt += t - bt #スイッチがオンのとき、前回からの経過時間を加算
bt = t
print((str(g... | p03731 |
#N,Tの取得
l = list(map(int, input().split()))
N = l[0]
T = l[1]
#秒のリストを取得
tl = list(map(int, input().split()))
bt = 0 #直前のスイッチを押した時間
gt = T #秒数総和
for t in tl[1:]:
if t - bt > T:
gt += T #スイッチオフの時はT秒追加
else:
gt += t - bt #スイッチがオンのとき、前回からの経過時間を加算
bt = t
print((str(g... | #N,Tの取得
N,T = list(map(int, input().split()))
#秒のリストを取得
tl = list(map(int, input().split()))
bt = 0 #直前のスイッチを押した時間
gt = T #秒数総和
for t in tl[1:]:
if t - bt > T:
gt += T #スイッチオフの時はT秒追加
else:
gt += t - bt #スイッチがオンのとき、前回からの経過時間を加算
bt = t
print((str(gt))) | p03731 |
n, T= list(map(int, input().split()))
t = list(map(int, input().split()))
total = T
for i in range(1, n):
if t[i]-t[i-1]>=T:
total += T
else:
total += t[i]-t[i-1]
print(total) | n, T= list(map(int, input().split()))
t = list(map(int, input().split()))
total = T
for i in range(1, n):
total += min(T, t[i]-t[i-1])
print(total) | p03731 |
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]
def solve():
n, t = LI()
T = LI()
sentou = [0 for _ in range(T[-1] + t + 1)]
i = 0
while i < len(... | def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]
def solve():
n, t = LI()
T = LI()
ans = 0
for i in range(len(T) - 1):
ans += min(t, T[i + 1] ... | p03731 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.