input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from itertools import product
INF = 1 << 20
while True:
n, m = list(map(int, input().split()))
if n | m == 0:
break
C = [[INF] * (m + 1) for _ in range(m + 1)]
T = [[INF] * (m + 1) for _ in range(m + 1)]
for _ in range(n):
a, b, c, t = list(map(int, input().split()))
... | INF = 1 << 20
while True:
n, m = list(map(int, input().split()))
if n | m == 0:
break
C = [[INF] * (m + 1) for _ in range(m + 1)]
T = [[INF] * (m + 1) for _ in range(m + 1)]
for _ in range(n):
a, b, c, t = list(map(int, input().split()))
C[a][b] = C[b][a] = c
... | p00200 |
import heapq
INF = 1 << 20
N, M = 3001, 101
def dijkstra(s, G):
visited = [False] * (M + 1)
visited[0] = True
d = [-1] * (M + 1)
pq = [(0,s)]
while not all(visited):
cost, cur = heapq.heappop(pq)
if visited[cur]:
continue
visited[cur] = True
... | import heapq
INF = 1 << 20
N, M = 3001, 101
def dijkstra(s, t, G):
visited = [False] * (M + 1)
visited[0] = True
pq = [(0,s)]
while True:
cost, cur = heapq.heappop(pq)
if visited[cur]:
continue
if cur == t:
return cost
visited[cur] =... | p00200 |
import heapq
INF = 1 << 20
N, M = 3001, 101
def dijkstra(s, t, G):
visited = [False] * (M + 1)
visited[0] = True
pq = [(0,s)]
while True:
cost, cur = heapq.heappop(pq)
if visited[cur]:
continue
if cur == t:
return cost
visited[cur] =... | import heapq
INF = 1 << 20
N, M = 3001, 101
def dijkstra(s, t, G):
visited = [False] * (M + 1)
visited[0] = True
pq = [(0,s)]
while True:
cost, cur = heapq.heappop(pq)
if visited[cur]:
continue
if cur == t:
return cost
visited[cur] =... | p00200 |
import sys
def dijkstra(m, start, goal, matrix):
defnode = {}
cost = [sys.maxsize for i in range(m+1)]
cost[start] = 0
node = start
while True:
defnode[node] = True
for i in range(1, m+1):
if i in defnode:
continue
if matrix[node][i] == sys.maxsize:
continue
... | import sys
def dijkstra(m, start, goal, matrix):
defnode = {}
cost = [sys.maxsize] * (m+1)
cost[start] = 0
node = start
while True:
defnode[node] = True
for i in range(1, m+1):
if i in defnode:
continue
if matrix[node][i] == sys.maxsize:
continue
cost[i... | p00200 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0200
"""
import sys
from sys import stdin
input = stdin.readline
def warshallFloyd(V, dp):
for k in range(1, V):
for i in range(1, V):
for j in range(1, V):
if dp[i][k][0] + dp[k... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0200
"""
import sys
from sys import stdin
input = stdin.readline
def warshallFloyd(V, dp):
for k in range(1, V):
for i in range(1, V):
for j in range(1, V):
if dp[i][k] + dp[k][j... | p00200 |
import sys
import heapq as h
inf = sys.maxsize
# おまじない
class heapq:
def __init__(self):
self.q = []
def push(self,v):
h.heappush(self.q, v)
def pop(self):
return h.heappop(self.q)
def is_empty(self):
return len(self.q) == 0
# 入力:graphと始点s
# 出... | inf = 0x10101010
def solve(A,strt):
cost = [inf]*m
visited = [False]*m
cost[strt] = 0
while 1:
min = inf
next = -1
visited[strt] = True
for i in range(m):
if visited[i]: continue
if A[strt][i]:
d = cost[strt] + A[strt][i... | p00200 |
def main():
N, Q = [int(v) for v in input().split()]
Query = [[int(v)-1 for v in input().split()] for _ in range(Q)]
rows = [N-1] * (N - 1)
cols = [N-1] * (N - 1)
black = (N - 2) * (N - 2)
min_row = N - 1
min_col = N - 1
for ty, x in Query:
if ty == 0:
... | def main():
N, Q = [int(v) for v in input().split()]
Query = [[int(v)-1 for v in input().split()] for _ in range(Q)]
rows = [N-1] * (N - 1)
cols = [N-1] * (N - 1)
black = (N - 2) * (N - 2)
min_row = N - 1
min_col = N - 1
for ty, x in Query:
if ty == 0:
... | p02551 |
n,q=list(map(int,input().split()))
nowbl=(n-2)**2
mu=[n-1]*n
mh= [n-1]*n
nowu=n-1 ; nowh=n-1
for i in range(q):
a,b=list(map(int,input().split()))
a-=1;b-=1
if a==0:
if mu[b]==1:
continue
nowbl-= mu[b]-1
mu[b]=0
if nowu< b:
continue
... | n,q=list(map(int,input().split()))
x= n-2
y= n-2
dx={}
dy={}
for _ in range(q):
a,b=list(map(int,input().split()))
b-=1
if a==1:
if y< b:
dy[b]=0;continue
# y= b-1
for i in range(b+1,y+1):
dy[i] = x
y=b-1
if a==2:
if x <... | p02551 |
from math import inf, log2
class SegmentTree:
def __init__(self, array, func=max):
self.n = len(array)
self.size = 2**(int(log2(self.n-1))+1) if self.n != 1 else 1
self.func = func
self.default = 0 if self.func != min else inf
self.data = [self.default] * (2 * self... | from math import inf, log2
class SegmentTree:
def __init__(self, array, func=max):
self.n = len(array)
self.size = 2**(int(log2(self.n-1))+1) if self.n != 1 else 1
self.func = func
self.default = 0 if self.func != min else inf
self.data = [self.default] * (2 * self... | p02551 |
from bisect import bisect_left as bl
N, Q = list(map(int, input().split()))
ans = 0
q1 = []
q2 = []
query = []
for _ in range(Q):
n, p = list(map(int, input().split()))
query.append((n, p))
if n == 1:
q1.append(p)
else:
q2.append(p)
q1.sort()
q2.sort()
board = [N - 2, N ... | from bisect import bisect_left as bl
N, Q = list(map(int, input().split()))
ans = 0
q1 = []
q2 = []
query = []
for _ in range(Q):
n, p = list(map(int, input().split()))
query.append((n, p))
if n == 1:
q1.append(p)
else:
q2.append(p)
q1.sort()
q2.sort()
board = [N - 2, N ... | p02551 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, Q = mapint()
verti = [N-2]*(N-1)
horiz = [N-2]*(N-1)
left, top = N-2, N-2
ans = (N-2)**2
for _ in range(Q):
c, x = mapint()
x -= 1
if c==1:
... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, Q = mapint()
verti = [N-2]*(N-1)
horiz = [N-2]*(N-1)
left, top = N-2, N-2
ans = (N-2)**2
last_top = (N-2, N-2)
last_left = (N-2, N-2)
for _ in range(Q):
c,... | p02551 |
class SegmentTreeDual():
def __init__(self, arr, op=lambda x, y: y if y != -1 else x, ie=-1):
self.h = (len(arr) - 1).bit_length()
self.n = 2**self.h
self.ie = ie
self.op = op
self.val = [ie for _ in range(self.n)]
self.laz = [ie for _ in range(2 * self.n)]
... | class SegmentTreeDual():
def __init__(self, n, op, id, commutative=False):
self.n = n
self.op = op
self.id = id
self.commutative = commutative
self.log = (n - 1).bit_length()
self.size = 1 << self.log
self.d = [id] * self.size
self.lz = [id] *... | p02551 |
class SegmentTreeDual():
def __init__(self, n, op, id, commutative=False):
self.n = n
self.op = op
self.id = id
self.commutative = commutative
self.log = (n - 1).bit_length()
self.size = 1 << self.log
self.d = [id] * self.size
self.lz = [id] *... | class SegmentTreeDual():
def __init__(self, n, op, id, commutative=False):
self.n = n
self.op = op
self.id = id
self.commutative = commutative
self.log = (n - 1).bit_length()
self.size = 1 << self.log
self.d = [id] * self.size
self.lz = [id] *... | p02551 |
# coding:UTF-8
import sys
from math import factorial
MOD = 10 ** 9 + 7
INF = 10000000000
def main():
# ------ 入力 ------#
N, Q = list(map(int, input().split())) # スペース区切り連続数字
queList = [list(map(int, input().split())) for _ in range(Q)] # スペース区切り連続数字(行列)
# ------ 処理 ------#
... | # coding:UTF-8
import sys
from math import factorial
MOD = 10 ** 9 + 7
INF = 10000000000
# 二分探査
def binary_search(list, item):
# 1:以上 2:以下
mode = 2
low = 0
high = len(list) - 1
upper = len(list) - 1
lower = 0
while low <= high:
mid = (low + high) // 2
gues... | p02551 |
n, q = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(q)]
ans = (n - 2)** 2
cnt, wh = [n - 2, n - 2], [[None] * (n - 2), [None] * (n - 2)]
for num, x in query:
num, x = num - 1, x - 2
if cnt[num] > x:
for i in range(x, cnt[num]):
wh[num][i] ... | n, q = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(q)]
ans = (n - 2)** 2
cnt, wh = [n - 2, n - 2], [[None] * (n - 2), [None] * (n - 2)]
for num, x in query:
num, x = num - 1, x - 2
if cnt[num] > x:
wh[num][x:cnt[num]] = [cnt[1 - num]] * (cnt[num] - x)... | p02551 |
N,Q = list(map(int, input().split()))
answer = (N-2)**2
q1 = [(N,N-2)]
q2 = [(N,N-2)]
def binary_search(q,n):
left = 0
right = len(q)-1
while right-left>0:
index = (left+right)//2
if q[index][0] < n:
left = index+1
else:
right = index
return left
for _ in range(Q):
... | N,Q = list(map(int, input().split()))
answer = (N-2)**2
q1 = [(N,N-2)]
q2 = [(N,N-2)]
def binary_search(q,n):
left = 0
right = len(q) - 1
while right > left:
index = (left + right) // 2
if q[index+1][0] > n:
left = index + 1
else:
right = index
return left
for _ in ra... | p02551 |
class BinaryIndexedTree: # 0-index !!!
"""
init(n): 要素数nを与えて0で初期化
add(i, x): i番目の値にxを追加 O(logN)
sum(i): 区間[0,i)の和を返す O(logN)
query(l, r): 区間[l,r)の和を返す O(logN)
"""
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1) # 内部的には1-indexで扱う
d... | n, q = (int(x) for x in input().split())
queries = [tuple(int(x) for x in input().split()) for _ in range(q)]
ans = (n - 2)**2
t1 = [n] * (n + 1)
t2 = [n] * (n + 1)
h, w = n, n
for t, x in queries:
if t == 1:
if x < w:
tmp = h
for i in range(x, w+1):
t1[i] ... | p02551 |
n, q = list(map(int, input().split()))
query = []
for _ in range(q):
t, x = list(map(int, input().split()))
query.append((t-1, x))
black = (n-2)**2
rc = [[n, n] for _ in range(n)]
mrc = [n, n]
for t, x in query:
black -= rc[x][t]-2
if x < mrc[t]:
mrc[t] = x
for i in range(rc[... | from collections import deque
n, q = list(map(int, input().split()))
query = []
for _ in range(q):
t, x = list(map(int, input().split()))
query.append((t-1, x))
black = (n-2)**2
rc = [deque([(n, n)]), deque([(n, n)])]
mrc = [n, n]
def bisect(li, x):
ok = -1
ng = len(li)
while abs(ok-ng... | p02551 |
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
... | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
... | p02551 |
N, Q = list(map(int, input().split()))
row = [N - 2] * (N + 2)
col = [N - 2] * (N + 2)
ans = (N - 2)**2
miCol = N
miRow = N
for _ in range(Q):
q, x = list(map(int, input().split()))
if q == 1:
ans -= row[x]
for i in range(miCol + 1):
col[i] = min(col[i], x - 2)
... | N, Q = list(map(int, input().split()))
row = [N - 2] * (N + 2)
col = [N - 2] * (N + 2)
ans = (N - 2)**2
miRow = N
miCol = N
for _ in range(Q):
q, x = list(map(int, input().split()))
if q == 1:
for i in range(x, miRow + 1):
row[i] = min(row[i], miCol - 2)
miRow = mi... | p02551 |
class LazySegmentTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(l, r, x): 区間[l, r)をxに更新 O(logN)
query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
"""
def __init__(self, init_val, segfunc, ide_ele):
"""
init_val: 配列の初期値
segfunc: 区間にしたい操作
ide_ele... | class LazySegmentTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.data = [ide_ele] * 2 * self.num
self.lazy = [None] * 2 * self.num
for i... | p02551 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | import sys
input = sys.stdin.readline
N,Q = list(map(int,input().split()))
class RUQ:
def __init__(self, N, default = None):
self.N0 = 2**(N-1).bit_length()
self.data = [(-1,N-1)]*(2*self.N0)
self.INF = (-1, default)
# 区間[l, r+1)の値をvに書き換える
# vは(t, value)という値にする (新しい値ほどtは大きくなる)
def upda... | p02551 |
import bisect
N,Q = list(map(int, input().split()))
L = [0]*Q
L1 = []
L2 = []
for i in range(Q):
a,b = list(map(int, input().split()))
L[i] = (a, b)
if a == 1:
L1.append(b)
else:
L2.append(b)
L1.sort()
L2.sort()
ans = (N-2)**2
up = N
left = N
for l in L:
a = l[0... | import bisect
N,Q = list(map(int, input().split()))
L = [0]*Q
L1 = []
L2 = []
for i in range(Q):
a,b = list(map(int, input().split()))
L[i] = (a, b)
if a == 1:
L1.append(b)
else:
L2.append(b)
L1.sort()
L2.sort()
M1 = len(L1)
M2 = len(L2)
ans = (N-2)**2
up = N
left = N... | p02551 |
#editorial
n,q=list(map(int,input().split()))
*qu,=[tuple(map(int, input().split())) for _ in range(q)]
w=n-2;h=n-2
wwh=[n-2]*(n-2)
hhw=[n-2]*(n-2)
b=0
for t,x in qu:
if t==1:
x-=2
b+=wwh[x]
if x<w:
for i in range(h):
hhw[i]=x
w=x
... | #editorial
n,q=list(map(int,input().split()))
*qu,=[tuple(map(int, input().split())) for _ in range(q)]
w=n-2;h=n-2
wwh=[n-2]*(n-2)
hhw=[n-2]*(n-2)
b=0
for t,x in qu:
x-=2
if t==1:
if x<w:
b+=h
for i in range(x,w):
wwh[i]=h
w=x
... | p02551 |
import sys
input = sys.stdin.buffer.readline
n, q = list(map(int, input().split()))
class SegmentTree:
ele = 10 ** 10
func = min
# SEG木は1-index
# Aに関しては0-index
def __init__(self, n): # Aは0-idx
self.n = n
self.num = 2 ** ((self.n - 1).bit_length())
self.S... | # Modified from https://atcoder.jp/contests/abc179/submissions/16893796
import sys
input = sys.stdin.buffer.readline
n, q = list(map(int, input().split()))
class SegmentTree:
ele = 10 ** 10
func = min
# SEG木は1-index
# Aに関しては0-index
def __init__(self, n): # Aは0-idx
self... | p02551 |
import sys
class SegmentTree():
"""
update, get を提供するSegmentTree
Attributes
----------
__n : int
葉の数。2 ^ i - 1
__dot :
Segment function
__e: int
単位元
__node: list
Segment Tree
"""
def __init__(self, A, dot, e):
"""
... | import sys
class SegmentTree():
"""
update, get を提供するSegmentTree
Attributes
----------
__n : int
葉の数。2 ^ i - 1
__dot :
Segment function
__e: int
単位元
__node: list
Segment Tree
"""
def __init__(self, A, dot, e):
"""
... | p02551 |
N, Q = list(map(int, input().split()))
rcx = [tuple(map(int, input().split())) for _ in range(Q)]
thres_1, thres_2 = N, N
nearest_white_1 = [N] * N
nearest_white_2 = [N] * N
reverse_count = 0
for rc, x in rcx:
if rc == 1:
if x < thres_1:
reverse_count += thres_2 - 2
for... | N, Q = list(map(int, input().split()))
rcx = [tuple(map(int, input().split())) for _ in range(Q)]
thres_1, thres_2 = N-2, N-2
nearest_white_1 = [0] * (N-2)
nearest_white_2 = [0] * (N-2)
reverse_count = 0
for rc, x in rcx:
x = x-2
if rc == 1:
if x < thres_1:
for i in range(x+1, ... | p02551 |
f=lambda:list(map(int,input().split()))
N,Q=f()
a,b=N,N
black=(N-2)*(N-2)
B=[-1]*(N+1)
W=[-1]*(N+1)
for _ in range(Q):
q,x=f()
if q==1:
if B[x]>0:
black-=B[x]
B[x]=0
else:
black-=b-2
a=x
for j in range(a+1,N+1):
... | f=lambda:list(map(int,input().split()))
N,Q=f()
a,b=N,N
black=(N-2)*(N-2)
B=[-1]*(N+1)
W=[-1]*(N+1)
for _ in range(Q):
q,x=f()
if q==1:
if B[x]>0:
black-=B[x]
B[x]=0
else:
black-=b-2
a=x
for j in range(a+1,N+1):
... | p02551 |
class LazyPropSegmentTree:
def __init__(self, a):
self.padding = float('inf')
self.n = len(a)
self.N = 1 << (self.n-1).bit_length()
self.seg_data = [self.padding]*(self.N-1) + a + [self.padding]*(self.N-self.n)
self.lazy = [None] * (2*self.N - 1)
for i ... | class LazyPropSegmentTree:
def __init__(self, a):
self.padding = float('inf')
self.n = len(a)
self.N = 1 << (self.n-1).bit_length()
self.seg_data = [self.padding]*(self.N-1) + a + [self.padding]*(self.N-self.n)
self.lazy = [self.padding] * (2*self.N - 1)
... | p02551 |
N, Q = list(map(int, input().split()))
q = [0] * Q
for i in range(Q):
q[i] = list(map(int, input().split()))
ans = (N - 2) ** 2
b1 = [N-2] * (N-2)
b2 = [N-2] * (N-2)
for i in range(Q):
x = q[i][1] - 2
if q[i][0] == 1:
ans -= b1[x]
for j in range(b1[x]):
b2[j] = ... | N, Q = list(map(int, input().split()))
q = [0] * Q
for i in range(Q):
q[i] = list(map(int, input().split()))
ans = (N - 2) ** 2
b1 = [0] * (N-2)
b2 = [0] * (N-2)
l = N-2
u = N-2
for i in range(Q):
x = q[i][1] - 2
if q[i][0] == 1:
if x < l:
ans -= u
for j i... | p02551 |
from collections import deque
import sys
N,M=list(map(int,input().split()))
table=[[] for i in range(N)]
ans=[]
for i in range(M):
a,b,c=list(map(int,input().split()))
table[a-1].append((b-1,c))
table[b-1].append((a-1,c))
ans.append((a-1,b-1,c))
h=deque()
inf=-10**13
h.append(0)
flag=True
... | import sys
from collections import deque
N,M=list(map(int,input().split()))
table=[[] for i in range(N)]
for i in range(M):
u,v,s=list(map(int,input().split()))
table[u-1].append((v-1,s))
table[v-1].append((u-1,s))
L=[0]*N
T=[1]*N#checker
visit=[False]*N
h=deque()
h.append([0,1])
visit[0]=True
... | p03306 |
n,m=list(map(int,input().split()))
edge=[[] for i in range(n)]
for i in range(m):
u,v,s=list(map(int,input().split()))
edge[u-1].append((v-1,s))
edge[v-1].append((u-1,s))
ans=[1 for i in range(n)]
pm=[True]*n
used=[False]*n
used[0]=True
que=[0]
while que:
u=que.pop()
for v,s in ed... | import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
edge=[[] for i in range(n)]
for i in range(m):
u,v,s=list(map(int,input().split()))
edge[u-1].append((v-1,s))
edge[v-1].append((u-1,s))
ans=[1 for i in range(n)]
pm=[True]*n
used=[False]*n
used[0]=True
que=[0]
whil... | p03306 |
from collections import deque
import sys
input = sys.stdin.readline
def is_bipartite(graph):
"""二部グラフ判定する"""
n = len(graph)
col = [-1] * n
q = deque([0])
col[0] = 0
while q:
v = q.pop()
for nxt_v, _ in graph[v]:
if col[nxt_v] == -1:
co... | from collections import deque
import sys
input = sys.stdin.readline
def is_bipartite(graph):
"""二部グラフ判定する"""
n = len(graph)
col = [-1] * n
q = deque([0])
col[0] = 0
while q:
v = q.pop()
for nxt_v, _ in graph[v]:
if col[nxt_v] == -1:
co... | p03306 |
MOD = 10**9 + 7
n, oddness = [int(item) for item in input().split()]
# Oddness must be even
if oddness % 2 == 1:
print((0))
exit()
oddness //= 2
max_oddness = 1300 + n
max_pending = n + 1
dp = [[[0] * (max_oddness) for _ in range(max_pending)] for _ in range(n)]
dp[0][0][0] = 1
dp[0][1][1] = 1
fo... | MOD = 10**9 + 7
n, oddness = [int(item) for item in input().split()]
# Oddness must be even
if oddness % 2 == 1:
print((0))
exit()
oddness //= 2
max_oddness = 1300 + n
max_pending = n//2 + 2
dp = [[[0] * (max_oddness) for _ in range(max_pending)] for _ in range(n)]
dp[0][0][0] = 1
dp[0][1][1] = 1
... | p02974 |
MOD = 10**9 + 7
n, oddness = [int(item) for item in input().split()]
# Oddness must be even
if oddness % 2 == 1:
print((0))
exit()
oddness //= 2
max_oddness = 1250 + n
max_pending = n//2 + 2
dp = [[[0] * (max_oddness) for _ in range(max_pending)] for _ in range(n)]
dp[0][0][0] = 1
dp[0][1][1] = 1
... | MOD = 10**9 + 7
n, oddness = [int(item) for item in input().split()]
# Oddness must be even
if oddness % 2 == 1:
print((0))
exit()
oddness //= 2
max_oddness = 1250 + n
max_pending = n//2 + 2
dp = [[[0] * (max_oddness) for _ in range(max_pending)] for _ in range(n)]
dp[0][0][0] = 1
dp[0][1][1] = 1
... | p02974 |
import sys
MOD = 10**9 + 7
N, K = list(map(int, input().split()))
maxS = N*N//2
if K > maxS or K%2:
print((0))
sys.exit()
dp = [[0]*(maxS+1) for j in range(N+1)]
dp[0][0] = 1
for i in range(1, N+1):
dp2 = [[0]*(maxS+1) for j in range(N+1)]
for j in range(i+1):
for s in range(... | anss = [1, 1, 1, 1, 2, 3, 1, 3, 7, 9, 4, 1, 4, 12, 24, 35, 24, 20, 1, 5, 18, 46, 93, 137, 148, 136, 100, 36, 1, 6, 25, 76, 187, 366, 591, 744, 884, 832, 716, 360, 252, 1, 7, 33, 115, 327, 765, 1523, 2553, 3696, 4852, 5708, 5892, 5452, 4212, 2844, 1764, 576, 1, 8, 42, 164, 524, 1400, 3226, 6436, 11323, 17640, 25472, 332... | p02974 |
n, k = list(map(int, input().split()))
md = 10 ** 9 + 7
if k % 2:
print((0))
exit()
k //= 2
dp = [[[0] * (n ** 2) for _ in range(n + 2)] for __ in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
dpi1 = dp[i - 1]
for j in range(i + 1):
for s in range(j, k + 1):
# 片... | def f(n,k):
md = 10 ** 9 + 7
if k % 2:
print((0))
exit()
k //= 2
dp = [[[0] * (n ** 2) for _ in range(n + 2)] for __ in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
dpi1 = dp[i - 1]
for j in range(i + 1):
for s in range(j, k + 1):... | p02974 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,K=list(map(int,input().split()))
dp=[[[0]*2700 for _ in range(55)] for _ in range(55)]
dp[0][0][0]=1
for i in range(n):
for j in range(i+1):
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,K=list(map(int,input().split()))
dp=[[[0]*2700 for _ in range(55)] for _ in range(55)]
dp[0][0][0]=1
for i in range(n):
for j in range(i+1):
... | p02974 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string
INF = float('inf')
def LI(): return list(map(int, s... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string
INF = float('inf')
def LI(): return list(map(int, s... | p02974 |
n, k = list(map(int, input().split()))
MOD =10**9+7
memo = [[{} for j in range(n+1)] for i in range(n+1)]
def fdp(cur_N, remain, min_k, MOD=10**9+7):
if cur_N <= 1:
if remain == 0 and min_k == 0:
return 1
if remain == 1 and min_k == 2:
return 1
else:
... | n, k = list(map(int, input().split()))
MOD =10**9+7
memo = [[{} for j in range(n+1)] for i in range(n+1)]
def fdp(cur_N, remain, min_k, MOD=10**9+7):
if cur_N <= 1:
if remain == 0 and min_k == 0:
return 1
if remain == 1 and min_k == 2:
return 1
else:
... | p02974 |
n, k = list(map(int, input().split()))
dp = {}
dp[(0, 0, 0)] = 1
def perm(i, j, k):
if (i, j, k) in dp:
return dp[(i, j, k)]
if i == 0 and (j is not 0 or k is not 0):
return 0
if i < 0 or j < 0 or k < 0 or i < j:
return 0
dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\
... | n, k = list(map(int, input().split()))
dp = {}
dp[(0, 0, 0)] = 1
def perm(i, j, k):
if (i, j, k) in dp:
return dp[(i, j, k)]
if i < 0 or j < 0 or k < 0 or i < j:
return 0
dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\
+ (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\
... | p02974 |
import sys
f=0
for s in sys.stdin:
f=1-f
b=list(map(int,s.split()))
if f:
a=b
continue
c1=0
c2=0
for i,e in enumerate(b):
if e==a[i]: c1+=1
elif e in a: c2+=1
print(c1, c2) | import sys
f=1
for s in sys.stdin:
b=list(map(int,s.split()))
if f:
a=b
f=0
continue
c1=0
c2=0
for i,e in enumerate(b):
if e==a[i]: c1+=1
elif e in a: c2+=1
print(c1, c2)
f=1 | p00025 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import defaultdict
"""
・trie木
・各ノードから、アルファベットごとの子ノードの番号
・親ノードの番号
"""
N = int(readline())
data = tuple(read().split())
S = data[:N]
Q = data[N]
it = iter(data[N+1:])
q... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import defaultdict
"""
・trie木
・各ノードから、アルファベットごとの子ノードの番号
・親ノードの番号
"""
N = int(readline())
data = tuple(read().split())
S = data[:N]
Q = int(data[N])
query_target = list... | p03974 |
# -*- coding: utf-8 -*-
"""
Created on Sat Jun 1 20:46:31 2019
@author: Yamazaki Kenichi
"""
import time
N, A, B, C = list(map(int,input().split()))
mod = 10**9+7
tnow = time.time()
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r]... | # -*- coding: utf-8 -*-
"""
Created on Sun Jun 2 15:02:08 2019
@author: Yamazaki Kenichi
"""
N, A, B, C = list(map(int,input().split()))
mod = 10**9+7
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 =... | p03025 |
n, a, b, c = list(map(int, input().split()))
mod = 10 ** 9 + 7
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
return [w[0],w[1]]
def mod_inv(a,m):
x = extg... | n, a, b, c = list(map(int, input().split()))
mod = 10 ** 9 + 7
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
return [w[0],w[1]]
def mod_inv(a,m):
x = extg... | p03025 |
n, a, b, c = list(map(int, input().split()))
mod = 10 ** 9 + 7
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
return [w[0],w[1]]
def mod_inv(a,m):
x = extg... | n, a, b, c = list(map(int, input().split()))
mod = 10 ** 9 + 7
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
return [w[0],w[1]]
def mod_inv(a,m):
x = extg... | p03025 |
M=10**9+7
N,A,B,C=list(map(int,input().split()))
f=[1]
for i in range(1,2*N):
f.append(f[-1]*i%M)
t=pow(A+B,M-2,M)
A*=t
B*=t
a=pow(A,N,M)
b=pow(B,N,M)
z=0
for i in range(N):
z+=(N+i)*100*pow(100-C,M-2,M)*f[N+i-1]*pow(f[N-1]*f[i],M-2,M)*(a+b)
z%=M
a=a*B%M
b=b*A%M
print(z)
| M=10**9+7
N,A,B,C=list(map(int,input().split()))
f=[1]
for i in range(1,2*N):
f.append(f[-1]*i%M)
t=pow(A+B,M-2,M)
A*=t
B*=t
a=pow(A,N,M)
b=pow(B,N,M)
z=0
for i in range(N):
z+=(N+i)*100*t*f[N+i-1]*pow(f[N-1]*f[i],M-2,M)*(a+b)
z%=M
a=a*B%M
b=b*A%M
print(z)
| p03025 |
M=10**9+7
N,A,B,C=list(map(int,input().split()))
f=[1]
for i in range(1,2*N):
f.append(f[-1]*i%M)
t=pow(A+B,M-2,M)
A*=t
B*=t
a=pow(A,N,M)
b=pow(B,N,M)
z=0
for i in range(N):
z+=(N+i)*100*t*f[N+i-1]*pow(f[N-1]*f[i],M-2,M)*(a+b)
z%=M
a=a*B%M
b=b*A%M
print(z)
| M=10**9+7
N,A,B,C=list(map(int,input().split()))
f=[1]
for i in range(1,2*N):
f.append(f[-1]*i%M)
t=pow(A+B,M-2,M)
A*=t
B*=t
a=pow(A,N,M)
b=pow(B,N,M)
z=0
for i in range(N):
z+=100*t*f[N+i]*pow(f[N-1]*f[i],M-2,M)*(a+b)
z%=M
a=a*B%M
b=b*A%M
print(z)
| p03025 |
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.std... | import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.std... | p03025 |
import os
import sys
sys.setrecursionlimit(2147483647)
INF = float('inf')
if os.getenv('LOCAL'):
sys.stdin = open('_in.txt')
def mod_inv(a):
"""
a の逆元
:param int a:
:return:
"""
return pow(a, MOD - 2, MOD)
# https://atcoder.jp/contests/abc066/submissions/5721975
def... | import itertools
import os
import sys
sys.setrecursionlimit(2147483647)
INF = float('inf')
if os.getenv('LOCAL'):
sys.stdin = open('_in.txt')
def mod_inv(a):
"""
a の逆元
:param int a:
:return:
"""
return pow(a, MOD - 2, MOD)
# https://atcoder.jp/contests/abc066/submis... | p03025 |
import math
N, A, B, C = list(map(int,input().split()))
mod = 10**9+7
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
g1 = [1, 1]
g2 = [1, 1]
inv = [0, 1]
for i in range(2, 2*10**5+1):
g1.append((g1[-1] * i) % mod)
in... | import math
N, A, B, C = list(map(int,input().split()))
mod = 10**9+7
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
g1 = [1, 1]
g2 = [1, 1]
inv = [0, 1]
for i in range(2, 2*10**5+1):
g1.append((g1[-1] * i) % mod)
in... | p03025 |
N, A, B, C = list(map(int, input().split()))
MOD = 10**9 + 7
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x) if isinstance(... | # 入力
N, A, B, C = list(map(int, input().split()))
MOD = 10**9 + 7
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x) if isins... | p03025 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | p03025 |
#!/usr/bin/env python
import sys
class bigint:
primeset = set()
def __init__(self,n,mod):
if not mod in bigint.primeset:
assert mod**2 < sys.maxsize, "modulo is too large"
bigint.primeset.add(mod)
#
self.n = n % mod
self.mod = mod
re... | #!/usr/bin/env python
import sys
MOD=10**9 + 7
def Add(n,m):
return (n+m)%MOD
def Sub(n,m):
return (n-m)%MOD
def Mul(n,m):
return (n*m)%MOD
def Pow(n,p):
if p<0: return Pow(n, ( p % ( MOD-1 ) ) )
elif p==0: return 1
elif p==1: return n
elif p%2==0:
tmp= Pow... | p03025 |
#!/usr/bin/env python
import sys
MOD=10**9 + 7
def Add(n,m):
return (n+m)%MOD
def Sub(n,m):
return (n-m)%MOD
def Mul(n,m):
return (n*m)%MOD
def Pow(n,p):
if p<0: return Pow(n, ( p % ( MOD-1 ) ) )
elif p==0: return 1
elif p==1: return n
elif p%2==0:
tmp= Pow... | #!/usr/bin/env python
import sys
MOD=10**9 + 7
def Add(n,m):
return (n+m)%MOD
def Sub(n,m):
return (n-m)%MOD
def Mul(n,m):
return (n*m)%MOD
def Pow(n,p):
if p<0: return Pow(n, ( p % ( MOD-1 ) ) )
elif p==0: return 1
elif p==1: return n
elif p%2==0:
tmp= Pow... | p03025 |
N,A,B,C=list(map(int,input().split()))
mod=10**9+7
#factorial,facotiralの逆数を事前計算.
#N=10**5あたりまで有効
FACT=[1,1]
FACT_INV=[1,1]
for i in range(2,2*10**5+1):
FACT.append(FACT[-1]*i%mod)
FACT_INV.append(FACT_INV[-1]*pow(i,mod-2,mod)%mod)
def Combi(N,K):
return FACT[N]*FACT_INV[N-K]*FACT_INV[K]%... | N,A,B,C=list(map(int,input().split()))
mod=10**9+7
#factorial,facotiralの逆数を事前計算.
#N=10**5あたりまで有効
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)]
for i in range(2*10**5,0,-1):
FACT_INV.append(FACT_INV[-1]*i%mod)
FACT_INV=FACT_INV[::-1]
... | p03025 |
from itertools import*
import math
from collections import*
from heapq import*
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf = float("inf")
mod = 10**9+7
from functools import reduce
import sys
sys.setrecursionlimit(10**7)
k,A,B,C = list(map(int,input().split()))
Max = max(2*k+... | from itertools import*
import math
from collections import*
from heapq import*
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf = float("inf")
mod = 10**9+7
from functools import reduce
import sys
sys.setrecursionlimit(10**7)
k,A,B,C = list(map(int,input().split()))
Max = max(2*k+... | p03025 |
div=10**9+7
def modinv(a, m=div):
b = m
u = 1
v = 0
while b:
t = a//b
a -= t*b
a = a^b
b = a^b
a = a^b
u -= t*v
u = u^v
v = u^v
u = u^v
u %= m
if u < 0: u += m
return u
N,A,B,C=list(map(int,input().... | div=10**9+7
def modinv(a, m=div):
b = m
u = 1
v = 0
while b:
t = a//b
a -= t*b
a = a^b
b = a^b
a = a^b
u -= t*v
u = u^v
v = u^v
u = u^v
u %= m
if u < 0: u += m
return u
N,A,B,C=list(map(int,input().... | p03025 |
#ARC073C - Sentou
n, t = list(map(int, input().rstrip().split()))
lst = list(map(int, input().rstrip().split()))
ans, cur = 0, lst[0]
for i in lst[1:]:
ans += min(t, i - cur)
cur = i
ans += t
print(ans) | # ARC073C - Sentou (ABC060C)
def main():
n, t = list(map(int, input().rstrip().split()))
lst = list(map(int, input().rstrip().split()))
ans, cur = 0, lst[0]
for i in lst[1:]:
ans += min(t, i - cur)
cur = i
ans += t
print(ans)
if __name__ == "__main__":
main() | p03733 |
n, t = list(map(int, input().split()))
T = list(map(int, input().split()))
ans = 0
x_ = 0
for x in T:
if x-x_ >= t:
ans += t
else:
ans += x-x_
x_ = x
ans += t
print(ans)
| n, T = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = 0
Y = []
for i in range(n-1):
Y.append(X[i+1]-X[i])
ans = 0
for y in Y:
ans += min(T, y)
ans += T
print(ans)
| p03733 |
N, T = list(map(int,input().split()))
TL = list(map(int,input().split()))
ans = 0
for i in range(N-1):
stop = TL[i] + T
if stop >= TL[i+1]:
ans += TL[i+1]-TL[i]
else:
ans += T
ans += T
print(ans) | N,T = list(map(int,input().split()))
L = list(map(int,input().split()))
ans = 0
end = 0
for i in range(N):
ans += min(L[i]+T-end,T)
end = L[i] + T
print(ans)
| p03733 |
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
t.append(t[-1])
ans = 0
for i in range(1, N+1):
if t[i] - t[i-1] > T:
ans += T
elif t[i] == t[i-1]:
ans += T
elif t[i] - t[i-1] <= T:
ans += t[i] - t[i-1]
print(ans) | n,t = list(map(int, input().split()))
T = list(map(int, input().split()))
ans = 0
for i in range(1,n):
if T[i] - T[i-1] < t:
ans += T[i] - T[i-1]
else: ans += t
ans += t
print(ans) | p03733 |
n,t = list(map(int, input().split()))
T = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if T[i+1]-T[i]<t: ans += T[i+1]-T[i]
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):
if t[i+1]-t[i] >= T: ans += T
else: ans += t[i+1]-t[i]
print((ans+T)) | p03733 |
def main():
n,t = list(map(int,input().split()))
a = list(map(int,input().split()))
res = t
for i in range(1,n):
if a[i-1]+t <= a[i]:
res += t
else:
res += t - (a[i-1]+t-a[i])
print(res)
if __name__ == '__main__':
main()
| def main():
n,t = list(map(int,input().split()))
tl = list(map(int,input().split()))
res = t
for i in range(1,n):
res += t - max((tl[i-1]+t-tl[i]),0)
print(res)
if __name__ == '__main__':
main()
| p03733 |
N,T=list(map(int,input().split()))
t=[int(i) for i in input().split()]
ans = T
for i in range(N-1):
ans += min(t[i+1] - t[i],T)
print(ans) | N,T= list(map(int,input().split()))
t = [int(j) for j in input().split()]
ans =T
b = 0
for i in t:
ans+=min(i-b,T)
b = i
print(ans) | p03733 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, t = list(map(int, input().split()))
T = list(map(int, input().split()))
res = 0
for i in range(1, n):
if T[i - 1] + t < T[i]:
res += t
else:
res ... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, t = list(map(int, input().split()))
T = list(map(int, input().split()))
res = 0
for i in range(n - 1):
res += t if T[i] + t <= T[i + 1] else T[i + 1] - T[i]
print((res + t))... | p03733 |
N,T = list(map(int,input().split()))
A = list(map(int,input().split()))
LST = []
for a in A:
LST.append((a,1))
LST.append((a+T,-1))
LST.sort()
prev = -1
s = 0
ans = 0
for x,y in LST:
if y == 1:
s += 1
if s == 1:
prev = x
elif y == -1:
s -= 1
if s == 0:
ans +... | N,T = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 0
for i in range(N-1):
ans += min(T,A[i+1] - A[i])
print((ans+T))
| p03733 |
N,T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = T
for i in range(1,N):
if t[i]-t[i-1] >= T:
ans += T
else:
ans += t[i] - t[i-1]
print(ans) | N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = N * T # 総和
cur = 0 # いつまで出るか
for i in range(N):
if cur > t[i]:
ans -= cur - t[i]
cur = t[i] + T
print(ans) | p03733 |
N,T = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
cur = 0
for i in range(1,N):
b = A[i]
a = A[i-1]
if b-a<T:
cur += b-a
else:
cnt += cur+T
cur = 0
cnt += cur+T
print(cnt) | N,T = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
cur = 0
for i in range(1,N):
if A[i]-A[i-1]>T:
cnt += A[i-1]-cur+T
cur = A[i]
cnt += A[N-1]+T-cur
print(cnt) | p03733 |
# coding: utf-8
# Your code here!
N, T = list(map(int, input().split()))
a = list(map(int, input().split()))
total_t, crrnt_t, a_len = 0, 0, len(a)
for i in range(a_len - 1):
if a[i] + T > a[i + 1]:
total_t += a[i + 1] - a[i]
else:
total_t += T
crrnt_t = a[i + 1]
print((to... | # coding: utf-8
# Your code here!
N, T = list(map(int, input().split()))
a = list(map(int, input().split()))
total_t, a_len = 0, len(a)
for i in range(a_len - 1):
if a[i] + T > a[i + 1]:
total_t += a[i + 1] - a[i]
else:
total_t += T
print((total_t + T)) | p03733 |
N,T = list(map(int,input().split()))
t = list(map(int,input().split()))
cnt = 0
for i in range(1,N):
emp_time=(t[i]-t[i-1])-T
if emp_time >= 0:
cnt += T
else:
cnt += t[i]-t[i-1]
print((cnt+T)) | # coding: utf-8
n, t = list(map(int,input().split()))
T = list(map(int,input().split()))
ans = 0
for i in range(n-1):
if T[i+1] - T[i] >= t:
ans += t
else:
ans += T[i+1] - T[i]
print((ans+t)) | p03733 |
N,T = [int(i) for i in input().split()]
ts = [int(i) for i in input().split()]
ret = 0
# for ind in range (1, N):
# ret += min(T,ts[ind]-ts[ind-1])
for diff in [ts[ind+1]-ts[ind] for ind in range(N-1)]:
ret += min(T,diff)
print((ret+T))
| N,T = [int(i) for i in input().split()]
ts = [int(i) for i in input().split()]
ret = 0
# for ind in range (1, N):
# ret += min(T,ts[ind]-ts[ind-1])
for diff in [ts[ind+1]-ts[ind] for ind in range(N-1)]:
ret += T if T<diff else diff
print((ret+T))
| p03733 |
N,T = [int(i) for i in input().split()]
ts = [int(i) for i in input().split()]
#ret = 0
# for ind in range (1, N):
# ret += min(T,ts[ind]-ts[ind-1])
# for diff in [ts[ind+1]-ts[ind] for ind in range(N-1)]:
# ret += T if T<diff else diff
ret = sum([min(T, ts[ind+1]-ts[ind]) for ind in range(N-1)])
print(... | N,T = [int(i) for i in input().split()]
ts = [int(i) for i in input().split()]
ret = T
# for ind in range (1, N):
# ret += min(T,ts[ind]-ts[ind-1])
for diff in [ts[ind+1]-ts[ind] for ind in range(N-1)]:
ret += T if T<diff else diff
print(ret)
| p03733 |
def resolve():
N, T = list(map(int, input().split()))
tt = list(map(int, input().split()))
ans = 0
last = 0
for t in tt:
if t >= last:
ans += T
last = t + T
else:
ans += t + T - last
last = t + T
print(ans)
return
if __name__ == "__main__":
resolve(... | def resolve():
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = 0
till = 0
for now in t:
if till > now:
ans -= till - now
till = now + T
ans += T
print(ans)
return
if __name__ == "__main__":
resolve()
| p03733 |
N,T = list(map(int,input().split()))
ts = list(map(int,input().split()))
ans = 0
until = 0
for t in ts:
ans += min(T, t+T-until)
until = t+T
print(ans) | N,T = list(map(int,input().split()))
ts = list(map(int,input().split()))
ans = 0
prev = ts[0]
for t in ts[1:]:
ans += min(T, t-prev)
prev = t
ans += T
print(ans) | p03733 |
n, t = list(map(int, input().split()))
times = list(map(int, input().split()))
p = 0
ans = 0
for time in times:
start = min(p, time)
ans += t - max(0, p - time)
p = time + t
print(ans)
| N, T = list(map(int, input().split()))
times = list(map(int, input().split()))
ans = 0
t = 0
for time in times:
if time >= t:
ans += T
t = time + T
else:
diff = t - time
ans += T - diff
t = time + T
print(ans) | p03733 |
N,T = list(map(int,input().split()))
L = list(map(int,input().split()))
ans = 0
for i in range(len(L)) :
if i != N-1 :
if L[i+1]-L[i] > T :
ans += T
else :
ans += L[i+1]-L[i]
else :
ans += T
print(ans)
| N,T = list(map(int,input().split()))
L = list(map(int,input().split()))
ans = T
for i in range(N-1) :
ans += min(L[i+1]-L[i],T)
print(ans)
| p03733 |
N, T = list(map(int, input().split()))
ans = 0
t_start = 0
t_stop = 0
for t in map(int, input().split()):
if t >= t_stop:
ans += t_stop - t_start
t_start = t
t_stop = t + T
print((ans + t_stop - t_start))
| N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
print((sum(min(T, t[i + 1] - t[i]) for i in range(N - 1)) + T))
| p03733 |
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = 0
for i in range(1, N):
if t[i] - t[i - 1] >= T:
ans += T
else:
ans += t[i] - t[i - 1]
print((ans + T))
| N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = 0
for i in range(1, N):
d=t[i]-t[i-1]
if d >= T:
ans += T
else:
ans += d
print((ans + T))
| p03733 |
d = int(eval(input()))
print(('Christmas' + (25-d)*' Eve')) | print(('Christmas'+(25-int(eval(input())))*' Eve')) | p03206 |
D= int(eval(input()));
C = "Christmas";
E = " Eve";
if D==25:
print(C);
elif 21 < D < 25:
print((C+(E*(25-D))));
| D = int(eval(input()))
chris = 'Christmas'
eve = ' Eve'
num = 25
if D in range(22,25):
num -= D
eve = ' Eve' * num
chris += eve
print(chris)
| p03206 |
D = int(eval(input()))
if D == 25:
print("Christmas")
elif D == 24:
print("Christmas Eve")
elif D == 23:
print("Christmas Eve Eve")
else:
print("Christmas Eve Eve Eve") | # -*-coding: utf-8 -*-
D = int(eval(input()))
if D == 25:
print("Christmas")
elif D == 24:
print("Christmas Eve")
elif D == 23:
print("Christmas Eve Eve")
else:
print("Christmas Eve Eve Eve") | p03206 |
a='Christmas'
for i in range (0,25-int(eval(input()))):
a+=' Eve'
print(a) | print(('Christmas'+(25-int(eval(input())))*' Eve')) | p03206 |
d = int(eval(input()))
if d == 25:
print("Christmas")
elif d == 24:
print("Christmas Eve")
elif d == 23:
print("Christmas Eve Eve")
else:
print("Christmas Eve Eve Eve") | print(("Christmas"+" Eve"*(25-int(eval(input()))))) | p03206 |
D=int(eval(input()))
List=["Christmas"+" Eve"*i for i in range(3,-1,-1)]
print((List[D-22])) | D=int(eval(input()))
print(("Christmas"+" Eve"*(-(D-25)))) | p03206 |
d = int(eval(input()))
if d == 25:
print("Christmas")
elif d == 24:
print("Christmas Eve")
elif d == 23:
print("Christmas Eve Eve")
elif d == 22:
print("Christmas Eve Eve Eve")
| print(("Christmas" + (" Eve" * (25 - int(eval(input())))))) | p03206 |
d=int(eval(input()));print(("Christmas"+" Eve"*(25-d))) | print(("Christmas"+" Eve"*(25-int(eval(input()))))) | p03206 |
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
D = int(sys.stdin.readline().rstrip())
print(('Christmas' + ' Eve'*(25-D)))
if __name__ == '__main__':
main()
| import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.... | p03206 |
d = int(eval(input()))
if d==25:
print('Christmas')
elif d==24:
print('Christmas Eve')
elif d==23:
print('Christmas Eve Eve')
else:
print('Christmas Eve Eve Eve') | n = int(eval(input()))
if n==22:
print('Christmas Eve Eve Eve')
elif n==23:
print('Christmas Eve Eve')
elif n==24:
print('Christmas Eve')
else:
print('Christmas') | p03206 |
import itertools
import math
import fractions
import functools
import copy
D = int(eval(input()))
if D == 25: print("Christmas")
if D == 24: print("Christmas Eve")
if D == 23: print("Christmas Eve Eve")
if D == 22: print("Christmas Eve Eve Eve") | def main():
n = int(eval(input()))
# t, a = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
if n == 25:
print("Christmas")
elif n== 24:
print("Christmas Eve")
elif n==23:
print("Christmas Eve Eve")
elif n==22:
pr... | p03206 |
num = 25 - int(eval(input()))
s = "Christmas"
for _ in range(num):
s = "{} {}".format(s, "Eve")
print(s) | d = int(eval(input()))
msg = 'Christmas'
for _ in range(25 - d):
msg += ' Eve'
print(msg) | p03206 |
day = int(eval(input()))
if day == 25:
print('Christmas')
elif day == 24:
print('Christmas Eve')
elif day == 23:
print('Christmas Eve Eve')
else:
print('Christmas Eve Eve Eve') | day = int(eval(input()))
print(('Christmas' + ' Eve' * (25 - day))) | p03206 |
d = int(eval(input()))
if d == 25:
print("Christmas")
elif d == 24:
print("Christmas Eve")
elif d == 23:
print("Christmas Eve Eve")
elif d == 22:
print("Christmas Eve Eve Eve")
| d = int(eval(input()))
print(("Christmas"+" Eve"*(25-d))) | p03206 |
d=25-int(eval(input()));print(("Christmas"+" Eve"*d)) | print(("Christmas"+" Eve"*(25-int(eval(input()))))) | p03206 |
d = int(eval(input()))
if d == 25:
print('Christmas')
elif d == 24:
print('Christmas Eve')
elif d==23:
print('Christmas Eve Eve')
elif d==22:
print('Christmas Eve Eve Eve') | print(('Christmas'+' Eve'*(25-int(eval(input()))))) | p03206 |
N = int(eval(input()))
if N == 25 :
print("Christmas")
elif N == 24 :
print("Christmas Eve")
elif N == 23 :
print("Christmas Eve Eve")
elif N == 22 :
print("Christmas Eve Eve Eve")
| N = int(eval(input()))
plus = " Eve"
ans = "Christmas" + plus*(25-N)
print(ans)
| p03206 |
D = int(eval(input()))
x = "Christmas" + (" Eve")*(25-D)
print(x) | D = int(eval(input()))
if D == 25:
print("Christmas")
elif D == 24:
print("Christmas Eve")
elif D == 23:
print("Christmas Eve Eve")
else:
print("Christmas Eve Eve Eve") | p03206 |
d = int(eval(input()))
if d == 25:
print('Christmas')
elif d == 24:
print('Christmas Eve')
elif d == 23:
print('Christmas Eve Eve')
elif d == 22:
print('Christmas Eve Eve Eve') | d = int(eval(input()))
count = 25
if d == 25:
print('Christmas')
else:
count -= d
print(('Christmas' + ' Eve' * count)) | p03206 |
import copy as c
n=int(eval(input()))
lis=[int(a) for a in input().split()]
count=0
alis=c.copy(lis)
alis=sorted(alis)
prev=False
for i in range(n):
if lis[i]==alis[i]:
if not prev:
count+=1
prev=True
continue
prev=False
print(count)
#wrong solutiuon | #import copy as c
n=int(eval(input()))
lis=[int(a) for a in input().split()]
count=0
prev=False
for i in range(n):
if lis[i]==i+1:
if not prev:
count+=1
prev=True
continue
prev=False
print(count)
#wrong solutiuon | p03614 |
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
seq = 0
ans = 0
for i in range(N):
A[i] -= i+1
if A[i] == 0:
seq += 1
else:
ans += (seq+1)//2
seq = 0
ans +=... | # python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
seq = 0
ans = 0
for i in range(1, N+1):
if A[i-1] == i:
seq += 1
else:
ans += (seq+1)//2
seq = 0
ans += (seq+1)//... | p03614 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.