input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
LP = list(map(int, input().split()))
cnt = 0
for i in range(N-2):
LA = []
LB = []
LA.append(LP[i])
LA.append(LP[i+1])
LA.append(LP[i+2])
LB = sorted(LA)
if LA[1] == LB[1]:
cnt += 1
print(cnt) | N = int(eval(input()))
LP = list(map(int, input().split()))
cnt = 0
for i in range(N-2):
LA = []
LB = []
LA = [LP[i],LP[i+1],LP[i+2]]
LB = sorted(LA)
if LA[1] == LB[1]:
cnt += 1
print(cnt) | p02988 |
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations, combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop
INF = float('inf')
NIL = - 1
""" Input
S ... | import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations, combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop
INF = float('inf')
NIL = - 1
N = int(eva... | p02988 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = sum(p[i] == (p[i + 1] + p[i] + p[i - 1] - max(p[i + 1], p[i], p[i - 1]) - min(p[i + 1], p[i], p[i - 1])) for i in range(1, n - 1))
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = sum(
p[i - 1] < p[i] < p[i + 1] or p[i - 1] > p[i] > p[i + 1]
for i in range(1, n - 1)
)
print(ans)
| p02988 |
#!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
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p02988 |
n = int(eval(input()))
L = [int(i) for i in input().split()]
Answer = int(0)
for i in range(n-2):
if L[i]<L[i+1] and L[i+1]<L[i+2]:
Answer = Answer + 1
continue
if L[i+2]<L[i+1] and L[i+1]<L[i]:
Answer = Answer + 1
continue
print(Answer)
| n = int(eval(input()))
L = [int(i) for i in input().split()]
Answer = int(0)
for i in range(n-2):
if L[i]<L[i+1] and L[i+1]<L[i+2]:
Answer = Answer + 1
if L[i+2]<L[i+1] and L[i+1]<L[i]:
Answer = Answer + 1
print(Answer)
| p02988 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstr... | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | p02988 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(1,len(p)-1,1):
if p[i+1] > p[i] > p[i-1]:
count = count +1
elif p[i+1] < p[i] < p[i-1]:
count = count +1
else:
pass
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(1,n-1,1):
if p[i+1] > p[i] > p[i-1]:
count = count +1
elif p[i+1] < p[i] < p[i-1]:
count = count +1
else:
pass
print(count) | p02988 |
cnt = 0
n = int(eval(input()))
lst = [int(i) for i in input().split()]
for i in range(n-2):
a,b,c = lst[i],lst[i+1],lst[i+2]
if (a<b and b<c) or (c<b and b<a):
cnt += 1
print(cnt) | n = int(eval(input()))
lst = list(map(int,input().split()))
cnt = 0
for i in range(1,n-1):
x,y,z = lst[i-1],lst[i],lst[i+1]
if x<=y<=z or z<=y<=x:
cnt += 1
print(cnt) | p02988 |
n = int(eval(input()))
l = list(map(int,input().split()))
cnt =0
for i in range(1,n-1):
if l[i-1]<l[i]<l[i+1] or l[i-1]>l[i]>l[i+1]:
cnt+=1
print(cnt) | def solve():
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
for i in range(1,n-1):
if p[i-1]<p[i]<p[i+1] or p[i-1]>p[i]>p[i+1]:
cnt+=1
print(cnt)
if __name__=='__main__':
solve() | p02988 |
n = int(eval(input()))
PPP = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if (PPP[i] >= PPP[i-1] and PPP[i+1] > PPP[i]) or (PPP[i-1] > PPP[i] and PPP[i] >= PPP[i+1]):
ans += 1
print(ans)
| N = int(eval(input()))
PPP = list(map(int, input().split()))
ans = 0
for i in range(1, N-1):
if (PPP[i] >= PPP[i-1] and PPP[i+1] > PPP[i]) or (PPP[i] >= PPP[i+1] and PPP[i-1] > PPP[i]):
ans += 1
print(ans)
| p02988 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
for i in range(2, n):
if p[i-2] < p[i-1] < p[i] or p[i-2] > p[i-1] > p[i]:
cnt += 1
print(cnt)
| n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
for i in range(2, n):
a = [p[i], p[i-1], p[i-2]]
a.sort()
if p[i-1] == a[1]:
cnt += 1
print(cnt)
| p02988 |
n = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(0,len(P)-2):
if P[i] < P[i+1] < P[i+2] or P[i+2] < P[i+1] < P[i]:
ans += 1
print(ans) | n = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(n-2):
if P[i]<P[i+1]<P[i+2] or P[i+2] < P[i+1] < P[i]:
ans += 1
else:
pass
print(ans) | p02988 |
n = int(eval(input()))
*p, = list(map(int, input().split()))
ans = 0
for i in range(n - 2):
if p[i] < p[i + 1] < p[i + 2] or p[i + 2] < p[i + 1]< p[i]:
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n - 2):
if p[i] < p[i + 1] < p[i + 2] or p[i + 2] < p[i + 1]< p[i]:
ans += 1
print(ans)
| p02988 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N-2):
ans += P[i] < P[i+1] < P[i+2]
ans += P[i] > P[i+1] > P[i+2]
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if p[i-1] < p[i]<p[i+1] or p[i+1] < p[i] < p[i-1]:
ans += 1
print(ans)
| p02988 |
n=int(eval(input()))
p=list(input().split())
p=[int(i) for i in p]
cnt=0
for i in range(1,n-1):
if p[i]!=max(p[i-1],max(p[i],p[i+1])) and p[i]!=min(p[i-1],min(p[i],p[i+1])):
cnt+=1
print(cnt)
| n=int(eval(input()))
p=list(input().split())
p=[int(i) for i in p]
cnt=0
for i in range(1,n-1):
if p[i]!=max(p[i-1],p[i],p[i+1]) and p[i]!=min(p[i-1],p[i],p[i+1]):
cnt+=1
print(cnt)
| p02988 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(1,n-1):
x = p[i-1:i+2]
x.sort()
if x[1] == p[i]:
ans+=1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(1,n-1):
t = p[i-1:i+2]
if max(t)>t[1]>min(t):
ans+=1
print(ans) | p02988 |
n = int(eval(input()))
p = list(map(int , input().split()))
meet_condition = 0
for i in range(n-2):
X =[]
for j in range(3):
X.append(p[i+j])
if p[i+1] != max(X) and p[i+1] != min(X):
meet_condition += 1
print(meet_condition) | n = int(eval(input()))
p = list(map(int , input().split()))
meet_condition = 0
for i in range(1 , n-1):
if p[i-1] < p[i] < p[i+1] or p[i-1] > p[i] > p[i+1]:
meet_condition += 1
print(meet_condition) | p02988 |
n = int(eval(input()))
pn = list(map(int,input().split()))
count = 0
for i in range(1,n-1):
if (pn[i] > pn[i-1] and pn[i] < pn[i+1]) or (pn[i] < pn[i-1] and pn[i] > pn[i+1]):
count += 1
print(count) | count = 0
n = int(eval(input()))
p = list(map(int,input().split()))
for i in range(n-2):
if p[i] < p[i+1] < p[i+2]:
count += 1
elif p[i] > p[i+1] > p[i+2]:
count += 1
print(count) | p02988 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(1,N-1):
if P[i-1]<P[i]<P[i+1] or P[i-1]>P[i]>P[i+1]:
ans += 1
print(ans) | n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
for i in range(1,n-1):
if (p[i-1]<p[i] and p[i]<p[i+1]) or (p[i+1]<p[i] and p[i]<p[i-1]):
ans+=1
print(ans)
| p02988 |
def solve(string):
n, c = string.split()
n, c = int(n), list(c)
wi, ri = 0, n - 1
while wi < n and c[wi] == "R":
wi += 1
while ri >= 0 and c[ri] == "W":
ri -= 1
ans = 0
while wi < n and ri >= 0 and wi < ri:
c[wi], c[ri], ans = c[ri], c[wi], ans + 1
... | def solve(string):
_, c = string.split()
r = c.count("R")
return str(c[:r].count("W"))
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
| p02597 |
# 初期入力
from bisect import bisect_left
import sys
#input = sys.stdin.readline #文字列では使わない
N = int(eval(input()))
c =input().strip()
ans =0
w =[i for i, x in enumerate(c) if x == 'W']
r =[i for i, x in enumerate(c) if x == 'R']
w_num =len(w) #全体でWの数
r_num =len(r) #全体でRの数
ans =bisect_left(r,r_num)
print((r_n... |
# 初期入力
from bisect import bisect_left
import sys
#input = sys.stdin.readline #文字列では使わない
N = int(eval(input()))
c =input().strip()
ans =0
r =[i for i, x in enumerate(c) if x == 'R'] #全体の中でRのIndex
r_num =len(r) #全体でRの数
ans =bisect_left(r,r_num) #呪われないためのRとWの境界
print((r_num -ans)) #境界より右側のRの数 | p02597 |
import sys
input = sys.stdin.readline
n=int(eval(input()))
s=list(input().strip())
count = 0
for i in range(n):
if s[i]=='W':
for j in range(n-1,i,-1):
if s[j]=='R':
s[i],s[j]=s[j],s[i]
count+=1
break
else:
break
... | import sys
input = sys.stdin.readline
n=int(eval(input()))
s=list(input().strip())
count = 0
cw = s.count('W')
cr = n-cw
for i in range(cr):
if s[i]=='W':
count+=1
print(count)
| p02597 |
# -*- coding: utf-8 -*-
import sys
def main():
N = int( sys.stdin.readline() )
c_list = list(sys.stdin.readline().rstrip())
cnt = 0
L = 0
R = len(c_list) - 1
while L < R:
if (c_list[L] == "W") and (c_list[R] == "R"):
c_list[L], c_list[R] = c_list[R], c... | # -*- coding: utf-8 -*-
import sys
def main():
N = int( sys.stdin.readline() )
c_list = list(sys.stdin.readline().rstrip())
num_R = c_list.count("R")
cnt = 0
for i in range(num_R):
if c_list[i] == "W":
cnt += 1
print(cnt)
if __name__ == "__m... | p02597 |
import re
N = int(input().strip())
# C = [c for c in input().strip()]
C = input().strip()
G = re.compile(r"^R*W*$")
cnt = 0
def rep(i, c, r, w):
if i == r:
return "W"
elif i == w:
return "R"
else:
return c
while not G.match(C):
cnt += 1
r = C.rfind("R... | N = int(input().strip())
C = [c for c in input().strip()]
if "W" not in C or "R" not in C:
print((0))
import sys; sys.exit(0)
cnt = 0
i = 0
j = len(C) - 1
while i < j:
while C[i] == "R":
i += 1
while C[j] == "W":
j -= 1
if i > j:
break
cnt += 1
C... | p02597 |
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
s = list(ins())
t = sorted(s)
ans = 0
for i in range(n):
... | import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
s = list(ins())
n = s.count("R")
t = sorted(s)
ans = 0
for ... | p02597 |
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
s = list(ins())
n = s.count("R")
t = sorted(s)
ans = 0
for ... | import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
s = list(ins())
n = s.count("R")
ans = 0
for i in range(n):
... | p02597 |
n,s,*w=open(0)
r=[-1]
n=int(n)
a=i=0
while i<n:
if'W'>s[i]:r+=i,
else:w+=i,
i+=1
for w in w:
if r.pop()>w:a+=1
else:break
print(a) | _,s=open(0)
print((s[:s.count('R')].count('W'))) | p02597 |
import sys
readline = sys.stdin.readline
from collections import deque
def solve():
N = int(readline())
C = readline().rstrip()
R, W = 'R', 'W'
reds = deque(i for i in range(len(C)) if C[i] == 'R')
whites = deque(i for i in range(len(C)) if C[i] == 'W')
count = 0
while len(wh... | import sys
readline = sys.stdin.readline
def solve():
N = int(readline())
C = readline().rstrip()
reds = [i for i in range(len(C)) if C[i] == 'R']
whites = [i for i in range(len(C)) if C[i] == 'W']
i = 0
n = min(len(reds), len(whites))
while i < n and reds[-1-i] > whites[i]:
... | p02597 |
import sys
sys.setrecursionlimit(10**6)
def main(input, print):
N = int(input())
C = list(input().strip())
last = N
ans = 0
for i in range(N):
if C[i] == 'W':
for j in reversed(range(i+1, last)):
if C[j] == 'R':
ans += 1
... | import sys
sys.setrecursionlimit(10**6)
def main(input, print):
N = int(input())
C = list(input().strip())
last = N
ans = 0
for i in range(N):
if C[i] == 'W':
has_r = False
for j in reversed(range(i+1, last)):
if C[j] == 'R':
... | p02597 |
from itertools import accumulate
from math import ceil
N = int(eval(input()))
A = list(map(int, input().split()))
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.bit = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.bit... | from itertools import accumulate
from math import ceil
N = int(eval(input()))
A = list(map(int, input().split()))
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.bit = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.bit... | p03275 |
import sys
from itertools import accumulate
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
class BIT:
def __init__(self,init_value):
self.n = len(init_value)
self.tree = [0]*(self.n+1)
for i in range... | import sys
from itertools import accumulate
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
class BIT:
def __init__(self,init_value):
self.n = len(init_value)
self.tree = [0]*(self.n+1)
for i in range... | p03275 |
import sys
from itertools import accumulate
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
class BIT:
def __init__(self,init_value):
self.n = len(init_value)
self.tree = [0]*(self.n+1)
for i in range... | # 座標圧縮した場合
import sys
from itertools import accumulate
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
class BIT:
def __init__(self,init_value):
self.n = len(init_value)
self.tree = [0]*(self.n+1)
... | p03275 |
from itertools import accumulate
from math import ceil
N = int(eval(input()))
A = list(map(int, input().split()))
if N == 1:
print((A[0]))
exit()
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.bit = [0] * (n + 1)
def sum(self, i):
s ... | import math
n = int(input())
lst = list(map(int, input().split()))
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def... | p03275 |
from itertools import accumulate
def add(B,a,n):#リストに値を追加する関数
x = a
while x <= n:
B[x] += 1
x += x&(-x)
def sums(B,a):#a番目までの和
x = a
S = 0
while x != 0:
S += B[x]
x -= x&(-x)
return S
def invnumber(n, S):# #{(i,j)| i<j and S[i]<=S[j]}
B = [... | def add(B,a,n):#リストに値を追加する関数
x = a
while x <= n:
B[x] += 1
x += x&(-x)
def sums(B,a):#a番目までの和
x = a
S = 0
while x != 0:
S += B[x]
x -= x&(-x)
return S
def invnumber(n, S):# #{(i,j)| i<j and S[i]<=S[j]}
B = [0]*(n*2 + 1)
invs = 0
fo... | p03275 |
from bisect import bisect_left
from math import ceil
# >= 3.3
# from collections.abc import Sequence
# < 3.3
from collections import Sequence
class LazySequence(Sequence):
def __init__(self, f, n):
self.f = f
self.n = n
def __len__(self):
return self.n
def __get... |
from bisect import bisect_left
from math import ceil
import sys
if sys.version_info[0:2] >= (3, 3):
from collections.abc import Sequence
else:
from collections import Sequence
class LazySequence(Sequence):
def __init__(self, f, n):
self.f = f
self.n = n
def __len__(sel... | p03275 |
class BIT:
"""1-indexed BIT
"""
def __init__(self, size: int):
"""サイズを指定して BIT を初期化します。
"""
self.__size = size
self.__bit = [0] * (self.__size+1)
def add(self, idx: int, val: int):
"""位置 idx (1-indexed) に値 val をたす。
:param idx: 値を追加したいインデックス
... |
def median_of_medians(N: int, A: list)->int:
def search(c):
bar = N
r = 0
res_nega = 0
dp_arr = [0]*(2*N+1)
for i in range(N):
dp_arr[bar] += 1
if A[i] < c:
r += dp_arr[bar]
bar += 1
else:
... | p03275 |
n = int(eval(input()))
A = list(map(int, input().split()))
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self,... | n = int(eval(input()))
A = list(map(int, input().split()))
# n = 4
# A = [i+1 for i in range(n)]
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -... | p03275 |
n = int(eval(input()))
a = list(map(int, input().split()))
x = list(sorted(set(a)))
n_sub = n * (n + 1) // 2
Li = -1
Ri = len(x) - 1
while Ri > Li + 1:
i = (Li + Ri) // 2
xi = x[i]
UorD = [1 if ak >= xi else -1 for ak in a]
cnt_sum = [0] * (2 * n + 1)
cumsum = 0
cnt_sum[cumsum + n] =... | n = int(eval(input()))
a = list(map(int, input().split()))
x = list(sorted(set(a)))
n_sub = n * (n + 1) // 2
Li = 0
Ri = len(x)
while Ri > Li + 1:
i = (Li + Ri) // 2
xi = x[i]
UorD = [1 if ak >= xi else -1 for ak in a]
cnt_sum = [0] * (2 * n + 1)
cumsum = 0
cnt_sum[cumsum + n] = 1
... | p03275 |
n = int(eval(input()))
a = list(map(int, input().split()))
x = list(sorted(set(a)))
n_sub = n * (n + 1) // 2
Li = 0
Ri = len(x)
while Ri > Li + 1:
i = (Li + Ri) // 2
xi = x[i]
UorD = [1 if ak >= xi else -1 for ak in a]
cnt_sum = [0] * (2 * n + 1)
cumsum = 0
cnt_sum[cumsum + n] = 1
... | def f(n, a):
x = list(sorted(set(a)))
n_sub_half = n * (n + 1) // 2 // 2
n_plus_minus = n * 2 + 1
Li = 0
Ri = len(x)
while Ri > Li + 1:
i = (Li + Ri) // 2
xi = x[i]
cnt_sum = [0] * n_plus_minus
cumsum = 0
cnt_sum[cumsum] = 1
judge = 0
... | p03275 |
def cumsum(li):
ret = []
sum = 0
for i in li:
sum += i
ret.append(sum)
return ret
class BinaryIndexedTree:
# http://hos.ac/slides/20140319_bit.pdf
def __init__(self, size):
"""
:param int size:
"""
self._bit = [0 for _ in range(siz... | def bisect_right_callable(fn, x, lo, hi):
"""
lo から hi-1 のうち、fn の結果が x 以下となる、最も右の値 + 1
bisect.bisect_right と同じ
https://docs.python.org/ja/3/library/bisect.html
:param callable fn:
:param x:
:param int lo: 最小値
:param int hi: 最大値 + 1
:return: lo <= ret <= hi
"""
whil... | p03275 |
#!/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
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/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
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p03275 |
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
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, ... | p03275 |
class BIT:
'''
0-indexed
'''
def __init__(self, N):
self.size = N
self.tree = [0] * (N + 1)
self.depth = n.bit_length()
def _bitsum(self, i):
ret = 0
while i:
ret += self.tree[i]
i ^= i & -i
return ret
def ... | class BIT:
'''
0-indexed
'''
def __init__(self, N):
self.size = N
self.tree = [0] * (N + 1)
self.depth = n.bit_length()
def _bitsum(self, i):
ret = 0
while i:
ret += self.tree[i]
i ^= i & -i
return ret
def ... | p03275 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class BIT:
# index 1~
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
class BIT:
# index 1~
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
... | p03275 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class BIT:
# index 1~
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
def sub_problem(x):
S = [0] * (N + 1)
for i in range(N):
S[i + 1] = S[i] + 1 if A[i] >= x else S[i] - 1
geta = abs(min(S)) + 1
for i in range(N + 1):
S[i] += geta
forward = 0
size = max(S)
bit = [... | p03275 |
import itertools
n=int(eval(input()))
lst=list(map(int,input().split()))
ans=[]
for c in list(itertools.combinations(list(range(len(lst)+1)),2)):
ans.append(lst[c[0]:c[1]][(c[1]-c[0])//2])
print((sorted(ans)[len(ans)//2]))
| n=int(eval(input()))
lst=list(map(int,input().split()))
ans=[]
for i in range(1,n+1):
for e in range(0,n+1-i):
ans.append(sorted(lst[e:e+i])[i//2])
print((sorted(ans)[len(ans)//2])) | p03275 |
N=int(eval(input()))
A=list(map(int,input().split()))
A_sort=sorted(A)
ANSMIN=0
ANSMAX=N-1
cums=[None]*(N+1)
def midup(x):
cums[0]=0
for i in range(N):
if A[i]>=x:
cums[i+1]=cums[i]+1
else:
cums[i+1]=cums[i]-1
MINS=min(cums)
MAXS=max(cums)
... | N=int(eval(input()))
A=list(map(int,input().split()))
A_sort=sorted(A)
ANSMIN=0
ANSMAX=N-1
cums=[None]*(N+1)
def midup(x):
cums[0]=0
for i in range(N):
if A[i]>=x:
cums[i+1]=cums[i]+1
else:
cums[i+1]=cums[i]-1
MINS=min(cums)
MAXS=max(cums)
... | p03275 |
def main():
def add(i,x):
while i<=size:
tree[i]+=x
i+=i&-i
n,*a=list(map(int,open(0).read().split()))
size=n-~n
m=n*-~n//2+1>>1
ng=max(a)+1
ok=0
while ng-ok>1:
mid=(ok+ng)//2
tree=[0]*-~size
c=n+1
s=0
add... | def main():
def add(i,x):
while i<=size:
tree[i]+=x
i+=i&-i
n,*a=list(map(int,open(0).read().split()))
size=n-~n
m=n*-~n//2+1>>1
ng=max(a)+1
ok=0
while ng-ok>1:
mid=ok+ng>>1
tree=[0]*-~size
c=n+1
s=0
add(c... | p03275 |
from itertools import accumulate
N = int(eval(input()))
A = list(map(int, input().split()))
NN = ((N + 1) * N // 2 + 1) // 2
def ok(x):
S = list(accumulate(1 if a >= x else -1 for a in A))
ms = min(min(S), 0)
S = [1] + [s - ms + 1 for s in S]
L = max(S) + 1
B = [0] * L
c = 0
for s... | N = int(eval(input()))
A = list(map(int, input().split()))
NN = ((N + 1) * N // 2 + 1) // 2
def ok(x):
B = [0] * (2 * N + 1)
res, cum, cur = 0, 0, 0
B[0] += 1
for a in A:
if a >= x:
cum += 1
cur += B[cum]+1
else:
cur -= B[cum]-1
... | p03275 |
import math
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | import math
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | p03275 |
import math
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] ... | p03275 |
#!/usr/bin/env python3
import sys
import itertools
import collections
from itertools import accumulate
import math
INF = float("inf")
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s +... | #!/usr/bin/env python3
import sys
from itertools import accumulate
INF = float("inf")
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
re... | p03275 |
n = int(eval(input()))
l = []
for i in range(n):
x= list(map(int, input().split()))
l.append(x)
def find(ele, l):
cc = 0
ans = []
for i in l:
if i==ele:
ans.append(cc)
cc+=1
return ans
c = n-1
for i in l[::-1]:
if c==n-1:
m = max(i)
... | n = int(eval(input()))
ans = [[0]*3 for xxx in range(n)]
for i in range(n):
a,b,c = list(map(int, input().split()))
if i==0:
ans[0][0] = a
ans[0][1] = b
ans[0][2] = c
continue
ans[i][0] += max(ans[i-1][1], ans[i-1][2]) + a
ans[i][1] += max(ans[i-1][2], ans[i-1]... | p03162 |
n = int(eval(input()))
table = []
for _ in range(n):
table.append([int(v) for v in input().split()])
dp = [0] * 3
for i in range(n):
dp_n = [0] * 3
a, b, c = table[i]
a0 = dp[0]
b0 = dp[1]
c0 = dp[2]
dp_n[0] = max(b0, c0) + a
dp_n[1] = max(c0, a0) + b
dp_n[2]... | def main():
N = int(eval(input()))
table = []
for _ in range(N):
a, b, c = list(map(int, input().split()))
table.append((a, b, c))
dp = [0] * 3
for i in range(N):
a, b, c = table[i]
a0 = dp[0]
b0 = dp[1]
c0 = dp[2]
dp[0] =... | p03162 |
N = int(eval(input()))
vacation = []
for i in range(N):
vacation.append(list(map(int, input().split())))
activities = 3
schedules = [[None for _ in range(activities)] for _ in range(N)]
schedules[0] = vacation[0]
for i in range(1, N):
for j in range(activities):
schedules[i][j] = max(schedu... | def main():
n = int(eval(input()))
matrix = []
tb = [[0] * 4 for _ in range(n + 1)]
for _ in range(n):
matrix.append([int(e) for e in input().split()])
for i in range(1, n + 1):
for j in range(1, 4):
for l in range(1, 4):
if j == l: continue... | p03162 |
n = int(eval(input()))
felicidade = []
for x in range(n):
felicidade.append(list(map(int,input().split())))
DP = [0,0,0]
if n == 1:
print((max(felicidade[0])))
else:
for x in range(3):
DP[x] = felicidade[0][x]
for dia in range(1,n):
m = [0] * 3
for x ... | nDays = int(eval(input()))
today = [int(x) for x in input().split()]
for i in range(nDays - 1):
tomorrow = [int(x) for x in input().split()]
tomorrow[0] += max(today[1], today[2])
tomorrow[1] += max(today[0], today[2])
tomorrow[2] += max(today[0], today[1])
today = tomorrow
print((max(... | p03162 |
N = int(eval(input()))
abc = [tuple(map(int, input().split())) for _ in range(N)]
dp = [[0] * 3 for _ in range(N+1)] # どの行動を選んだか残しておくための３、
for i in range(N):
for j in range(3): # 昨日の行動
for k in range(3):
if j == k:
continue # 昨日と同じ行動はとれないので飛ばす
dp[i+1][k] = ... | N = int(eval(input()))
dp = [[0 for _ in range(3)] for _ in range(N+1)]
#dp[i][j]:i日目に活動a~cを行ったときに得られる最高の累積幸福度
for i in range(1, N+1):
a,b,c = list(map(int, input().split()))
dp[i][0] = a + max(dp[i-1][1], dp[i-1][2])
dp[i][1] = b + max(dp[i-1][0], dp[i-1][2])
dp[i][2] = c + max(dp[i-1][0], d... | p03162 |
N = int(eval(input()))
A_B_C = []
for i in range(N):
A_B_C.append(tuple(map(int, input().split())))
DP = [[0]*3 for i in range(N)]
DP[0][0] = A_B_C[0][0]
DP[0][1] = A_B_C[0][1]
DP[0][2] = A_B_C[0][2]
for i in range(1, N):
for j in range(3):
j_a = (j + 1) % 3
j_b = (j + 2) % 3
... | N = int(eval(input()))
F = [tuple(map(int, input().split())) for _ in range(N)]
DP = [0] * 3
for f in F:
D = [0] * 3
S = {0, 1, 2}
for i in range(3):
S.remove(i)
for s in S:
D[i] = max(D[i], f[i] + DP[s])
S.add(i)
DP = D
print((max(DP))) | p03162 |
N = int(eval(input()))
ABC = []
for _ in range(N):
a,b,c = list(map(int,input().split()))
ABC.append((a,b,c))
dpA = [ABC[0][0]]*N
dpB = [ABC[0][1]]*N
dpC = [ABC[0][2]]*N
for i in range(1, N):
dpA[i] = max(dpB[i-1] + ABC[i][0], dpC[i-1] + ABC[i][0])
dpB[i] = max(dpA[i-1] + A... | N = int(eval(input()))
for i in range(N):
a,b,c = list(map(int,input().split()))
if i == 0:
preA = a
preB = b
preC = c
else:
A = max(preB + a, preC + a)
B = max(preA + b, preC + b)
C = max(p... | p03162 |
n = int(eval(input()))
a = [0] * (n + 1)
b = [0] * (n + 1)
c = [0] * (n + 1)
for i in range(1, n + 1):
a[i], b[i], c[i] = list(map(int, input().split()))
a[i] = a[i] + max(b[i - 1], c[i - 1])
b[i] = b[i] + max(c[i - 1], a[i - 1])
c[i] = c[i] + max(a[i - 1], b[i - 1])
print((max(a[n], b[n], c[n]... | n = int(eval(input()))
hya, hyb, hyc = 0, 0, 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
ha = a + max(hyb, hyc)
hb = b + max(hyc, hya)
hc = c + max(hya, hyb)
hya =ha
hyb =hb
hyc =hc
print((max(ha, hb, hc))) | p03162 |
n=int(eval(input()))
a,b,c = list(map(int,input().split()))
d={'a':a,'b':b,'c':c}#初期化
for i in range(n-1):
a,b,c = list(map(int,input().split()))
da,db,dc=d['a'],d['b'],d['c']
d['a'] = a +max(db,dc)
d['b'] = b +max(da,dc)
d['c'] = c +max(da,db)
print((max(d.values()))) | N = int(eval(input()))
A,B,C=[],[],[]
for i in range(N):
a,b,c = list(map(int,input().split()))
A.append(a)
B.append(b)
C.append(c)
dpa,dpb,dpc = A[0],B[0],C[0]
for i in range(1,N):
a,b,c = dpa,dpb,dpc
dpa = max(c,b)+A[i]
dpb = max(c,a)+B[i]
dpc = max(a,b)+C[i]
print((max(dp... | p03162 |
n = int(eval(input()))
eff = [list(map(int, input().split())) for _ in range(n)]
dp = [[float('-inf')] * 3 for _ in range(n)]
from copy import deepcopy
dp[0] = deepcopy(eff[0])
for i in range(1, n):
for yi in range(3):
for ti in range(3):
if yi != ti:
dp[i][ti]... | from copy import deepcopy
n = int(eval(input()))
eff = [list(map(int, input().split())) for _ in range(n)]
dp = [[float('-inf')] * 3 for _ in range(n)]
dp[0] = deepcopy(eff[0])
for i in range(1, n):
for yi in range(3):
for ti in range(3):
if yi != ti:
dp[i][ti] = m... | p03162 |
from copy import deepcopy
n = int(eval(input()))
eff = [list(map(int, input().split())) for _ in range(n)]
dp = [[float('-inf')] * 3 for _ in range(n)]
dp[0] = deepcopy(eff[0])
for i in range(1, n):
for yi in range(3):
for ti in range(3):
if yi != ti:
dp[i][ti] = m... | n = int(eval(input()))
da = db = dc = 0
for i in range(n):
a, b, c = list(map(int, input().split()))
da, db, dc = max(db, dc) + a, max(da, dc) + b, max(da, db) + c
print((max(da, db, dc))) | p03162 |
# coding: utf-8
# import sys
# input = sys.stdin.readline
def dp_happiness(N):
yesterday_a, yesterday_b, yesterday_c = 0, 0, 0
for _ in range(N):
a, b, c = list(map(int, input().split()))
today_a = a + max(yesterday_b, yesterday_c)
today_b = b + max(yesterday_c, yesterday_a)
... | # coding: utf-8
import sys
input = sys.stdin.readline
def dp_happiness(N):
yesterday_a, yesterday_b, yesterday_c = 0, 0, 0
for _ in range(N):
a, b, c = list(map(int, input().split()))
today_a = a + max(yesterday_b, yesterday_c)
today_b = b + max(yesterday_c, yesterday_a)
... | p03162 |
n = int(eval(input()))
a = ([list(map(int, input().split())) for _ in range(n)])
a.insert(0,[0,0,0])
dp = [[0,0,0] for _ in range(n+1)]
for i, a in enumerate(a):
dp_1 = dp[i-1]
dp[i][0] = max(dp_1[1], dp_1[2]) + a[0]
dp[i][1] = max(dp_1[0], dp_1[2]) + a[1]
dp[i][2] = max(dp_1[0], dp_1[1]) + a[2]
... | def main():
n = int(eval(input()))
abc = []
for _ in range(n):
abc.append(tuple(map(int, input().split())))
dp = [[0,0,0] for _ in range(n)]
dp[0][0] = abc[0][0]
dp[0][1] = abc[0][1]
dp[0][2] = abc[0][2]
for i in range(1, n):
dp[i][0] = max(dp[i - 1][1], dp[i ... | p03162 |
def main():
n = int(eval(input()))
abc = []
for _ in range(n):
abc.append(tuple(map(int, input().split())))
dp = [[0,0,0] for _ in range(n)]
dp[0][0] = abc[0][0]
dp[0][1] = abc[0][1]
dp[0][2] = abc[0][2]
for i in range(1, n):
dp[i][0] = max(dp[i - 1][1], dp[i ... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
colA, colB, colC = list(map(int, input().split()))
for i1 in range(1, n):
a, b, c = list(map(int, input().split()))
colA, colB, colC = a + max(colB, colC), b + max(colA, colC), c + max(colA, colB)
print((m... | p03162 |
import sys
input=sys.stdin.readline
def main():
N = int(eval(input()))
a1,b1,c1 = 0,0,0
for _ in range(N):
a,b,c = list(map(int, input().split()))
a0,b0,c0 = a1,b1,c1
a1 = max(b0, c0) + a # b or c => a
b1 = max(a0, c0) + b # a or c => b
c1 = max(a0, b0) + ... | import sys
input=sys.stdin.readline
def main():
N = int(eval(input()))
a1,b1,c1 = 0,0,0
for _ in range(N):
a,b,c = list(map(int, input().split()))
a0,b0,c0 = a1,b1,c1
a1 = a + (b0 if b0 > c0 else c0)
b1 = b + (a0 if a0 > c0 else c0)
c1 = c + (a0 if a0 > b0... | p03162 |
# EduDPC - Vacation
import sys
input = sys.stdin.readline
n = int(eval(input()))
arr = [list(map(int, input().rstrip().split())) for _ in range(n)]
dp = [[0, 0, 0] for i in range(n)]
dp[0] = arr[0]
for i in range(1, n):
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + arr[i][0]
dp[i][1] = max(dp[i - 1][0... | # dpC - Vacation
# 貰うDP
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(n))
dp = [[0] * 3 for _ in range(n)]
dp[0] = A[0]
for i in range(1, n): # i-th day
for j in range(3): # yesterday
... | p03162 |
N = int(eval(input()))
dp = [[0] * 3 for _ in range(N)]
dp[0][0], dp[0][1], dp[0][2] = list(map(int, input().split()))
for i in range(1,N):
abc = list(map(int, input().split()))
for j,k,l in ((0,1,2), (1,0,2), (2, 0, 1)):
dp[i][j] = abc[j] + max(dp[i-1][k], dp[i-1][l])
print((max(dp[N-1]))) | N = int(eval(input()))
x, y, z = list(map(int, input().split()))
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
x, y, z = a + max(y, z), b + max(x, z), c + max(x, y)
print((max(x,y,z))) | p03162 |
n=int(eval(input()))
a=[]
for i in range(n):
a.append([0,0,0])
a[i][0],a[i][1],a[i][2]=list(map(int,input().split()))
a.reverse()
b=[a[0][0],a[0][1],a[0][2]]
for i in range(1,n):
b1=b[:]
b[0]=max(a[i][0]+b1[1],a[i][0]+b1[2])
b[1]=max(a[i][1]+b1[0],a[i][1]+b1[2])
b[2]=max(a[i][2]+b1[1]... | n=int(eval(input()))
a=[]
for i in range(n):
a.append([0,0,0])
a[i][0],a[i][1],a[i][2]=list(map(int,input().split()))
b=[a[0][0],a[0][1],a[0][2]]
for i in range(1,n):
b1=b[:]
b[0]=max(a[i][0]+b1[1],a[i][0]+b1[2])
b[1]=max(a[i][1]+b1[0],a[i][1]+b1[2])
b[2]=max(a[i][2]+b1[1],a[i][2]+b1[0... | p03162 |
N = int(eval(input()))
happy_list = [list(map(int, input().split())) for n in range(N)]
def chmax(a, b):
if a > b:
return a
else:
return b
dp_list = [[0, 0, 0]]
for n in range(1, N+1):
tmp = [0, 0, 0]
tmp[1] = chmax(tmp[1], dp_list[n-1][0] + happy_list[n-1][1])
tmp[2] = ch... | N = int(eval(input()))
abc_list = [list(map(int, input().split())) for _ in range(N)]
happy_list = [[0, 0, 0]] # n日目にa|b|cを選んだときの幸福のそこまでの最大値
# before_act = -1 # a: 0, b: 1, c: 2
for n in range(N):
before_happy_a, before_happy_b, before_happy_c = happy_list[-1]
a, b, c = abc_list[n]
tmp_happy_a = ma... | p03162 |
N = int(eval(input()))
a, b, c = [0] * N, [0] * N, [0] * N
for i in range(N):
a[i], b[i], c[i] = list(map(int, input().split()))
dp = [[0] * 3 for _ in range(N)]
dp[0] = [a[0], b[0], c[0]]
for i in range(N - 1):
dp[i + 1][0] = max(dp[i][1] + a[i + 1], dp[i][2] + a[i + 1])
dp[i + 1][1] = max(dp... | n= int(eval(input()))
a=[0]*n
b=[0]*n
c=[0]*n
for i in range(n):
a[i],b[i],c[i]=list(map(int, input().split()))
dp = [[0] * 3 for _ in range(n)]
dp[0] = [a[0], b[0], c[0]]
for i in range(1,n):
dp[i][0]=max(a[i]+dp[i-1][1],a[i]+dp[i-1][2])
dp[i][1]=max(b[i]+dp[i-1][0],b[i]+dp[i-1][2])
dp... | p03162 |
N = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(N)]
dp = [[0 for i in range(3)] for j in range(N+1)]
for i in range(1, N+1):
for j in range(3):
for k in range(3):
if j != k:
dp[i][j] = max(dp[i][j], dp[i-1][k]+l[i-1][k])
print((max(dp[N]... | N = int(eval(input()))
dp = [[0 for i in range(3)] for j in range(N+1)]
for i in range(1, N+1):
hapiness = list(map(int, input().split()))
for j in range(3):
for k in range(3):
if j != k:
dp[i][j] = max(dp[i][j], dp[i-1][k] + hapiness[k])
print((max(dp[N][0], dp[N... | p03162 |
N = int(eval(input()))
dp = [[0]*3 for i in range(N+1)]
for i in range(1, N+1):
acitivities = list(map(int, input().split()))
for j in range(3):
for k in range(3):
if j == k :
continue
dp[i][j] = max(dp[i][j], dp[i-1][k]+acitivities[j])
print((max(dp[N]))) | N = int(eval(input()))
dp = [[0]*3 for i in range(N+1)]
A = [list(map(int, input().split())) for i in range(N)]
for i in range(N):
for j in range(3):
for k in range(3):
if j == k :
continue
dp[i][j] = max(dp[i][j], dp[i-1][k]+A[i][j])
print((max(dp[N-1]))) | p03162 |
n=int(eval(input()))
ma,mb,mc=0,0,0
for _ in range(n):
a,b,c=list(map(int,input().split()))
x,y,z=ma,mb,mc
ma=a+max([y,z])
mb=b+max([z,x])
mc=c+max([x,y])
print((max([ma,mb,mc]))) | def main():
n, *abc = list(map(int, open(0).read().split()))
dp = [[0, 0, 0] for _ in range(n + 1)]
for i, (a, b, c) in enumerate(zip(abc[::3], abc[1::3], abc[2::3]), 1):
x, y, z = dp[i - 1]
dp[i] = [a + max(y, z), b + max(z, x), c + max(x, y)]
ans = max(dp[-1])
print(ans)
... | p03162 |
n = int(eval(input()))
dp = [[0 for _ in range(3)] for _ in range(n+1)]
ls = [[1,2],[0,2],[0,1]]
for i in range(1,n+1):
day = list(map(int,input().split()))
dp[i][0] = day[0] + max(dp[i-1][1],dp[i-1][2])
dp[i][1] = day[1] + max(dp[i-1][0],dp[i-1][2])
dp[i][2] = day[2] + max(dp[i-1][0],dp[i-1][1]... | N = int(eval(input()))
ls = [[0 for i in range(3)] for i in range(N)]
for i in range(N):
ls[i] = list(map(int,input().split()))
# dp[i][j] -> i-1日目にjの仕事をしたときの i 日目の幸福度の総和
dp = [ [0 for i in range(3)] for i in range(N)]
for i in range(3):
dp[0][i] = ls[0][i]
for i in range(1,N):
for j in range(3):
... | p03162 |
N = int(eval(input()))
act = list(list(map(int, input().split())) for _ in range(N))
dp = [[0 for _ in range(3)] for _ in range(N + 1)]
for i in range(N):
dp[i + 1][0] = max(dp[i + 1][0], act[i][0] + max(dp[i][1], dp[i][2]))
dp[i + 1][1] = max(dp[i + 1][1], act[i][1] + max(dp[i][0], dp[i][2]))
dp[i + 1][2] ... | import sys
input = sys.stdin.readline
N = int(eval(input()))
act = [tuple(map(int, input().split())) for _ in range(N)]
dp = [[0] * 3 for _ in range(N)]
dp[0][0] = act[0][0]
dp[0][1] = act[0][1]
dp[0][2] = act[0][2]
for i in range(N - 1):
for j in range(3):
dp[i + 1][j] = max(dp[i][(j + 1) % 3], dp[i][(... | p03162 |
n=int(eval(input()))
a=[[]]
for i in range(n):
a.append([int(i) for i in input().split()])
dp=[[0,0,0] for i in range(n+1)]
for i in range(1,n+1):
for j in range(3):
dp[i][j]=a[i][j]+max(dp[i-1][k] for k in range(3) if k!=j)
print((max(dp[n]))) | n=int(eval(input()))
lst=[]
for i in range(n):
lst.append([int(i) for i in input().split()])
dp=[[0,0,0] for i in range(n)]
dp[0]=lst[0]
for i in range(1,n):
for j in range(3):
dp[i][j]=lst[i][j]+max(dp[i-1][k] for k in range(3) if k!=j)
print((max(dp[n-1])))
| p03162 |
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
a = [[0]*3 for i in range(N)]
for i in range(N):
a[i] = [int(i) for i in input().split()]
def f(n, i):
if n ==0:
return a[0][i]
i1 = (i+1) % 3
i2 = (i+2) % 3
if F[n][i]:
return F[n][i]
F[n][i] = max(f(n-1, i1), f(n-... | N = int(eval(input()))
a = [[0]*3 for i in range(N)]
for i in range(N):
a[i] = [int(i) for i in input().split()]
def summerVacation(n, i):
if n ==0:
dp[n][i] = a[n][i]
return
i1 = (i+1) % 3
i2 = (i+2) % 3
dp[n][i] = max( dp[n-1][i1], dp[n-1][i2] ) + a[n][i]
dp =[[None]*3 for _ ... | p03162 |
n = int(eval(input()))
a = [0]
b = [0]
c = [0]
for i in range(n):
aa,bb,cc = list(map(int,input().split()))
a.append(max(b[i] + aa, c[i] + aa))
b.append(max(a[i] + bb, c[i] + bb))
c.append(max(a[i] + cc, b[i] + cc))
print((max(a[-1], b[-1], c[-1])))
| def main():
n = int(eval(input()))
a = [0]
b = [0]
c = [0]
for i in range(n):
aa,bb,cc = list(map(int,input().split()))
a.append(max(b[i] + aa, c[i] + aa))
b.append(max(a[i] + bb, c[i] + bb))
c.append(max(a[i] + cc, b[i] + cc))
print((max(a[-1], b[-1], c[-1])))
main(... | p03162 |
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 6)
N = int(eval(input()))
plans = []
for _ in range(N):
a, b, c = list(map(int, input().split()))
plans.append((a, b, c))
@lru_cache(maxsize=None)
def max_utility_at(day, i):
candidates = [
(1, 2),
(0, 2),
... | N = int(eval(input()))
plans = []
for _ in range(N):
a, b, c = list(map(int, input().split()))
plans.append((a, b, c))
memo = [[0] * (N + 1) for _ in range(3)]
for day, plan in enumerate(plans, 1):
memo[0][day] = max(memo[1][day - 1], memo[2][day - 1]) + plan[0]
memo[1][day] = max(memo[0][day... | p03162 |
#!/usr/bin/env python3
#dp3 #Vacation
n = int(eval(input()))
dpa = [0]*n
dpb = [0]*n
dpc = [0]*n
a,b,c = list(map(int,input().split()))
dpa[0] = a
dpb[0] = b
dpc[0] = c
for i in range(1,n):
a,b,c = list(map(int,input().split()))
dpa[i] = max(dpb[i-1] + a,dpc[i-1] + a)
dpb[i] = max(dpa[i-1] + ... | #!/usr/bin/env python3
#dp3 #Vacation
def c():
n = int(eval(input()))
dpa = [0]*n
dpb = [0]*n
dpc = [0]*n
a,b,c = list(map(int,input().split()))
dpa[0] = a
dpb[0] = b
dpc[0] = c
for i in range(1,n):
a,b,c = list(map(int,input().split()))
dpa[i] = max(... | p03162 |
n = int(eval(input()))
a_ls = [0] * n
b_ls = [0] * n
c_ls = [0] * n
for i in range(n):
a,b,c = list(map(int,input().split()))
a_ls[i] = a
b_ls[i] = b
c_ls[i] = c
dp = [[0]*3 for _ in range(n+1)]
dp[1] = [a_ls[0], b_ls[0], c_ls[0]]
for i in range(1,n):
dp[i+1][0] = max(dp[i+1][0], dp[i]... | n = int(eval(input()))
days_ls = [0] * n
for i in range(n):
days_ls[i] = list(map(int, input().split()))
dp = [[0]*3 for _ in range(n)]
dp[0] = days_ls[0]
for i in range(1,n):
dp[i][0] = max(dp[i-1][1],dp[i-1][2]) + days_ls[i][0]
dp[i][1] = max(dp[i-1][0],dp[i-1][2]) + days_ls[i][1]
dp[i][2] ... | p03162 |
n = int(eval(input()))
abc = [list(map(int, input().split())) for _ in range(n)]
a, b, c = 0, 0, 0
for x, y, z in abc:
a, b, c = max(b, c) + x, max(a, c) + y, max(a, b) + z
print((max(a, b, c))) | n = int(eval(input()))
h = [list(map(int, input().split())) for _ in range(n)]
x, y, z = 0, 0, 0
for a, b, c in h:
x, y, z = max(y,z) + a, max(x,z) + b, max(x,y) + c
print((max(x, y, z))) | p03162 |
n = int(eval(input()))
abc = [list(map(int,input().split())) for _ in range(n)]
dp = [[0 for _ in range(3)] for _ in range(n+1)]
for i in range(1,n+1):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][k] = max(dp[i][k],dp[i-1][j] + abc[i-1][... | n = int(eval(input()))
abc = [list(map(int,input().split())) for _ in range(n)]
dp = [[0 for _ in range(3)] for _ in range(n+1)]
for i in range(1,n+1):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][k] = max(dp[i][k],dp[i-1][j] + abc[i-1][... | p03162 |
N = int(eval(input()))
Y = []
for _ in range(N):
Y.append(list(map(int, input().split()))) # Y = [[3, 9, 7], [10, 3, 2]]
dp = [[0] * 3 for _ in range(N)] # 初期化
dp[0] = Y[0] # 初期化
# A, B, C の3パターン以外にも対応
for i in range(N-1):
for j in range(3):
for k in range(3):
if j == k:
... | N = int(eval(input()))
A = [0] * N
B = [0] * N
C = [0] * N
for i in range(N):
A[i], B[i], C[i] = list(map(int, input().split()))
dp = [[0] * 3 for _ in range(N)] # 初期化 [[0, 0, 0], [0, 0, 0], [0, 0, 0], [0, 0, 0]] for n = 4
dp[0] = [A[0], B[0], C[0]]
for i in range(N-1):
dp[i+1][0] = max(dp[i][1]+A[i... | p03162 |
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
ABC = [list(map(int, input().split())) for i in range(N)]
dp = [[0]*3 for i in range(N)]
dp[0] = ABC[0]
ind = [[1, 2], [0, 2], [0, 1]]
for i in range(1, N):
a, b, c = ABC[i]
dp[i][0... | def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
ABC = [list(map(int, input().split())) for i in range(N)]
dp = [[0]*3 for i in range(N)]
dp[0] = ABC[0]
for i in range(N-1):
a, b, c = ABC[i+1]
dp[i+1][0] = a + max(dp[i][1], dp[i][2])
... | p03162 |
import sys
#import unittest
#import collections
def plan_vacation(activity, n):
dp = [[0] * 3 for i in range(n)]
for i in range(3):
dp[0][i] = activity[0][i]
for i in range(1, n):
for j in range(3):
for k in range(3):
if j != k:
dp[i][j] = max(dp[i][j], dp[i-1][k] + activity[i][j])
... | import sys
#import unittest
#import collections
def plan_vacation(activity, n):
dp = [0] * 3
for i in range(3):
dp[i] = activity[0][i]
for i in range(1, n):
new_dp = [0] * 3
for j in range(3):
for k in range(3):
if j != k:
new_dp[j] = max(new_dp[j], dp[k] + activity[i][j])
dp =... | p03162 |
s = list(map(int, input().split()))
n=s[0]
dp=[[0]*3 for i in range(n)]
s = list(map(int, input().split()))
dp[0][0]=s[0]
dp[0][1] = s[1]
dp[0][2] = s[2]
for i in range(1,n):
s = list(map(int, input().split()))
dp[i][0] = max(dp[i-1][1]+s[0], dp[i-1][2]+s[0])
dp[i][1] = max(dp[i-1][0]+s[1], dp[i-1... |
n=list(map(int,input().split()))[0]
dp=[[0]*3 for _ in range(n+1)]
for i in range(1,n+1):
a,b,c=list(map(int,input().split()))
dp[i][0]=max(dp[i-1][1]+a,dp[i-1][2]+a)
dp[i][1]=max(dp[i-1][0]+b,dp[i-1][2]+b)
dp[i][2]=max(dp[i-1][1]+c,dp[i-1][0]+c)
print((max(dp[-1]))) | p03162 |
n=int(eval(input()))
l1=[]
l2=[]
l3=[]
for i in range(n):
l=input().split()
u=int(l[0])
v=int(l[1])
w=int(l[2])
l1.append(u)
l2.append(v)
l3.append(w)
dpu=[0 for i in range(n)]
dpv=[0 for i in range(n)]
dpw=[0 for i in range(n)]
dpu[0]=l1[0]
dpv[0]=l2[0]
dpw[0]=l3[0]
for i in range(1,n):
dpu[... | n=int(eval(input()))
l=[]
for i in range(n):
lo=input().split()
l.append((int(lo[0]),int(lo[1]),int(lo[2])))
dp=[[0 for i in range(3)]for i in range(n)]
dp[0][0]=l[0][0]
dp[0][1]=l[0][1]
dp[0][2]=l[0][2]
for i in range(1,n):
dp[i][0]=max(dp[i-1][1],dp[i-1][2])+l[i][0]
dp[i][1]=max(dp[i-1][2],... | p03162 |
import sys
sys.setrecursionlimit(int(1e6))
n=int(eval(input()))
l=[[0,0,0]]
for _ in range(n):
l.append(list(map(int,input().split())))
memo=[[-1,-1,-1] for _ in range(n+1)]
memo[0][0]=0
memo[0][1]=0
memo[0][2]=0
def dp(i,j):
if memo[i][j]!=-1:
return memo[i][j]
else:
memo[... | import sys
sys.setrecursionlimit(int(1e6))
n=int(eval(input()))
l=[[0,0,0]]
for _ in range(n):
l.append(list(map(int,input().split())))
memo=[[-1,-1,-1] for _ in range(n+1)]
memo[0][0]=0
memo[0][1]=0
memo[0][2]=0
def dp(i,j):
if memo[i][j]!=-1:
return memo[i][j]
else:
memo[... | p03162 |
def main():
n = int(eval(input()))
x = []
for _ in range(n):
a, b, c = list(map(int, input().split()))
x.append([a, b, c])
dp = [[0] * 3 for _ in range(n)]
# i日目の幸福度dp[i-1]
# まず1日目の幸福度を設定
dp[0] = [x[0][l] for l in range(3)]
for i in range(1,n):
for j in... | def main():
n = int(eval(input()))
x = []
for _ in range(n):
a, b, c = list(map(int, input().split()))
x.append((a, b, c))
dp0 = [0]*(n+1)
dp1 = [0]*(n+1)
dp2 = [0]*(n+1)
for i in range(1,n+1):
a, b, c = x[i-1]
dp0[i] = max(dp1[i-1]+a, dp2[i-1]+a)
... | p03162 |
n = int(eval(input()))
a,b,c = list(map(int,input().split()))
dp = [0,0,0] * n
dp[0] = [a,b,c]
for i in range(1,n):
a,b,c = list(map(int,input().split()))
dp[i] = [max(dp[i-1][1],dp[i-1][2])+a,max(dp[i-1][0],dp[i-1][2])+b,max(dp[i-1][0],dp[i-1][1])+c]
print((max(dp[n-1]))) | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [0]*n
b = [0]*n
c = [0]*n
for i in range(n):
a[i],b[i],c[i] = list(map(int,input().split()))
dpa = [a[0]]+[0]*(n-1)
dpb = [b[0]]+[0]*(n-1)
dpc = [c[0]]+[0]*(n-1)
for i in range(1,n):
dpa[i] = max(dpb[i-1],dpc[i-1]) + a[i]
dpb[i]... | p03162 |
N=int(eval(input()))
dp=[[0]*3 for i in range(N+1)]
for i in range(1,N+1):
a=list(map(int,input().split()))
for j in range(3):
tmp=[]
for k in range(3):
if j!=k:
dp[i][k]=max(dp[i][k],dp[i-1][j]+a[k])
print((max(dp[-1]))) | N = int(eval(input()))
A = [list(map(int, input().split())) for i in range(N)]
dp = [[0]*3 for i in range(N+1)]
for i in range(1,N+1):
for j in range(3):
for k in range(3):
if j != k:
dp[i][k] = max(dp[i][k],dp[i-1][j]+A[i-1][k])
print((max(dp[-1]))) | p03162 |
N = int(eval(input()))
A = [list(map(int, input().split())) for i in range(N)]
dp = [[0]*3 for i in range(N+1)]
for i in range(1,N+1):
for j in range(3):
for k in range(3):
if j != k:
dp[i][k] = max(dp[i][k],dp[i-1][j]+A[i-1][k])
print((max(dp[-1]))) | import sys
input = sys.stdin.readline
N = int(eval(input()))
table = []
dp = [[0]*3 for i in range(N)]
for i in range(N):
a,b,c = list(map(int, input().split()))
table.append((a,b,c))
dp[0] = table[0]
for i in range(1,N):
for j in range(3):
for k in range(3):
if j==k:
... | p03162 |
n= int(eval(input()))
active = [[0, 0, 0]] * n
for i in range(n):
a, b, c = list(map(int, input().split(' ')))
active[i] = [a, b, c]
dp = [[]] * (n + 1)
for i in range(n+1):
dp[i] = [0, 0, 0]
#print(n, active, dp)
def chmin(arr, index_a, val):
if arr[index_a] > val:
arr[index_a] = val
... | n = int(eval(input()))
a = [0] * n
b = [0] * n
c = [0] * n
for i in range(n):
a[i], b[i], c[i] = list(map(int, input().split()))
dp = [[]] * (n+1)
for i in range(n+1):
dp[i] = [0, 0, 0]
for i in range(n):
dp[i+1][0] = max(dp[i][1] + a[i], dp[i][2] + a[i])
dp[i+1][1] = max(dp[i][0] + b[i], dp[i]... | p03162 |
import sys
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()
def maxim(i, char):
if i < 0:
return 0
if li[i][char] != ... | import sys
def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()
n=int(eval(input()))
a, b, c = [], [], []
for _ in range(n):
x,y,z=get_ints()
##li=[[-... | p03162 |
n = int(eval(input()))
dp = [[0 for i in range(3)]]
for i in range(1,n+1):
a,b,c = list(map(int, input().split()))
x = max(dp[i-1][1] + a, dp[i-1][2] + a)
y = max(dp[i-1][2] + b, dp[i-1][0] + b)
z = max(dp[i-1][0] + c, dp[i-1][1] + c)
dp.append([x,y,z])
print((max(dp[n])))
| n = int(eval(input()))
dp = [0 for i in range(3)]
for i in range(1,n+1):
a,b,c = list(map(int, input().split()))
x = max(dp[1] + a, dp[2] + a)
y = max(dp[2] + b, dp[0] + b)
z = max(dp[0] + c, dp[1] + c)
dp = [x,y,z]
print((max(dp)))
| p03162 |
def main():
N = int(eval(input()))
A = [0]
B = [0]
C = [0]
for i in range(N):
a, b, c = (int(i) for i in input().split())
A.append(a)
B.append(b)
C.append(c)
dp = [[0 for _ in range(N+1)] for _ in range(3)]
dp[0][1] = A[1]
dp[1][1] = B[1]
... | def main():
N = int(eval(input()))
ABC = [[int(i) for i in input().split()] for j in range(N)]
dp = [[0]*3 for _ in range(N+1)]
for i in range(N):
for j in range(3):
dp[i+1][j] = max(dp[i][(j+1) % 3], dp[i][(j+2) % 3]) + ABC[i][j]
print((max(dp[N])))
if __name__ =... | p03162 |
# coding: utf-8
import sys
input = sys.stdin.readline
def f(n, abc):
dp = [0] * 3
for i in range(1, n + 1):
a, b, c = abc[i - 1]
dp = [ max(dp[1] + a, dp[2] + a), \
max(dp[0] + b, dp[2] + b), \
max(dp[0] + c, dp[1] + c) ]
return(max(dp))
n = int(e... | # coding: utf-8
import sys
input = sys.stdin.readline
def f(n, abc):
dp = [0] * 3
for i in range(n):
a, b, c = abc[i]
dp0, dp1, dp2 = dp
dp = [ max(dp1 + a, dp2 + a), \
max(dp0 + b, dp2 + b), \
max(dp0 + c, dp1 + c) ]
return(max(dp))
n = ... | p03162 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.