input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def kukan(n, a):
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
L = a[i] - dp[i + 1][j]
R = a[j] - dp[i][j - 1]
dp[i][j] = L if L > R else R
return dp[0][n - 1]
... | def kukan(n, a):
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
g0 = dp[i]
g1 = dp[i + 1]
for j in range(i + 1, n):
L = a[i] - g1[j]
R = a[j] - g0[j - 1]
dp[i][j] = L if L > R el... | p03171 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | p03171 |
import sys
sys.setrecursionlimit(10**9)
def recursive(i,j):
if i>j:
return 0
elif dp.get((i,j)):
return dp[(i,j)]
dp[(i,j)]=max(nums[i]-recursive(i+1,j),nums[j]-recursive(i,j-1))
return dp[(i,j)]
dp={}
n=int(eval(input()))
nums=list(map(int,input().split()))
#print(dp)
print((recursive(... | dp={}
n=int(eval(input()))
nums=list(map(int,input().split()))
#print(dp)
#print(recursive(0,n-1))
dp=[[0]*(n+1) for _ in range(n+1)]
for i in range(n-1,-1,-1):
for j in range(i,n,1):
dp[i][j]=max(nums[i]-dp[i+1][j],nums[j]-dp[i][j-1])
print((dp[0][n-1]))
| p03171 |
import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
from functools import lru_cache
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
@lru_cache(None)
def dfs(l, r):
# base c... | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
from functools import lru_cache
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
dp = [[None] * (n + 1) for _ in range(n + 1)]
for... | p03171 |
# input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[[None for _ in range(2)] for _ in rang... | # input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[None for _ in range(N)] for _ in range... | p03171 |
# input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[None for _ in range(N)] for _ in range... | # input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[0 for _ in range(N)] for _ in range(N)... | p03171 |
#L
import sys
sys.setrecursionlimit(10**5)
N=int(eval(input()))
a=list(map(int,input().split()))
S=[0]*(N+1)
for i in range(N):
S[i+1]=S[i]+a[i]
dp=[[0]*(N+1) for _ in range(N+1)]#[l,r)の範囲が残っているときに取れる最大値
def rep(l,r):
if l==r:
return 0
if dp[l][r]!=0:
return dp[l][r]
... | #L
N=int(eval(input()))
a=list(map(int,input().split()))
S=[0]*(N+1)
for i in range(N):
S[i+1]=S[i]+a[i]
dp=[[0]*(N+1) for _ in range(N+1)]#[l,r)の範囲が残っているときに取れる最大値
for i in range(1,N+1):#r-lの値
for j in range(N):#lの値
r=j+i
if r>N:
break
l=j
x=a[l]+... | p03171 |
def solve():
n = int(eval(input()))
a = list(int(x) for x in input().split())
memo = [[None] * n for _ in range(n)]
for i, aa in enumerate(a):
memo[i][i] = aa
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[r] - memo[l][r - 1], a[l]... | def solve():
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([None] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[r] - memo[l][r - 1], a[l]... | p03171 |
def solve():
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([None] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[r] - memo[l][r - 1], a[l]... | n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1])
print((dp[0][n - 1]))
# 下記提出と全く同じ内容で提出します
# htt... | p03171 |
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([None] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[l] - memo[l + 1][r], a[r] - memo[l][r - 1])
print((memo[0][n - 1]))
... | def main():
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([None] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[l] - memo[l + 1][r], a[r] ... | p03171 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03171 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03171 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03171 |
def fun(i,j):
# print(i,j)
if i>j or i>=n or j<0:
return 0
elif i==j:
dp[i][j]=arr[i]
return dp[i][j]
else:
if dp[i][j]==0:
dp[i][j]=max(arr[i]+min(fun(i+1,j-1),fun(i+2,j)),arr[j]+min(fun(i+1,j-1),fun(i,j-2)))
return dp[i][j]
n=int(eval(input()))
dp=[0]*n
for i in range(n):
dp[i]=[0]*n
... | def fun(i,j):
# print(i,j)
if i>j or i>=n or j<0:
return 0
elif i==j:
dp[i][j]=arr[i]
return dp[i][j]
else:
if dp[i][j]==0:
dp[i][j]=max(arr[i]+min(fun(i+1,j-1),fun(i+2,j)),arr[j]+min(fun(i+1,j-1),fun(i,j-2)))
return dp[i][j]
n=int(eval(input()))
dp=[0]*n
for i in range(n):
dp[i]=[0]*n
... | p03171 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03171 |
def deque(a):
n = len(a)
cur = [(x, 0) for x in a]
nxt = [(0, 0)] * n
for l in range(2, n + 1):
for i in range(n - l + 1):
j = i + l - 1
x, y = cur[i]
z, t = cur[i + 1]
if a[i] + t - z > a[j] + y - x:
nxt[i] = (a[i] + t, z... | def deque(a):
n = len(a)
cur = a[:]
nxt = [0] * (n - 1)
for l in range(2, n + 1):
for i in range(n - l + 1):
j = i + l - 1
nxt[i] = max(a[i] - cur[i + 1], a[j] - cur[i])
cur, nxt = nxt, cur
return cur[0]
def main():
eval(input()) # n
a... | p03171 |
import sys
sys.setrecursionlimit(1000000)
N=eval(input())
A=list(map(int, sys.stdin.readline().split()))
dp=[ [ 0 for i in range(N) ] for j in range(N) ]
def func(x,y,cnt):
if dp[x][y]>0: return dp[x][y]
ret=0
if x==y:
if cnt%2==0:
ret=A[x]
dp[x][y]=ret
return ret
else:
ret=-1*... | # -*- coding: utf-8 -*-
import sys
N=eval(input())
A=list(map(int, sys.stdin.readline().split()))
dp=[ [ None for i in range(N) ] for j in range(N) ]
for i in range(N-1,-1,-1):
if N%2==0:
dp[i][i]=A[i]*-1
else:
dp[i][i]=A[i]
for i in range(N-2,-1,-1):
for j in range(i+1,N):
t=N-(j-i+1)... | p03171 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | p03171 |
import sys
sys.setrecursionlimit(10**7)
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[None] * len(a) for _ in a]
def solve(i, j):
if dp[i][j]:
return dp[i][j]
if i == j:
dp[i][j] = a[i]
return dp[i][j]
dp[i][j] = max(a[j] - solve(i, j-1), a[... | n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[None] * len(a) for _ in a]
for i in range(len(a)-1, -1, -1):
for j in range(i, len(a)):
if i == j:
dp[i][j] = a[i]
continue
dp[i][j] = max(a[j] - dp[i][j-1], a[i] - dp[i+1][j])
print((dp[0][len... | p03171 |
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 9)
def main():
N = int(eval(input()))
a = list(map(int,input().split()))
memo = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
memo[i][i] = a[i]
def point(x,y):
if memo[x][y] != ... | import sys
input = sys.stdin.buffer.readline
def main():
N = int(eval(input()))
a = list(map(int,input().split()))
dp = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
dp[i][i] = a[i]
for i in range(N-1,-1,-1):
for j in range(i,N):
if dp[i]... | p03171 |
import sys
sys.setrecursionlimit(10**8)
n,*a=list(map(int,open(0).read().split()))
dp=[[0]*(n+1) for _ in range(n+1)]
def dfs(l,r):
if l+r==n:return 0
if dp[l][r]:return dp[l][r]
dp[l][r]=max(a[l]-dfs(l+1,r),a[n-1-r]-dfs(l,r+1))
return dp[l][r]
print((dfs(0,0))) | n,*a=list(map(int,open(0).read().split()))
dp=[[0]*(n+1) for _ in range(n+1)]
for l in range(n)[::-1]:
for r in range(n)[::-1]:
if l+r<=n-1:
dp[l][r]=max(a[l]-dp[l+1][r],a[n-1-r]-dp[l][r+1])
print((dp[0][0])) | p03171 |
import sys
sys.setrecursionlimit(10**8)
def calc(N,i,j):
if dp[i][j]<float('inf'):
return dp[i][j]
if (N-(j-i+1))%2==0:
if i==j:
dp[i][j] = A[i]
else:
dp[i][j] = max(calc(N,i,j-1)+A[j],calc(N,i+1,j)+A[i])
else:
if i==j:
dp[i][j] = -A[i]
else:
dp[i][j] = mi... | N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[float('inf')]*N for _ in range(N)]
for i in range(N):
if (N-1)%2==0:
dp[i][i] = A[i]
else:
dp[i][i] = -A[i]
for k in range(1,N):
for i in range(N):
j = i+k
if j>N-1:
break
if (N-(k+1))%2==0:
dp[i][j] = ... | p03171 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
A=list(map(int,input().split()))
SCORE=[[None for i in range(N+1)] for j in range(N+1)]
def score(i,j,k,l):#A[i:j)が残っているときのscore,1:Xの手番,-1:Yの手番
#print(i,j,k,l)
if SCORE[i][j]!=None:
return SCORE[i][j]+k
if i==j:
... | import sys
input = sys.stdin.readline
N=int(eval(input()))
A=list(map(int,input().split()))
SCORE=[[None for i in range(N+1)] for j in range(N+1)]
def score(i,j,k,l):#A[i:j)が残っているときのscore,1:Xの手番,-1:Yの手番
if i==j:
SCORE[i][j]=0
return
if SCORE[i][j]!=None:
retur... | p03171 |
import sys
sys.setrecursionlimit(10**7)
n=int(eval(input()))
a=list(map(int,input().split()))
d={}
def k(a):
return ','.join(map(str,a))
def dp(a):
ka=k(a)
if ka in d:
return [d[ka][0],d[ka][1]]
if len(a)==1:
d[ka]=[a[0],[]]
return a[0],[]
... | n=int(eval(input()))
a=list(map(int,input().split()))
dp=[[0]*n for _ in range(n)]
# dp[i][j]:i<=j,i番目からj番目までの数列(j-i+1個)を前にした時、ゲーム終了までに自分が取れる最大得点。i,j=0,..,n-1
sa=[0]
s=0
for ai in a:
s+=ai
sa.append(s)
for len in range(1,n+1):
for l in range(n-len+1):
r=l+len-1
s=sa... | p03171 |
from sys import stdin, setrecursionlimit
input = stdin.readline
setrecursionlimit(200000)
N = int(eval(input()))
a = list(map(int, input().split()))
INF = -(10**13)
dp = [[INF] * (N + 1) for _ in range(N + 1)]
def play(start: 'int',
end: 'int') -> 'int': # return the maximum X for range[star... | from sys import stdin
input = stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N):
dp[i][i + 1] = a[i] if N & 1 == 1 else -a[i]
for j in range(2, N + 1):
for i in range(0, N + 1 - j):
# j is the length of... | p03171 |
import sys
def solve():
a = read()
result = think(a)
write(result)
def read():
n = read_int(1)[0]
return read_int(n)
def read_int(n):
return list([int(x) for x in read_line().split(' ')])[:n]
def read_float(n):
return list([float(x) for x in read_line().split(' ')]... | def solve():
a = read()
result = think(a)
write(result)
def read():
n = read_int(1)[0]
return read_int(n)
def read_int(n):
return list(map(int, read_line().split(' ')))[:n]
def read_float(n):
return list(map(float, read_line().split(' ')))[:n]
def read_line(n=0):
... | p03171 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from itertools import accumulate
n = int(eval(input()))
A = list(map(int, input().split()))
L = [0] + list(accumulate(A))
dp = [[-1]*(n+1) for i in range(n+1)]
def dfs(i, j):
if dp[i][j] != -1:
return dp[i][j]
if i == j:
dp[i][... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from itertools import accumulate
n = int(eval(input()))
A = list(map(int, input().split()))
L = [0] + list(accumulate(A))
dp = [[0]*(n+1) for i in range(n+1)]
for d in range(1, n+1):
for i in range(n+1-d):
dp[i][i+d] = max(A[i] + L[i+d... | p03171 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**9)
#import
#import math
#import numpy as np
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[-1] * (N + 1) for _ in range(N + 1)]
# 半開区間A[r,l)における最大スコア
def calc(r, l):
if dp[r][l] != -1:
return dp[r][l]
if ... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**9)
#import
#import math
#import numpy as np
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[0] * (N + 1) for _ in range(N + 1)]
for w in range(1, N + 1):
for l in range(N - w + 1):
r = w + l
dp[l][r] = ... | p03171 |
N = int(eval(input()))
a = list(map(int, input().split()))
# dp[x][y][Person]:= 左端がx 番目,右端がy 番目の時の,この時動かすのがPersonの時の X - Y の値(0<=x<=Y<N)
dp = [[[0, 0] for j in range(N)] for i in range(N)]
for i in range(N):
dp[i][i][0] = a[i]
dp[i][i][1] = -a[i]
for i in range(1, N+1):
# y-x = i thus y = x+i 0<... | N = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0]*(2*N) for i in range(N)]
for i in range(N):
dp[i][i] = a[i]
dp[i][i+N] = -a[i]
for i in range(1, N+1):
for x in range(N-i):
dp[x][x+i] = max(a[x]+dp[x+1][x+i+N], a[x+i]+dp[x][x+i-1+N])
dp[x][x+i+N] = min(dp[x+1][... | p03171 |
import sys
sys.setrecursionlimit(5000)
def max(a,b):
if a >= b:
return a
return b
def min(a,b):
if a <= b:
return a
return b
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[-1]*(n+1) for i in range(n)]
def rec(i=0, j=n):
... | n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0]*(n+1) for i in range(n+1)]
for l in range(1,n+1):
for i in range(n+1-l):
j = i+l
if (n-l)%2 == 0:
dp[i][j] = max(dp[i+1][j]+a[i], dp[i][j-1]+a[j-1])
else:
dp[i][j] = min(dp[i+1][j]-a[i], d... | p03171 |
#EDPC L
import sys
sys.setrecursionlimit(10**5)
def main():
N=int(eval(input()))
a=list(map(int,input().split()))
#dp[l][r]:=区間[l,r]が残っている時の(直後の人の最終的な得点-そうじゃない方の最終的な得点）
dp=[[-1]*N for _ in range(N)]
def rec(l,r):
if dp[l][r]!=-1:
return dp[l][r]
... | #EDPC L メモ化再帰じゃTLEで通らないのでやり直し
N=int(eval(input()))
a=list(map(int,input().split()))
#dp[l][r]:=区間[l,r]が残っている時の(直後の人の最終的な得点-そうじゃない方の最終的な得点）
dp=[[-1]*N for _ in range(N)]
for k in range(N):
dp[k][k]=a[k]
for r in range(1,N):
for l in reversed(list(range(r))):
dp[l][r]=max(a[l]-dp[l+1][r... | p03171 |
n = int(eval(input()))
arr = list(map(int, input().split()))
dp = [[0] * (n+1) for _ in range(n+1)]
for length in range(1, n + 1):
for i in range(n - length + 1):
j = i + length
if ((n - length) % 2 == 0):
dp[i][j] = max(dp[i+1][j] + arr[i], dp[i][j-1] + arr[j-1])
e... | def kukan(n, a):
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
g0 = dp[i]
g1 = dp[i + 1]
for j in range(i + 1, n):
L = a[i] - g1[j]
R = a[j] - g0[j - 1]
dp[i][j] = L if L > R el... | p03171 |
import sys
sys.setrecursionlimit(10 ** 6)
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
c = [[None] * N for _ in range(N)]
for r in reversed(list(range(N))):
c[r][r] = A[r]
for l in range(r + 1, N):
c[r][l] = max(-c[r + 1][l] + A[r], -c[r... | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
c = [0] * N
for r in reversed(list(range(N))):
ar = A[r]
c[r] = t = ar
for l in range(r + 1, N):
c[l] = t = max(ar - c[l], A[l] - t)
print((c[-1]))
main()
| p03171 |
N = int(eval(input()))
a = [int(c) for c in input().split()]
dp = [[-1] * N for _ in range(N)]
for i in range(N):
for L in range(N):
for R in range(L, N):
if L == R:
dp[L][R] = a[L]
else:
dp[L][R] = max(a[L] - dp[L+1][R], a[R] - dp[L][R-1])
... | N = int(eval(input()))
a = [int(c) for c in input().split()]
dp = [[-1] * N for _ in range(N)]
for L in range(N, -1, -1):
for R in range(L, N):
if L == R:
dp[L][R] = a[L]
else:
dp[L][R] = max(a[L] - dp[L+1][R], a[R] - dp[L][R-1])
print((dp[0][N-1]))
| p03171 |
import sys
input = sys.stdin.readline
def func():
N = int(eval(input()))
A = [int(i) for i in input().split()]
dp = [[0] * (N+1) for i in range(N+1)]
if (N - 1) % 2 == 0:
fl = 1
else:
fl = -1
for i in range(N):
dp[i][i+1] = fl * A[i]
for s in range(2... | import sys
input = sys.stdin.readline
def func():
N = int(eval(input()))
A = [int(i) for i in input().split()]
dp = [[0] * (N+1) for i in range(N+1)]
for i in range(N):
dp[i][i+1] = A[i]
for s in range(2, N+1):
for l in range(N-s+1):
r = l + s
... | p03171 |
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(1000000000)
N = int(eval(input()))
a = list(map(int, input().split()))
dp_memo = [[float("inf")]*(N+1) for _ in range(N+1)]
for i in range(N+1):
dp_memo[i][i] = 0
def dp(i,j):
if dp_memo[i][j] < float("inf"):
return dp_me... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(1000000000)
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [[float("inf")]*(N+1) for _ in range(N+1)]
for shift_i in range(N+1):
for i in range(N+1):
if i+shift_i >= N+1:
continue
if shift... | p03171 |
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(1000000000)
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [[float("inf")]*(N+1) for _ in range(N+1)]
for shift_i in range(N+1):
for i in range(N+1):
if i+shift_i >= N+1:
continue
if shift... | import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
a = list(map(int, input().split()))
# dp[i][j] 区間a[i,j)だけ残った時点で互いの点数を一旦0とし、ゲームを最後まで続けた場合のX-Yの値
dp = [[0]*(N+1) for _ in range(N+1)]
# こちらもメモ化再帰ではpypy3でも間に合わない
# j==i+1, i+2, ...とループしてdpテーブルの上三角部分を対角線と平行に埋めていく。jをshift_iと書き換えてループ
for shift_... | p03171 |
import sys
readline = sys.stdin.readline
N = int(readline())
A = list(map(int,readline().split()))
dp = [[0] * (N + 1) for i in range(N + 1)]
# [i,j)
for l in range(1, N + 1):
for i in range(N - l + 1):
j = i + l
if (N - l) % 2 == 0: # 先手
dp[i][j] = max(dp[i + 1][j] + A[i], dp[i][j... | import sys
readline = sys.stdin.readline
N = int(readline())
A = list(map(int,readline().split()))
# dp[l][r] = [l:r)の区間から起こり得るX - Yの最大値
# [N - 区間の長さ] = 偶数のとき、次に取るのは先手
dp = [[0] * (N + 1) for i in range(N + 1)]
for k in range(1, N + 1): # 区間の長さ
for i in range(N + 1 - k):
if (N - k) % 2 == 0: # 先手... | p03171 |
import sys
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
def solve():
N, *a = list(map(int, read().split()))
a = tuple(a)
INF = float('inf')
memo = [[INF] * N for _ in range(N)]
def f(i, j):
if memo[i][j] != INF:
return memo[i][j]
n = j - i + 1
... | import sys
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
def solve():
n, *a = list(map(int, read().split()))
a = tuple(a)
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
L... | p03171 |
import sys
sys.setrecursionlimit(10000)
n = int(eval(input()))
*A, = list(map(int, input().split()))
DP = [[None for j in range(n+1)] for i in range(n)]
def dp(i, j):
if i == j:
return 0
if DP[i][j] != None:
return DP[i][j]
DP[i][j] = max(A[i]-dp(i+1, j), A[j-1]-dp(i, j-1))
re... | n = int(eval(input()))
*A, = list(map(int, input().split()))
DP = [[0 for j in range(n+1)] for i in range(n+1)]
for l in range(1, n+1):
for i in range(n-l+1):
j = i+l
DP[i][j] = max(A[i]-DP[i+1][j], A[j-1]-DP[i][j-1])
print((DP[0][n]))
| p03171 |
import math
from fractions import Fraction
mod = 998244353
n = int(eval(input()))
p = [list(map(int, input().split())) for i in range(n)]
pow2 = [2**i % mod for i in range(n + 1)]
used = [[False] * n for i in range(n)]
ret = (pow2[n] - 1 - n - n * (n - 1) / 2) % mod
for i in range(n):
for j in range(i):
... | import math
mod = 998244353
n = int(eval(input()))
p = [list(map(int, input().split())) for i in range(n)]
pow2 = [1]
for i in range(n):
pow2.append(pow2[-1] * 2 % mod)
used = [[False] * n for i in range(n)]
ret = (pow2[n] - 1 - n - n * (n - 1) / 2) % mod
for i in range(n):
for j in range(i):
... | p03615 |
A, B = list(map(int, input().split()))
c = 0
tmp = 1
while tmp < B:
c += 1
tmp = (A - 1) * (c - 1) + A
print(c)
| def main():
A, B = list(map(int, input().split()))
if B == 1:
print((0))
exit()
cnt = A
tap = 1
while True:
if cnt >= B:
print(tap)
exit()
cnt += (A - 1)
tap += 1
if __name__ == "__main__":
main() | p02922 |
n,m = list(map(int,input().split()))
# n = int(input())
# s = input()
# t = input()
ans = 0
while m > 1:
m -= n - 1
ans += 1
print(ans) | a, b = list(map(int, input().split()))
print(((b - 1) // (a - 1) + min(1, (b - 1) % (a - 1)))) | p02922 |
import sys
from pprint import pprint
def solve(a, b):
ans = 0
emp = 1
while emp < b:
emp += a - 1
ans += 1
print(ans)
if __name__ == '__main__':
a, b = list(map(int, sys.stdin.readline().strip().split(" ")))
solve(a, b)
| import sys
A, B = list(map(int, sys.stdin.readline().split()))
print(((B - A - 1) // (A-1) + 2)) | p02922 |
A, B = list(map(int, input().split()))
k = 1
while k < B:
k += A - 1
if A == 2 :
print((k-1))
else:
print((k//(A - 1))) | A, B = list(map(int, input().split()))
k = 1
s = 0
while k < B:
k += A - 1
s += 1
print(s) | p02922 |
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 1 20:21:49 2019
@author: Yamazaki Kenichi
"""
A, B = list(map(int,input().split()))
ans = (B-A-1)//(A-1) + 1 + 1
print(ans)
| A, B = list(map(int,input().split()))
ans = (B-1-1)//(A-1)+1
print(ans) | p02922 |
import sys
sys.setrecursionlimit(10**7)
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 LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
A,B = MI()
print(((B+A-3)//(A-1)))
| p02922 |
import math
A, B = list(map(int, input().split()))
if B == 1:
print((0))
elif A >= B:
print((1))
else:
print((math.ceil((B - 1) / (A - 1))))
| import math
A, B = list(map(int, input().split()))
if B == 1:
print((0))
elif A >= B:
print((1))
else:
print((math.ceil((B - A) / (A - 1)) + 1))
| p02922 |
a, b = list(map(int,input().split()))
for i in range(b):
if 1 + (a-1)*i >= b:
print(i)
break | a, b = list(map(int,input().split()))
i = 0
while True:
if 1 + (a-1)*i >= b:
print(i)
break
i += 1 | p02922 |
a,b=list(map(int,input().split()))
import math
socket=0;ans=0
if b==1:
ans=0
else:
while (True):
if socket+a >= b:
ans+=1
break
socket+=a-1
ans+=1
print(ans) | a,b=list(map(int,input().split()))
import math
socket=1;ans=0
while (True):
if socket >= b:
break
socket-=1
socket+=a
ans+=1
print(ans) | p02922 |
a,b = list(map(int,input().split()))
ans = 0
c = 1
while c < b:
ans += 1
c = c-1+a
print(ans)
| a,b=list(map(int,input().split()))
print(((b-1+a-1-1)//(a-1))) | p02922 |
# ABC 139: B – Power Socket
from math import ceil
a, b = [int(s) for s in input().split()]
print((ceil((b - 1) / (a - 1)))) | # ABC 139: B – Power Socket
A, B = [int(s) for s in input().split()]
taps = 0
while (A - 1) * taps + 1 < B:
taps += 1
print(taps) | p02922 |
a,b = list(map(int,input().split()))
ans = 1
count = 0
while ans < b:
ans = (ans-1)+a
count += 1
print(count) | a,b = list(map(int,input().split()))
ans = 1
count = 0
while ans<b:
ans += (a-1)
count += 1
print(count) | p02922 |
a,b = list(map(int, input().split()))
from math import ceil
print((ceil( (b-1) / (a-1) ) ))
| def resolve():
a,b = list(map(int, input().split()))
tmp = 1
cnt = 0
while tmp < b:
tmp -= 1
cnt += 1
tmp += a
print(cnt)
if __name__ == '__main__':
resolve()
| p02922 |
A,B = list(map(int,input().split()))
ans=1
cnt=0
while B > ans:
ans+=A-1
cnt+=1
print(cnt) | import math
A,B = list(map(int,input().split()))
print((math.ceil((B - A) / (A - 1)) + 1)) | p02922 |
import math
(a,b) = list(map(int, input().split()))
print((math.ceil(((b-a)/(a-1) + 1)))) | A, B = [int(A) for A in input().split()]
socket = 0
count = 0
if B==1 :
count=0
elif B != 0 :
while socket < B :
if socket + A < B :
socket = socket + A - 1
count += 1
elif socket+A >= B :
socket = socket + A
count += 1
print(count)
| p02922 |
import math
a,b=list(map(int,input().split()))
print((math.ceil((b-1)/(a-1))))
| a,b=list(map(int,input().split()))
ans,num=0,1
while num<b:
num-=1
num+=a
ans+=1
print(ans) | p02922 |
from sys import stdin
import queue
import sys
import math
a,b=list(map(int,input().split()))
print((math.ceil((b-1)/(a-1))))
| import math
a,b=list(map(int,input().split()))
print((math.ceil((b-1)/(a-1)))) | p02922 |
import sys
input = sys.stdin.readline
a,b = list(map(int, input().split()))
cnt = 1
while True:
if b<= 1:
cnt = 0
elif b <= (a-1)*cnt+1:
break
cnt += 1
print(cnt) | import sys
input = sys.stdin.readline
a,b = list(map(int, input().split()))
cnt = 1
while True:
if b<= 1:
cnt = 0
break
elif b <= (a-1)*cnt+1:
break
cnt += 1
print(cnt) | p02922 |
a, b = list(map(int, input().split()))
now = 1
ans = 0
while now < b:
ans += 1
now += a-1
print(ans)
| a, b = list(map(int, input().split()))
tmp = (b-1)/(a-1)
if tmp - int(tmp) == 0:
print((int(tmp)))
else:
print((int(tmp)+1)) | p02922 |
a, b = list(map(int, input().split()))
print((-(-(b-a)//(a-1)) + 1))
| # 2:50
a, b = list(map(int, input().split()))
if b == 1:
print((0))
exit()
if a >= b:
print((1))
else:
b -= a
cnt = 1
while (b > 0):
b -= (a - 1)
cnt += 1
print(cnt)
| p02922 |
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return list(map(fn, readline().split()))
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
a, b = geta(int)
... | import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return list(map(fn, readline().split()))
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
a, b = geta(int)
... | p02922 |
from copy import deepcopy
from math import ceil
if __name__ == "__main__":
a = list(map(int, input().split()))
n = deepcopy(a[0])
i = 1
if a[0] == a[1]: print(i)
elif a[1] == 1: print((0))
elif a[0] >= a[1]: print(i)
else:
while True:
i += 1
n +=... | #n = input()
a = list(map(int, input().split()))
#b = list(map(int, input().split()))
#c = list(map(int, input().split()))
r = 1
c = 0
if a[1] == 1:
print((0))
elif a[0] == a[1]:
print((1))
else:
while r < a[1]:
c += 1
r -= 1
r += a[0]
print(c) | p02922 |
#!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()... | import math
a,b = [int(x) for x in input().split()]
print((math.ceil((b-1)/(a-1))))
| p02922 |
import math
a,b=list(map(int,input().split()))
print((math.ceil((b-1)/(a-1)))) | a,b=list(map(int,input().split()))
print((-(-(b-1)//(a-1)))) | p02922 |
# -*- coding: utf-8 -*-
a,b = list(map(int, input().split()))
res = 0
cnt = 1
while cnt<b:
cnt += a-1
res += 1
print(res)
| a,b = list(map(int, input().split()))
s = 1
cnt = 0
while s<b:
s += a-1
cnt += 1
print(cnt) | p02922 |
a, b = list(map(int, input().split()))
print((0 if b == 1 else ((b - 1) + (a - 2)) // (a - 1)))
| a, b = list(map(int, input().split()))
print((((b - 1) + (a - 2)) // (a - 1)))
| p02922 |
import math
a, b = list(map(int, input().split()))
print((math.ceil((b-1)/(a-1)))) | a, b = list(map(int, input().split()))
n = 0
while a*n-(n-1) < b:
n += 1
print(n)
| p02922 |
import sys
A, B = list(map(int, input().split()))
if B == 1:
print((0))
sys.exit()
ans = 1
taps = A
while True:
if B <= taps:
break
ans += 1
taps += A - 1
print(ans) | A, B = list(map(int, input().split()))
ans = 0
taps = 1
while taps < B:
taps += A - 1
ans += 1
print(ans) | p02922 |
a, b = list(map(int, input().split()))
b -= 1
a = (b + (a - 2)) // (a - 1)
print(a) | a, b = list(map(int, input().split()))
# b -= a
# counter = 1
# while b > 0:
# b -= a - 1
# counter += 1
# print(counter)
sum_tap = 1
for i in range(100):
if sum_tap >= b:
print(i)
break
sum_tap += a - 1
| p02922 |
A, B = list(map(int,input().split()))
for i in range(21):
if ((A - 1) * (i - 1)) + A >= B:
print(i)
exit() | A, B = list(map(int, input().split()))
for i in range(0, 21):
ans = i * ( A - 1 ) + 1
if ans >= B:
print(i)
exit()
| p02922 |
def slove():
import sys
input = sys.stdin.readline
a, b = list(map(int, input().rstrip('\n').split()))
t = 1
cnt = 0
while True:
if t >= b:
print(cnt)
exit()
else:
t += a
t -= 1
cnt += 1
if __name__ == ... | def slove():
import sys
input = sys.stdin.readline
a, b = list(map(int, input().rstrip('\n').split()))
d = a - 1
print(((b - 1 + d - 1) // d))
if __name__ == '__main__':
slove()
| p02922 |
A, B = list(map(int,input().split()))
puragu = 1
if B == 1:
print((0))
exit()
if A >= B:
print((1))
exit()
result = 0
while puragu < B:
puragu += A-1
result += 1
print(result)
| A, B = list(map(int, input().split()))
tap = 1
count = 0
while tap < B:
tap += A - 1
count += 1
print(count) | p02922 |
a, b = [int(i) for i in input().split()]
b-=1
c=0
while b>0:
b-=a-1
c+=1
print(c) | a, b = list(map(int, input().split()))
ans = 0
tmp = 0
if b == 1:
print((0))
exit()
for i in range(10 ** 9):
ans += 1
tmp += a
if b <= tmp:
break
else:
tmp -= 1
print(ans)
| p02922 |
AB = input().split()
A,B = int(AB[0]),int(AB[1])
count = 0
unused = 1
while unused < B:
unused += A - 1
count += 1
print(count) | a,b=list(map(int,input().split()))
t=1
ans=0
while t<b:
t += a-1
ans += 1
print(ans) | p02922 |
a,b = list(map(int,input().split()))
res = 0
c = 1
while c < b:
c += a - 1
res += 1
print(res) | a,b = list(map(int,input().split()))
ans = 0
tap = 1
while tap < b:
ans += 1
tap += a - 1
print(ans)
| p02922 |
import math
a, b = list(map(int, input().split(' ')))
print((math.ceil((b - 1) / (a - 1))))
| a, b = list(map(int, input().split(' ')))
print((-(-(b-1) // (a-1))))
| p02922 |
import math
a, b = list(map(int, input().split()))
i = 0
s = 1
while b > s:
s += a-1
i += 1
print(i) | import math
a, b = list(map(int, input().split()))
print((math.ceil((b-1)*1.0/(a-1)))) | p02922 |
A, B = list(map(int, input().split()))
ans = 0
k = 1
while k < B:
ans += 1
k += A - 1
print(ans) | a,b=list(map(int, input().split()))
k=1
for i in range(1000):
if k>=b:
print(i)
break
k = k - 1 + a
| p02922 |
a,b=list(map(int,input().split()))
sum=1
tap=0
while sum<b:
sum+=a-1
tap+=1
print(tap) | a,b=list(map(int,input().split()))
con=1
ans=0
while con<b:
con+=a-1
ans+=1
print(ans) | p02922 |
A, B = list(map(int, input().split()))
if (B-1)%(A-1) == 0:
print((int((B-1)/(A-1))))
else:
print((int((B-1)//(A-1) +1))) | A, B = list(map(int, input().split()))
if (B-1)%(A-1) == 0:
print((int((B-1)/(A-1))))
else:
print(((B-1)//(A-1) +1)) | p02922 |
a,b = list(map(int,input().split()))
sumA = a
count =1
ans = 0
while count < b:
count -=1
count +=a
ans +=1
print(ans) | a,b = list(map(int,input().split()))
count =1
ans = 0
while count < b:
count -=1
count +=a
ans +=1
print(ans)
| p02922 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | # 入力
a,b=list(map(int,input().split()))
# 初期状態（1口）
n=1
# タップの数
ans=0
# タップを1つずつ差していく
# 差すことでa口増えるが、差した口も1つ減る
while True:
# b口以上になったら終了
if n>=b:
print(ans)
exit()
n+=a
n-=1
ans+=1
| p02922 |
A,B=list(map(int,input().split()))
x=0
while (A-1)*x+1<B:
x+=1
print(x) | a, b = list(map(int, input().split()))
print((-(-(b-1)//(a-1))))
| p02922 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,M = list(map(int,input().split()))
LRA = [[int(x) for x in row.split()] for row in sys.stdin.readlines()]
R_to_LA = [[] for _ in range(N+1)]
for L,R,A in LRA:
R_to_LA[R].append((L,A))
INF = 10 ** 18
size = 1<<18
data = [0] * (2... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,M = list(map(int,input().split()))
LRA = [[int(x) for x in row.split()] for row in sys.stdin.readlines()]
R_to_LA = [[] for _ in range(N+1)]
for L,R,A in LRA:
R_to_LA[R].append((L,A))
INF = 10 ** 18
size = 1<<18
data = [0] * (2... | p03182 |
import sys
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
L = [[] for i in range(N+1)]
R = [[] for i in range(N+1)]
for i in range(M):
l, r, a = list(map(int, readline().split()))
L[l-1].append((r, a))
INF = 2**31-1
LV = (N).bit_length()
N0 = 2**LV
data = [0]*(2*N0)
la... | import sys
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
L = [[] for i in range(N+1)]
R = [[] for i in range(N+1)]
for i in range(M):
l, r, a = list(map(int, readline().split()))
L[l-1].append((r, a))
INF = 2**31-1
LV = (N).bit_length()
N0 = 2**LV
data = [0]*(2*N0)
la... | p03182 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
class SegmentTree(object):
def __init__(self,A,dot,e,comp,id,act):
"""
A: array of monoid (M,dot,e)
comp: composite function of Hom(M), comp(f,g)=gf
id: ide... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
"""
(M, dot, unit) : monoid
(S, compose, identitiy) : sub monoid of End(M)... | p03182 |
import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
"""
(M, dot, unit) : monoid
(S, compose, identitiy) : s... | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
"""
(M, dot, unit) : monoid
(S, compose, identitiy) : s... | p03182 |
import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
"""
(M, dot, unit) : monoid
(S, compose, identitiy) : s... | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
"""
(M, dot, unit) : monoid
(S, compose, identitiy) : s... | p03182 |
#!/usr/bin/env pypy3
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,M=MI()
class Lazysegtree:
#RAQ
def __init__(self, A, intv, initialize = True, segf = min):
... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,M=MI()
class Lazysegtree:
#RAQ
def __init__(self, A, intv, initialize = True, s... | p03182 |
import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
end=[[] for i in range(N+2)]
for i in [0]*M:
l,r,a=list(map(int,input().split()))
end[r+1].append((l,a))
#Starry Sky tree
seg_el=1<<18#Segment treeの台の要素数
SEG=[0]*(2*seg_el-1)#Segment tree.色々考えると0で初期化してOKそう
ADD=[0]*(2*se... | import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
end=[[] for i in range(N+2)]
for i in [0]*M:
l,r,a=list(map(int,input().split()))
end[r+1].append((l,a))
#Starry Sky tree
seg_el=1<<18#Segment treeの台の要素数
SEG=[0]*(2*seg_el-1)#Segment tree.色々考えると0で初期化してOKそう
ADD=[0]*(2*se... | p03182 |
class StarrySkyTree:
def __init__(self,param,default,func):
if isinstance(param,list):
num=len(param)
else:
num=param
leaf=1<<(num-1).bit_length()
self.leaf=leaf
self.d=default
if isinstance(param,list):
self.data=[default... | class StarrySkyTree:
def __init__(self,num):
leaf=1<<(num-1).bit_length()
self.leaf=leaf
self.data=[0]*leaf*2
self.lazy=[0]*leaf*2
def indices(self,l,r):
L,R=l+self.leaf,r+self.leaf
lm=(L//(L&-L))>>1
rm=(R//(R&-R))>>1
while L<R:
... | p03182 |
class StarrySkyTree:
def __init__(self,num):
leaf=1<<(num-1).bit_length()
self.leaf=leaf
self.data=[0]*leaf*2
self.lazy=[0]*leaf*2
zero_indices=[]
for i in range(num+1):
tmp=[]
i+=self.leaf
limit=(i//(i&-i))>>1
... | class StarrySkyTree:
def __init__(self,num):
leaf=1<<(num-1).bit_length()
self.leaf=leaf
self.data=[0]*leaf*2
self.lazy=[0]*leaf*2
def indices(self,l,r):
L,R=l+self.leaf,r+self.leaf
lm=(L//(L&-L))>>1
rm=(R//(R&-R))>>1
while L<R:
... | p03182 |
class StarrySkyTree:
def __init__(self,num,default,func):
leaf=1<<(num-1).bit_length()
self.leaf=leaf
self.d=default
self.data=[default]*leaf*2
self.lazy=[0]*leaf*2
self.f=func
def merge(self,a,b):
return self.f(a,b)
def indices(self,l,r):
... | class StarrySkyTree:
def __init__(self,num):
leaf=1<<(num-1).bit_length()
self.leaf=leaf
self.data=[0]*leaf*2
self.lazy=[0]*leaf*2
def indices(self,l,r):
L,R=l+self.leaf,r+self.leaf
lm=(L//(L&-L))>>1
rm=(R//(R&-R))>>1
while L<R:
... | p03182 |
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
class RAQ_RMQ:
def __init__(self, n, a=None, F=min, e=float("inf")):
self.n = n
self.n0 = 2**(n-1).bit_length()
self.e = e
self.F = F
self.lazy = [0]*(2*self.n0)
if a is None:
... | import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
class RAQ_RMQ:
def __init__(self, n, F=min, e=float("inf"), fill=None):
self.n = n
self.n0 = 2**(n-1).bit_length()
self.e = e
self.F = F
self.lazy = [0]*(2*self.n0)
if fill is None... | p03182 |
"""
遅延セグメント木（区間演算、区間更新）
dat[] の要素に モノイド M をもつ
laz[] の要素に Aut(M) をもつ（ただし作用素は「右」から作用とする）
アクセスは0-indexed, 内部のツリーは 1-indexed（つまりすべての和は tree[1]）
関数は閉区間
引数：
N: 処理する区間の長さ
op_M = operator: モノイド演算 (max, min, __add__,ラムダ式,関数定義など)
e_M: 単位元
compose: 作用素を合成させる関数 (max, min, __add__,ラムダ式,関数定義など)
funcval... | """
遅延セグメント木（区間演算、区間更新）
dat[] の要素に モノイド M をもつ
laz[] の要素に Aut(M) をもつ（ただし作用素は「右」から作用とする）
アクセスは0-indexed, 内部のツリーは 1-indexed（つまりすべての和は tree[1]）
関数は閉区間
引数：
N: 処理する区間の長さ
op_M = operator: モノイド演算 (max, min, __add__,ラムダ式,関数定義など)
e_M: 単位元
compose: 作用素を合成させる関数 (max, min, __add__,ラムダ式,関数定義など)
funcval... | p03182 |
"""
遅延セグメント木（区間演算、区間更新）
dat[] の要素に モノイド M をもつ
laz[] の要素に Aut(M) をもつ（ただし作用素は「右」から作用とする）
アクセスは0-indexed, 内部のツリーは 1-indexed（つまりすべての和は tree[1]）
関数は閉区間
引数：
N: 処理する区間の長さ
op_M = operator: モノイド演算 (max, min, __add__,ラムダ式,関数定義など)
e_M: 単位元
compose: 作用素を合成させる関数 (max, min, __add__,ラムダ式,関数定義など)
funcval... | """
遅延セグメント木（区間演算、区間更新）
dat[] の要素に モノイド M をもつ
laz[] の要素に Aut(M) をもつ（ただし作用素は「右」から作用とする）
アクセスは0-indexed, 内部のツリーは 1-indexed（つまりすべての和は tree[1]）
関数は閉区間
引数：
N: 処理する区間の長さ
op_M = operator: モノイド演算 (max, min, __add__,ラムダ式,関数定義など)
e_M: 単位元
compose: 作用素を合成させる関数 (max, min, __add__,ラムダ式,関数定義など)
funcval... | p03182 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
N0 = 2**N.bit_length()
LV = 2**N0
INF = 2**31-1
data = [0]*(2*N0)
lazy = [0]*(2*N0)
def gindex(l, r):
L = l + N0; R = r + N0
lm = (L // (L & -L)) >> 1
rm = (R // (R & -R)) >> 1
while L < R:
if R <= rm:
... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
N0 = 2**((N+1).bit_length())
INF = 10**18
data = [0]*(2*N0)
lazy = [0]*(2*N0)
def gindex(l, r):
L = l + N0; R = r + N0
lm = (L // (L & -L)) >> 1
rm = (R // (R & -R)) >> 1
while L < R:
if R <= rm:
... | p03182 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
N0 = 2**((N+1).bit_length())
INF = 10**18
data = [0]*(2*N0)
lazy = [0]*(2*N0)
def gindex(l, r):
L = l + N0; R = r + N0
lm = (L // (L & -L)) >> 1
rm = (R // (R & -R)) >> 1
while L < R:
if R <= rm:
... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
N0 = 2**((N+1).bit_length())
INF = 10**18
data = [0]*(2*N0)
lazy = [0]*(2*N0)
def gindex(l, r):
L = l + N0; R = r + N0
lm = (L // (L & -L)) >> 1
rm = (R // (R & -R)) >> 1
while L < R:
if R <= rm:
... | p03182 |
a,b=list(map(int,input().split()));print(('Yay!' if max(a,b)<=8 else ':(')) | print(('Yay!'if max(list(map(int,input().split())))<9 else':(')) | p03323 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.