problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02850
|
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n=int(input())
edge=[[] for i in range(n+1)]
par=[0]*(n+1)#i番目の頂点とその親を結ぶ辺の色
par[1]=-1
col=[0]*(n-1)#i番目の辺の色
for i in range(n-1):
a,b=mp()
edge[a].append([a,b,i])
edge[b].append([b,a,i])
print(edge)
que=deque([edge[1]])
while len(que):
k=1
q=que.popleft()
for x,y,i in q:
if col[i]==0:
if k==par[x]:
k+=1
col[i]=k
par[y]=k
k+=1
que.append(edge[y])
print(max(col))
for i in range(n-1):
print(col[i])
|
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n=int(input())
edge=[[] for i in range(n+1)]
par=[0]*(n+1)#i番目の頂点とその親を結ぶ辺の色
par[1]=-1
col=[0]*(n-1)#i番目の辺の色
for i in range(n-1):
a,b=mp()
edge[a].append([a,b,i])
edge[b].append([b,a,i])
que=deque([edge[1]])
while len(que):
k=1
q=que.popleft()
for x,y,i in q:
if col[i]==0:
if k==par[x]:
k+=1
col[i]=k
par[y]=k
k+=1
que.append(edge[y])
print(max(col))
for i in range(n-1):
print(col[i])
|
[
"call.remove"
] | 655,994
| 655,995
|
u024782094
|
python
|
p02850
|
from collections import deque
n=int(input())
g=[[] for i in range(n)]
b=[0]*(n-1)
for i in range(n-1):
ai,bi=map(int,input().split())
g[ai-1].append(bi-1)
g[bi-1].append(ai-1)
b[i]=bi-1
#n=8
#g=[[1], [0, 2, 3, 4], [1], [1, 6], [1, 5], [4, 7], [3], [5]]
#n=6
#g=[[1, 2, 3, 4, 5], [0], [0], [0], [0], [0]]
q=deque([0])
stack=[0]
parent=[-1]*n
pc=[-1]*n
parent[0]=0
dist=[-1]*n
dist[0]=0
while q:
state = q.popleft()
ic=0
for v in g[state]:
if parent[v] !=-1:
continue
else:
parent[v]=state
dist[v]=dist[state]+1
q.append(v)
ic+=1
if ic==pc[state]:
ic+=1
pc[v]=ic
k=max(pc)
print(k)
for i in range(1,n):
print(pc[bi[i]])
|
from collections import deque
n=int(input())
g=[[] for i in range(n)]
b=[0]*(n-1)
for i in range(n-1):
ai,bi=map(int,input().split())
g[ai-1].append(bi-1)
g[bi-1].append(ai-1)
b[i]=bi-1
#n=8
#g=[[1], [0, 2, 3, 4], [1], [1, 6], [1, 5], [4, 7], [3], [5]]
#b=[1, 2, 3, 4, 6, 5, 7]
#n=6
#g=[[1, 2, 3, 4, 5], [0], [0], [0], [0], [0]]
q=deque([0])
stack=[0]
parent=[-1]*n
pc=[-1]*n
parent[0]=0
dist=[-1]*n
dist[0]=0
while q:
state = q.popleft()
ic=0
for v in g[state]:
if parent[v] !=-1:
continue
else:
parent[v]=state
dist[v]=dist[state]+1
q.append(v)
ic+=1
if ic==pc[state]:
ic+=1
pc[v]=ic
k=max(pc)
print(k)
for i in range(n-1):
print(pc[b[i]])
|
[
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 655,996
| 655,997
|
u576432509
|
python
|
p02850
|
from collections import deque
N = int(input())
edges=[[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edges[a].append((b, i))
edges[b].append((a, i))
next_set = deque([(0,0)])
colors = [0]*(N-1)
while next_set:
p, i = next_set.popleft()
cnt = 1 if colors[i] != 1 else 2
for q, j in edges[p]:
if colors[j] != 0:
continue
colors[j] = cnt
cnt += 1
if cnt == i:
cnt += 1
next_set.append((q, j))
print(max(colors))
print(*colors, sep="\n")
|
from collections import deque
N = int(input())
edges=[[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edges[a].append((b, i))
edges[b].append((a, i))
next_set = deque([(0,0)])
colors = [0]*(N-1)
while next_set:
p, i = next_set.popleft()
cnt = 1 if colors[i] != 1 else 2
for q, j in edges[p]:
if colors[j] != 0:
continue
colors[j] = cnt
cnt += 1
if cnt == colors[i]:
cnt += 1
next_set.append((q, j))
print(max(colors))
print(*colors, sep="\n")
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 656,004
| 656,005
|
u367701763
|
python
|
p02850
|
def resolve():
N = int(input())
g = {}
for i in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append((b-1, i))
g.setdefault(b-1, [])
g[b-1].append((a-1, i))
nodes = [(None, 0)]
colors = [None for _ in range(N-1)]
maxdeg = 0
while nodes:
prevcol, node = nodes.pop()
maxdeg = max(maxdeg, len(g[node]))
color = 1 if prevcol != 1 else 2
for nxt, colidx in g[node]:
if colors[colidx] is None:
colors[colidx] = color
nodes.append((color, nxt))
color += 1 if prevcol != colidx+1 else 2
print(maxdeg)
for col in colors:
print(col)
if '__main__' == __name__:
resolve()
|
def resolve():
N = int(input())
g = {}
for i in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append((b-1, i))
g.setdefault(b-1, [])
g[b-1].append((a-1, i))
nodes = [(None, 0)]
colors = [None for _ in range(N-1)]
maxdeg = 0
while nodes:
prevcol, node = nodes.pop()
maxdeg = max(maxdeg, len(g[node]))
color = 1 if prevcol != 1 else 2
for nxt, colidx in g[node]:
if colors[colidx] is None:
colors[colidx] = color
nodes.append((color, nxt))
color += 1 if prevcol != color+1 else 2
print(maxdeg)
for col in colors:
print(col)
if '__main__' == __name__:
resolve()
|
[
"identifier.change",
"expression.operation.binary.change"
] | 656,010
| 656,011
|
u106797249
|
python
|
p02850
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *
N = INT()
ab = [LIST() for _ in range(N-1)]
graph = [[] for _ in range(N)]
for a, b in ab:
graph[a-1].append(b-1)
graph[b-1].append(a-1)
length = [len(x) for x in graph]
ans = max(length)
color = defaultdict(int)
def coloring(n, previous, col): #頂点nにpreviousから色colで辿ってきた。
cnt = 1
for x in graph[n]:
print(n, x)
if x == previous:
color[(n, x)] = col
color[(x, n)] = col #やってきた頂点との間における色
else:
if cnt == col:
cnt += 1
color[(x, n)] = cnt
color[(n, x)] = cnt
coloring(x, n, cnt)
cnt += 1
coloring(0, -1, 0)
print(ans)
for a, b in ab:
print(color[(a-1, b-1)])
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *
N = INT()
ab = [LIST() for _ in range(N-1)]
graph = [[] for _ in range(N)]
for a, b in ab:
graph[a-1].append(b-1)
graph[b-1].append(a-1)
length = [len(x) for x in graph]
ans = max(length)
color = defaultdict(int)
def coloring(n, previous, col): #頂点nにpreviousから色colで辿ってきた。
cnt = 1
for x in graph[n]:
if x == previous:
color[(n, x)] = col
color[(x, n)] = col #やってきた頂点との間における色
else:
if cnt == col:
cnt += 1
color[(x, n)] = cnt
color[(n, x)] = cnt
coloring(x, n, cnt)
cnt += 1
coloring(0, -1, 0)
print(ans)
for a, b in ab:
print(color[(a-1, b-1)])
|
[
"call.remove"
] | 656,018
| 656,019
|
u285891772
|
python
|
p02850
|
import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(input())
directions=np.array([[1,0],[0,1],[-1,0],[0,-1]])
directions = list(map(np.array, directions))
mod = 10**9+7
def factorial(n):
fact = 1
for integer in range(1, n + 1):
fact *= integer
return fact
def search(x,col_befedge):
#print("top", x, count)
global col
k=1
for n in adj[x]:
e=tuple(sorted((n,x)))
#print(e,k,col_befedge)
if col[e]>0:
continue
if k==col_befedge:
k+=1
#if k==col_pa:
# k+=1
col[e]=k
search(n,k)
k+=1
N=int(input())
adj=[[] for i in range(N+1)]
edges=[]
col={}
for i in range(N-1):
tmp=acinput()
adj[tmp[0]].append(tmp[1])
adj[tmp[1]].append(tmp[0])
col[tuple(sorted(tmp))]=0
edges.append(tuple(sorted(tmp)))
#col=[-1]*(N+1)
#col[1]=1
#print(adj)
search(1,0)
#print(reduce(lambda a,b:max(a,b),col.keys))
print(col[max(col)])
for se in edges:
print(col[se])
|
import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(input())
directions=np.array([[1,0],[0,1],[-1,0],[0,-1]])
directions = list(map(np.array, directions))
mod = 10**9+7
def factorial(n):
fact = 1
for integer in range(1, n + 1):
fact *= integer
return fact
def search(x,col_befedge):
#print("top", x, count)
global col
k=1
for n in adj[x]:
e=tuple(sorted((n,x)))
#print(e,k,col_befedge)
if col[e]>0:
continue
if k==col_befedge:
k+=1
#if k==col_pa:
# k+=1
col[e]=k
search(n,k)
k+=1
N=int(input())
adj=[[] for i in range(N+1)]
edges=[]
col={}
for i in range(N-1):
tmp=acinput()
adj[tmp[0]].append(tmp[1])
adj[tmp[1]].append(tmp[0])
col[tuple(sorted(tmp))]=0
edges.append(tuple(sorted(tmp)))
#col=[-1]*(N+1)
#col[1]=1
#print(adj)
search(1,0)
#print(reduce(lambda a,b:max(a,b),col.keys))
#print(col)
print(max(col.values()))
#print(col[max(col)])
for se in edges:
print(col[se])
|
[
"call.add",
"call.arguments.change",
"io.output.change"
] | 656,034
| 656,035
|
u346308892
|
python
|
p02850
|
import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
n = int(input())
edge = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = map(int,input().split())
edge[a].append((b, i))
edge[b].append((a, i))
colors = 0
for i, line in enumerate(edge):
colors = max(colors, len(line))
work_q = deque()
work_q.append((1, -1, -1))
color = [-1] * (n - 1)
while work_q:
here, prev, col = work_q.popleft()
cnt = 1
for to, ind in edge[here]:
if to == prev:
continue
if cnt == col:
cnt += 1
color[ind] = cnt
work_q.append((to, here, cnt))
cnt += 1
print(*color, sep="\n")
|
import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
n = int(input())
edge = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = map(int,input().split())
edge[a].append((b, i))
edge[b].append((a, i))
colors = 0
for i, line in enumerate(edge):
colors = max(colors, len(line))
print(colors)
work_q = deque()
work_q.append((1, -1, -1))
color = [-1] * (n - 1)
while work_q:
here, prev, col = work_q.popleft()
cnt = 1
for to, ind in edge[here]:
if to == prev:
continue
if cnt == col:
cnt += 1
color[ind] = cnt
work_q.append((to, here, cnt))
cnt += 1
print(*color, sep="\n")
|
[
"call.add"
] | 656,041
| 656,042
|
u599114793
|
python
|
p02850
|
import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
if u!=p: #木構造の逆向きの矢印を除くための条件
if col == p_col:
col += 1
Ans[idx] = col
print(p_col)
dfs(u, v, col) #u;調べる頂点 v;直前に調べた辺で、調べる頂点と結ばれている頂点 col;直前に調べた辺の色番号
col += 1 #最深部まで調べたら デフォルトの色=最後に調べた辺の色+1とする
#最深部に繋がった辺の色+1してやれば、次の辺の色は必ず条件を満たしてくれる
dfs()
print("\n".join(map(str, Ans)))
|
import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
if u!=p:
if col == p_col:
col += 1
Ans[idx] = col
dfs(u, v, col)
col += 1
dfs()
print("\n".join(map(str, Ans)))
|
[
"call.remove"
] | 656,051
| 656,052
|
u029000441
|
python
|
p02850
|
import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
if u!=p: #木構造の逆向きの矢印を除くための条件
if col == p_col:
col += 1
Ans[idx] = col
print(p_col)
dfs(u, v, col) #u;調べる頂点 v;直前に調べた辺で、調べる頂点と結ばれている頂点 col;直前に調べた辺の色番号
col += 1 #最深部まで調べたら デフォルトの色=最後に調べた辺の色+1とする
#最深部に繋がった辺の色+1してやれば、次の辺の色は必ず条件を満たしてくれる
dfs()
print("\n".join(map(str, Ans)))
|
import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
if u!=p: #木構造の逆向きの矢印を除くための条件
if col == p_col:
col += 1
Ans[idx] = col
#print(p_col)
dfs(u, v, col) #u;調べる頂点 v;直前に調べた辺で、調べる頂点と結ばれている頂点 col;直前に調べた辺の色番号
col += 1 #最深部まで調べたら デフォルトの色=最後に調べた辺の色+1とする
#最深部に繋がった辺の色+1してやれば、次の辺の色は必ず条件を満たしてくれる
dfs()
print("\n".join(map(str, Ans)))
|
[
"call.remove"
] | 656,051
| 656,053
|
u029000441
|
python
|
p02850
|
import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b])))
ans = max(count)
c = 1
def dfs(idx, pr):
c = 1
col = color[pr]
for i in edge[idx]:
if i not in pr:
if c == col:
c+=1
x, y = sorted([i, idx])
color[(x, y)] = c
dfs(i, (x, y))
c+=1
color[(-1, -1)] = 0
dfs(0, (-1, -1))
print(ans)
for tpl in egs:
print(color[tpl])
|
import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b])))
ans = max(count)
c = 1
def dfs(idx, pr):
c = 1
col = color[pr]
for i in edge[idx]:
if i in pr:
continue
if c == col:
c+=1
x, y = sorted([i, idx])
color[(x, y)] = c
dfs(i, (x, y))
c+=1
color[(-1, -1)] = 0
dfs(0, (-1, -1))
print(ans)
for tpl in egs:
print(color[tpl])
|
[
"control_flow.branch.if.condition.change",
"control_flow.continue.add"
] | 656,060
| 656,059
|
u707498674
|
python
|
p02850
|
import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b])))
ans = max(count)
c = 1
def dfs(idx, pr):
c = 1
col = color[pr]
for i in edge[idx]:
if i not in pr:
if c == col:
c+=1
x, y = sorted([i, idx])
color[(x, y)] = c
dfs(i, (x, y))
c+=1
color[(-1, -1)] = 0
dfs(0, (-1, -1))
print(ans)
for tpl in egs:
print(color[tpl])
|
import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b])))
ans = max(count)
c = 1
def dfs(idx, pr):
c = 1
col = color[pr]
for i in edge[idx]:
if i in pr:
continue
if c == col:
c+=1
x, y = sorted([i, idx])
color[(x, y)] = c
dfs(i, (x, y))
c+=1
color[(-1, -1)] = 0
dfs(0, (-1, -1))
print(ans)
for tpl in egs:
print(color[tpl])
|
[
"control_flow.branch.if.condition.change",
"control_flow.continue.add"
] | 656,060
| 656,061
|
u707498674
|
python
|
p02850
|
n=int(input())
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
g[a-1].append((b-1,i))
vc=[0] * n
ec=[-1]*(n-1)
for p,ci in enumerate(g):
color = 1
for c, i in ci:
if vc[p] == c:
color += 1
vc[c] = color
ec[i] = color
color += 1
print(max(ec))
for i in range(n-1):
print(ec[i])
|
n=int(input())
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
g[a-1].append((b-1,i))
vc=[0] * n
ec=[-1]*(n-1)
for p,ci in enumerate(g):
color = 1
for c, i in ci:
if vc[p] == color:
color += 1
vc[c] = color
ec[i] = color
color += 1
print(max(ec))
for i in range(n-1):
print(ec[i])
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,070
| 656,071
|
u242196904
|
python
|
p02850
|
from collections import deque
N = int(input())
# グラフ準備
graph = [[] for _ in range(N + 1)]
seq = []
for _ in range(N - 1):
a, b = map(int, input().split())
graph[a].append(b)
seq.append(b)
# BFS
q = deque([1])
color = [0] * (N + 1)
while q:
checking_parent = q.popleft()
parent_color = color[checking_parent]
c = 1
for child in graph[checking_parent]:
if c == parent_color:
c += 1
# 使用したcolorをchildの色として格納する
color[child] = c
c += 1
# childを探索候補へ追加
q.append(child)
print(max(color))
for i in range(2, N + 1):
print(color[i])
|
# 参考：https://atcoder.jp/contests/abc146/submissions/10412733
from collections import deque
N = int(input())
# グラフ準備
graph = [[] for _ in range(N + 1)]
seq = []
for _ in range(N - 1):
a, b = map(int, input().split())
graph[a].append(b)
seq.append(b)
# BFS
q = deque([1])
color = [0] * (N + 1)
while q:
checking_parent = q.popleft()
parent_color = color[checking_parent]
c = 1
for child in graph[checking_parent]:
if c == parent_color:
c += 1
# 使用したcolorをchildの色として格納する
color[child] = c
c += 1
# childを探索候補へ追加
q.append(child)
print(max(color))
for i in range(N - 1):
print(color[seq[i]])
|
[
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 656,094
| 656,095
|
u134302690
|
python
|
p02850
|
from collections import deque, defaultdict
N = int(input())
ab = [[int(i) for i in input().split()] for _ in range(N-1)]
#print(ab)
outs = defaultdict(list)
ins = defaultdict(int)
for v1, v2 in ab:
outs[v1].append(v2)
ins[v2] += 1
q = deque(v1 for v1 in range(1,N+1) if ins[v1] == 0)
hoji = []
dicthoji = {1: 0}
while q:
v1 = q.popleft()
count = 0
for v2 in outs[v1]: #v1のノードから出ている矢印をみる．
count += 1
if dicthoji[v1] == count: #前に色を使っていたら飛ばす
count += 1
ins[v2] -= 1
q.append(v2)
dicthoji.update([(v2,count)])
hoji.append(count)
print(dicthoji)
print(max(hoji))
for i in range(N-1):
print(dicthoji[ab[i][1]])
|
from collections import deque, defaultdict
N = int(input())
ab = [[int(i) for i in input().split()] for _ in range(N-1)]
#print(ab)
outs = defaultdict(list)
ins = defaultdict(int)
for v1, v2 in ab:
outs[v1].append(v2)
ins[v2] += 1
q = deque(v1 for v1 in range(1,N+1) if ins[v1] == 0)
hoji = []
dicthoji = {1: 0}
while q:
v1 = q.popleft()
count = 0
for v2 in outs[v1]: #v1のノードから出ている矢印をみる．
count += 1
if dicthoji[v1] == count: #前に色を使っていたら飛ばす
count += 1
ins[v2] -= 1
q.append(v2)
dicthoji.update([(v2,count)])
hoji.append(count)
#print(dicthoji)
print(max(hoji))
for i in range(N-1):
print(dicthoji[ab[i][1]])
|
[
"call.remove"
] | 656,096
| 656,097
|
u697559326
|
python
|
p02850
|
import collections
from collections import deque
def tree(s):
INF=-10**9
dis = [INF for i in range(n)]
ans = [INF for i in range(n)]
dis[s]=0
def bfs():
d = deque()
d.append(s)
while len(d):
x = d.popleft()
cnt=1
for i in range(len(b[x])):
y=b[x][i]
if dis[y] == INF:
d.append(y)
dis[y]=dis[x]+1
if ans[x]!=cnt:
ans[y]=cnt
cnt+=1
else:
cnt+=1
ans[y]=cnt
cnt+=1
return ans
return bfs()
n=int(input())
a = [list(map(int, input().split())) for i in range(n-1)]
b = [[] for i in range(n)]
for i in range(n-1):
b[a[i][0]-1].append(a[i][1]-1)
x=tree(0)
print(max(x))
for i in range(1,n):
print(x[a[i][1]-1])
|
import collections
from collections import deque
def tree(s):
INF=-10**9
dis = [INF for i in range(n)]
ans = [INF for i in range(n)]
dis[s]=0
def bfs():
d = deque()
d.append(s)
while len(d):
x = d.popleft()
cnt=1
for i in range(len(b[x])):
y=b[x][i]
if dis[y] == INF:
d.append(y)
dis[y]=dis[x]+1
if ans[x]!=cnt:
ans[y]=cnt
cnt+=1
else:
cnt+=1
ans[y]=cnt
cnt+=1
return ans
return bfs()
n=int(input())
a = [list(map(int, input().split())) for i in range(n-1)]
b = [[] for i in range(n)]
for i in range(n-1):
b[a[i][0]-1].append(a[i][1]-1)
x=tree(0)
print(max(x))
for i in range(n-1):
print(x[a[i][1]-1])
|
[
"call.arguments.change"
] | 656,098
| 656,099
|
u970899068
|
python
|
p02850
|
from collections import deque
n=int(input())
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=map(int,input().split())
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.pop()
color=1
for ni in E[s]:
if color==ans[s]:
color+=1
else:
ans[ni]=color
color+=1
que.append(ni)
print(max(ans))
for i in L:
print(ans(i))
|
from collections import deque
n=int(input())
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=map(int,input().split())
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.pop()
color=1
for ni in E[s]:
if color==ans[s]:
color+=1
ans[ni]=color
color+=1
que.append(ni)
print(max(ans))
for i in L:
print(ans[i])
|
[
"call.arguments.change",
"io.output.change"
] | 656,108
| 656,109
|
u573754721
|
python
|
p02850
|
import sys
input = sys.stdin.buffer.readline
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N + 1)]
for a, b in AB:
graph[a].append(b)
graph[b].append(a)
def make_tree(graph, root) -> (list, list, list):
INF = 10 ** 15
dist = [INF] * len(graph)
parent = [-1] * len(graph)
stack = [root]
dist[root] = 0
order = []
parent[root] = root
while stack:
s = stack.pop()
order.append(s)
for g in graph[s]:
if dist[g] > dist[s] + 1:
dist[g] = dist[s] + 1
parent[g] = s
stack.append(g)
return dist, parent, order
dist, parent, order = make_tree(graph, 1)
color = [-1] * (N + 1)
for s in order:
ng = color[s]
c = 1
for g in graph[s]:
if parent[s] == g:
continue
if c == ng:
c += 1
color[g] = c
c += 1
print(color)
answer = []
for a, b in AB:
if parent[a] == b:
answer.append(color[a])
else:
answer.append(color[b])
print(max(answer))
for a in answer:
print(a)
|
import sys
input = sys.stdin.buffer.readline
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N + 1)]
for a, b in AB:
graph[a].append(b)
graph[b].append(a)
def make_tree(graph, root) -> (list, list, list):
INF = 10 ** 15
dist = [INF] * len(graph)
parent = [-1] * len(graph)
stack = [root]
dist[root] = 0
order = []
parent[root] = root
while stack:
s = stack.pop()
order.append(s)
for g in graph[s]:
if dist[g] > dist[s] + 1:
dist[g] = dist[s] + 1
parent[g] = s
stack.append(g)
return dist, parent, order
dist, parent, order = make_tree(graph, 1)
color = [-1] * (N + 1)
for s in order:
ng = color[s]
c = 1
for g in graph[s]:
if parent[s] == g:
continue
if c == ng:
c += 1
color[g] = c
c += 1
answer = []
for a, b in AB:
if parent[a] == b:
answer.append(color[a])
else:
answer.append(color[b])
print(max(answer))
for a in answer:
print(a)
|
[
"call.remove"
] | 656,121
| 656,122
|
u296518383
|
python
|
p02850
|
import sys
from collections import deque
def solve():
input = sys.stdin.readline
N = int(input())
edge = [[] for _ in range(N)]
order = dict()
for i in range(N-1):
a, b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
order[(min(a-1, b-1), max(a-1, b-1))] = i
K = 0
for i in range(N): K = max(K, len(edge[i]))
q = deque()
col = [-1] * N
col[0] = 0
colE = [-1] * (N - 1)
colPointer = 1
for next in edge[0]:
q.append((0, next))
col[next] = colPointer
colE[order[(0, next)]] = colPointer
colPointer += 1
while q:
parentNode, nowNode = q.popleft()
par[nowNode] = parentNode
colPointer = 1
for nextNode in edge[nowNode]:
if nextNode != parentNode:
q.append((nowNode, nextNode))
if colPointer == col[nowNode]: colPointer += 1
col[nextNode] = colPointer
colE[order[(min(nowNode, nextNode), max(nowNode, nextNode))]] = colPointer
colPointer += 1
print(K)
for c in colE: print(c)
return 0
if __name__ == "__main__":
solve()
|
import sys
from collections import deque
def solve():
input = sys.stdin.readline
N = int(input())
edge = [[] for _ in range(N)]
order = dict()
for i in range(N-1):
a, b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
order[(min(a-1, b-1), max(a-1, b-1))] = i
K = 0
for i in range(N): K = max(K, len(edge[i]))
q = deque()
col = [-1] * N
col[0] = 0
colE = [-1] * (N - 1)
colPointer = 1
for next in edge[0]:
q.append((0, next))
col[next] = colPointer
colE[order[(0, next)]] = colPointer
colPointer += 1
while q:
parentNode, nowNode = q.popleft()
colPointer = 1
for nextNode in edge[nowNode]:
if nextNode != parentNode:
q.append((nowNode, nextNode))
if colPointer == col[nowNode]: colPointer += 1
col[nextNode] = colPointer
colE[order[(min(nowNode, nextNode), max(nowNode, nextNode))]] = colPointer
colPointer += 1
print(K)
for c in colE: print(c)
return 0
if __name__ == "__main__":
solve()
|
[
"assignment.remove"
] | 656,179
| 656,180
|
u608088992
|
python
|
p02850
|
import sys
from collections import deque
inputs = sys.stdin.readlines()
n = int(inputs[0])
edges = [tuple(map(int, x.split())) for x in inputs[1:]]
B = [e[1] for e in edges]
E = [[] for _ in range(N + 1)]
for a, b in edges:
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
c = 0
for u in E[v]:
c += 1 + (c + 1 == C[v])
C[u] = c
Q.append(u)
print(max(C))
for b in B:
print(C[b])
|
import sys
from collections import deque
inputs = sys.stdin.readlines()
n = int(inputs[0])
edges = [tuple(map(int, x.split())) for x in inputs[1:]]
B = [e[1] for e in edges]
E = [[] for _ in range(n + 1)]
for a, b in edges:
E[a].append(b)
Q = deque([1])
C = [0] * (n + 1)
while Q:
v = Q.popleft()
c = 0
for u in E[v]:
c += 1 + (c + 1 == C[v])
C[u] = c
Q.append(u)
print(max(C))
for b in B:
print(C[b])
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 656,188
| 656,189
|
u417365712
|
python
|
p02850
|
from collections import deque
n = int(input())
k = 0
data = [[] for _ in range(n)]
ans_index = []
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
data[a].append(b)
ans_index.append(b)
q = deque([0])
color = [0] * n
print(data)
while q:
cur = q.popleft()
c = 1
for x in data[cur]:
if c == color[cur]:
c += 1
color[x] = c
c += 1
q.append(x)
print(max(color))
for i in ans_index:
print(color[i])
|
from collections import deque
n = int(input())
k = 0
data = [[] for _ in range(n)]
ans_index = []
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
data[a].append(b)
ans_index.append(b)
q = deque([0])
color = [0] * n
while q:
cur = q.popleft()
c = 1
for x in data[cur]:
if c == color[cur]:
c += 1
color[x] = c
c += 1
q.append(x)
print(max(color))
for i in ans_index:
print(color[i])
|
[
"call.remove"
] | 656,194
| 656,195
|
u502731482
|
python
|
p02850
|
from collections import deque
n=int(input())
arr=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
arr[a-1].append([b-1,i])
arr[b-1].append([a-1,i])
print(arr)
que=deque([0])
ans=[0]*(n-1)
par=[0]*n
par[0]=-1
while que:
x=que.popleft()
p=par[x]
color=1
for tup in arr[x]:
if p==color:
color+=1
if ans[tup[1]]==0:
ans[tup[1]]=color
par[tup[0]]=color
color+=1
que.append(tup[0])
print(max(ans))
print(*ans,sep='\n')
|
from collections import deque
n=int(input())
arr=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
arr[a-1].append([b-1,i])
arr[b-1].append([a-1,i])
que=deque([0])
ans=[0]*(n-1)
par=[0]*n
par[0]=-1
while que:
x=que.popleft()
p=par[x]
color=1
for tup in arr[x]:
if p==color:
color+=1
if ans[tup[1]]==0:
ans[tup[1]]=color
par[tup[0]]=color
color+=1
que.append(tup[0])
print(max(ans))
print(*ans,sep='\n')
|
[
"call.remove"
] | 656,225
| 656,226
|
u669173971
|
python
|
p02850
|
n=int(input())
import sys
sys.setrecursionlimit(10 ** 7)
graph = [[] for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
graph[a - 1].append((b - 1, i))
graph[b - 1].append((a - 1, i))
# print(graph)
max_color=0
for graph_i in graph:
max_color=max(max_color, len(graph_i))
print(max_color)
colors=[-1]*(n-1)
def dfs(v, color, pre):
if color!=1:
nc=0
else:
nc=1
for e in graph[v]:
# print(e,nc)
if e[0]==pre:
continue
colors[e[1]]=nc
dfs(e[0],nc,v)
nc+=1
if nc==color:
nc+=1
dfs(0,-1,-1)
for c in colors:
print(c+1)
|
n=int(input())
import sys
sys.setrecursionlimit(10 ** 7)
graph = [[] for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
graph[a - 1].append((b - 1, i))
graph[b - 1].append((a - 1, i))
# print(graph)
max_color=0
for graph_i in graph:
max_color=max(max_color, len(graph_i))
print(max_color)
colors=[-1]*(n-1)
def dfs(v, color, pre):
if color!=0:
nc=0
else:
nc=1
for e in graph[v]:
# print(e,nc)
if e[0]==pre:
continue
colors[e[1]]=nc
dfs(e[0],nc,v)
nc+=1
if nc==color:
nc+=1
dfs(0,-1,-1)
for c in colors:
print(c+1)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 656,238
| 656,239
|
u405660020
|
python
|
p02850
|
from collections import deque
n = int(input())
graph = [[] for _ in range(n)]
edges = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
# graph[b].append(a)
edges[(a, b)] = i
# edges[(b, a)] = i
que = deque([0])
ans = [0] * (n - 1)
visited = [0] * n
visited[0] = 1
while que:
a = que.popleft()
c = 1
for b in graph[a]:
if not visited[b]:
if visited[a] == c:
c += 1
visited[b] = c
ans[edges[(a, b)]] = c
c += 1
que.append(b)
k = max(ans)
print(k)
for i in ans:
print(i)
|
from collections import deque
n = int(input())
graph = [[] for _ in range(n)]
edges = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
# graph[b].append(a)
edges[(a, b)] = i
# edges[(b, a)] = i
que = deque([0])
ans = [0] * (n - 1)
visited = [-1] * n
visited[0] = 0
while que:
a = que.popleft()
c = 1
for b in graph[a]:
if visited[b] < 0:
if visited[a] == c:
c += 1
visited[b] = c
ans[edges[(a, b)]] = c
c += 1
que.append(b)
k = max(ans)
print(k)
for i in ans:
print(i)
|
[
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 656,240
| 656,241
|
u940139461
|
python
|
p02850
|
from collections import deque
from heapq import heappush, heappop
n = int(input()) # 入力が1つ
# map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字
graph = [[] for _ in range(n)]
edge = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
graph[b].append(a)
edge[(a, b)] = i
edge[(b, a)] = i
def bfs(graph, start, n):
visited = [-1] * n
que = deque()
color = [0] * (n - 1)
visited[start] = 0
que.append(start)
while que:
node = que.popleft()
c = 1
for e in graph[node]:
if visited[e] < 0:
if visited[node] == c:
c += 1
visited[e] = c
color[edge[(e, node)]] = c
que.append(e)
c += 1
return color
r = bfs(graph, 0, n)
ans = max(r)
for k in r:
print(k)
|
from collections import deque
from heapq import heappush, heappop
n = int(input()) # 入力が1つ
# map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字
graph = [[] for _ in range(n)]
edge = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
graph[b].append(a)
edge[(a, b)] = i
edge[(b, a)] = i
def bfs(graph, start, n):
visited = [-1] * n
que = deque()
color = [0] * (n - 1)
visited[start] = 0
que.append(start)
while que:
node = que.popleft()
c = 1
for e in graph[node]:
if visited[e] < 0:
if visited[node] == c:
c += 1
visited[e] = c
color[edge[(e, node)]] = c
que.append(e)
c += 1
return color
r = bfs(graph, 0, n)
ans = max(r)
print(ans)
for k in r:
print(k)
|
[
"call.add"
] | 656,242
| 656,243
|
u940139461
|
python
|
p02850
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
ab = [list(map(int, readline().split())) for i in range(n - 1)]
gragh = [[] for j in range(n + 1)]
for a, b in ab:
gragh[a].append(b)
gragh[b].append(a)
root = 1
parent = [0] * (n + 1)
stack = [root]
order = []
while stack:
x = stack.pop()
order.append(x)
for y in gragh[x]:
if y == parent[x]:
continue
parent[y] = x
stack.append(y)
color = [-1] * (n + 1)
for x in order:
ng = color[x]
cnt = 1
for y in gragh[x]:
if y == parent[x]:
continue
if cnt == ng:
cnt += 1
color[y] = cnt
cnt += 1
ans = []
append = ans.append
for a, b in ab:
if parent[a] == b:
append(color[a])
else:
append(color[b])
print(max(ans))
print('/n'.join(map(str, ans)))
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
ab = [list(map(int, readline().split())) for i in range(n - 1)]
gragh = [[] for j in range(n + 1)]
for a, b in ab:
gragh[a].append(b)
gragh[b].append(a)
root = 1
parent = [0] * (n + 1)
stack = [root]
order = []
while stack:
x = stack.pop()
order.append(x)
for y in gragh[x]:
if y == parent[x]:
continue
parent[y] = x
stack.append(y)
color = [-1] * (n + 1)
for x in order:
ng = color[x]
cnt = 1
for y in gragh[x]:
if y == parent[x]:
continue
if cnt == ng:
cnt += 1
color[y] = cnt
cnt += 1
ans = []
append = ans.append
for a, b in ab:
if parent[a] == b:
append(color[a])
else:
append(color[b])
print(max(ans))
print('\n'.join(map(str, ans)))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 656,266
| 656,267
|
u691018832
|
python
|
p02850
|
N = int(input())
data = [0]*(N-1)
cho = [0]*(N+1) #cho[i]にi番目の頂点の根元の色
res = [0]*(N-1) #枝の色
for i in range(0,N-1):
di = list(map(int, input().split()))
di.append(i)
data[i] = di
data = sorted(data)
print(data)
for i in range(0,N-1):
if i != 0 and data[i][0] == data[i-1][0]:
cur += 1
else:
cur = 1
if cur == cho[data[i][0]]: cur += 1
res[data[i][2]] = cur
cho[data[i][1]] = cur
print(max(cho))
for item in res:
print(item)
|
N = int(input())
data = [0]*(N-1)
cho = [0]*(N+1) #cho[i]にi番目の頂点の根元の色
res = [0]*(N-1) #枝の色
for i in range(0,N-1):
di = list(map(int, input().split()))
di.append(i)
data[i] = di
data = sorted(data)
for i in range(0,N-1):
if i != 0 and data[i][0] == data[i-1][0]:
cur += 1
else:
cur = 1
if cur == cho[data[i][0]]: cur += 1
res[data[i][2]] = cur
cho[data[i][1]] = cur
print(max(cho))
for item in res:
print(item)
|
[
"call.remove"
] | 656,285
| 656,286
|
u698460655
|
python
|
p02850
|
import sys
from collections import deque
# txt = "100000"
# for i in range(99999):
# txt += "\n" + str(i) +" " + str(i+1)
# def i():
# for l in txt.split("\n"):
# yield l
# input = i().__next__
def main():
N = int(input())
mawari = [[] for _ in range(N)]
e_num = [0] * N
for l in range(N-1):
i, j = [int(x)-1 for x in input().split()]
e_num[i] += 1
e_num[j] += 1
mawari[i].append((j, l))
mawari[j].append((i, l))
look = -1
for ind, l in enumerate(e_num):
if l == 1:
look = ind
break
color = [-1]*(N-1)
c_prev = deque([-1])
to_visit = deque([look])
maxc = 0
while len(to_visit)>=1:
look = to_visit.pop()
c = 0
prevc = c_prev[-1]
for i,j in mawari[look]:
if color[j] != -1:
continue
if c == prevc:
c += 1
color[j] = c
c_prev.append(c)
to_visit.append(i)
maxc = max(maxc, c)
c += 1
# mc, c = a(N, 0, look, color, mawari, -1)
print(maxc+1)
for i in color:
print(i+1)
# def a(N, maxc, look, color, mawari, prev):
# nexts = mawari[look]
# c = 0
# for i,j in nexts:
# if c == prev:
# c += 1
# color[j] = c
# maxc = max(maxc, a(N, maxc, i, color, mawari, c)[0])
# c += 1
# return maxc, color
main()
|
import sys
from collections import deque
# txt = "100000"
# for i in range(99999):
# txt += "\n" + str(i) +" " + str(i+1)
# def i():
# for l in txt.split("\n"):
# yield l
# input = i().__next__
def main():
N = int(input())
mawari = [[] for _ in range(N)]
e_num = [0] * N
for l in range(N-1):
i, j = [int(x)-1 for x in input().split()]
e_num[i] += 1
e_num[j] += 1
mawari[i].append((j, l))
mawari[j].append((i, l))
look = -1
for ind, l in enumerate(e_num):
if l == 1:
look = ind
break
color = [-1]*(N-1)
c_prev = deque([-1])
to_visit = deque([look])
maxc = 0
while len(to_visit)>=1:
look = to_visit.pop()
c = 0
prevc = c_prev.pop()
for i,j in mawari[look]:
if color[j] != -1:
continue
if c == prevc:
c += 1
color[j] = c
c_prev.append(c)
to_visit.append(i)
maxc = max(maxc, c)
c += 1
# mc, c = a(N, 0, look, color, mawari, -1)
print(maxc+1)
for i in color:
print(i+1)
# def a(N, maxc, look, color, mawari, prev):
# nexts = mawari[look]
# c = 0
# for i,j in nexts:
# if c == prev:
# c += 1
# color[j] = c
# maxc = max(maxc, a(N, maxc, i, color, mawari, c)[0])
# c += 1
# return maxc, color
main()
|
[] | 656,299
| 656,300
|
u974620347
|
python
|
p02850
|
import sys
sys.setrecursionlimit(100005)
N=int(input())
edges = [0 for i in range(N)]
edge_l = [[] for i in range(N)]
cols = [0 for i in range(N)]
out = 0
seen = [False for i in range(N)]
seen2 = [False for i in range(N)]
def paint(cur, parC):
if seen[cur]:
return
curC = 1
seen[cur] = True
for e in edge_l[cur]:
if not seen2[e[1]]:
seen2[e[1]] = True
if curC == parC:
curC+=1
cols[e[1]] = curC
paint(e[0], cols[cur])
curC+=1
return
for i in range(N-1):
a,b=map(int,input().split())
a-=1
b-=1
edges[a]+=1
edges[b]+=1
edge_l[a].append([b,i])
edge_l[b].append([a,i])
out = max(out,edges[a],edges[b])
print(out)
paint(0,0)
for i in range(N-1):
print(cols[i])
|
import sys
sys.setrecursionlimit(200000)
N=int(input())
edges = [0 for i in range(N)]
edge_l = [[] for i in range(N)]
cols = [0 for i in range(N)]
out = 0
seen = [False for i in range(N)]
seen2 = [False for i in range(N)]
def paint(cur, parC):
if seen[cur]:
return
curC = 1
seen[cur] = True
for e in edge_l[cur]:
if not seen2[e[1]]:
seen2[e[1]] = True
if curC == parC:
curC+=1
cols[e[1]] = curC
paint(e[0], curC)
curC+=1
return
for i in range(N-1):
a,b=map(int,input().split())
a-=1
b-=1
edges[a]+=1
edges[b]+=1
edge_l[a].append([b,i])
edge_l[b].append([a,i])
out = max(out,edges[a],edges[b])
print(out)
paint(0,0)
for i in range(N-1):
print(cols[i])
|
[
"literal.number.integer.change",
"call.arguments.change"
] | 656,301
| 656,302
|
u375076148
|
python
|
p02850
|
import sys
input = sys.stdin.readline
n = int(input())
edges = [[] for _ in range(n)]
for i in range(n-1):
a,b = map(int,input().split())
edges[a-1].append((b-1,i))
edges[b-1].append((a-1,i))
print(edges)
ans = [-1] * (n-1)
q = [0]
visit = [False] * n
visit[0] = True
while q:
l = q.pop(-1)
li = []
for i,j in edges[l]:
if not visit[i]:
q.append(i)
visit[i] = True
li.append(j)
li = list(set(li))
li2 = []
for i in li:
li2.append(ans[i])
li2.sort()
if li2[0] == -1:
li2 = li2[1:]
count = 1
for i in li:
while ans[i] == -1:
if count not in li2:
ans[i] = count
count += 1
print(max(ans))
for i in ans:
print(i)
|
import sys
input = sys.stdin.readline
n = int(input())
edges = [[] for _ in range(n)]
for i in range(n-1):
a,b = map(int,input().split())
edges[a-1].append((b-1,i))
edges[b-1].append((a-1,i))
ans = [-1] * (n-1)
q = [0]
visit = [False] * n
visit[0] = True
while q:
l = q.pop(-1)
li = []
for i,j in edges[l]:
if not visit[i]:
q.append(i)
visit[i] = True
li.append(j)
li = list(set(li))
li2 = []
for i in li:
li2.append(ans[i])
li2.sort()
if li2[0] == -1:
li2 = li2[1:]
count = 1
for i in li:
while ans[i] == -1:
if count not in li2:
ans[i] = count
count += 1
print(max(ans))
for i in ans:
print(i)
|
[
"call.remove"
] | 656,311
| 656,312
|
u623231048
|
python
|
p02850
|
from collections import deque
N = int(input())
visited = [False]*N
tree = [[] for _ in range(N)]
tmp = []
for _ in range(N-1):
a, b = map(lambda x: int(x)-1, input().split())
tree[a].append(b)
tree[b].append(a)
tmp.append((a, b)) # 順番を保持するため
ans = {} # 連想配列で保持する
q = deque([0]) # 開始のノード
colors = [-1]*N # そのノードにささっている辺の色
while len(q): # 幅優先探索を開始する
v = q.pop() # 部分木の親のノード
color = 1
for e in tree[v]: # 子供に対して操作を行う
if visited[e]:
continue
visited[e] = True
if colors[v] == color:
color += 1
ans[(v, e)] = color
colors[e] = color
color += 1
q.append(e)
print(max(colors))
for a, b in tmp:
print(ans[(a, b)])
|
from collections import deque
N = int(input())
visited = [False]*N
tree = [[] for _ in range(N)]
tmp = []
for _ in range(N-1):
a, b = map(lambda x: int(x)-1, input().split())
tree[a].append(b)
tree[b].append(a)
tmp.append((a, b)) # 順番を保持するため
ans = {} # 連想配列で保持する
q = deque([0]) # 開始のノード
colors = [-1]*N # そのノードにささっている辺の色
visited[0] = True
while len(q): # 幅優先探索を開始する
v = q.pop() # 部分木の親のノード
color = 1
for e in tree[v]: # 子供に対して操作を行う
if visited[e]:
continue
visited[e] = True
if colors[v] == color:
color += 1
ans[(v, e)] = color
colors[e] = color
color += 1
q.append(e)
print(max(colors))
for a, b in tmp:
print(ans[(a, b)])
|
[
"assignment.add"
] | 656,342
| 656,343
|
u708255304
|
python
|
p02850
|
import sys
read = sys.stdin.read
n, *ab = map(int, read().split())
ans = [0]*(n-1)
edges = [[]for _ in range(n)]
used = [0]*n
for i, a, b in zip(range(n-1), *[iter(ab)] * 2):
edges[a].append([b, i])
for node in range(n):
unable = used[node]
color = 1
for to, id in edges[node]:
if color == unable:
color += 1
ans[id] = str(color)
used[to] = color
color += 1
print(max(used))
print('\n'.join(ans))
|
import sys
read = sys.stdin.read
n, *ab = map(int, read().split())
ans = [0]*(n-1)
edges = [[]for _ in range(n)]
used = [0]*n
for i, a, b in zip(range(n-1), *[iter(ab)] * 2):
edges[a-1].append([b-1, i])
for node in range(n):
unable = used[node]
color = 1
for to, id in edges[node]:
if color == unable:
color += 1
ans[id] = str(color)
used[to] = color
color += 1
print(max(used))
print('\n'.join(ans))
|
[
"expression.operation.binary.add"
] | 656,362
| 656,363
|
u380524497
|
python
|
p02850
|
from collections import deque
n = int(input())
t = [list() for _ in range(n)]
color = [0] * (n-1)
for i in range(n-1):
a, b = map(int, input().split())
a -= 1
b -= 1
t[a].append((b, i))
q = deque([(0, 0)])
while q:
print(q)
v, pc = q.popleft()
nc = 0
for nv, edge in t[v]:
nc += 1
if nc == pc:
nc += 1
color[edge] = nc
q.append((nv, nc))
print(max(color))
print(*color, sep="\n")
|
from collections import deque
n = int(input())
t = [list() for _ in range(n)]
color = [0] * (n-1)
for i in range(n-1):
a, b = map(int, input().split())
a -= 1
b -= 1
t[a].append((b, i))
q = deque([(0, 0)])
while q:
v, pc = q.popleft()
nc = 0
for nv, edge in t[v]:
nc += 1
if nc == pc:
nc += 1
color[edge] = nc
q.append((nv, nc))
print(max(color))
print(*color, sep="\n")
|
[
"call.remove"
] | 656,364
| 656,365
|
u921518222
|
python
|
p02850
|
# coding: utf-8
# Here your code !
import sys
sys.setrecursionlimit(10**6)
N = int(input())
v = [[] for i in range(N)]
for i in range(N-1):
a,b = map(int,input().split())
a,b = a-1,b-1
v[a].append([b,i])
print(v)
ans = [None] * (N-1)
def decide_colord(cur,color):
cnt = 1
for (to,j)in v[cur]:
if cnt == color:
cnt += 1
ans[j] = cnt
decide_colord(to,cnt)
cnt += 1
decide_colord(0,0)
print(max(ans))
[print(a) for a in ans]
|
# coding: utf-8
# Here your code !
import sys
sys.setrecursionlimit(10**6)
N = int(input())
v = [[] for i in range(N)]
for i in range(N-1):
a,b = map(int,input().split())
a,b = a-1,b-1
v[a].append([b,i])
ans = [None] * (N-1)
def decide_colord(cur,color):
cnt = 1
for (to,j)in v[cur]:
if cnt == color:
cnt += 1
ans[j] = cnt
decide_colord(to,cnt)
cnt += 1
decide_colord(0,0)
print(max(ans))
[print(a) for a in ans]
|
[
"call.remove"
] | 656,378
| 656,379
|
u095562538
|
python
|
p02850
|
import queue
n = int(input())
G = [[] for i in range(n)]
vp = [() for i in range(n - 1)]
for i in range(n - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
vp[i] = (a, b)
que = queue.Queue()
que.put(0)
used = [0] * n
used[0] = 1
K = 0
cs = [0] * n
dic = {}
while not que.empty():
v = que.get()
if len(G[v]) > K:
K = len(G[v])
col = 1
for u in G[v]:
print(u)
if used[u]:
continue
if col == cs[v]:
col += 1
cs[u] = col
dic[(u, v)] = col
dic[(v, u)] = col
col += 1
used[u] = 1
que.put(u)
print(K)
for i in vp:
print(dic[i])
|
import queue
n = int(input())
G = [[] for i in range(n)]
vp = [() for i in range(n - 1)]
for i in range(n - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
vp[i] = (a, b)
que = queue.Queue()
que.put(0)
used = [0] * n
used[0] = 1
K = 0
cs = [0] * n
dic = {}
while not que.empty():
v = que.get()
if len(G[v]) > K:
K = len(G[v])
col = 1
for u in G[v]:
if used[u]:
continue
if col == cs[v]:
col += 1
cs[u] = col
dic[(u, v)] = col
dic[(v, u)] = col
col += 1
used[u] = 1
que.put(u)
print(K)
for i in vp:
print(dic[i])
|
[
"call.remove"
] | 656,382
| 656,383
|
u760802228
|
python
|
p02850
|
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
ab = [list(map(lambda x:int(x)-1, input().split())) for _ in range(n-1)]
e = [[] for _ in range(n)]
p = [0] * n
c = [0] * n
d = [0] * n
for a, b in ab:
e[a].append(b)
e[b].append(a)
me = 0
q = [0]
p[0] = -1
while q:
x = q.pop()
temp = c[x]
color = 0
me = max(me, len(e[x]))
for y in e[x]:
if color == temp:
color += 1
if d[y] == 0:
q.append(y)
c[y] = color
p[y] = x
color += 1
d[x] = 1
print(me)
for a, b in ab:
if p[a] == b:
print(c[a])
else:
print(c[b])
|
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
ab = [list(map(lambda x:int(x)-1, input().split())) for _ in range(n-1)]
e = [[] for _ in range(n)]
p = [0] * n
c = [0] * n
d = [0] * n
for a, b in ab:
e[a].append(b)
e[b].append(a)
me = 0
q = [0]
p[0] = -1
while q:
x = q.pop()
temp = c[x]
color = 1
me = max(me, len(e[x]))
#print(x, temp)
for y in e[x]:
if color == temp:
color += 1
if d[y] == 0:
q.append(y)
c[y] = color
p[y] = x
color += 1
d[x] = 1
#print(c)
#print(p)
print(me)
for a, b in ab:
if p[a] == b:
print(c[a])
else:
print(c[b])
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 656,399
| 656,400
|
u824237520
|
python
|
p02850
|
# -*- coding: utf-8 -*-
from collections import deque
n = int(input())
edges = [list(map(int, input().split())) for i in range(n-1)]
tree = {}
node_in = [0 for i in range(n)] # 頂点に入る辺は1つ
node_out = [[0] for i in range(n)] # 頂点から出る辺は1つ以上
for edge in sorted(edges):
a = edge[0] # 頂点a
b = edge[1] # 頂点b
color = 0
if node_out[a-1][-1] == 0:
if node_in[a-1] <= 1: # node_in[a-1] == 0の時1、1の時2なのでまとめて
color = node_in[a-1] + 1
else: # node_in[a-1] >= 2
color = 1
else:
color = node_out[a-1][-1] + 1
if node_in == color:
color += 1
tree[(a, b)] = color
node_out[a-1].append(color)
node_in[b-1] = color
print(max(tree.values()))
for edge in edges:
a = edge[0] # 頂点a
b = edge[1] # 頂点b
print(tree[(a, b)])
|
# -*- coding: utf-8 -*-
from collections import deque
n = int(input())
edges = [list(map(int, input().split())) for i in range(n-1)]
tree = {}
node_in = [0 for i in range(n)] # 頂点に入る辺は1つ
node_out = [[0] for i in range(n)] # 頂点から出る辺は1つ以上
for edge in sorted(edges):
a = edge[0] # 頂点a
b = edge[1] # 頂点b
color = 0
if node_out[a-1][-1] == 0:
if node_in[a-1] <= 1: # node_in[a-1] == 0の時1、1の時2なのでまとめて
color = node_in[a-1] + 1
else: # node_in[a-1] >= 2
color = 1
else:
color = node_out[a-1][-1] + 1
if node_in[a-1] == color:
color += 1
tree[(a, b)] = color
node_out[a-1].append(color)
node_in[b-1] = color
print(max(tree.values()))
for edge in edges:
a = edge[0] # 頂点a
b = edge[1] # 頂点b
print(tree[(a, b)])
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 656,422
| 656,423
|
u461592867
|
python
|
p02850
|
n = int(input())
vs = [[] for i in range(n)]
out = [0]*n
for i in range(n-1):
a, b = [int(i) for i in input().split()]
vs[a].append([b,i+1])
vs[b].append([a,i+1])
nex = [[0,-1]]
def coloring(index,defColor):
i=0
for v in vs[index]:
if i==defColor:
i+=1
out[v[1]]=i
vs[v[0]].remove([index,v[1]])
nex.append([v[0],i])
i+=1
out[0] = max(out[0],i-1)
while nex.__len__()>0:
c,d = nex.pop()
coloring(c,d)
for i in range(n):
print(out[i]+1)
|
n = int(input())
vs = [[] for i in range(n)]
out = [0]*n
for i in range(n-1):
a, b = [int(i)-1 for i in input().split()]
vs[a].append([b,i+1])
vs[b].append([a,i+1])
nex = [[0,-1]]
def coloring(index,defColor):
i=0
for v in vs[index]:
if i==defColor:
i+=1
out[v[1]]=i
vs[v[0]].remove([index,v[1]])
nex.append([v[0],i])
i+=1
out[0] = max(out[0],i-1)
while nex.__len__()>0:
c,d = nex.pop()
coloring(c,d)
for i in range(n):
print(out[i]+1)
|
[
"assignment.change"
] | 656,424
| 656,425
|
u211706121
|
python
|
p02850
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
[
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,432
| 656,433
|
u256031597
|
python
|
p02850
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[]*N for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
[
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,434
| 656,433
|
u256031597
|
python
|
p02850
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,432
| 656,435
|
u256031597
|
python
|
p02850
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[]*N for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
func(cld, cnt)
cnt += 1
func(0, 0)
print(max(ans))
for i in range(N-1):
print(ans[i])
|
[
"expression.operation.binary.remove",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,434
| 656,435
|
u256031597
|
python
|
p02850
|
import sys
from collections import deque
read = sys.stdin.read
def main():
N, *ab = map(int, read().split())
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(ab)] * 2):
E[a].append(b)
edge_order.append(b)
# 頂点1から幅優先探索
queue = deque([1])
color = [0] * (N+1)
while queue:
V = queue.popleft()
c = 1
for i in E[V]:
if c == color[V]:
c += 1
color[i] = c
c += 1
queue.append(i)
print(max(color))
for i in edge_order:
print(color[i])
if __name__ == "__main__":
main()
|
import sys
from collections import deque
read = sys.stdin.read
def main():
N, *ab = map(int, read().split())
E = [[] for _ in range(N + 1)]
edge_order = []
for a, b in zip(*[iter(ab)] * 2):
E[a].append(b)
edge_order.append(b)
# 頂点1から幅優先探索
queue = deque([1])
color = [0] * (N+1)
while queue:
V = queue.popleft()
c = 1
for i in E[V]:
if c == color[V]:
c += 1
color[i] = c
c += 1
queue.append(i)
print(max(color))
for i in edge_order:
print(color[i])
if __name__ == "__main__":
main()
|
[
"assignment.add"
] | 656,436
| 656,437
|
u638456847
|
python
|
p02850
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
n = int(input())
child_list = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
child_list[a].append([b,i])
ans = [None]*(n-1)
def rec(node, parent_color_id):
default_color_id = 1
color_id = default_color_id
for child_node, no in child_list[node]:
if parent_color_id == color_id:
color_id += color_id
ans[no] = color_id
rec(child_node, color_id)
color_id += 1
rec(0, 0)
print(max(ans))
print(*ans, sep="\n")
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
n = int(input())
child_list = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
child_list[a].append([b,i])
ans = [None]*(n-1)
def rec(node, parent_color_id):
default_color_id = 1
color_id = default_color_id
for child_node, no in child_list[node]:
if parent_color_id == color_id:
color_id += 1
ans[no] = color_id
rec(child_node, color_id)
color_id += 1
rec(0, 0)
print(max(ans))
print(*ans, sep="\n")
|
[
"identifier.replace.remove",
"literal.replace.add"
] | 656,442
| 656,443
|
u258391277
|
python
|
p02850
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
m = map(int,read().split())
AB = list(zip(m,m))
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
root = 1
parent = [0] * (N+1)
order = []
stack = [root]
while stack:
x = stack.pop()
order.append(x)
for y in graph[x]:
if y == parent[x]:
continue
parent[y] = x
stack.append(y)
print(order,parent)
color = [-1] * (N+1)
for x in order:
ng = color[x]
c = 1
for y in graph[x]:
if y == parent[x]:
continue
if c == ng:
c += 1
color[y] = c
c += 1
answer = []
append = answer.append
for a,b in AB:
if parent[a] == b:
append(color[a])
else:
append(color[b])
K = max(answer)
print(K)
print('\n'.join(map(str,answer)))
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
m = map(int,read().split())
AB = list(zip(m,m))
#print(N,m,AB)
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
#print(a,b)
#print(graph)
root = 1
parent = [0] * (N+1)
order = []
stack = [root]
#print(stack)
while stack:
x = stack.pop()
order.append(x)
for y in graph[x]:
if y == parent[x]:
continue
parent[y] = x
stack.append(y)
#print(order,parent)
color = [-1] * (N+1)
for x in order:
ng = color[x]
c = 1
for y in graph[x]:
if y == parent[x]:
continue
if c == ng:
c += 1
color[y] = c
c += 1
#print(color)
answer = []
append = answer.append
for a,b in AB:
if parent[a] == b:
append(color[a])
else:
append(color[b])
K = max(answer)
print(K)
print('\n'.join(map(str,answer)))
|
[
"call.remove"
] | 656,444
| 656,445
|
u902430070
|
python
|
p02850
|
N = int(input())
AB =[]
V = [[] for _ in range(N)]
Edict = dict()
for _ in range(N-1):
a,b = map(int,input().split())
AB.append((a-1,b-1))
V[a-1].append(b-1)
V[b-1].append(a-1)
K = min(len(V[i]) for i in range(N))
for i in V:
i.sort()
for i,v in enumerate(V[0]):
Edict[(0,v)] = i
for i in range(1,N): # 2(N-1)
color = 0
for j in V[i]:
if j < i: # unique per V and first
parent_color = Edict[(j,i)]
else:
if color == parent_color:
color += 1
Edict[(i,j)] = color
color += 1
print(K)
for i in AB:
print(Edict[i]+1)
|
N = int(input())
AB =[]
V = [[] for _ in range(N)]
Edict = dict()
for _ in range(N-1):
a,b = map(int,input().split())
AB.append((a-1,b-1))
V[a-1].append(b-1)
V[b-1].append(a-1)
K = max(len(V[i]) for i in range(N))
for i in V:
i.sort()
for i,v in enumerate(V[0]):
Edict[(0,v)] = i
for i in range(1,N): # 2(N-1)
color = 0
for j in V[i]:
if j < i: # unique per V and first
parent_color = Edict[(j,i)]
else:
if color == parent_color:
color += 1
Edict[(i,j)] = color
color += 1
print(K)
for i in AB:
print(Edict[i]+1)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 656,469
| 656,470
|
u202570162
|
python
|
p02850
|
sys.setrecursionlimit(10**6)
n = int(input())
G = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
G[a].append([b,i])
ans = [None]*(n-1)
def rec(cur,color):
cnt = 1
for (to, j) in G[cur]:
if cnt == color:
cnt += 1
ans[j] = cnt
rec(to, cnt)
cnt += 1
rec(0, 0)
print(max(ans))
print(*ans, sep="\n")
|
import sys
sys.setrecursionlimit(10**6)
n = int(input())
G = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
G[a].append([b,i])
ans = [None]*(n-1)
def rec(cur,color):
cnt = 1
for (to, j) in G[cur]:
if cnt == color:
cnt += 1
ans[j] = cnt
rec(to, cnt)
cnt += 1
rec(0, 0)
print(max(ans))
print(*ans, sep="\n")
|
[] | 656,477
| 656,478
|
u896451538
|
python
|
p02850
|
from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[0]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
for u in G[v]:
if visited[u]==0:
if j==visited[v]:
j+=1
visited[u]=j
ans[edge[(u,v)]]=j
que.appendleft(u)
j+=1
print(max(ans))
for a in ans:
print(a)
|
from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[-1]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
for u in G[v]:
if visited[u]<0:
if j==visited[v]:
j+=1
visited[u]=j
ans[edge[(u,v)]]=j
que.appendleft(u)
j+=1
print(max(ans))
for a in ans:
print(a)
|
[
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 656,487
| 656,488
|
u121921603
|
python
|
p02850
|
from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[0]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
for u in G[v]:
if visited[u]==0:
if j==viisted[v]:
j+=1
visited[u]=j
ans[edge[(u,v)]]=j
que.appendleft(u)
j+=1
print(max(ans))
for a in ans:
print(a)
|
from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[-1]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
for u in G[v]:
if visited[u]<0:
if j==visited[v]:
j+=1
visited[u]=j
ans[edge[(u,v)]]=j
que.appendleft(u)
j+=1
print(max(ans))
for a in ans:
print(a)
|
[
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 656,489
| 656,488
|
u121921603
|
python
|
p02840
|
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,a,d=map(int,input().split())
if(d==0):
if(a!=0):
print(n-1)
else:
print(1)
return
if(d<0): a,d=-a,-d # d>0
D=defaultdict(list)
for k in range(n+1):
q,r=divmod(k*a,d)
L=q+k*(k-1)//2
R=q+k*(2*n-k-1)//2
D[r].append((L,1)) # 1 -> add
D[r].append((R,2)) # 2 -> remove
ans=0
for arr in D.values():
arr.sort()
# print(arr)
over=0
for v,q in arr:
if(q==1 and over==0):
left=v
over+=1 if(q==1) else -1
if(over==0):
ans+=v-left+1
print(ans)
resolve()
|
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,a,d=map(int,input().split())
if(d==0):
if(a!=0):
print(n+1)
else:
print(1)
return
if(d<0): a,d=-a,-d # d>0
D=defaultdict(list)
for k in range(n+1):
q,r=divmod(k*a,d)
L=q+k*(k-1)//2
R=q+k*(2*n-k-1)//2
D[r].append((L,1)) # 1 -> add
D[r].append((R,2)) # 2 -> remove
ans=0
for arr in D.values():
arr.sort()
# print(arr)
over=0
for v,q in arr:
if(q==1 and over==0):
left=v
over+=1 if(q==1) else -1
if(over==0):
ans+=v-left+1
print(ans)
resolve()
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 656,571
| 656,572
|
u440566786
|
python
|
p02840
|
from operator import itemgetter
n, x, d = map(int, input().split())
if d == 0:
if x == 0:
print(1)
else:
print(n+1)
exit()
if d < 0:
x *= -1
d *= -1
p = dict()
q = dict()
for k in range(n+1):
temp = k * x % d
if temp in p.keys():
#print((k - p[temp]) * x)
a = (k - p[temp]) * x // d
L = (k-1)*k//2 + a
H = (2*n-k-1)*k//2 + a
q[temp].append([L, H])
else:
p[temp] = k
L = (k-1)*k//2
H = (2*n-k-1)*k//2
q[temp] = [[L, H]]
#print(q)
ans = 0
for z in q.values():
c = - float('inf')
#print(sorted(z))
for a, b in sorted(z):
if a > c:
ans += b - a + 1
elif b > c:
ans += b - c
c = b
#print(ans, a, b)
print(ans)
|
from operator import itemgetter
n, x, d = map(int, input().split())
if d == 0:
if x == 0:
print(1)
else:
print(n+1)
exit()
if d < 0:
x *= -1
d *= -1
p = dict()
q = dict()
for k in range(n+1):
temp = k * x % d
if temp in p.keys():
#print((k - p[temp]) * x)
a = (k - p[temp]) * x // d
L = (k-1)*k//2 + a
H = (2*n-k-1)*k//2 + a
q[temp].append([L, H])
else:
p[temp] = k
L = (k-1)*k//2
H = (2*n-k-1)*k//2
q[temp] = [[L, H]]
ans = 0
for z in q.values():
c = - float('inf')
for a, b in sorted(z):
if a > c:
ans += b - a + 1
elif b > c:
ans += b - c
else:
continue
c = b
print(ans)
|
[
"control_flow.continue.add"
] | 656,669
| 656,670
|
u824237520
|
python
|
p02840
|
import sys
from collections import defaultdict
N, X, D = map(int, input().split())
if D == 0:
print(1 if D == 0 else N + 1)
sys.exit()
if D < 0:
X *= -1
D *= -1
dic = defaultdict(list)
for i in range(N + 1):
l = X*i + i*(i-1)//2*D
r = X*i + (N-1+N-1-(i-1))*i//2*D
dic[l % D].append((l // D, r // D + 1))
ans = 0
for v in dic.values():
v.sort()
ima = -10**100
for l, r in v:
if ima < l:
ans += r - l
ima = r
elif r > ima:
ans += r - ima
ima = r
print(ans)
|
import sys
from collections import defaultdict
N, X, D = map(int, input().split())
if D == 0:
print(1 if X == 0 else N + 1)
sys.exit()
if D < 0:
X *= -1
D *= -1
dic = defaultdict(list)
for i in range(N + 1):
l = X*i + i*(i-1)//2*D
r = X*i + (N-1+N-1-(i-1))*i//2*D
dic[l % D].append((l // D, r // D + 1))
ans = 0
for v in dic.values():
v.sort()
ima = -10**100
for l, r in v:
if ima < l:
ans += r - l
ima = r
elif r > ima:
ans += r - ima
ima = r
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 656,677
| 656,678
|
u006493569
|
python
|
p02840
|
import math
n, X, D = map(int, input().split())
if D == 0:
if X == 0:
print(1)
else:
print(N + 1)
exit()
Y = dict()
for i in range(n + 1):
b = -2 * i * X
r = (n - 1 + n - i) * i // 2
l = (0 + i - 1) * i // 2
off = b % (-2 * D)
l += (b - off) // (-2 * D)
r += (b - off) // (-2 * D)
if off in Y:
Y[off].append((l, r))
else:
Y[off] = [(l, r)]
def calc(u):
pt = dict()
for l, r in u:
if l in pt:
pt[l] += 1
else:
pt[l] = 1
if r + 1 in pt:
pt[r + 1] -= 1
else:
pt[r + 1] = -1
cur, v = -10 ** 100, 0
ans = 0
for k in sorted(pt.keys()):
if v:
ans += k - cur
v += pt[k]
cur = k
return ans
print(sum(map(calc, Y.values())))
|
import math
n, X, D = map(int, input().split())
if D == 0:
if X == 0:
print(1)
else:
print(n + 1)
exit()
Y = dict()
for i in range(n + 1):
b = -2 * i * X
r = (n - 1 + n - i) * i // 2
l = (0 + i - 1) * i // 2
off = b % (-2 * D)
l += (b - off) // (-2 * D)
r += (b - off) // (-2 * D)
if off in Y:
Y[off].append((l, r))
else:
Y[off] = [(l, r)]
def calc(u):
pt = dict()
for l, r in u:
if l in pt:
pt[l] += 1
else:
pt[l] = 1
if r + 1 in pt:
pt[r + 1] -= 1
else:
pt[r + 1] = -1
cur, v = -10 ** 100, 0
ans = 0
for k in sorted(pt.keys()):
if v:
ans += k - cur
v += pt[k]
cur = k
return ans
print(sum(map(calc, Y.values())))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 656,727
| 656,728
|
u484902431
|
python
|
p02851
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(1,N):
A[i]+=A[i-1]
A=[(A[i]-i-1)%K for i in range(N)]
A=[0]+A
from collections import Counter
if K>=N:
a=Counter(A)
ans=0
for v in a.values():
ans+=v*(v-1)/2
print(ans)
else:
ans=0
d={}
for i in range(K):
if A[i] in d:
ans+=d[A[i]]
d[A[i]]+=1
else:
d[A[i]]=1
for i in range(K,N+1):
d[A[i-K]]-=1
if A[i] in d:
ans+=d[A[i]]
d[A[i]]+=1
if A[i] not in d or d[A[i]]==0:
d[A[i]]=1
print(ans)
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(1,N):
A[i]+=A[i-1]
A=[(A[i]-i-1)%K for i in range(N)]
A=[0]+A
from collections import Counter
if K>N:
a=Counter(A)
ans=0
for v in a.values():
ans+=v*(v-1)/2
print(int(ans))
else:
ans=0
d={}
for i in range(K):
if A[i] in d:
ans+=d[A[i]]
d[A[i]]+=1
else:
d[A[i]]=1
for i in range(K,N+1):
d[A[i-K]]-=1
if A[i] in d:
ans+=d[A[i]]
d[A[i]]+=1
if A[i] not in d or d[A[i]]==0:
d[A[i]]=1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 656,766
| 656,767
|
u425184437
|
python
|
p02851
|
from collections import defaultdict
n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
s = [0] * (n + 1)
for i in range(n):
s[i + 1] = (s[i] + a[i]) % k
mp = defaultdict(int)
print(s)
ans = 0
for i in range(n + 1):
ans += mp[s[i]]
mp[s[i]] += 1
if i >= k - 1:
mp[s[i - k + 1]] -= 1
print(ans)
|
from collections import defaultdict
n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
s = [0] * (n + 1)
for i in range(n):
s[i + 1] = (s[i] + a[i]) % k
mp = defaultdict(int)
ans = 0
for i in range(n + 1):
ans += mp[s[i]]
mp[s[i]] += 1
if i >= k - 1:
mp[s[i - k + 1]] -= 1
print(ans)
|
[
"call.remove"
] | 656,772
| 656,773
|
u843175622
|
python
|
p02851
|
import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
"""
N^2なので素直に計算は無理，部分和を使いたいのでとりあえず累積和
[i+1:j]が条件を満たすとはS[j]-S[i]とj-iが合同．
移行して，S[j]-jとS[i]-iが合同
基本は個数だけ見れば良い
これだけだと，個数がKより大きい時にダメ
直近Kこの情報だけ持つ，今見てる数字が直近K個のものと何個組にできるか
"""
def main():
mod=10**9+7
N,K=MI()
A=LI()
from collections import defaultdict
dd = defaultdict(int)
S=[0]*(N+1)
for i in range(N):
S[i+1]=(S[i]+A[i])%K
ans=0
for i in range(min(K,N)):
temp=(S[i]-i)%K
ans+=dd[temp]
dd[temp]+=1
for i in range(K,N+1):
temp=(S[i]-i)%K
temp_m=(S[(i-K)]-(i-K))%K
dd[temp_m]-=1
ans+=dd[temp]
dd[temp]+=1
print(ans)
main()
|
import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
"""
N^2なので素直に計算は無理，部分和を使いたいのでとりあえず累積和
[i+1:j]が条件を満たすとはS[j]-S[i]とj-iが合同．
移行して，S[j]-jとS[i]-iが合同
基本は個数だけ見れば良い
これだけだと，個数がKより大きい時にダメ
直近Kこの情報だけ持つ，今見てる数字が直近K個のものと何個組にできるか
"""
def main():
mod=10**9+7
N,K=MI()
A=LI()
from collections import defaultdict
dd = defaultdict(int)
S=[0]*(N+1)
for i in range(N):
S[i+1]=(S[i]+A[i])%K
ans=0
for i in range(min(K,N+1)):
temp=(S[i]-i)%K
ans+=dd[temp]
dd[temp]+=1
for i in range(K,N+1):
temp=(S[i]-i)%K
temp_m=(S[(i-K)]-(i-K))%K
dd[temp_m]-=1
ans+=dd[temp]
dd[temp]+=1
print(ans)
main()
|
[
"expression.operation.binary.add"
] | 656,774
| 656,775
|
u498487134
|
python
|
p02851
|
from collections import deque
n,k = map(int, input().split())
al = list(map(int, input().split()))
val_cnt = {}
val_cnt[0] = 1
val_q = deque([0])
if k == 1:
val_q.popleft()
ans = 0
curr_sum = 0
for i in range(n):
curr_sum += al[i]
curr_sum %= k
val = (curr_sum - (i+1))%k
val_cnt.setdefault(val,0)
ans += val_cnt[val]
val_cnt[val] += 1
val_q.append(val)
if len(val_q) >= k:
poped = val_q.popleft()
val_cnt[poped] -= 1
print(ans)
|
from collections import deque
n,k = map(int, input().split())
al = list(map(int, input().split()))
val_cnt = {}
val_cnt[0] = 1
val_q = deque([0])
if k == 1:
print(0)
exit()
ans = 0
curr_sum = 0
for i in range(n):
curr_sum += al[i]
curr_sum %= k
val = (curr_sum - (i+1))%k
val_cnt.setdefault(val,0)
ans += val_cnt[val]
val_cnt[val] += 1
val_q.append(val)
if len(val_q) >= k:
poped = val_q.popleft()
val_cnt[poped] -= 1
print(ans)
|
[
"call.arguments.change",
"control_flow.exit.add"
] | 656,804
| 656,805
|
u493520238
|
python
|
p02851
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
DP=dict()
if K==1:
print(0)
exit()
DP[0]=1
P=0
Y=[0]*(N+1)
for i in range(N):
Y[i+1]=(Y[i]+A[i]-1)%K
P+=DP.get(Y[i+1],0)
DP[Y[i+1]]=DP.get(Y[i+1],0)+1
if i>=K-2:
DP[Y[i-K+2]]-=1
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
DP=dict()
if K==1:
print(0)
exit()
DP[0]=1
P=0
Y=[0]*(N+1)
for i in range(N):
Y[i+1]=(Y[i]+A[i]-1)%K
P+=DP.get(Y[i+1],0)
DP[Y[i+1]]=DP.get(Y[i+1],0)+1
if i>=K-2:
DP[Y[i-K+2]]-=1
print(P)
|
[
"call.add"
] | 656,819
| 656,820
|
u873915460
|
python
|
p02851
|
from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] += 1
ans += dic[x%K]-ldic[x%K]
if K+i-1<=N:
dic[B[K+i-1]%K] += 1
"""
print('###############')
print(i,x, ans)
print(dic)
print(ldic)
"""
print(ans)
|
from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N+1)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] += 1
ans += dic[x%K]-ldic[x%K]
if K+i-1<=N:
dic[B[K+i-1]%K] += 1
"""
print('###############')
print(i,x, ans)
print(dic)
print(ldic)
"""
print(ans)
|
[
"expression.operation.binary.add"
] | 656,876
| 656,877
|
u476604182
|
python
|
p02851
|
from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] += 1
ans += dic[x%K]-ldic[x%K]
if K+i-1<=N:
dic[B[K+i-1]%K] += 1
"""
print('###############')
print(i,x, ans)
print(dic)
print(ldic)
"""
print(ans)
|
from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N+1)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] += 1
ans += dic[x%K]-ldic[x%K]
if K+i-1<=N:
dic[B[K+i-1]%K] += 1
"""
print('###############')
print(i,x, ans)
print(dic)
print(ldic)
"""
print(ans)
|
[
"expression.operation.binary.add"
] | 656,876
| 656,878
|
u476604182
|
python
|
p02851
|
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
#sys.setrecursionlimit(10**6)
input=lambda: sys.stdin.readline().rstrip()
show_flg=False
show_flg=True
n,k=LI()
a=LI()
b=[k-1]
for i in range(n):
b.append((b[-1]+a[i])%k)
b=[(b[i]-i)%k for i in range(n+1)]
ans=0
dc=defaultdict(int)
show(a)
show(b)
for i in range(n+1):
if i>=k:
dc[b[i-k]]-=1
ans+=dc[b[i]]
#if dc[b[i]]>0:show(i,a[i],dc[b[i]],ans)
#show(i,b[i],dc)
dc[b[i]]+=1
print(ans)
|
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
#sys.setrecursionlimit(10**6)
input=lambda: sys.stdin.readline().rstrip()
show_flg=False
#show_flg=True
n,k=LI()
a=LI()
b=[k-1]
for i in range(n):
b.append((b[-1]+a[i])%k)
b=[(b[i]-i)%k for i in range(n+1)]
ans=0
dc=defaultdict(int)
show(a)
show(b)
for i in range(n+1):
if i>=k:
dc[b[i-k]]-=1
ans+=dc[b[i]]
#if dc[b[i]]>0:show(i,a[i],dc[b[i]],ans)
#show(i,b[i],dc)
dc[b[i]]+=1
print(ans)
|
[
"assignment.remove"
] | 657,049
| 657,050
|
u623819879
|
python
|
p02851
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
a=list(map(lambda x:x-1 ,a))
if k==1:
print(0)
s=[0]
for i in range(n):
s.append(s[-1]+a[i])
s=list(map(lambda x:x%k,s))
from collections import defaultdict
d=defaultdict(int)
d[0]=1
ans=0
for i in range(1,n+1):
ans+=d[s[i]]
d[s[i]]+=1
if i>=k-1:
d[s[i-k+1]]-=1
print(ans)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
a=list(map(lambda x:x-1 ,a))
if k==1:
print(0)
exit()
s=[0]
for i in range(n):
s.append(s[-1]+a[i])
s=list(map(lambda x:x%k,s))
from collections import defaultdict
d=defaultdict(int)
d[0]=1
ans=0
for i in range(1,n+1):
ans+=d[s[i]]
d[s[i]]+=1
if i>=k-1:
d[s[i-k+1]]-=1
print(ans)
|
[
"call.add"
] | 657,053
| 657,054
|
u366959492
|
python
|
p02851
|
import sys
from collections import defaultdict
from copy import deepcopy
import itertools
input = sys.stdin.readline
# 文字列の場合は普通のinput()を使うか下を使う
# input = sys.stdin.readline().rstrip()
N, K = map(int, input().split())
A = list(map(int, input().split()))
S = [0] + list(itertools.accumulate(A))
"""
「iからjまで」--->「0からjまで」-「0から(i - 1)まで」
に分解すれば、求める条件は
(S[j] - S[i]) % K = j - i
と書ける。これを式変形して
S[j] - j = S[i] - i mod K "with j - i < K"
とすれば、次を示せばよい：
For 1 <= j <= N, count the number of j - K < i < j
such that S[j] - j = S[i] - i mod K
"""
if K == 0:
print(0)
exit()
d = defaultdict(int)
d[(S[0] - 0) % K] = 1
ans = 0
for j in range(1, N + 1):
x = (S[j] - j) % K
ans += d[x]
d[x] += 1
if j - K >= -1:
y = (S[j - K + 1] - (j - K + 1)) % K
d[y] -= 1
print(ans)
|
import sys
from collections import defaultdict
from copy import deepcopy
import itertools
input = sys.stdin.readline
# 文字列の場合は普通のinput()を使うか下を使う
# input = sys.stdin.readline().rstrip()
N, K = map(int, input().split())
A = list(map(int, input().split()))
S = [0] + list(itertools.accumulate(A))
"""
「iからjまで」--->「0からjまで」-「0から(i - 1)まで」
に分解すれば、求める条件は
(S[j] - S[i]) % K = j - i
と書ける。これを式変形して
S[j] - j = S[i] - i mod K "with j - i < K"
とすれば、次を示せばよい：
For 1 <= j <= N, count the number of j - K < i < j
such that S[j] - j = S[i] - i mod K
"""
if K == 1:
print(0)
exit()
d = defaultdict(int)
d[(S[0] - 0) % K] = 1
ans = 0
for j in range(1, N + 1):
x = (S[j] - j) % K
ans += d[x]
d[x] += 1
if j - K >= -1:
y = (S[j - K + 1] - (j - K + 1)) % K
d[y] -= 1
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 657,055
| 657,056
|
u107639613
|
python
|
p02851
|
#!/usr/bin/env python3
import sys
from collections import Counter
input = sys.stdin.readline
INF = 10**9
n, k = [int(item) for item in input().split()]
a = [int(item) - 1 for item in input().split()]
cumsum = [0] * (n + 1)
for i in range(n):
cumsum[i+1] = cumsum[i] + a[i]
cumsum[i+1] %= k
ls = list(set(cumsum))
dic = dict()
for i, item in enumerate(ls):
dic[item] = i
cnt = [0] * n
num = 0
ans = 0
for i, item in enumerate(cumsum):
index = dic[item]
ans += cnt[index]
cnt[index] += 1
num += 1
if num >= k:
left = cumsum[i - k + 1]
index = dic[left]
if cnt[index] > 0:
cnt[index] -= 1
num -= 1
print(ans)
|
#!/usr/bin/env python3
import sys
from collections import Counter
input = sys.stdin.readline
INF = 10**9
n, k = [int(item) for item in input().split()]
a = [int(item) - 1 for item in input().split()]
cumsum = [0] * (n + 1)
for i in range(n):
cumsum[i+1] = cumsum[i] + a[i]
cumsum[i+1] %= k
ls = list(set(cumsum))
dic = dict()
for i, item in enumerate(ls):
dic[item] = i
cnt = [0] * (n + 10)
num = 0
ans = 0
for i, item in enumerate(cumsum):
index = dic[item]
ans += cnt[index]
cnt[index] += 1
num += 1
if num >= k:
left = cumsum[i - k + 1]
index = dic[left]
if cnt[index] > 0:
cnt[index] -= 1
num -= 1
print(ans)
|
[] | 657,136
| 657,137
|
u052499405
|
python
|
p02851
|
import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {0 : []}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k - 1)
for i in memo.keys():
for j in range(len(memo[i]) - 1):
ans += bisect.bisect_left(memo[i], memo[i][j] + k) - 1 - j
print(memo)
print(ans)
|
import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {0 : []}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k - 1)
for i in memo.keys():
for j in range(len(memo[i]) - 1):
ans += bisect.bisect_left(memo[i], memo[i][j] + k) - 1 - j
print(ans)
|
[
"call.remove"
] | 657,144
| 657,145
|
u671455949
|
python
|
p02851
|
import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k - 1)
for i in memo.keys():
for j in range(len(memo[i]) - 1):
ans += bisect.bisect_left(memo[i], memo[i][j] + k) - 1 - j
print(ans)
|
import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {0 : []}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k - 1)
for i in memo.keys():
for j in range(len(memo[i]) - 1):
ans += bisect.bisect_left(memo[i], memo[i][j] + k) - 1 - j
print(ans)
|
[] | 657,146
| 657,145
|
u671455949
|
python
|
p02851
|
n, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
cnt = {0:1}
ans = 0
for i in range(1, n+1):
left = i - k + 1
if left >= 0:
ldif = (a[left] - left) % k
if ldif < 0: ldif += k
cnt[ldif] -= 1
a[i] += a[i-1]
dif = (a[i] - i) % k
if dif < 0: dif += k
if dif not in cnt:
cnt[dif] = 0
ans += cnt[dif]
cnt[dif] += 1
print(ans)
|
n, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
cnt = {0:1}
ans = 0
for i in range(1, n+1):
left = i - k
if left >= 0:
ldif = (a[left] - left) % k
if ldif < 0: ldif += k
cnt[ldif] -= 1
a[i] += a[i-1]
dif = (a[i] - i) % k
if dif < 0: dif += k
if dif not in cnt:
cnt[dif] = 0
ans += cnt[dif]
cnt[dif] += 1
print(ans)
|
[
"expression.operation.binary.remove"
] | 657,174
| 657,175
|
u299869545
|
python
|
p02852
|
import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0], sub[1]
if s1 < count:
continue
count = s1+1
for i in range(min([index, s2-1]), max([-1, s2-m-1]), -1):
if ans[i] != inf:
continue
if s[i] == "1":
continue
heapq.heappush(key, (count, i))
ans[i] = s2
subindex = i
index = subindex
if ans[0] == inf:
print(-1)
else:
index = 0
answer = []
while True:
subindex = ans[index]
answer.append(subindex-index)
if subindex == n:
break
index = subindex
print(*answer)
if __name__ == "__main__":
main()
|
import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0], sub[1]
if s1 < count:
continue
count = s1+1
subindex = index
for i in range(min([index, s2-1]), max([-1, s2-m-1]), -1):
if ans[i] != inf:
continue
if s[i] == "1":
continue
heapq.heappush(key, (count, i))
ans[i] = s2
subindex = i
index = subindex
if ans[0] == inf:
print(-1)
else:
index = 0
answer = []
while True:
subindex = ans[index]
answer.append(subindex-index)
if subindex == n:
break
index = subindex
print(*answer)
if __name__ == "__main__":
main()
|
[
"assignment.add"
] | 657,244
| 657,245
|
u021548497
|
python
|
p02852
|
import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0], sub[1]
if s1 < count:
continue
count = s1+1
for i in range(min([index, s2-1]), max([-1, s2-m-1]), -1):
if ans[i] != inf:
continue
if s[i] == "1":
continue
heapq.heappush(key, (count, i))
ans[i] = s2
subindex = i
index = subindex
if ans[0] == inf:
print(-1)
else:
index = 0
answer = []
while True:
subindex = ans[index]
answer.append(subindex-index)
if subindex == n:
break
index = subindex
print(*answer)
if __name__ == "__main__":
main()
|
import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0], sub[1]
if s1 < count:
continue
count = s1+1
subindex = index
for i in range(min([index, s2-1]), max([-1, s2-m-1]), -1):
if ans[i] != inf:
continue
if s[i] == "1":
continue
heapq.heappush(key, (count, i))
ans[i] = s2
subindex = i
index = subindex
if ans[0] == inf:
print(-1)
else:
index = 0
answer = []
while True:
subindex = ans[index]
answer.append(subindex-index)
if subindex == n:
break
index = subindex
print(*answer)
if __name__ == "__main__":
main()
|
[
"assignment.add"
] | 657,244
| 657,246
|
u021548497
|
python
|
p02852
|
n,m = map(int,input().split())
s = input()
now = n
ans_rev = []
while(now != 0):
for i in range( now-m,now+1):
if(i == now):
print(-1)
exit()
if(s[i] == '1'):
continue
ans_rev.append(now - i)
now = i
break
print(' '.join(map(str, ans_rev[::-1])))
|
n,m = map(int,input().split())
s = input()
now = n
ans_rev = []
while(now != 0):
for i in range( max(0,now-m),now+1):
if(i == now):
print(-1)
exit()
if(s[i] == '1'):
continue
ans_rev.append(now - i)
now = i
break
print(' '.join(map(str, ans_rev[::-1])))
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 657,267
| 657,268
|
u490642448
|
python
|
p02852
|
n,m=map(int,input().split())
s=input()
x=n
a=[]
while x!=0:
for i in range(min(m,x),0,-1):
if s[x-i]=="0":
x-=i
a.append(i)
break
if i==1:print(-1);exit()
print(a[::-1])
|
n,m=map(int,input().split())
s=input()
x=n
a=[]
while x!=0:
for i in range(min(m,x),0,-1):
if s[x-i]=="0":
x-=i
a.append(i)
break
if i==1:print(-1);exit()
print(*a[::-1])
|
[
"call.arguments.change"
] | 657,316
| 657,317
|
u227082700
|
python
|
p02852
|
n,m=map(int,input().split())
s=input()
s=s[::-1]
r,l,cnt,k,=0,0,0,0
ans=[]
while 1:
while cnt<m:
r+=1
if r==n:
ans.append(r-k)
print(r,l)
print(*ans[::-1])
exit()
if s[r]=='0':
l=r
cnt+=1
if r-l==m:
print(-1)
exit()
ans.append(l-k)
k=l
cnt=r-l
|
n,m=map(int,input().split())
s=input()
s=s[::-1]
r,l,cnt,k,=0,0,0,0
ans=[]
while 1:
while cnt<m:
r+=1
if r==n:
ans.append(r-k)
print(*ans[::-1])
exit()
if s[r]=='0':
l=r
cnt+=1
if r-l==m:
print(-1)
exit()
ans.append(l-k)
k=l
cnt=r-l
|
[
"call.remove"
] | 657,343
| 657,344
|
u169138653
|
python
|
p02852
|
def main():
N, M = map(int, input().split())
S = input()
p = N
a = []
while p > 0:
for i in range(min(M, p), 0, -1):
if S[p - i] == '0':
p = p - i
a.append(str(i))
break
else:
return -1
return ''.join(i for i in reversed(a))
print(main())
|
def main():
N, M = map(int, input().split())
S = input()
p = N
a = []
while p > 0:
for i in range(min(M, p), 0, -1):
if S[p - i] == '0':
p = p - i
a.append(str(i))
break
else:
return -1
return ' '.join(i for i in reversed(a))
print(main())
|
[
"literal.string.change",
"function.return_value.change"
] | 657,400
| 657,401
|
u316464887
|
python
|
p02852
|
from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.appendleft(i)
j-=i
if i==1 and S[j-i]=="1":
print(-1)
exit()
|
from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.appendleft(i)
j-=i
break
if i==1 and S[j-i]=="1":
print(-1)
exit()
|
[
"control_flow.break.add"
] | 657,402
| 657,403
|
u121921603
|
python
|
p02852
|
from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.append(i)
j-=i
if i==1 and S[j-i]=="1":
print(-1)
exit()
|
from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.appendleft(i)
j-=i
break
if i==1 and S[j-i]=="1":
print(-1)
exit()
|
[
"identifier.change",
"control_flow.break.add"
] | 657,404
| 657,403
|
u121921603
|
python
|
p02852
|
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N, M = map(int, input().split())
S = input()
rS = [i for i in reversed(S)]
res = []
step = 0
lenS = len(S)
while 1:
if step == lenS-1:
break
for i in range(M, -1, -1):
# print(' i:', i)
if step+i > lenS-1:
continue
if i == 0:
# print(-1)
exit()
if rS[step+i] == '0':
# print('step+', i)
step += i
res.append(i)
break
print(*reversed(res))
|
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N, M = map(int, input().split())
S = input()
rS = [i for i in reversed(S)]
res = []
step = 0
lenS = len(S)
while 1:
if step == lenS-1:
break
for i in range(M, -1, -1):
if step+i > lenS-1:
continue
if i == 0:
print(-1)
exit()
if rS[step+i] == '0':
step += i
res.append(i)
break
print(*reversed(res))
|
[
"call.add"
] | 657,409
| 657,410
|
u625729943
|
python
|
p02852
|
n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=-1
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
reans.append(i)
break
reans.reverse()
print(*reans)
|
n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=0
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
reans.append(i)
break
reans.reverse()
print(*reans)
|
[
"assignment.value.change",
"expression.operation.unary.remove"
] | 657,489
| 657,488
|
u223904637
|
python
|
p02852
|
n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=-1
while nk<n+1:
for i in range(min(n+1-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
reans.append(i)
break
reans.reverse()
print(*reans)
|
n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=0
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
reans.append(i)
break
reans.reverse()
print(*reans)
|
[
"assignment.value.change",
"expression.operation.unary.remove",
"expression.operation.binary.remove"
] | 657,491
| 657,488
|
u223904637
|
python
|
p02852
|
n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=-1
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
reans.append(i)
break
reans.reverse()
print(*reans)
|
n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=0
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
reans.append(i)
break
reans.reverse()
print(*reans)
|
[
"assignment.value.change",
"expression.operation.unary.remove"
] | 657,492
| 657,488
|
u223904637
|
python
|
p02852
|
N, M = list(map(int, input().split()))
S = list(input())
D = []
t = N
while t > 0:
print(t)
if t - M <= 0:
D.append(t)
break
for i in range(M, 0, -1):
if S[t - i] == "0":
D.append(i)
t -= i
break
else:
print(-1)
exit()
for i in range(len(D) -1, -1, -1):
print(D[i],end = " ")
|
N, M = list(map(int, input().split()))
S = list(input())
D = []
t = N
while t > 0:
if t - M <= 0:
D.append(t)
break
for i in range(M, 0, -1):
if S[t - i] == "0":
D.append(i)
t -= i
break
else:
print(-1)
exit()
for i in range(len(D) -1, -1, -1):
print(D[i],end = " ")
|
[
"call.remove"
] | 657,547
| 657,548
|
u456353530
|
python
|
p02850
|
from collections import deque
def bfs(succs, preds, start, colors):
saisyoku = {}
queue = deque([start])
used = 0
while queue:
v = queue.popleft()
for u in preds[v]:
used = saisyoku[preds[v][u]]
c = 1
for w in succs[v]:
if used and c == used:
c += 1
saisyoku[succs[v][w]] = c
queue.append(w)
c += 1
return saisyoku
n = int(input())
vertices = range(1, n+1)
edges = [list(map(int, input().split())) for _ in range(n-1)]
jisu = {v: 0 for v in vertices}
succs = {v: {} for v in vertices}
preds = {v: {} for v in vertices}
for i, (u, v) in enumerate(edges):
succs[u][v] = i
preds[v][u] = i
jisu[u] += 1
jisu[v] += 1
colors = max(jisu.values())
print(colors)
saisyoku = bfs(succs, preds, 1)
for _, c in sorted(saisyoku.items()):
print(c)
|
from collections import deque
def bfs(succs, preds, start):
saisyoku = {}
queue = deque([start])
used = 0
while queue:
v = queue.popleft()
for u in preds[v]:
used = saisyoku[preds[v][u]]
c = 1
for w in succs[v]:
if used and c == used:
c += 1
saisyoku[succs[v][w]] = c
queue.append(w)
c += 1
return saisyoku
n = int(input())
vertices = range(1, n+1)
edges = [list(map(int, input().split())) for _ in range(n-1)]
jisu = {v: 0 for v in vertices}
succs = {v: {} for v in vertices}
preds = {v: {} for v in vertices}
for i, (u, v) in enumerate(edges):
succs[u][v] = i
preds[v][u] = i
jisu[u] += 1
jisu[v] += 1
colors = max(jisu.values())
print(colors)
saisyoku = bfs(succs, preds, 1)
for _, c in sorted(saisyoku.items()):
print(c)
|
[] | 657,565
| 657,566
|
u127873832
|
python
|
p02853
|
x,y = map(int,input().split())
c = 0
if x==1:
c+=300000
elif x == 2:
c+=200000
elif x == 3:
c+=100000
if y==1:
c+=300000
elif y == 2:
c+=200000
elif y == 3:
c+=100000
if x == 1 and y == 1:
x+=400000
print(c)
|
x,y = map(int,input().split())
c = 0
if x==1:
c+=300000
elif x == 2:
c+=200000
elif x == 3:
c+=100000
if y==1:
c+=300000
elif y == 2:
c+=200000
elif y == 3:
c+=100000
if x == 1 and y == 1:
c+=400000
print(c)
|
[
"identifier.change"
] | 657,598
| 657,599
|
u629540524
|
python
|
p02853
|
x, y = map(int, input().split())
prize = [300000, 100000, 200000]
total = 0
if x <= 3:
total += prize[x-1]
if y <= 3:
total += prize[y-1]
if x == y == 1:
total += 400000
print(total)
|
x, y = map(int, input().split())
prize = [300000, 200000, 100000]
total = 0
if x <= 3:
total += prize[x-1]
if y <= 3:
total += prize[y-1]
if x == y == 1:
total += 400000
print(total)
|
[] | 657,601
| 657,602
|
u896791216
|
python
|
p02853
|
x,y=map(int,input().split())
if x==y==1:
print(1000000)
A=[300000,200000,100000]+[0]*1000
print(A[x-1]+A[y-1])
|
x,y=map(int,input().split())
if x==y==1:
print(1000000);exit()
A=[300000,200000,100000]+[0]*1000
print(A[x-1]+A[y-1])
|
[] | 657,603
| 657,604
|
u023229441
|
python
|
p02853
|
x,y = map(int,input().split())
if x == 1 and y == 1:
print(1000000)
elif x == 1 and y == 2 or x == 2 or y == 1:
print(500000)
elif x == 2 and y == 2 or x == 3 and y == 1 or x == 1 or y == 3:
print(400000)
elif x == 3 and y == 2 or x == 2 and y == 3 or x == 1 and y >= 4 or x >= 4 and y == 1:
print(300000)
elif x == 3 and y == 3 or x == 2 and y >= 4 or x >= 4 and y == 2:
print(200000)
elif x == 3 and y >= 4 or x >= 4 and y == 3:
print(100000)
else:
print(0)
|
x,y = map(int,input().split())
if x == 1 and y == 1:
print(1000000)
elif x == 1 and y == 2 or x == 2 and y == 1:
print(500000)
elif x == 2 and y == 2 or x == 3 and y == 1 or x == 1 and y == 3:
print(400000)
elif x == 3 and y == 2 or x == 2 and y == 3 or x == 1 and y >= 4 or x >= 4 and y == 1:
print(300000)
elif x == 3 and y == 3 or x == 2 and y >= 4 or x >= 4 and y == 2:
print(200000)
elif x == 3 and y >= 4 or x >= 4 and y == 3:
print(100000)
else:
print(0)
|
[
"control_flow.branch.if.condition.change"
] | 657,609
| 657,610
|
u397953026
|
python
|
p02853
|
X, Y = map(int, input().split())
def solver(X, Y):
if X == 1 and Y == 1:
print(1000000)
return
a = 0
if X == 1:
a += 300000
if X == 2:
a += 200000
if X == 3:
a += 100000
if Y == 1:
a += 300000
if Y == 2:
a += 200000
if Y == 3:
a += 200000
print(a)
solver(X, Y)
|
X, Y = map(int, input().split())
def solver(X, Y):
if X == 1 and Y == 1:
print(1000000)
return
a = 0
if X == 1:
a += 300000
if X == 2:
a += 200000
if X == 3:
a += 100000
if Y == 1:
a += 300000
if Y == 2:
a += 200000
if Y == 3:
a += 100000
print(a)
solver(X, Y)
|
[
"literal.number.integer.change"
] | 657,611
| 657,612
|
u642012866
|
python
|
p02853
|
x,y = map(int,input().split())
a = [0]*210
a[:3] = [300000, 200000, 100000]
if x == y and x == 1:
print(400000)
else:
print(a[x-1] + a[y-1])
|
x,y = map(int,input().split())
a = [0]*210
a[:3] = [300000, 200000, 100000]
if x == y and x == 1:
print(1000000)
else:
print(a[x-1] + a[y-1])
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 657,613
| 657,614
|
u624613992
|
python
|
p02853
|
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:1000000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans)
|
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 657,621
| 657,622
|
u123745130
|
python
|
p02853
|
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>4:
x=0
else:
x=a
if b>4:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans)
|
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 657,623
| 657,622
|
u123745130
|
python
|
p02853
|
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:1000000}
if a>4:
x=0
else:
x=a
if b>4:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans)
|
a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 657,624
| 657,622
|
u123745130
|
python
|
p02853
|
x,y=map(int, input())
coin=0
if x==1 and y==1:
coin+=400000
if x==1:
coin+=300000
if y==1:
coin+=300000
if x==2:
coin+=200000
if y==2:
coin+=200000
if x==3:
coin+=100000
if y==3:
coin+=100000
print(coin)
|
x,y=map(int, input().split())
coin=0
if x==1 and y==1:
coin+=400000
if x==1:
coin+=300000
if y==1:
coin+=300000
if x==2:
coin+=200000
if y==2:
coin+=200000
if x==3:
coin+=100000
if y==3:
coin+=100000
print(coin)
|
[
"call.add"
] | 657,631
| 657,632
|
u088488125
|
python
|
p02853
|
def p(n):
if n == 1:
return 300000
elif n == 2:
return 200000
elif n == 3:
return 300000
else:
return 0
x, y = map(int, input().split())
ans = 0
if x == y == 1:
ans += 400000
ans += p(x) + p(y)
print(ans)
|
def p(n):
if n == 1:
return 300000
elif n == 2:
return 200000
elif n == 3:
return 100000
else:
return 0
x, y = map(int, input().split())
ans = 0
if x == y == 1:
ans += 400000
ans += p(x) + p(y)
print(ans)
|
[
"literal.number.integer.change",
"function.return_value.change"
] | 657,635
| 657,636
|
u654240084
|
python
|
p02853
|
x, y = map(int, input().split())
A, B = [0] * 206, [0] * 206
A[1] = 300000
A[2] = 200000
A[3] = 100000
B[1] = 300000
B[2] = 300000
B[3] = 300000
if x == 1 and y == 1:
print(A[x] + B[y] + 400000)
else:
print(A[x] + B[y])
|
x, y = map(int, input().split())
A, B = [0] * 206, [0] * 206
A[1] = 300000
A[2] = 200000
A[3] = 100000
B[1] = 300000
B[2] = 200000
B[3] = 100000
if x == 1 and y == 1:
print(A[x] + B[y] + 400000)
else:
print(A[x] + B[y])
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 657,637
| 657,638
|
u627803856
|
python
|
p02853
|
a = list(map(int,input().split()))
ans = 0
for v in a:
if v == 1:
ans += 300000
elif v == 2:
ans += 200000
else:
ans += 100000
if sum(a) == 2:
ans += 400000
print(ans)
|
a = list(map(int,input().split()))
ans = 0
for v in a:
if v == 1:
ans += 300000
elif v == 2:
ans += 200000
elif v == 3:
ans += 100000
if sum(a) == 2:
ans += 400000
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 657,639
| 657,640
|
u143051858
|
python
|
p02853
|
X, Y = map(int, input().split())
price = [0, 300000, 200000, 100000]
ans = price[X] + price[Y] + 400000*(X == Y == 1)
print(ans)
|
X, Y = map(int, input().split())
price = [0, 300000, 200000, 100000] + [0]*300
ans = price[X] + price[Y] + 400000*(X == Y == 1)
print(ans)
|
[
"assignment.change"
] | 657,648
| 657,649
|
u922449550
|
python
|
p02853
|
X,Y=map(int, input().split())
v1 = [300000, 200000, 100000]
v2 = [300000, 200000, 100000]
x = 0
y = 0
if X <= 3:
x = int(v1[X-1])
if Y <= 3:
y = int(v2[Y-1])
if (X==1 & Y==1):
print(int(x + y + 400000))
else:
print(int(x + y))
|
X,Y=map(int, input().split())
v1 = [300000, 200000, 100000]
v2 = [300000, 200000, 100000]
x = 0
y = 0
if X <= 3:
x = int(v1[X-1])
if Y <= 3:
y = int(v2[Y-1])
if ((X==1) & (Y==1)):
print(int(x + y + 400000))
else:
print(int(x + y))
|
[
"control_flow.branch.if.condition.change"
] | 657,652
| 657,653
|
u019355060
|
python
|
p02853
|
X, Y = map(int, input().split())
ans = 0
for z in [X,Y]:
if z == 3:
ans += 10**5
elif z == 2:
ans += 2*10**5
elif z == 1:
ans += 3*10**5
if X == Y:
ans += 4*10**5
print(ans)
|
X, Y = map(int, input().split())
ans = 0
for z in [X,Y]:
if z == 3:
ans += 10**5
elif z == 2:
ans += 2*10**5
elif z == 1:
ans += 3*10**5
if X == Y == 1:
ans += 4*10**5
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 657,654
| 657,655
|
u086503932
|
python
|
p02853
|
x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if top_count != 0:
print(ans + 400000)
else:
print(ans)
|
x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if top_count == 2:
print(ans + 400000)
else:
print(ans)
|
[] | 657,660
| 657,661
|
u068142202
|
python
|
p02853
|
x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i ==2:
ans += 200000
elif i == 3:
ans += 100000
if top_count != 0:
print(ans + 400000)
else:
print(ans)
|
x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if top_count == 2:
print(ans + 400000)
else:
print(ans)
|
[] | 657,662
| 657,661
|
u068142202
|
python
|
p02853
|
X, Y = map(int, input().split())
ans = 0
if X == 1 and Y == 1:
asn = 1000000
else:
if X == 1:
ans += 300000
elif X == 2:
ans += 200000
elif X == 3:
ans += 100000
if Y == 1:
ans += 300000
elif Y == 2:
ans += 200000
elif Y ==3:
ans += 100000
print(ans)
|
X, Y = map(int, input().split())
ans = 0
if X == 1 and Y == 1:
ans = 1000000
else:
if X == 1:
ans += 300000
elif X == 2:
ans += 200000
elif X == 3:
ans += 100000
if Y == 1:
ans += 300000
elif Y == 2:
ans += 200000
elif Y ==3:
ans += 100000
print(ans)
|
[
"assignment.variable.change",
"identifier.change"
] | 657,663
| 657,664
|
u211236379
|
python
|
p02853
|
x,y = map(int,input().split())
p = 0
pr = [300000,200000,100000]
if(x < 3):p += pr[x-1]
if(y < 3):p += pr[y-1]
if(x == y and x == 1):p += 400000
print(p)
|
x,y = map(int,input().split())
p = 0
pr = [300000,200000,100000]
if(x <= 3):p += pr[x-1]
if(y <= 3):p += pr[y-1]
if(x == y and x == 1):p += 400000
print(p)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 657,665
| 657,666
|
u030726788
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.