input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
Xlist = list(map(int, input().split()))
ans = 10**9+7
for i in range(1, 101):
p = 0
for x in Xlist:
p += (x-i)**2
ans = min(ans, p)
print(ans) | N = int(eval(input()))
Xlist = list(map(int, input().split()))
ans = 10**9
for p in range(min(Xlist), max(Xlist)+1):
cost = 0
for x in Xlist:
cost += (x - p)**2
ans = min(ans, cost)
print(ans) | p02767 |
n = int(eval(input()))
x = sorted(list(map(int,input().split())))
z = sum(x)//n
z2 = z + 1
ans1 = 0
ans2 = 0
for i in range(n):
ans1 += (x[i] - z)**2
for i in range(n):
ans2 += (x[i] - z2)**2
print((min(ans1,ans2)))
| n = int(eval(input()))
x = list(map(int,input().split()))
point = sum(x)//n
sum1 = 0;sum2 = 0
for i in range(n):
sum1 += (point - x[i])**2
sum2 += (point+1 - x[i])**2
print((min(sum1,sum2)))
| p02767 |
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys
import copy
sys.setrecursionlimit(10**9)
mod = 10**7+9
inf = 10**20
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlin... | n = int(eval(input()))
x = list(map(int,input().split()))
ans = 10**9+7
for i in range(min(x),max(x)+1):
tmp=0
for j in x:
tmp+=(i-j)**2
ans = min(ans,tmp)
print(ans) | p02767 |
n=int(eval(input()))
l=list(map(int,input().split()))
ans=float("inf")
for i in range(1,101):
ans=min(ans,sum([(c-i)**2 for c in l]))
print(ans) | import sys
input=sys.stdin.readline
n=int(eval(input()))
l=list(map(int,input().split()))
d=sum(l)//n
def dis(x):
global l;ret=0
for i in l:
ret+=(x-i)**2
return ret
print((min(dis(d),dis(d+1)))) | p02767 |
N = int(eval(input()))
X = list(map(int, input().split()))
m = min(X)
M = max(X)
cost = [1000000009 for _ in range(101)]
for p in range(1,101):
c = 0
for x in X:
c += (x-p)**2
cost[p] = c
print((min(cost))) | N = int(eval(input()))
X = list(map(int, input().split()))
m = min(X)
M = max(X)
min_val = 100 * 100 * 100
for p in range(m, M+1):
score = 0
for x in X:
score += (x-p)*(x-p)
if score < min_val: min_val = score
print(min_val)
| p02767 |
n,*a=list(map(int,open(0).read().split()))
b=10**8
for i in range(1,101):
b=min(b,sum((j-i)**2 for j in a))
print(b) | n,*a=list(map(int,open(0).read().split()));print((sum((round(sum(a)/n)-i)**2 for i in a))) | p02767 |
s = list(input())
q = int(input())
for i in range(q):
cmd = [s for s in input().split()]
cmd[1] = int(cmd[1])
cmd[2] = int(cmd[2])
if cmd[0] == "replace":
c = list(cmd[3])
h = 0
for j in range(cmd[1], cmd[2]+1):
s[j] = c[h]
h+=1
elif cmd[0]... | str = [w for w in input()]
q = int(input())
for i in range(q):
command = [w for w in input().split()]
command[1] = int(command[1])
command[2] = int(command[2])
if command[0] == "print":
for i in range(command[1], command[2]+1):
print(str[i], end="")
print()
if c... | p02422 |
# -*- coding: utf-8 -*-
str = input()
for _ in range(eval(input())):
ops = input().split()
na = int(ops[1])
nb = int(ops[2]) + 1
op = ops[0]
if op[0]=="p": print(str[na:nb])
elif op[2]=="v": str = str[:na] + "".join(reversed(str[na:nb])) + str[nb:]
else: str = str[:na] + ops[3] + str[nb:] | # -*- coding: utf-8 -*-
str = input()
for _ in range(eval(input())):
ops = input().split()
na = int(ops[1])
nb = int(ops[2]) + 1
op = ops[0]
if op[0]=="p": print(str[na:nb])
elif op[2]=="v":
t = str[na:nb]
str = str[:na] + t[::-1] + str[nb:]
else: str = str[:na] + ops[3] + str[nb:] | p02422 |
h, w, n = list(map(int,input().split()))
from collections import defaultdict
m3x3 =defaultdict(list)
for _ in range(n):
a, b = list(map(int,input().split()))
for i in range(max(0, a - 3),min(h - 2, a)):
for j in range(max(0, b - 3),min(w - 2, b)):
if (i,j) in m3x3:
m... | from collections import defaultdict
import sys
h, w, n = list(map(int,sys.stdin.readline().rstrip().split()))
m3x3 =defaultdict(list)
for _ in range(n):
a, b = list(map(int,sys.stdin.readline().rstrip().split()))
for i in range(max(0, a - 3),min(h - 2, a)):
for j in range(max(0, b - 3),min(w - ... | p04002 |
H, W, N = list(map(int, input().split()))
D = dict()
for i in range(N):
a, b = list(map(int, input().split()))
for a_add in [-1, 0, 1]:
for b_add in [-1, 0, 1]:
c = a + a_add
d = b + b_add
if c-1 in range(1, H-1) and d-1 in range(1, W-1):
if... | H, W, N = list(map(int, input().split()))
D = dict()
for i in range(N):
a, b = list(map(int, input().split()))
for a_add in [-1, 0, 1]:
for b_add in [-1, 0, 1]:
c = a + a_add
d = b + b_add
if c-1 in range(1, H-1) and d-1 in range(1, W-1):
if... | p04002 |
from itertools import product
from bisect import bisect_left as bl
H, W, N = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(N)]
A.sort()
ans = [0] * 10
for x, y in A:
for ltx, lty in product(range(max(1, x-2), min(x+1, H-1)),
range(max(1, y-... | from itertools import product
H, W, N = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(N)]
count = {}
for x, y in A:
for xx, yy in product(range(x-1, x+2), range(y-1, y+2)):
if not(2 <= xx <= H-1 and 2 <= yy <= W-1):
continue
count[(xx, yy)] ... | p04002 |
from itertools import product
H, W, N = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(N)]
count = {}
for x, y in A:
for xx, yy in product(range(x-1, x+2), range(y-1, y+2)):
if not(2 <= xx <= H-1 and 2 <= yy <= W-1):
continue
count[(xx, yy)] ... | from itertools import product
H, W, N = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(N)]
count = {}
for x, y in A:
for xx, yy in product(range(x-1, x+2), range(y-1, y+2)):
if not(2 <= xx <= H-1 and 2 <= yy <= W-1):
continue
count[(xx, yy)] ... | p04002 |
import sys
input = sys.stdin.buffer.readline
from collections import defaultdict
def getlist():
return list(map(int, input().split()))
H, W, N = getlist()
D = defaultdict(int)
D[0] += (H - 2) * (W - 2)
L = []
for i in range(N):
a, b = getlist()
for j in range(3):
for k in range(3):
if H - 2 >... | import sys
input = sys.stdin.buffer.readline
from collections import defaultdict
def getlist():
return list(map(int, input().split()))
def main():
H, W, N = getlist()
D = defaultdict(int)
D[0] += (H - 2) * (W - 2)
L = []
for i in range(N):
a, b = getlist()
for j in range(3):
for k in r... | p04002 |
from collections import defaultdict
def gen_bound(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return lb,ub+1
def solve():
count = defaultdict(int)
ans = [0]*10
H,W,N = list(map(int,input().split()))
ans[0] = (H-2)*(W-2)
for i in range(N):
a,b = list(map(int,inp... | from collections import defaultdict
def gen_bound(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return lb,ub+1
def solve():
count = defaultdict(int)
ans = [0]*10
H,W,N = list(map(int,input().split()))
ans[0] = (H-2)*(W-2)
for i in range(N):
a,b = list(map(int,inp... | p04002 |
from collections import defaultdict
def gen_bound(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return lb,ub+1
def solve():
count = defaultdict(int)
ans = [0]*10
H,W,N = list(map(int,input().split()))
ans[0] = (H-2)*(W-2)
for i in range(N):
a,b = list(map(int,inp... | from collections import defaultdict
def gen_bound(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return lb,ub+1
def solve():
count = defaultdict(int)
ans = [0]*10
H,W,N = list(map(int,input().split()))
ans[0] = (H-2)*(W-2)
for i in range(N):
a,b = list(map(int,inp... | p04002 |
from collections import defaultdict
def gen_bound(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return lb,ub+1
def solve():
count = defaultdict(int)
ans = [0]*10
H,W,N = list(map(int,input().split()))
ans[0] = (H-2)*(W-2)
for i in range(N):
a,b = list(map(int,inp... | from collections import defaultdict
from sys import stdin
def gen_bound(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return lb,ub+1
def solve():
count = defaultdict(int)
ans = [0]*10
L = [list(map(int,x.split())) for x in stdin.readlines()]
H,W,N = L[0]
ans[0] = (... | p04002 |
from collections import defaultdict
from sys import stdin
def gen_bound(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return lb,ub+1
def solve():
count = defaultdict(int)
ans = [0]*10
L = [list(map(int,x.split())) for x in stdin.read().split("\n")]
H,W,N = L[0]
for... | from collections import defaultdict
from itertools import product
from sys import stdin
def gen_b(x,B):
if x < 3: lb = 2
else: lb = x - 1
if x > B-2: ub = B-1
else: ub = x + 1
return range(lb,ub+1)
def solve():
count = defaultdict(int)
ans = [0]*10
L = [list(map(int,x.split())) for x in stdin.readli... | p04002 |
from collections import Counter
h, w, n = list(map(int, input().split()))
d = Counter()
for _ in range(n):
a, b = list(map(int, input().split()))
for i in range(3):
for j in range(3):
if w > b+j-1 > 1 < a+i-1 < h:
d[(a+i,b+j)] += 1
ans = Counter()
for i in list(d.va... | i=lambda:map(int,input().split())
h,w,n=i()
r=[0,1,2]
d={}
while n:
a,b=i();n-=1
for j in r:
for k in r:
if w>=b+k>2<a+j<=h:d[(a+j,b+k)]=d.get((a+j,b+k),0)+1
c=[0]*10
for i in d:c[d[i]]+=1
c[0]=(h-2)*(w-2)-sum(c)
print(*c,sep="\n")
| p04002 |
from collections import Counter
h,w,n=map(int,input().split())
cc=Counter()
for _ in range(n):
b,a=map(int,input().split())
for i in range(3):
for j in range(3):
x=a+i
y=b-j #brute forcing valid bottom right corners
if x>=1 and x<=w and y>=1 and y<=h:
... | from collections import Counter
import sys
input=sys.stdin.buffer.readline
h,w,n=map(int,input().split())
cc=Counter()
for _ in range(n):
b,a=map(int,input().split())
for i in range(3):
for j in range(3):
x=a+i
y=b-j #brute forcing valid bottom right corners
... | p04002 |
import sys
n=int(eval(input()))
c=[int(i) for i in sys.stdin]
x=[0]*(200001)
c.append(0)
x[c[0]]+= 1
num=1
p=10**9 +7
for i in range(1,n):
if c[i]-c[i-1]:
x[c[i]]+= num
x[c[i]]= x[c[i]]%p
if c[i]-c[i+1]:
num=x[c[i]]%p
else:
num=0
print(num) | import sys
n=int(eval(input()))
c=[int(i) for i in sys.stdin]
#連続した数を除去したlist
d=[]
#前の数を保存する変数
stack=0
for i in c:
if i!=stack:
d.append(i)
stack=i
#0で初期化
x=[0]*200001
sum=1
p=10**9+7
for i in range(0,len(d)):
x[d[i]]= (x[d[i]]+sum)%p
sum=x[d[i]]%p
print(sum) | p03096 |
import sys
mod = 10**9 + 7
N = int(sys.stdin.readline())
stones = []
for _ in range(N):
stones.append(int(sys.stdin.readline()))
left = [-1 for _ in range(2*10**5+1)]
dp = [0 for _ in range(N+5)]
dp[0] = 1
for i in range(N):
dp[i+1] = dp[i]
# 同じ色が前回出現した位置
c = stones[i]
if 0 <= lef... | import sys
mod = 10**9 + 7
N = int(sys.stdin.readline())
stones = []
for _ in range(N):
stones.append(int(sys.stdin.readline()))
left = {}
dp = [0 for _ in range(N+5)]
dp[0] = 1
for i in range(N):
dp[i+1] = dp[i]
# 同じ色が前回出現した位置
c = stones[i]
if c in left and 0 <= left[c] < i - 1:
... | p03096 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
mod = 10**9+7
from collections import defaultdict
from bisect import bisect_right
last = -1
dic = defaultdict(list)
idx = 0
lis = []
for i ... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
mod = 10**9+7
last = {}
dp = [0]*(N+1)
dp[0] = 1
for i in range(1, N+1):
dp[i] = dp[i-1]
c = int(eval(input()))
if c in last an... | p03096 |
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def main():
mod = 10 ** 9 + 7
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
dp = [1] * (N + 1)
dp[0] = 1
D = {c: set() for c in set(C)}
pre =... | def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def main():
mod = 10 ** 9 + 7
N = int(eval(input()))
dp = [1] * (N + 1)
dp[0] = 1
D = {}
pre = -1
for n in range(N):
c = int(eval(input()))
dp[... | p03096 |
import sys
from bisect import bisect_left as bl
from bisect import bisect_right as br
input = sys.stdin.readline
N = int(eval(input()))
table = [[] for _ in range(2 * pow(10, 5) + 1)]
a = []
t = 0
mod = 10 ** 9 + 7
for i in range(N):
x = int(eval(input()))
if t != x:
table[x].append(i)
t = x
... | import sys
from bisect import bisect_right as br
from bisect import bisect_left as bl
input = sys.stdin.readline
N = int(eval(input()))
mod = 10 ** 9 + 7
a = []
for _ in range(N): a.append(int(eval(input())))
t = 0
table = [[] for _ in range(max(a) + 1)]
for i in range(N):
if a[i] != t:
t = a[i]
... | p03096 |
a=int(eval(input()))
C=list()
last=[[]for i in range(2*100002)]
for i in range(a):
C.append(int(eval(input())))
ans=[1]*a
last[C[0]].append(0)
#print(last,ans)
for i in range(1,a):
ans[i]=ans[i-1]
if C[i]==C[i-1]:
continue
for j in last[C[i]]:
if j==0:
ans[i]+... | a = int(eval(input()))
C = list()
last = [-1] * 2 * 100002
for i in range(a):
C.append(int(eval(input())))
ans = [1] * a
last[C[0]] = 0
# print(last,ans)
for i in range(1, a):
ans[i] = ans[i - 1]
if C[i] == C[i - 1]:
continue
if last[C[i]] != -1:
ans[i] += ans[last[C[i]]]
... | p03096 |
MOD=10**9+7
N=int(eval(input()))
clist=[]
for i in range(N):
c=int(eval(input()))
clist.append(c)
#print(clist)
c2list=clist[:1]
for i in range(1,N):
if clist[i]!=c2list[-1]:
c2list.append(clist[i])
#print(c2list)
N2=len(c2list)
cdic={}
for i in range(N2):
c=c2list[i]
if not c in c... | import bisect
MOD=10**9+7
N=int(eval(input()))
clist=[]
for i in range(N):
c=int(eval(input()))
clist.append(c)
#print(clist)
c2list=clist[:1]
for i in range(1,N):
if clist[i]!=c2list[-1]:
c2list.append(clist[i])
#print(c2list)
N2=len(c2list)
cdic={}
for i in range(N2):
c=c2list[i]... | p03096 |
import bisect
MOD=10**9+7
N=int(eval(input()))
clist=[]
for i in range(N):
c=int(eval(input()))
clist.append(c)
#print(clist)
c2list=clist[:1]
for i in range(1,N):
if clist[i]!=c2list[-1]:
c2list.append(clist[i])
#print(c2list)
N2=len(c2list)
cdic={}
for i in range(N2):
c=c2list[i]... | import bisect
MOD=10**9+7
N=int(eval(input()))
clist=[]
for i in range(N):
c=int(eval(input()))
clist.append(c)
#print(clist)
c2list=clist[:1]
for i in range(1,N):
if clist[i]!=c2list[-1]:
c2list.append(clist[i])
#print(c2list)
N2=len(c2list)
cldic={}
dp=[0]*(N2-1)+[1]
for i in range... | p03096 |
n = int(eval(input()))
C = []
MOD = 10 ** 9 + 7
pre = -1
for i in range(n):
a = int(eval(input()))
if a != pre:
C.append(a)
pre = a
N = len(C)
dp = [0] * (N + 1)
col = {}
pre = -1
dp[0] = 1
for i in range(1, N + 1):
if C[i - 1] not in col :
dp[i] = dp[i - 1]
co... | n = int(eval(input()))
C = []
MOD = 10 ** 9 + 7
pre = -1
for i in range(n):
a = int(eval(input()))
if a != pre:
C.append(a)
pre = a
N = len(C)
dp = [0] * (N + 1)
col = {}
pre = -1
dp[0] = 1
for i in range(1, N + 1):
if C[i - 1] not in col:
dp[i] = dp[i - 1]
col... | p03096 |
import sys
input = sys.stdin.readline
INF = 10 ** 9
MOD = 10 **9 + 7
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
lst = [INF] * (2 * 10 ** 5 + 10) #各番号がどこにあるかを管理するリスト
ans = [1] * N
lst[C[-1]] = N - 1
for i in range(N - 2, -1, -1):
c = C[i]
if lst[c] == INF or lst[c] ==... | import sys
input = sys.stdin.readline
INF = 10 ** 9
MOD = 10 **9 + 7
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
lst = [INF] * (2 * 10 ** 5 + 10) #各番号がどこにあるかを管理するリスト
ans = [1] * N
lst[C[-1]] = N - 1
for i in range(N - 2, -1, -1):
c = C[i]
if lst[c] == INF or lst[c] ==... | p03096 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | p03096 |
N=int(eval(input()))
C=[int(eval(input())) for _ in range(N)]
mod = int(1e9+7)
memo={}
new_C=[]
pre = 1.5
i=0
for c in C:
if c!= pre:
new_C.append(c)
memo.setdefault(c,[]).append(i)
i+=1
pre=c
answer = [0]*len(new_C)
answer[0] = 1
for i in range(1, len(new_C)):
... | N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
mod = int(1e9+7)
from itertools import groupby
x = [0] + [k for k, g in groupby(C)]
dp = [0]*(len(x)) # i個目までで何通りあるか
dp[0] = 1
memo = {}
for i in range(1, len(x)):
c = x[i]
memo[c] = (memo.get(c,0) + dp[i-1])%mod
dp[i] = memo... | p03096 |
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().spl... | import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().spl... | p03096 |
import sys
N = int(eval(input()))
C = []
pre = 0
for _ in range(N):
c = int(sys.stdin.readline())
if pre == c:
continue
else:
C.append(c)
pre = c
ans = 1
dic = {}
for c in C:
if c in list(dic.keys()):
a = dic[c]
dic[c] += ans
ans += a
... | import sys
N = int(eval(input()))
C = [0]
for line in sys.stdin:
c = int(line)
if C[-1] == c:
continue
else:
C.append(c)
ans = 1
dic = {}
for c in C:
if c in list(dic.keys()):
a = dic[c]
dic[c] += ans
ans += a
else:
dic[c] = ans
... | p03096 |
import sys
from collections import defaultdict
N = int(eval(input()))
C = [0]
for _ in range(N):
c = int(sys.stdin.readline())
if C[-1] == c:
continue
else:
C.append(c)
ans = 1
dic = defaultdict(lambda: 0)
mod = 10 ** 9 + 7
for c in C:
a = dic[c]
dic[c] += ans
... | import sys
from collections import defaultdict
N = int(eval(input()))
C = [0]
for _ in range(N):
c = int(sys.stdin.readline())
if C[-1] != c:
C.append(c)
ans = 1
dic = defaultdict(lambda: 0)
mod = 10 ** 9 + 7
for c in C:
a = dic[c]
dic[c] += ans
ans = (ans + a) % mod
pri... | p03096 |
import sys
from collections import defaultdict
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)] + [None]
C = [C[i] for i in range(N) if C[... | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)] + [-1]
C = [C[i] for i in range(N) if C[i] != C[i + 1]]
N = len(C)
... | p03096 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
n = int(input())
prev = -1
nums = []
table = {}
for _ in range(n):
v = int(input())
if v != prev:
nums.append(v)
prev = v
for i, n in enumerate(nums):
if n not in table:
table[n] = []
table... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
value = 1
skips = {}
prev = -1
for _ in range(int(input())):
n = int(input())
if n == prev:
continue
prev = n
if n in skips:
value += skips[n]
skips[n] = value
print(value % int(1e+9 + 7), f... | p03096 |
from collections import defaultdict
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def main():
md = 10 ** 9 + 7
n = int(input())
cc = [int(input()) for _ in range(n)]
dp = [0] * (n + 1)
dp[0] = 1
ll = defaultdict(int)
... | import sys
sys.setrecursionlimit(10 ** 5)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | p03096 |
#import time
#t = []
N = int(eval(input()))
#st = time.time()
sums = [1] # pair number sum until index
#cpos = [-1] * (2 * 10 ** 5 + 1) # positions of each color
cpos = {}
lastc = -1 # last color of input
C = [] # color stone list
#print("prepare time [ms] = {}".format(1000 * (time.time() - s... | sums = [1] # pair number sum until index
csums = {} # pair number sum of each color
N = int(eval(input()))
C = [] # color stone list
lastc = -1 # last color of input
for i in range(N):
c = int(eval(input()))
if(lastc == c):
continue
lastc = c
C.append(c)
#print("C = " + st... | p03096 |
from collections import defaultdict
MOD = 10**9+7
n = int(eval(input()))
dp = [1]
d = defaultdict(list)
cur = int(eval(input()))
d[cur].append(0)
for i in range(1,n):
pre,cur = cur,int(eval(input()))
c = dp[-1]
if pre != cur and d[cur]:
c += dp[d[cur][-1]]
dp.append(c)
d[cur].append(i)
print... | from collections import defaultdict
MOD = 10**9+7
n = int(eval(input()))
dp = [1]
d = defaultdict(list)
cur = int(eval(input()))
d[cur].append(0)
for i in range(1,n):
pre,cur = cur,int(eval(input()))
c = dp[-1]
if pre != cur and d[cur]:
c += dp[d[cur][-1]]
dp.append(c%MOD)
d[cur].append(i)
p... | p03096 |
from collections import defaultdict
N = int(eval(input()))
p = 10 ** 9 + 7
C = [0] * (N + 1)
D = defaultdict(list)
DP = [[0, 0] for i in range(N + 1)]
DP[0] = [1, 0]
LC = 0
LP = -1
for i in range(1, N + 1):
C[i] = int(eval(input()))
DP[i][0] = sum(DP[i - 1]) % p
if C[i] != C[i - 1]:
for d in D[C[... | from collections import defaultdict
N = int(eval(input()))
p = 10 ** 9 + 7
C = [0] * (N + 1)
D = defaultdict(lambda: -1)
DP = [[0, 0] for i in range(N + 1)]
DP[0] = [1, 0]
for i in range(1, N + 1):
C[i] = int(eval(input()))
DP[i][0] = sum(DP[i - 1]) % p
if C[i] != C[i - 1]:
DP[i][1] = sum(DP[D[C[i]... | p03096 |
import copy
from collections import deque
N = int(eval(input()))
C = [eval(input()) for i in range(N)]
C2 = []
re = ""
L = {}
for i in C:
if i != re:
if i in L:
L[i].append(len(C2))
else:
L[i] = deque([])
C2.append(i)
re = i
LL = [-1] * len(C2)
for i in range(len(C2)):
... | N = int(eval(input()))
C = [eval(input()) for i in range(N)]
MOD = 1e9 + 7
C2 = []
re = ""
L = {}
LL = [-1] * N
for i in C:
if i != re:
if i in L:
LL[L[i]] = len(C2)
L[i] = len(C2)
else:
L[i] = len(C2)
C2.append(i)
re = i
DP = [-1] * (len(C2) + 1)
DP[-1] = 1
... | p03096 |
N = int(eval(input()))
c = []
for _ in range(N):
c.append(int(eval(input())))
dp = [0] * N
dp[0] = 1
for i in range(1, N):
if c[i] == c[i - 1]:
dp[i] = dp[i - 1]
continue
for j in range(i):
if j == 0 and c[j] == c[i]:
dp[i] += 1
if c[i] == c[j + 1... | import sys
input = sys.stdin.readline
N = int(eval(input()))
c = []
for _ in range(N):
c.append(int(eval(input())))
dp = [0] * N
dp[0] = 1
dpc = [0] * (max(c) + 1)
dpc[c[0]] = 1
for i in range(1, N):
dp[i] = dp[i - 1]
if c[i] != c[i - 1]:
dp[i] += dpc[c[i]]
dpc[c[i]] += d... | p03096 |
N=int(eval(input()))
clist=[-1]
mod=10**9+7
for i in range(N):
t=int(eval(input()))
if t==clist[-1]:
continue
clist.append(t)
del clist[0]
N = len(clist)
# print(clist)
colorlast=[-1]*(3*10**5)
poslp=[-1]*(N+1)
for e,c in enumerate(clist,1):
if colorlast[c] != -1:
poslp[e]=col... | def solve():
# 方針
# 範囲で並べ方の個数を足し合わせるDP
N = int(eval(input()))
X = [int(eval(input())) for _ in range(N)]
MOD = int(1e9)+7
colors = set()
NoDouble = [-1]
for x in X:
colors.add(x)
if x == NoDouble[-1]:
continue
NoDouble.append(x)... | p03096 |
#!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, ... | p03096 |
import sys
sys.setrecursionlimit(100000000)
N = int(eval(input()))
C = [int(eval(input()))]
cindex = {C[0]:[0]}
mod = 7 + 10 ** 9
counter = 0
for _ in range(N-1):
c = int(eval(input()))
if c != C[-1]:
C.append(c)
counter += 1
if c in cindex:
cindex[c].append(coun... | N = int(eval(input()))
C = [int(eval(input()))]
cindex = {C[0]: 0}
mod = 7 + 10 ** 9
counter = 0
for _ in range(N-1):
c = int(eval(input()))
if c != C[-1]:
C.append(c)
counter += 1
if c not in cindex:
cindex[c] = counter
DP = [[0, 1] for i in range(len(C))]
for... | p03096 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
c = [-1]
INF = 10**9+7
for _ in range(N):
a = int(eval(input()))
if c[-1] == a:
continue
c.append(a)
c.pop(0)
d,M = len(c),max(c)
_c = list(set(c))
... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
c = [-1]
INF = 10**9+7
for _ in range(N):
a = int(eval(input()))
if c[-1] == a-1:
continue
c.append(a-1)
c.pop(0)
d,M = len(c),max(c)
dp = [1 for _ in range(d+1)]... | p03096 |
from collections import defaultdict
from bisect import *
def solve():
mod = 10**9+7
d = defaultdict(lambda: [])
N = int(eval(input()))
for i in range(N):
a = int(eval(input()))
d[a].append(i)
selist = []
ends = [-1]
for l in list(d.values()):
for i in rang... | from collections import defaultdict
from bisect import *
def solve():
mod = 10**9+7
d = defaultdict(lambda: [])
N = int(eval(input()))
for i in range(N):
a = int(eval(input()))
d[a].append(i)
selist = []
ends = [-1]
for l in list(d.values()):
for i in rang... | p03096 |
from collections import defaultdict
from bisect import *
def solve():
mod = 10**9+7
d = defaultdict(lambda: [])
N = int(eval(input()))
for i in range(N):
a = int(eval(input()))
d[a].append(i)
selist = [[-1,-1]]
ends = [-1]
for l in list(d.values()):
for i ... | from collections import defaultdict
def solve():
ans = 0
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
d = defaultdict(lambda: -1)
dp = [1]*N
d[C[0]] = 0
mod = 10**9+7
for i in range(1,N):
dp[i] = dp[i-1]
if d[C[i]]>-1 and d[C[i]]!=i-1:
dp[i] += dp[d[C[i]]]
... | p03096 |
N = int(eval(input()))
C = [int(eval(input())) for i in range(N)]
MOD = 10**9+7
A = []
for c in C:
if A and A[-1]==c: continue
A.append(c)
last = [-1] * 200001
B = [-1] * len(A)
for i,a in enumerate(A):
B[i] = last[a]
last[a] = i
dp = [0] * (len(A))
dp[0] = 1
for i in range(1,len(A))... | N = int(eval(input()))
C = [int(eval(input())) for i in range(N)]
MOD = 10**9+7
dp = [0] * N
dp[0] = 1
bak = {C[0]:0}
for i,c in enumerate(C):
if i==0: continue
dp[i] = dp[i-1]
if c in bak and bak[c] < i-1:
dp[i] += dp[bak[c]]
dp[i] %= MOD
bak[c] = i
print((dp[-1])) | p03096 |
import sys
N = int(eval(input()))
C = [0]
#c = [int(sys.stdin.readline()) for i in range(N)]
n = N
for i in range(1, n + 1):
c = int(sys.stdin.readline())
if c == C[-1]:
N -= 1
else:
C.append(c)
#C = C+c
dp = [0] * (N + 2)
dp_2 = [0] * (N + 2)
color = [[]for i in range((2*(10**... | import sys
N = int(eval(input()))
C = [0]
n = N
for i in range(1, n + 1):
c = int(sys.stdin.readline())
if c == C[-1]:
N -= 1
else:
C.append(c)
dp = [0] * (N + 2)
dp[0] = 1
dp[1] = 1
cumsum = [0] * (2 * (10 ** 5) + 2)
cumsum[C[1]] = 1
for i in range(2, N+1):
dp[i] = dp[i ... | p03096 |
n = int(eval(input()))
c = [int(eval(input())) for i in range(n)]
dp = [1 for i in range(2*(10**5)+1)]
dp2 = [-1 for i in range(2*(10**5)+1)]
dp3 = [0 for i in range(2*(10**5)+1)]
ans = 1
def count(s):
memo = {}
res = 1
for i in range(len(s)):
if s[i] not in memo:
memo[s[i]] = 1
else... | n = int(eval(input()))
cc = [int(eval(input())) for i in range(n)]
c = [cc[0]]
for i in range(1,n):
if cc[i] != cc[i-1]:
c.append(cc[i])
n = len(c)
dp = [0 for i in range(n)]
pos_dp = [-1 for i in range(2*10**5+1)]
dp[0] = 1
pos_dp[c[0]] = 0
for i in range(1,n):
if pos_dp[c[i]]!=-1:
... | p03096 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(eval(input()))
mod=10**9+7
C=[int(eval(input()))for _ in range(n)]
places=[[] for _ in range(2*10**5+1)]
for i in range(n):
places[C[i]].append(i)
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(eval(input()))
mod=10**9+7
stone=[0]*(2*10**5+1)
stone_last_pos=[-1]*(2*10**5+1)
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
c=int(eval(input()))
place=stone_last_pos[c]
if plac... | p03096 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(eval(input()))
mod=10**9+7
stone=[0]*(2*10**5+1)
stone_last_pos=[-1]*(2*10**5+1)
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
c=int(eval(input()))
place=stone_last_pos[c]
if plac... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(eval(input()))
mod=10**9+7
stone_last_pos=[-1]*(2*10**5+1)
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
c=int(eval(input()))
place=stone_last_pos[c]
if place==i-1 or place==-1:
... | p03096 |
n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
dp = [0] * n
last_dic = {}
for i in range(n):
if c[i] in list(last_dic.keys()) and i - last_dic[c[i]] >= 2:
dp[i] = 1 + sum(dp[:last_dic[c[i]]+1])
last_dic[c[i]] = i
print((1+sum(dp))) | n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
m = 10**9+7
dp = [-1] * n
dp[0] = 1
last_dic = {}
for i in range(n):
if c[i] in list(last_dic.keys()) and i - last_dic[c[i]] >= 2:
dp[i] = (dp[i-1] + dp[last_dic[c[i]]]) % m
elif i:
dp[i] = dp[i-1]
last_dic[c[i]] ... | p03096 |
n = int(eval(input()))
dp = [1 for i in range(0,n+1)]
c = list()
c.append(-1)
for i in range(1,n+1):
c.append(int(eval(input())))
for i in range(2,n+1):
for j in reversed(list(range(1,i))):
if c[i-1] != c[i] == c[j] != c[j-1]:
dp[i] = dp[i-1]+dp[j]
break
else:
... | n = int(eval(input()))
dp = [1 for i in range(0,n+1)]
c = list()
c.append(-1)
d = {}
for i in range(1,n+1):
c.append(int(eval(input())))
for i in range(1,n+1):
if c[i] in d:
j = d[c[i]]
d[c[i]] = i
if c[i-1] != c[i]:
dp[i] = dp[i-1]+dp[j]
continue... | p03096 |
n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
mod = 10 ** 9 + 7
MAX = 2 * 10 ** 5
cc = []
prev = 0
for e in c:
if e != prev:
cc.append(e)
prev = e
ln = len(cc)
dp = [0] * (ln + 1)
dp[0] = 1
acc = [0] * (MAX + 1)
for i, e in enumerate(cc, 1):
dp[i] = dp[... | n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
mod = 10 ** 9 + 7
MAX = 2 * 10 ** 5
cc = []
prev = 0
for e in c:
if e != prev:
cc.append(e)
prev = e
ln = len(cc)
dp_prev = 1
acc = [0] * (MAX + 1)
for i, e in enumerate(cc, 1):
dp_now = dp_prev + acc[e]
... | p03096 |
N = int(eval(input()))
C = [0] * N
mod = 10 ** 9 + 7
dic = [ [ ] for _ in range(2*(10**5)+1)]
for i in range(N):
C[i] = int(eval(input()))
if i > 0 and C[i] == C[i-1]:
continue
dic[C[i]].append(i)
dp = [0] * N
dp[0] = 1
for i in range(1,N):
dp[i] = dp[i-1] % mod
if C[i] == C[i... | N = int(eval(input()))
C = [0] * N
mod = 10 ** 9 + 7
dic = [-1]*(2*(10**5)+1)
prevIdx = [0] * N
for i in range(N):
C[i] = int(eval(input()))
if i > 0 and C[i] == C[i-1]:
continue
prevIdx[i] = dic[C[i]]
dic[C[i]] = i
dp = [0] * N
dp[0] = 1
acc = [0] * N
acc[0] = 1
for i in range(... | p03096 |
N = int(eval(input()))
C = []
tmp_b = -1
for _ in range(N):
tmp_n = int(eval(input()))
if tmp_n != tmp_b:
C.append(tmp_n)
tmp_b = tmp_n
SUM = 1
DP_dict = {}
for c in C:
if c not in list(DP_dict.keys()):
DP_dict[c] = SUM
else:
SUM += DP_dict[c]
DP_dict[c] = SUM
print((SU... | N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
C = [x for (x,y) in zip(C[:-1], C[1:]) if x!=y] + [C[-1]]
SUM = 1
DP_dict = {}
for c in C:
if c in list(DP_dict.keys()):
SUM += DP_dict[c]
DP_dict[c] = SUM
print((SUM % (10**9+7))) | p03096 |
n=int(eval(input()))
c=[int(eval(input())) for _ in range(n)]
x=[c[0]]
for i in range(1,n):
if c[i]!=c[i-1]:
x.append(c[i])
#print(x)
dp=[0 for _ in range(n)]
res=[[] for _ in range(max(x)+1)]
res[x[0]].append(0)
for i in range(1,len(x)):
if len(res[x[i]])>0:
if res[x[i]][-1]==0:#左... | n=int(eval(input()))
c=[int(eval(input())) for _ in range(n)]
x=[c[0]]
for i in range(1,n):
if c[i]!=c[i-1]:
x.append(c[i])
#print(x)
dp=[0 for _ in range(n)]
res=[[] for _ in range(max(x)+1)]
res[x[0]].append(0)
res2=[0 for _ in range(max(x)+1)]
for i in range(1,len(x)):
if len(res[x[i]])... | p03096 |
import sys
from collections import defaultdict
from itertools import groupby
read = sys.stdin.read
N, *C = list(map(int, read().split()))
C = [i for i, _ in groupby(C)]
mod = 10 ** 9 + 7
cnt = defaultdict(int)
dp = 1
for idx, i in enumerate(C):
prev = dp
dp = (cnt[i] + dp) % mod
cnt[i] = (cn... | import sys
from collections import defaultdict
from itertools import groupby
read = sys.stdin.read
N, *C = list(map(int, read().split()))
C = [i for i, _ in groupby(C)]
mod = 10 ** 9 + 7
cnt = defaultdict(int)
dp = 1
for i in C:
prev = dp
dp = (cnt[i] + dp) % mod
cnt[i] = (cnt[i] + prev) % m... | p03096 |
n = int(eval(input()))
z = []
pre = 0
for _ in range(n):
i = int(eval(input()))
if i != pre:
z.append(i)
pre = i
n = len(z)
dp = [1] * (n+1)
place = [[] for _ in range(2 * 10 ** 5)]
for i in range(n):
dp[i+1] = dp[i]
for p in place[z[i] - 1]:
dp[i+1] += dp[p]
place... | n = int(eval(input()))
z = []
pre = 0
for _ in range(n):
i = int(eval(input()))
if i != pre:
z.append(i)
pre = i
n = len(z)
dp = [1] * (n+1)
dpp = [0] * 2 * 10 ** 5
for i in range(n):
dp[i+1] = dp[i] + dpp[z[i]-1]
dpp[z[i]-1] += dp[i]
dp[i+1] %= 10 ** 9 + 7
print((dp[n])) | p03096 |
from collections import defaultdict
N = int(eval(input()))
tmp = [int(eval(input())) for _ in range(N)]
mod = 10 ** 9 + 7
C = []
for c in tmp:
if not C:
C.append(c)
continue
if C[-1] != c:
C.append(c)
N = len(C)
last = defaultdict(int)
ans = 1
for c in C:
ans += la... | import sys
input = sys.stdin.readline
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
mod = 10 ** 9 + 7
newC = []
while C:
c = C.pop()
if not newC or newC[-1] != c:
newC.append(c)
N = len(newC)
seen = [0] * (2*10 ** 5 + 10)
dp = [0] * (N + 1)
dp[0] = 1
seen[newC[0]]... | p03096 |
class Dice:
same_dice_index = ((0, 1, 2, 3, 4, 5), (0, 2, 4, 1, 3, 5), (0, 3, 1, 4, 2, 5),
(0, 4, 3, 2, 1, 5), (1, 0, 3, 2, 5, 4), (1, 2, 0, 5, 3, 4),
(1, 3, 5, 0, 2, 4), (1, 5, 2, 3, 0, 4), (2, 0, 1, 4, 5, 3),
(2, 1, 5, 0, 4, 3), (2, 4, 0, 5,... | class Dice:
same_dice_index = ((0, 1, 2, 3, 4, 5), (0, 2, 4, 1, 3, 5), (0, 3, 1, 4, 2, 5),
(0, 4, 3, 2, 1, 5), (1, 0, 3, 2, 5, 4), (1, 2, 0, 5, 3, 4),
(1, 3, 5, 0, 2, 4), (1, 5, 2, 3, 0, 4), (2, 0, 1, 4, 5, 3),
(2, 1, 5, 0, 4, 3), (2, 4, 0, 5,... | p02385 |
class Dice:
def __init__(self):
# 初期値がない場合
# 上, 南、東、西、北、下にそれぞれ1, 2, 3, 4, 5, 6がくる想定
self.t = 1
self.s = 2
self.e = 3
self.w = 4
self.n = 5
self.b = 6
self.rotway = {"S": 0, "N": 1, "E": 2, "W": 3}
def __init__(self, t, s, e, ... | f = list(map(int, input().split()))
s = list(map(int, input().split()))
yes = 0
for _ in range(4):
s[0],s[2],s[5],s[3] = s[2],s[5],s[3],s[0]
for _ in range(4):
s[1],s[2],s[4],s[3] = s[2],s[4],s[3],s[1]
if f == s:
yes = 1
for _ in range(4):
s[0],s[1],s[5],s[4] = s[1]... | p02385 |
from copy import deepcopy, copy
class dice:
men = [0] * 7
def __init__(self, li = [0] * 6):
self.men = [0] + li
def move0(self, a, b, c, d):
self.men[a], self.men[b], self.men[c], self.men[d] = self.men[b], self.men[c], self.men[d], self.men[a]
def move(self, h):
if h == ... | class dice:
def __init__(self, li = [0] * 6):
self.men = [0] + li
def move0(self, a, b, c, d):
self.men[a], self.men[b], self.men[c], self.men[d] = self.men[b], self.men[c], self.men[d], self.men[a]
def move(self, h):
if h == "N":
self.move0(1, 2, 6, 5)
el... | p02385 |
x = list(map(int, input().split()))
y = list(map(int, input().split()))
z = [0, 1, 2]
for i in range(6):
order = [0, 0, 0]
for j in range(3):
if {x[j], x[-j-1]} != {y[z[j]], y[-z[j]-1]}:
break
if x[j] == y[z[j]]:
order[j] = 1
if x[j] == x[-j-1]:
... | x = list(map(int, input().split()))
y = list(map(int, input().split()))
z = [0, 1, 2]
for i in range(6):
order = [0, 0, 0]
for j in range(3):
if {x[j], x[-j-1]} != {y[z[j]], y[-z[j]-1]}:
break
if x[j] == y[z[j]]:
order[j] = 1
if x[j] == x[-j-1]:
... | p02385 |
class Dice():
def __init__(self, label):
self.label = label
def north(self):
self.change([2, 6, 3, 4, 1, 5])
def west(self):
self.change([3, 2, 6, 1, 5, 4])
def east(self):
self.change([4, 2, 1, 6, 5, 3])
def south(self):
self.change([5, 1,... | class Dice():
def __init__(self, label):
self.label = label
def north(self):
self.change([2, 6, 3, 4, 1, 5])
def west(self):
self.change([3, 2, 6, 1, 5, 4])
def east(self):
self.change([4, 2, 1, 6, 5, 3])
def south(self):
self.change([5, 1,... | p02385 |
class Dice:
def __init__(self,t,f,r,l,ba,bo):
self.t = t
self.f = f
self.r = r
self.l = l
self.ba = ba
self.bo = bo
def E(self):
a = self.t
b = self.r
c = self.bo
d = self.l
self.r = a
self.bo = b... | class Dice:
def __init__(self,t,f,r,l,ba,bo):
self.t = t
self.f = f
self.r = r
self.l = l
self.ba = ba
self.bo = bo
def E(self):
a = self.t
b = self.r
c = self.bo
d = self.l
self.r = a
self.bo = b... | p02385 |
class Dice:
def __init__(self, faces):
self.faces = faces
self.t = faces[0]
self.s = faces[1]
self.e = faces[2]
self.w = faces[3]
self.n = faces[4]
self.b = faces[5]
def roll(self, drct):
t_ = self.t
s_ = self.s
e_ = self.e
w_ = self.w
n_ = self.n
b_ = self.b
if drct =... | class Dice:
def __init__(self, faces):
self.faces = faces
self.t = faces[0]
self.s = faces[1]
self.e = faces[2]
self.w = faces[3]
self.n = faces[4]
self.b = faces[5]
def roll(self, drct):
t_ = self.t
s_ = self.s
e_ = self.e
w_ = self.w
n_ = self.n
b_ = self.b
if drct =... | p02385 |
class Dice(object):
def __init__(self, d):
self.rows = [d[0], d[4], d[5], d[1]]
self.cols = [d[0], d[2], d[5], d[3]]
def move_next_rows(self):
temp = self.rows.pop(0)
self.rows.append(temp)
self.__update(self.cols, self.rows)
def move_prev_rows(self)... | class Dice(object):
def __init__(self, d):
self.rows = [d[0], d[4], d[5], d[1]]
self.cols = [d[0], d[2], d[5], d[3]]
def move_next_rows(self):
temp = self.rows.pop(0)
self.rows.append(temp)
self.__update(self.cols, self.rows)
def move_prev_rows(self)... | p02385 |
#coding:utf-8
#1_11_C 2015.4.20
class Dice:
def __init__(self,ary):
self.top , self.south , self.east , self.west , self.north ,self.bottom = ary
def roll_n(self):
self.top , self.south , self.bottom , self.north = self.south , self.bottom , self.north , self.top
def roll_e(self):... | #coding:utf-8
#1_11_C
class Dice:
def __init__(self, ary):
self.top, self.south, self.east, self.west, self.north, self.bottom = ary
def roll_n(self):
self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom
def roll_e(self):
self.to... | p02385 |
while True:
n = int(input())
if n == 0:
break
R = sorted([list(map(int,input().split())) for _ in range(n)],
key = lambda x:sum(60*m+s for m,s in zip(x[1::2],x[2::2])))
print("\n".join(map(str,[R[0][0],R[1][0],R[-2][0]]))) | while True:
n = eval(input())
if n == 0:
break
R = sorted([list(map(int,input().split())) for _ in range(n)],
key = lambda x:sum(60*m+s for m,s in zip(x[1::2],x[2::2])))
print("\n".join(map(str,[R[0][0],R[1][0],R[-2][0]]))) | p00161 |
while 1:
n = eval(input())
if n==0: break
d = [0]*n
for i in range(n):
x = list(map(int, input().split()))
d[i]=[sum(x[1::2])*60+sum(x[2::2]),x[0]]
d = sorted(d)
print(d[0][1])
print(d[1][1])
print(d[-2][1]) | while 1:
n = eval(input())
if n==0: break
D = [0]*n
for j in range(n):
a,b,c,d,e,f,g,h,i = list(map(int, input().split()))
D[j] = [(b+d+f+h)*60 + c+e+g+i, a]
D = sorted(D)
print(D[0][1])
print(D[1][1])
print(D[-2][1]) | p00161 |
while 1:
n = eval(input())
if n==0: break
D = [0]*n
for j in range(n):
a,b,c,d,e,f,g,h,i = list(map(int, input().split()))
D[j] = [(b+d+f+h)*60 + c+e+g+i, a]
D = sorted(D)
print(D[0][1])
print(D[1][1])
print(D[-2][1]) | while 1:
n = eval(input())
if n==0: break
D = {}
for j in range(n):
a,b,c,d,e,f,g,h,i = list(map(int, input().split()))
D[(b+d+f+h)*60 + c+e+g+i] = a
A = sorted(D)
for i in [0,1,-2]: print(D[A[i]]) | p00161 |
N,M = list(map(int,input().split()))
t = M * 1900 + (N-M) * 100
ac_rate = 1 / (2**M)
rate = 1.0
ans = 0.0
for n in range(1,1000000):
ans += rate * ac_rate * t * n
rate *= (1 - ac_rate)
print((round(ans)))
| N,M = list(map(int,input().split()))
p = 2**M
ans = p * (1900*M + 100*(N-M))
print(ans) | p03551 |
from collections import deque
from typing import Optional
class DeletableDeque:
"""Deletable Deque: a deque that supports lazy deletion of values."""
__slots__ = ["_set", "_deque"]
def __init__(self, *initial_values: int) -> None:
self._set = set()
self._deque = deque([])
... | from collections import deque
from typing import Optional
class DeletableDeque:
"""Deletable Deque: a deque that supports lazy deletion of values."""
__slots__ = ["_set", "_deque"]
def __init__(self, *initial_values: int) -> None:
self._set = set()
self._deque = deque([])
... | p03652 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(N)]
inva = [[0] * M for _ in range(N)]
for i in range(N):
for j in range(M):
inva[i][a[i][j] - 1] = j
dp = [N * M] * M
t = [0] * N
vis = set()
#print(inva)
for i in range(M)... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(N)]
t = [0] * (M + 1)
p = [0] * N
s = set()
res = float("inf")
for _ in range(M):
t = [0] * (M + 1)
for i in range(N): t[a[i][p[i]]] += 1
x = 0
y = 0
for j in range(1, ... | p03652 |
# chokudaiブログの典型力の話を意識しつつ考えたら思いついた!
# 「ある集合の部分集合の中で、〜〜〜の値が最小になるものを求めよ」のパターン
# 愚直にやると2^Nを調べねばならず無理。
# したがって「一部を調べればよい」に帰着するのが多いだろう。
# 何らかの形でソートしておいて、空集合から1つずつ付け加えるとか。全体集合から1つずつ取り去るとか。
# 今回は全体集合から1つずつ取り去るのを考えるとできる。
# 全体集合である競技m0が最多の人数p0人を集めたとする。
# すると、全ての部分集合のうち「m0を含む集合」を考えると、競技m0は必ずp0人以上集まるので解もp0以上。
# ここで「m0... | # chokudaiブログの典型力の話を意識しつつ考えたら思いついた!
# 「ある集合の部分集合の中で、〜〜〜の値が最小になるものを求めよ」のパターン
# 愚直にやると2^Nを調べねばならず無理。
# したがって「一部を調べればよい」に帰着するのが多いだろう。
# 何らかの形でソートしておいて、空集合から1つずつ付け加えるとか。全体集合から1つずつ取り去るとか。
# 今回は全体集合から1つずつ取り去るのを考えるとできる。
# 全体集合である競技m0が最多の人数p0人を集めたとする。
# すると、全ての部分集合のうち「m0を含む集合」を考えると、競技m0は必ずp0人以上集まるので解もp0以上。
# ここで「m0... | p03652 |
# chokudaiブログの典型力の話を意識しつつ考えたら思いついた!
# 「ある集合の部分集合の中で、〜〜〜の値が最小になるものを求めよ」のパターン
# 愚直にやると2^Nを調べねばならず無理。
# したがって「一部を調べればよい」に帰着するのが多いだろう。
# 何らかの形でソートしておいて、空集合から1つずつ付け加えるとか。全体集合から1つずつ取り去るとか。
# 今回は全体集合から1つずつ取り去るのを考えるとできる。
# 全体集合である競技m0が最多の人数p0人を集めたとする。
# すると、全ての部分集合のうち「m0を含む集合」を考えると、競技m0は必ずp0人以上集まるので解もp0以上。
# ここで「m0... | # chokudaiブログの典型力の話を意識しつつ考えたら思いついた!
# 「ある集合の部分集合の中で、〜〜〜の値が最小になるものを求めよ」のパターン
# 愚直にやると2^Nを調べねばならず無理。
# したがって「一部を調べればよい」に帰着するのが多いだろう。
# 何らかの形でソートしておいて、空集合から1つずつ付け加えるとか。全体集合から1つずつ取り去るとか。
# 今回は全体集合から1つずつ取り去るのを考えるとできる。
# 全体集合である競技m0が最多の人数p0人を集めたとする。
# すると、全ての部分集合のうち「m0を含む集合」を考えると、競技m0は必ずp0人以上集まるので解もp0以上。
# ここで「m0... | p03652 |
from collections import Counter
N, M = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
check = [0] * (M + 1)
answer = []
for _ in range(M):
tmp = []
for ai in A:
for aij in ai:
if check[aij] == 0:
tmp.append(aij)
break
#print(tmp)... | from collections import Counter
N, M = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
check = [0] * (M + 1)
answer = []
for _ in range(M):
tmp = []
for ai in A:
for aij in ai:
if check[aij] == 0:
tmp.append(aij)
break
counter = l... | p03652 |
from collections import Counter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = N
Q = [set([v for v in range(M)])]
while Q:
sports_cand = Q.pop(0)
n_sports = [0]*M
... | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = N
Q = [set([v for v in range(M)])]
checked = {"".join([str(v) for v in range(M)])}
while Q:
sports_cand = Q.pop(0)
n... | p03652 |
from collections import Counter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = N
sports_cand = set([v for v in range(M)])
for _ in range(M-1):
C = Counter()
for n ... | from collections import Counter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = N
Q = [set([v for v in range(M)])]
while Q:
C = Counter()
sports_cand = Q.pop(0)
... | p03652 |
from collections import defaultdict
N, M = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
def search(sportList):
if not sportList:
return float('inf')
cnt = defaultdict(int)
for p in range(N):
for a in A[p]:
if a in spor... | from collections import defaultdict
N, M = list(map(int, input().split()))
INF = float('inf')
A = [tuple(map(int, input().split())) for _ in range(N)]
def search(sports):
if not sports:
return INF
cnt = [0] * (M + 1)
for a in A:
for p in a:
if p in sports:
... | p03652 |
from collections import Counter
N, M=list(map(int, input().split()))
m=[]
ans = 300
for i in range(N):
m.append(list(map(int,input().split())))
def search(ln):
#l = []
cnt = Counter()
for r in m:
for col in r:
if col in ln:
cnt[col] += 1
... | from collections import Counter
N, M=list(map(int, input().split()))
m=[]
ans = 300
for i in range(N):
m.append(list(map(int,input().split())))
def search(ln):
#l = []
cnt = Counter()
for r in m:
cnt[r[0]] += 1
s,c = cnt.most_common(1)[0]
global ans
ans = min(ans, ... | p03652 |
import itertools
n, m = input().split(' ');
n = int(n)
m = int(m)
a = [[int(num) for num in input().split(' ')] for _ in range(n)]
sports = [list(itertools.combinations([num + 1 for num in range(m)], i + 1))
for i in range(m)]
min = 300
for combs in sports:
for comb in combs:
dist ... | import itertools
n, m = input().split(' ');
n = int(n)
m = int(m)
a = [[int(num) for num in input().split(' ')] for _ in range(n)]
sports = [i + 1 for i in range(m)]
min = 300
for _ in range(m):
dict = {i: 0 for i in sports}
for player in a:
for num in player:
if num in spor... | p03652 |
# https://atcoder.jp/contests/agc018/submissions/2152627
# 写経
from collections import deque
from operator import itemgetter
def solve(n, m, prefers):
def sub(prefers, canceled):
ret = [0] * m
for pref in prefers:
while canceled[pref[0]]:
pref.popleft()
... | # 同じ解法
# 自力で書けるか確認
def solve():
from operator import itemgetter
n, m = list(map(int, input().split()))
a = tuple([int(x) - 1 for x in reversed(input().split())] for _ in range(n))
excluded = [False] * m
ret = n
for _ in range(m):
cnt = [0] * m
for p in a:
... | p03652 |
# -*- 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 ... | p03652 |
import sys
input = sys.stdin.buffer.readline
n, m = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
cnt = [0] * (m + 1)
cur = [0] * n
done = [0] * (m + 1)
for i in range(n):
cnt[a[i][0]] += 1
cur[i] = a[i][0]
ans = max(cnt)
for _ in range(m - 1):
col = cnt.index(... | import sys
input = sys.stdin.buffer.readline
n, m = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
cnt = [0] * (m + 1)
cur = [0] * n
cur_idx = [0] * n
done = [0] * (m + 1)
for i in range(n):
cnt[a[i][0]] += 1
cur[i] = a[i][0]
ans = max(cnt)
for _ in range(m - 1):... | p03652 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
N,M = LI()
A = [LI() for _ in range(N)]
ctr = [0] * N
sp = [0] * (M+1)
for i in range(N):
sp[A[i][ctr[i]]] += 1
ans = max(sp)
... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
N,M = LI()
A = [LI() for _ in range(N)]
ctr = [0] * N
sp = [0] * (M+1)
for i in range(N):
sp[A[i][ctr[i]]] += 1
ans = max(sp)
... | p03652 |
import sys
input=sys.stdin.readline
from collections import Counter
n,m=list(map(int,input().split()))
A,B=[],[]
for _ in range(n):
A.append(tuple([int(x)-1 for x in input().split()]))
B.append(A[-1][0])
delete=[False]*m
ans=n
for _ in range(m-1):
c=Counter(B)
sport,num=c.most_common()[0]
... | import sys
input=sys.stdin.readline
from collections import Counter
n,m=list(map(int,input().split()))
A,B=[],[]
for _ in range(n):
A.append(tuple([int(x)-1 for x in input().split()]))
B.append(A[-1][0])
delete=[False]*m
ans=n
idx=[0]*n
for _ in range(m-1):
c=Counter(B)
sport,num=c.most_com... | p03652 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
total=[0]*(n+1)
asum=[0]*(n+1)
for i in range(n):
asum[i+1]=asum[i]+a[i]
if a[i]>0:
total[i+1]=total[i]+a[i]
else:
total[i+1]=total[i]
ans=0
for i in range(n-k+1):
tmp=asum[i+k]-asum[i]
ans=max(ans,tmp+t... | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s1=[0]*n
s1[0]=a[0]
s2=[0]*n
if a[0]>0:
s2[0]=a[0]
for i in range(1,n):
s1[i]+=s1[i-1]+a[i]
s2[i]+=s2[i-1]
if a[i]>0:
s2[i]+=a[i]
ans=-float("inf")
for i in range(n-k+1):
if i==0:
tmp1=s1[i+k-1]
... | p03839 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
al = [0]*(n+1)
pl = [0]*(n+1)
ans = -10**10
for i in range(n):
al[i+1] = al[i] + a[i]
pl[i+1] = pl[i] + max(0,a[i])
for i in range(n-k+1):
l,r = i,i+k-1
cur = max(0,al[r+1]-al[l]) + pl[l] + pl[-1] - pl[r+1]
if cur > ans:
... | n,k = list(map(int,input().split()))
a = list(map(int, input().split()))
al = [0]*(n+1)
pl = [0]*(n+1)
ans = 0
for i in range(n):
al[i+1] = al[i] + a[i]
pl[i+1] = pl[i]
if a[i] > 0: pl[i+1] += a[i]
for r in range(k-1,n):
l = r-k+1
cur = pl[l] + max(0, al[r+1] - al[l]) + pl[n] - pl[r+1]
if ans < ... | p03839 |
n,k = list(map(int,input().split()))
a = list(map(int, input().split()))
al = [0]*(n+1)
pl = [0]*(n+1)
ans = 0
for i in range(n):
al[i+1] = al[i] + a[i]
pl[i+1] = pl[i]
if a[i] > 0: pl[i+1] += a[i]
for r in range(k-1,n):
l = r-k+1
cur = pl[l] + max(0, al[r+1] - al[l]) + pl[n] - pl[r+1]
if ans < ... | n,k = list(map(int,input().split()))
a = list(map(int, input().split()))
al = [0]*(n+1)
pl = [0]*(n+1)
ans = 0
for i in range(n):
al[i+1] = al[i] + a[i]
pl[i+1] = pl[i]
if a[i] > 0: pl[i+1] += a[i]
for r in range(k,n+1):
l = r-k
cur = pl[l] + max(0, al[r] - al[l]) + pl[n] - pl[r]
if ans < cur: a... | p03839 |
from itertools import accumulate
N, K, *A = list(map(int, open(0).read().split()))
M = [a if a < 0 else 0 for a in A]
P = [a if a > 0 else 0 for a in A]
MA = [0] + list(accumulate(M))
PA = [0] + list(accumulate(P))
minus = max(q - p for p, q in zip(MA, MA[K:]))
plus = min(q - p for p, q in zip(PA, PA[K:]... | from itertools import accumulate
def main():
N, K, *A = list(map(int, open(0).read().split()))
M = [a if a < 0 else 0 for a in A]
P = [a if a > 0 else 0 for a in A]
MA = [0] + list(accumulate(M))
PA = [0] + list(accumulate(P))
minus = max(q - p for p, q in zip(MA, MA[K:]))
pl... | p03839 |
n,k = list(map(int,input().split()))
lis = list(map(int,input().split()))
num = 0
ans = 0
for i in range(n):num += max(0,lis[i])
li = [0 for i in range(n-k+1)]
for i in range(n-k+1):
cou = 0
co = 0
for nu in lis[i:i+k]:
if nu >= 0:cou += nu
else:co -= nu
if cou >= co:ans = max(ans,num-co)
... | n,k = list(map(int,input().split()))
lis = list(map(int,input().split()))
num = 0
ans = 0
cou = 0
co = 0
for i in range(n):num += max(0,lis[i])
li = [0 for i in range(n-k+1)]
for i in range(k-1):
cou += max(0,lis[i])
co += max(0,-lis[i])
for i in range(n-k+1):
cou += max(0,lis[i+k-1])
co += max(0,-... | p03839 |
from itertools import accumulate
n,k,*a=list(map(int,open(0).read().split()))
p=[x if x>0 else 0 for x in a]
acc=[0]+list(accumulate(a))
p_acc=[0]+list(accumulate(p))
rev_p_acc=[0]+list(accumulate(p[::-1]))
print((max(max(0,acc[k+i]-acc[i])+p_acc[i]+rev_p_acc[n-k-i] for i in range(n-k+1)))) | from itertools import accumulate
def main():
n, k, *a = list(map(int, open(0).read().split()))
p = [x if x > 0 else 0 for x in a]
acc = [0] + list(accumulate(a))
p_acc = [0] + list(accumulate(p))
rev_p_acc = [0] + list(accumulate(p[::-1]))
print((max(max(0, acc[k + i] - acc[i]) + p_acc[i] + rev_p_acc[n - k... | p03839 |
N,K = list(map(int,input().split()))
src = list(map(int,input().split()))
cums = [0]
cump = [0]
for a in src:
cums.append(cums[-1] + a)
cump.append(cump[-1] + max(0,a))
ans = 0
for i in range(N-K+1):
tmp = cump[i]
tmp += max(0, cums[i+K] - cums[i])
tmp += cump[N] - cump[i+K]
ans ... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
cums = [0]
cums_p = [0]
for a in A:
cums.append(cums[-1] + a)
cums_p.append(cums_p[-1] + max(0,a))
ans = -float('inf')
for l in range(N-K+1):
free = cums_p[l] + cums_p[-1] - cums_p[l+K]
cont = cums[l+K] - cums[l]
... | p03839 |
# Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
r = 1000000001
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if y1 == y2:
EP.append((min(x1, x2), l, y1))
EP.append((max(x1, x2), r, y1))
el... | # Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
u = 1000000001
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if x1 == x2:
if y1 < y2:
EP.append((y1, l, x1))
EP.append((y2, u, x... | p02304 |
# Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
u = 1000000001
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if x1 == x2:
if y1 < y2:
EP.append((y1, l, x1))
EP.append((y2, u, x... | # Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
u = 1000000001
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if x1 == x2:
if y1 < y2:
EP.append((y1, l, x1))
EP.append((y2, u, x... | p02304 |
# Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
u = 1000000001
vs_x = set()
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if x1 == x2:
if y1 < y2:
EP.append((y1, l, x1))
EP.ap... | # Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
u = 1000000001
vs_x = set()
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if x1 == x2:
if y1 < y2:
EP.append((y1, l, x1))
EP.ap... | p02304 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.