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 |
|---|---|---|---|---|---|---|---|
p02802
|
N, M = map(int, input().split())
p = []
s = []
for _ in range(M):
tp,ts = map(str,input().split())
p.append(int(tp))
s.append(ts)
cnt = [0] * (N+1)
flg = [0] * (N+1)
cnt_AC = 0
cnt_WA = 0
for i in range(M):
cp = p[i]
if flg[cp] == 1:
continue
else:
if s[i] == 'AC':
cnt_AC += 1
cnt_WA += cnt[cp]
flg[cp] = 1
else:
cnt[cp] += 1
print(cnt_AC, end = " ")
print(sum(cnt))
|
N, M = map(int, input().split())
p = []
s = []
for _ in range(M):
tp,ts = map(str,input().split())
p.append(int(tp))
s.append(ts)
cnt = [0] * (N+1)
flg = [0] * (N+1)
cnt_AC = 0
cnt_WA = 0
for i in range(M):
cp = p[i]
if flg[cp] == 1:
continue
else:
if s[i] == 'AC':
cnt_AC += 1
cnt_WA += cnt[cp]
flg[cp] = 1
else:
cnt[cp] += 1
print(cnt_AC, end = " ")
print(cnt_WA)
|
[
"call.arguments.change",
"io.output.change"
] | 606,910
| 606,911
|
u314050667
|
python
|
p02802
|
n, m = map(int, input().split())
a_list = []
b_list = ["f"] * (10**5+1)
count_ac = 0
count_wa = 0
for i in range(m):
a,b = map(str, input().split())
a_list.append((int(a),b))
for i in range(m):
if a_list[i][1] == "WA" and b_list[a_list[i][0]] == "f":
count_wa += 1
if a_list[i][1] == "AC":
if b_list[a_list[i][0]] == "f":
count_ac += 1
b_list[a_list[i][0]] = "t"
for i in range(m):
if b_list[a_list[i][0]] == "f" and b_list[a_list[i][1]] == "WA":
count_wa -= 1
print(count_ac,count_wa)
|
n, m = map(int, input().split())
a_list = []
b_list = ["f"] * (10**5+1)
count_ac = 0
count_wa = 0
for i in range(m):
a,b = map(str, input().split())
a_list.append((int(a),b))
for i in range(m):
if a_list[i][1] == "WA" and b_list[a_list[i][0]] == "f":
count_wa += 1
if a_list[i][1] == "AC":
if b_list[a_list[i][0]] == "f":
count_ac += 1
b_list[a_list[i][0]] = "t"
for i in range(m):
if b_list[a_list[i][0]] == "f" and a_list[i][1] == "WA":
count_wa -= 1
print(count_ac,count_wa)
|
[
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 606,920
| 606,921
|
u700805562
|
python
|
p02802
|
n, m = map(int, input().split())
d = [[] for i in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
d[p].append(s)
ac_cnt, w_cnt = 0, 0
for l in d:
if len(l) != 0:
w_cnt += l.index("AC")
if "AC" in l:
ac_cnt += 1
print(ac_cnt, w_cnt)
|
n, m = map(int, input().split())
d = [[] for i in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
d[p].append(s)
ac_cnt, w_cnt = 0, 0
for l in d:
if len(l) != 0 and "AC" in l:
w_cnt += l.index("AC")
if "AC" in l:
ac_cnt += 1
print(ac_cnt, w_cnt)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 606,926
| 606,927
|
u777283665
|
python
|
p02802
|
[N,M] = list(map(int,input().split()))
P = []
S = []
for i in range(M):
[ptmp,stmp] = list(input().split())
P.append(ptmp)
S.append(stmp)
ans1 = [0]*N
ans2 = [0]*N
for i in range(M):
prob = int(P[i])
resu = S[i]
if resu=="AC":
ans1[prob-1]=1
elif resu=="WA" and ans1[prob-1]!=1:
ans2[prob-1]+=1
cnt1=0
cnt2=0
for i in range(N):
if ans1[i]==1:
cnt1+=ans1[i]
cnt2+=ans2[i]
output = str(cnt1) + " " + str(cnt2)
|
[N,M] = list(map(int,input().split()))
P = []
S = []
for i in range(M):
[ptmp,stmp] = list(input().split())
P.append(ptmp)
S.append(stmp)
ans1 = [0]*N
ans2 = [0]*N
for i in range(M):
prob = int(P[i])
resu = S[i]
if resu=="AC":
ans1[prob-1]=1
elif resu=="WA" and ans1[prob-1]!=1:
ans2[prob-1]+=1
cnt1=0
cnt2=0
for i in range(N):
if ans1[i]==1:
cnt1+=ans1[i]
cnt2+=ans2[i]
output = str(cnt1) + " " + str(cnt2)
print(output)
|
[
"call.add"
] | 606,956
| 606,957
|
u208713671
|
python
|
p02802
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#solve
def solve():
n, m = LI()
d = [0] * n
wa = [0] * n
for _ in range(m):
p, s = input().rstrip().split()
p = int(p) - 1
if d[p]:
continue
if s == "AC":
d[p] = 1
else:
wa[p] += 1
ans = 0
for i in range(n):
if d[i]:
ans += wa[p]
print(sum(d), ans)
return
#main
if __name__ == '__main__':
solve()
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#solve
def solve():
n, m = LI()
d = [0] * n
wa = [0] * n
for _ in range(m):
p, s = input().rstrip().split()
p = int(p) - 1
if d[p]:
continue
if s == "AC":
d[p] = 1
else:
wa[p] += 1
ans = 0
for i in range(n):
if d[i]:
ans += wa[i]
print(sum(d), ans)
return
#main
if __name__ == '__main__':
solve()
|
[
"identifier.change",
"variable_access.subscript.index.change"
] | 606,964
| 606,965
|
u423585790
|
python
|
p02802
|
n,m=map(int,input().split())
s=[0]*n
t=[0]*n
for i in range(m):
a,b=map(str,input().split())
a,
a=int(a)-1
if not s[a]:
if b=="WA":
t[a]+=1
else:
s[a]=1
print(sum(s),sum(t[i] for i in range(n)if s[a]))
|
n,m=map(int,input().split())
s=[0]*n
t=[0]*n
for i in range(m):
a,b=map(str,input().split())
a,
a=int(a)-1
if not s[a]:
if b=="WA":
t[a]+=1
else:
s[a]=1
print(sum(s),sum(t[i] for i in range(n)if s[i]))
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 606,992
| 606,993
|
u619819312
|
python
|
p02802
|
n, m = map(int, input().split())
ps_lis = []
for i in range(m):
p, s = input().split()
ps_lis.append([int(p), s])
ac_lis = [0] * (n + 1)
pe_lis = [0] * (n + 1)
for p, s in ps_lis:
if s == 'WA' and ac_lis[p] == 0:
pe_lis[p] += 1
elif s == 'AC':
ac_lis[p] = 1
for i, ac in enumerate(ac_lis):
if ac_lis == 0:
pe_lis[i] = 0
print(sum(ac_lis), sum(pe_lis))
|
n, m = map(int, input().split())
ps_lis = []
for i in range(m):
p, s = input().split()
ps_lis.append([int(p), s])
ac_lis = [0] * (n + 1)
pe_lis = [0] * (n + 1)
for p, s in ps_lis:
if s == 'WA' and ac_lis[p] == 0:
pe_lis[p] += 1
elif s == 'AC':
ac_lis[p] = 1
for i, ac in enumerate(ac_lis):
if ac == 0:
pe_lis[i] = 0
print(sum(ac_lis), sum(pe_lis))
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 607,000
| 607,001
|
u598812605
|
python
|
p02802
|
n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(n) if ac[i]==1))
|
n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(n+1) if ac[i]==1))
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 607,031
| 607,032
|
u941438707
|
python
|
p02802
|
n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(m) if ac[i]==1))
|
n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(n+1) if ac[i]==1))
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,033
| 607,032
|
u941438707
|
python
|
p02802
|
n, m = map(int, input().split(' '))
pena = [0 for i in range(n)]
acc = [0 for i in range(n)]
for i in range(m):
pp, ss = input().split(' ')
p = int(pp) - 1
if acc[p] == 0:
if ss == 'WA':
pena[p] += 1
else:
acc[p] = 1
for i in range(m):
pena[i] = pena[i] * acc[i]
print(sum(acc), sum(pena))
|
n, m = map(int, input().split(' '))
pena = [0 for i in range(n)]
acc = [0 for i in range(n)]
for i in range(m):
pp, ss = input().split(' ')
p = int(pp) - 1
if acc[p] == 0:
if ss == 'WA':
pena[p] += 1
else:
acc[p] = 1
for i in range(n):
pena[i] = pena[i] * acc[i]
print(sum(acc), sum(pena))
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,066
| 607,067
|
u789840108
|
python
|
p02802
|
N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(M):
if not AC[p]:
WA[i]=0
print(sum(AC), sum(WA))
|
N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(N):
if not AC[i]:
WA[i]=0
print(sum(AC), sum(WA))
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 607,082
| 607,083
|
u419877586
|
python
|
p02802
|
N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(N):
if not AC[p]:
WA[i]=0
print(sum(AC), sum(WA))
|
N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(N):
if not AC[i]:
WA[i]=0
print(sum(AC), sum(WA))
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 607,084
| 607,083
|
u419877586
|
python
|
p02802
|
N, M = map(int, input().split())
p = [0]*M
k = [""] * M
for i in range(M):
p[i], k[i] = input().split()
p[i] = int(p[i])
ans = [0]*N
pen = [0]*N
accept = 0
pena = 0
for i in range(M):
if k[i] == "WA" and ans[p[i]] == 0:
pen[p[i]] += 1
elif k[i] == "AC" and ans[p[i]] == 0:
pena += pen[p[i]]
ans[p[i]] = 1
accept += 1
print(str(accept) + " " + str(pena))
|
N, M = map(int, input().split())
p = [0] * M
k = [""] * M
for i in range(M):
p[i], k[i] = input().split()
p[i] = int(p[i])-1
ans = [0]*N
pen = [0]*N
accept = 0
pena = 0
for i in range(M):
if k[i] == "WA" and ans[p[i]] == 0:
pen[p[i]] += 1
elif k[i] == "AC" and ans[p[i]] == 0:
pena += pen[p[i]]
ans[p[i]] = 1
accept += 1
print(str(accept) + " " + str(pena))
|
[
"assignment.change"
] | 607,089
| 607,090
|
u578462133
|
python
|
p02802
|
# coding: utf-8
import re
import math
#import numpy as np
#main
n,m=map(int,input().split())
MAP={}
PS=[]
for a in range(m):
s,t=input().split()
if(not s in MAP):MAP[s]=[]
MAP[s].append(t)
ac=0
wa=0
for a,b in MAP.items():
if(not "AC" in MAP[a]):continue
for c in b:
if(c=="WA"):
ac+=1
else:
wa+=1
break
print(ac,wa)
|
# coding: utf-8
import re
import math
#import numpy as np
#main
n,m=map(int,input().split())
MAP={}
PS=[]
for a in range(m):
s,t=input().split()
if(not s in MAP):MAP[s]=[]
MAP[s].append(t)
ac=0
wa=0
for a,b in MAP.items():
if(not "AC" in MAP[a]):continue
for c in b:
if(c=="WA"):
wa+=1
else:
ac+=1
break
print(ac,wa)
|
[
"identifier.change"
] | 607,091
| 607,092
|
u902151549
|
python
|
p02802
|
# -*- coding: utf-8 -*-
# abc151/abc151_c
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
N, M = i2nn()
wa_list = [0] * N
penalty = 0
ac = 0
for _ in range(M):
p, S = i2s().split(' ')
p = int(p)
if wa_list[p] >= 0:
if S == 'WA':
wa_list[p] += 1
else:
penalty += wa_list[p]
wa_list[p] = -1
ac += 1
print(ac, penalty)
return
main()
|
# -*- coding: utf-8 -*-
# abc151/abc151_c
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
N, M = i2nn()
wa_list = [0] * N
penalty = 0
ac = 0
for _ in range(M):
p, S = i2s().split(' ')
p = int(p) - 1
if wa_list[p] >= 0:
if S == 'WA':
wa_list[p] += 1
else:
penalty += wa_list[p]
wa_list[p] = -1
ac += 1
print(ac, penalty)
return
main()
|
[
"assignment.change"
] | 607,100
| 607,101
|
u106311097
|
python
|
p02802
|
N,M = map(int,input().split())
score = [[False,0] for _ in [0]*N]
for _ in range(M):
p,S = input().split()
p = int(p)-1
S = S=="AC"
if S:
score[p][0] = True
else:
if not score[p][0]:
score[p][1] += 1
AC = sum(s[0] for s in score)
WA = sum(s[1] for s in score)
print(AC,WA)
|
N,M = map(int,input().split())
score = [[False,0] for _ in [0]*N]
for _ in range(M):
p,S = input().split()
p = int(p)-1
S = S=="AC"
if S:
score[p][0] = True
else:
if not score[p][0]:
score[p][1] += 1
AC = sum(s[0] for s in score)
WA = sum(s[1] for s in score if s[0])
print(AC,WA)
|
[] | 607,104
| 607,105
|
u391731808
|
python
|
p02802
|
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
A = [list(input().split()) for i in range(m)]
for i in range(m):
A[i][0] = int(A[i][0])
P = [0] * n
AC = [0] * n
for i in range(m):
if A[i][1] == "WA":
if AC[A[i][0]] == 0:
P[A[i][0]] += 1
else:
AC[A[i][0]] = 1
p=0
ac=sum(AC)
for i in range(len(P)):
if AC[i] == 1:
p += P[i]
print(ac,p)
|
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
A = [list(input().split()) for i in range(m)]
for i in range(m):
A[i][0] = int(A[i][0])-1
P = [0] * n
AC = [0] * n
for i in range(m):
if A[i][1] == "WA":
if AC[A[i][0]] == 0:
P[A[i][0]] += 1
else:
AC[A[i][0]] = 1
p=0
ac=sum(AC)
for i in range(len(P)):
if AC[i] == 1:
p += P[i]
print(ac,p)
|
[
"assignment.change"
] | 607,108
| 607,109
|
u325227960
|
python
|
p02802
|
n, m = map(int, input().split())
ac = [0 for _ in range(n)]
pen = [0 for _ in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == 'WA':
if ac[p] == 0:
pen[p] += 1
else:
ac[p] = 1
for p in range(m):
if ac[p] == 0:
pen[p] = 0
print(str(sum(ac)) + ' ' + str(sum(pen)))
|
n, m = map(int, input().split())
ac = [0 for _ in range(n)]
pen = [0 for _ in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == 'WA':
if ac[p] == 0:
pen[p] += 1
else:
ac[p] = 1
for p in range(n):
if ac[p] == 0:
pen[p] = 0
print(str(sum(ac)) + ' ' + str(sum(pen)))
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,112
| 607,113
|
u253952966
|
python
|
p02803
|
from copy import deepcopy
from collections import deque
from itertools import product
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(function(grid[0][0]))
self.grid = np.empty((h, w), dtype=dtype)
for i, row in zip(range(h), grid):
for j, val in zip(range(w), row):
self.grid[i][j] = function(val)
def is_valid_x(self, x):
return 0 <= x < self.w
def is_valid_y(self, y):
return 0 <= y < self.h
def is_valid_xy(self, x, y):
return self.is_valid_x(x) and self.is_valid_y(y)
def __iter__(self):
return iter(self.grid)
def __repr__(self):
return '\n'.join([' '.join(map(str, row)) for row in self.grid])
def __getitem__(self, x):
return self.grid[x]
def __setitem__(self, x, val):
self.grid[x] = val
h, w = map(int, inputs[0].split())
grid_origin = Grid(inputs[1:], function=lambda x: int(x == '.'))
def bfs(root):
x, y, _ = root
grid[y, x] = 0
queue = deque([root])
while queue:
x, y, d = queue.popleft()
for dx, dy in zip([1, 0, -1, 0], [0, 1, 0, -1]):
if grid.is_valid_xy(x+dx, y+dy) and grid[y+dy, x+dx]:
queue.append((x+dx, y+dy, d+1))
grid[y+dy, x+dx] = 0
return d-1
ans = 0
for i, j in product(range(h), range(w)):
if grid_origin[i, j]:
grid = deepcopy(grid_origin)
ans = max(ans, bfs((j, i)))
print(ans)
|
from copy import deepcopy
from collections import deque
from itertools import product
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(function(grid[0][0]))
self.grid = np.empty((h, w), dtype=dtype)
for i, row in zip(range(h), grid):
for j, val in zip(range(w), row):
self.grid[i][j] = function(val)
def is_valid_x(self, x):
return 0 <= x < self.w
def is_valid_y(self, y):
return 0 <= y < self.h
def is_valid_xy(self, x, y):
return self.is_valid_x(x) and self.is_valid_y(y)
def __iter__(self):
return iter(self.grid)
def __repr__(self):
return '\n'.join([' '.join(map(str, row)) for row in self.grid])
def __getitem__(self, x):
return self.grid[x]
def __setitem__(self, x, val):
self.grid[x] = val
h, w = map(int, inputs[0].split())
grid_origin = Grid(inputs[1:], function=lambda x: int(x == '.'))
def bfs(root):
x, y, _ = root
grid[y, x] = 0
queue = deque([root])
while queue:
x, y, d = queue.popleft()
for dx, dy in zip([1, 0, -1, 0], [0, 1, 0, -1]):
if grid.is_valid_xy(x+dx, y+dy) and grid[y+dy, x+dx]:
queue.append((x+dx, y+dy, d+1))
grid[y+dy, x+dx] = 0
return d
ans = 0
for i, j in product(range(h), range(w)):
if grid_origin[i, j]:
grid = deepcopy(grid_origin)
ans = max(ans, bfs((j, i, 0)))
print(ans)
|
[
"expression.operation.binary.remove"
] | 607,118
| 607,119
|
u417365712
|
python
|
p02803
|
from copy import deepcopy
from collections import deque
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(function(grid[0][0]))
self.grid = np.empty((h, w), dtype=dtype)
for i, rows in zip(range(h), grid):
for j, val in zip(range(w), rows):
self.grid[i][j] = function(val)
def is_valid_x(self, x):
return 0 <= x < self.w
def is_valid_y(self, y):
return 0 <= y < self.h
def is_valid_xy(self, x, y):
return self.is_valid_x(x) and self.is_valid_y(y)
def __iter__(self):
return iter(self.grid)
def __repr__(self):
return '\n'.join([' '.join(map(str, rows)) for rows in self.grid])
def __getitem__(self, x):
return self.grid[x]
def __setitem__(self, x, val):
self.grid[x] = val
h, w = map(int, inputs[0].split())
grid_origin = Grid(inputs[1:], function=lambda x: int(x == '.'))
def bfs(root):
queue = deque([root])
while queue:
x, y, d = queue.popleft()
d += 1
grid[y, x] = 0
for dx, dy in zip([1, 0, -1, 0], [0, 1, 0, -1]):
if grid.is_valid_xy(x+dx, y+dy) and grid[y+dy, x+dx]:
queue.append((x+dx, y+dy, d))
grid[y+dy, x+dx] = 0
return d-1
ans = 0
for i, j in product(range(h), range(w)):
if grid_origin[i, j]:
grid = deepcopy(grid_origin)
ans = max(ans, bfs((j, i, 0)))
print(ans)
|
from copy import deepcopy
from collections import deque
from itertools import product
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(function(grid[0][0]))
self.grid = np.empty((h, w), dtype=dtype)
for i, rows in zip(range(h), grid):
for j, val in zip(range(w), rows):
self.grid[i][j] = function(val)
def is_valid_x(self, x):
return 0 <= x < self.w
def is_valid_y(self, y):
return 0 <= y < self.h
def is_valid_xy(self, x, y):
return self.is_valid_x(x) and self.is_valid_y(y)
def __iter__(self):
return iter(self.grid)
def __repr__(self):
return '\n'.join([' '.join(map(str, rows)) for rows in self.grid])
def __getitem__(self, x):
return self.grid[x]
def __setitem__(self, x, val):
self.grid[x] = val
h, w = map(int, inputs[0].split())
grid_origin = Grid(inputs[1:], function=lambda x: int(x == '.'))
def bfs(root):
queue = deque([root])
while queue:
x, y, d = queue.popleft()
d += 1
grid[y, x] = 0
for dx, dy in zip([1, 0, -1, 0], [0, 1, 0, -1]):
if grid.is_valid_xy(x+dx, y+dy) and grid[y+dy, x+dx]:
queue.append((x+dx, y+dy, d))
grid[y+dy, x+dx] = 0
return d-1
ans = 0
for i, j in product(range(h), range(w)):
if grid_origin[i, j]:
grid = deepcopy(grid_origin)
ans = max(ans, bfs((j, i, 0)))
print(ans)
|
[] | 607,120
| 607,121
|
u417365712
|
python
|
p02802
|
N, M = map(int, input().split())
wrongnumber = [0] * N
ACset = set()
for i in range(M):
p, S = input().split()
if S == "AC":
ACset.add(int(p)-1)
else:
if (int(p) - 1) not in ACset:
wrongnumber[int(p) - 1] += 1
WAnumber = 0
ACnumber = len(ACset)
for j in ACset:
WAnumber += wrongnumber[j-1]
print(ACnumber, WAnumber)
|
N, M = map(int, input().split())
wrongnumber = [0] * N
ACset = set()
for i in range(M):
p, S = input().split()
if S == "AC":
ACset.add(int(p)-1)
else:
if (int(p) - 1) not in ACset:
wrongnumber[int(p) - 1] += 1
WAnumber = 0
ACnumber = len(ACset)
for j in ACset:
WAnumber += wrongnumber[j]
print(ACnumber, WAnumber)
|
[
"expression.operation.binary.remove"
] | 607,127
| 607,128
|
u065079240
|
python
|
p02802
|
import numpy as np
N, M = map(int, input().split())
succ = [0] * N
fail = [0] * N
for i in range(M):
p, S = input().split()
p = int(p) - 1
if S == 'AC':
succ[p] = 1
else:
if succ[p] == 0:
fail[p] += 1
succ = np.array(succ)
fail = np.array(fail)
print(succ.sum(), fail.sum())
|
import numpy as np
N, M = map(int, input().split())
succ = [0] * N
fail = [0] * N
for i in range(M):
p, S = input().split()
p = int(p) - 1
if S == 'AC':
succ[p] = 1
else:
if succ[p] == 0:
fail[p] += 1
succ = np.array(succ)
fail = np.array(fail) * succ
print(succ.sum(), fail.sum())
|
[
"assignment.change"
] | 607,129
| 607,130
|
u555498801
|
python
|
p02802
|
N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
p, s = input().split()
p = int(p)
if s == "AC":
if not isAC[p]:
isAC[p] = True
ac += 1
p += penalties[p]
else:
penalties[p] += 1
print(ac, penalty)
|
N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
p, s = input().split()
p = int(p)
if s == "AC":
if not isAC[p]:
isAC[p] = True
ac += 1
penalty += penalties[p]
else:
penalties[p] += 1
print(ac, penalty)
|
[
"identifier.change"
] | 607,141
| 607,142
|
u978178314
|
python
|
p02803
|
from collections import deque
import numpy as np
H,W = map(int,input().split())
Maze=[list(input()) for i in range(H)]
for hi in range(0,H):
for wi in range(0,W):
if Maze[hi][wi]=="#":
continue
maze1=[[0]*W for _ in range(H)]
stack=deque([[hi,wi]])
while stack:
h,w=stack.popleft()
for i,j in [[1,0],[-1,0],[0,1],[0,-1]]:
new_h,new_w=h+i,w+j
if new_h <0 or new_w <0 or new_h >=H or new_w >=W:
continue
elif Maze[new_h][new_w]!="#" and maze1[new_h][new_w]==0:
maze1[new_h][new_w]=maze1[h][w]+1
stack.append([new_h,new_w])
maze1[hi][wi]=0
ans=max(ans,np.max(maze1))
print(ans)
|
from collections import deque
import numpy as np
H,W = map(int,input().split())
Maze=[list(input()) for i in range(H)]
ans=0
for hi in range(0,H):
for wi in range(0,W):
if Maze[hi][wi]=="#":
continue
maze1=[[0]*W for _ in range(H)]
stack=deque([[hi,wi]])
while stack:
h,w=stack.popleft()
for i,j in [[1,0],[-1,0],[0,1],[0,-1]]:
new_h,new_w=h+i,w+j
if new_h <0 or new_w <0 or new_h >=H or new_w >=W:
continue
elif Maze[new_h][new_w]!="#" and maze1[new_h][new_w]==0:
maze1[new_h][new_w]=maze1[h][w]+1
stack.append([new_h,new_w])
maze1[hi][wi]=0
ans=max(ans,np.max(maze1))
print(ans)
|
[
"assignment.add"
] | 607,168
| 607,169
|
u887152994
|
python
|
p02803
|
#関数を持ってくる
from collections import deque
#入力(座標をリストで扱いやすいように-1する)
r,c = map(int,input().split())
c_list = [list(input()) for nesya in range(r)]
for hoge in c_list:
hoge.insert(0,'#')
hoge.append('#')
c_list.insert(0,['#']*(c+2))
c_list.append(['#']*(c+2))
ans = 0
for i in range(r+2):
for j in range(c+2):
#dequeオブジェクトを作る
d = deque()
#その座標を扱ったかを調べるためのリストを作る
hoge_list = [[-1]*(c+2) for motsu in range(r+2)]
if c_list[j][i] == '#':
continue
else:
#スタート位置をdに加え、到達時刻を0にする
d.append((j,i))
hoge_list[j][i] = 0
#当該の座標から動かすためのリストを作る
move =[[1,0],[-1,0],[0,1],[0,-1]]
#座標に対して作業する
while len(d) > 0:
#今から扱う座標をcoordとする
coord = d.popleft()
#縦横に移動したときそれぞれのマスに作業する
for k in range(4):
#移動した後の座標
x = coord[1] + move[k][1]
y = coord[0] + move[k][0]
#作業が終わっている座標であったら無視する
if hoge_list[y][x] != -1:
pass
#マスが壁であった場合-2を代入して終わる
elif c_list[y][x] == '#':
hoge_list[y][x] = -2
#作業するマス
else:
#当該座標から1移動したはずである
hoge_list[y][x] = hoge_list[coord[0]][coord[1]] + 1
ans = max(hoge_list[y][x],ans)
#dequeに加える
d.append((y,x))
#ゴールの移動回数を出力する
print(ans)
|
#関数を持ってくる
from collections import deque
#入力(座標をリストで扱いやすいように-1する)
r,c = map(int,input().split())
c_list = [list(input()) for nesya in range(r)]
for hoge in c_list:
hoge.insert(0,'#')
hoge.append('#')
c_list.insert(0,['#']*(c+2))
c_list.append(['#']*(c+2))
ans = 0
for j in range(r+2):
for i in range(c+2):
#dequeオブジェクトを作る
d = deque()
#その座標を扱ったかを調べるためのリストを作る
hoge_list = [[-1]*(c+2) for motsu in range(r+2)]
if c_list[j][i] == '#':
continue
else:
#スタート位置をdに加え、到達時刻を0にする
d.append((j,i))
hoge_list[j][i] = 0
#当該の座標から動かすためのリストを作る
move =[[1,0],[-1,0],[0,1],[0,-1]]
#座標に対して作業する
while len(d) > 0:
#今から扱う座標をcoordとする
coord = d.popleft()
#縦横に移動したときそれぞれのマスに作業する
for k in range(4):
#移動した後の座標
x = coord[1] + move[k][1]
y = coord[0] + move[k][0]
#作業が終わっている座標であったら無視する
if hoge_list[y][x] != -1:
pass
#マスが壁であった場合-2を代入して終わる
elif c_list[y][x] == '#':
hoge_list[y][x] = -2
#作業するマス
else:
#当該座標から1移動したはずである
hoge_list[y][x] = hoge_list[coord[0]][coord[1]] + 1
ans = max(hoge_list[y][x],ans)
#dequeに加える
d.append((y,x))
#ゴールの移動回数を出力する
print(ans)
|
[
"identifier.change"
] | 607,240
| 607,241
|
u227085629
|
python
|
p02803
|
from collections import deque
h, w = map(int, input().split())
maze = [input() for i in range(h)]
ans = 0
INF = 20 * 20 + 1
for j in range(h):
for i in range(w):
if maze[j][i] == ".":
cnt = [[INF] * w for _ in range(h)]
cnt[j][i] = 0
q = deque([(j,i)])
while q:
y,x = q.popleft()
for by,bx in ((0,1),(0,-1),(1,0),(-1,0)):
by += y
bx += x
if 0 <= by < h and 0 <= bx < w:
ct = cnt[y][x] + 1
if maze[ny][nx] == "." and ct < cnt[ny][nx]:
q += [(by,bx)]
cnt[by][bx] = ct
ans = max(ans, cnt[by][bx])
print(ans)
|
from collections import deque
h, w = map(int, input().split())
maze = [input() for i in range(h)]
ans = 0
INF = 20 * 20 + 1
for j in range(h):
for i in range(w):
if maze[j][i] == ".":
cnt = [[INF] * w for _ in range(h)]
cnt[j][i] = 0
q = deque([(j,i)])
while q:
y,x = q.popleft()
for by,bx in ((0,1),(0,-1),(1,0),(-1,0)):
by += y
bx += x
if 0 <= by < h and 0 <= bx < w:
ct = cnt[y][x] + 1
if maze[by][bx] == "." and ct < cnt[by][bx]:
q += [(by,bx)]
cnt[by][bx] = ct
ans = max(ans, cnt[by][bx])
print(ans)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 607,246
| 607,247
|
u324197506
|
python
|
p02803
|
from collections import deque
h, w = map(int, input().split())
s = [list(str(input())) for _ in range(h)]
print(s)
def bfs(h, w, s, s_h, s_w):
if s[s_h][s_w] == '#':
return 0
d_max = 0
pas = [[-1 for _ in range(w)] for _ in range(h)]
dist = [[-1 for _ in range(w)] for _ in range(h)]
dist[s_h][s_w], pas[s_h][s_w] = 0, 's'
que = deque()
que.append((s_h, s_w))
while len(que) > 0:
q = que.popleft()
near = [(q[0]+1, q[1]), (q[0], q[1]+1), (q[0]-1, q[1]), (q[0], q[1]-1)]
for i in near:
if (i[0] < 0) | (i[0] >= h) | (i[1] < 0) | (i[1] >= w):
continue
if (dist[i[0]][i[1]] == -1) & (s[i[0]][i[1]] == '.'):
dist[i[0]][i[1]] = dist[q[0]][q[1]] + 1
pas[i[0]][i[1]] = q
que.append(i)
d_max = max(dist[q[0]][q[1]] + 1, d_max)
return d_max
dmax = 0
for i in range(h):
for j in range(w):
dist = bfs(h, w, s, i, j)
dmax = max(dmax, dist)
print(dmax)
|
from collections import deque
h, w = map(int, input().split())
s = [list(str(input())) for _ in range(h)]
def bfs(h, w, s, s_h, s_w):
if s[s_h][s_w] == '#':
return 0
d_max = 0
pas = [[-1 for _ in range(w)] for _ in range(h)]
dist = [[-1 for _ in range(w)] for _ in range(h)]
dist[s_h][s_w], pas[s_h][s_w] = 0, 's'
que = deque()
que.append((s_h, s_w))
while len(que) > 0:
q = que.popleft()
near = [(q[0]+1, q[1]), (q[0], q[1]+1), (q[0]-1, q[1]), (q[0], q[1]-1)]
for i in near:
if (i[0] < 0) | (i[0] >= h) | (i[1] < 0) | (i[1] >= w):
continue
if (dist[i[0]][i[1]] == -1) & (s[i[0]][i[1]] == '.'):
dist[i[0]][i[1]] = dist[q[0]][q[1]] + 1
pas[i[0]][i[1]] = q
que.append(i)
d_max = max(dist[q[0]][q[1]] + 1, d_max)
return d_max
dmax = 0
for i in range(h):
for j in range(w):
dist = bfs(h, w, s, i, j)
dmax = max(dmax, dist)
print(dmax)
|
[
"call.remove"
] | 607,266
| 607,267
|
u222668979
|
python
|
p02803
|
def abc151d_maze_master():
h, w = map(int, input().split())
s = []
max_val = 0
for i in range(h):
s.append(input())
for hi in range(h):
for wi in range(w):
if s[hi][wi] == '#': continue
flg = [[-1] * w for _ in range(h)]
flg[hi][wi] = 0
q = [(0, hi, wi)]
heapq.heapify(q)
while len(q) > 0:
d, hj, wj = heapq.heappop(q)
for dh, dw in zip([0, 0, 1, -1], [1, -1, 0, 0]):
if 0 <= hj + dh < h and 0 <= wj + dw < w and s[hj + dh][wj + dw] != '#' and \
(flg[hj + dh][wj + dw] == -1 or flg[hj + dh][wj + dw] > flg[hj][wj] + 1):
heapq.heappush(q, (d + 1, hj + dh, wj + dw))
flg[hj + dh][wj + dw] = flg[hj][wj] + 1
# print(q)
max_val = max(max_val, max([max(v) for v in flg]))
print(max_val)
abc151d_maze_master()
|
import heapq
def abc151d_maze_master():
h, w = map(int, input().split())
s = []
max_val = 0
for i in range(h):
s.append(input())
for hi in range(h):
for wi in range(w):
if s[hi][wi] == '#': continue
flg = [[-1] * w for _ in range(h)]
flg[hi][wi] = 0
q = [(0, hi, wi)]
heapq.heapify(q)
while len(q) > 0:
d, hj, wj = heapq.heappop(q)
for dh, dw in zip([0, 0, 1, -1], [1, -1, 0, 0]):
if 0 <= hj + dh < h and 0 <= wj + dw < w and s[hj + dh][wj + dw] != '#' and \
(flg[hj + dh][wj + dw] == -1 or flg[hj + dh][wj + dw] > flg[hj][wj] + 1):
heapq.heappush(q, (d + 1, hj + dh, wj + dw))
flg[hj + dh][wj + dw] = flg[hj][wj] + 1
# print(q)
max_val = max(max_val, max([max(v) for v in flg]))
print(max_val)
abc151d_maze_master()
|
[] | 607,299
| 607,300
|
u252405453
|
python
|
p02803
|
#!/usr/bin/env python
# coding: utf-8
# In[11]:
from collections import deque
# In[23]:
H,W = map(int, input().split())
S = []
for _ in range(H):
S.append(input())
# In[24]:
def bfs(sx,sy):
dx = [1,0,-1,0]
dy = [0,1,0,-1]
d = [[-1]*W for _ in range(H)]
q = deque([])
q.append([sx,sy])
d[sx][sy] = 0
ans = 0
while q:
x,y = q.popleft()
for i in range(4):
nx = x + dx[i]
ny = y + dy[i]
if 0 <= nx < H and 0 <= ny < W and S[nx][ny] != "#" and d[nx][ny] == -1:
q.append([nx,ny])
d[nx][ny] = d[x][y] + 1
ans = max(ans,d[nx][ny])
return ans
# In[25]:
for sh in range(H):
if "." in S[sh]:
for sw in range(W):
if S[sh][sw] == ".":
ans = max(ans,bfs(sh,sw))
print(ans)
# In[ ]:
|
#!/usr/bin/env python
# coding: utf-8
# In[1]:
from collections import deque
# In[2]:
H,W = map(int, input().split())
S = []
for _ in range(H):
S.append(input())
# In[3]:
def bfs(sx,sy):
dx = [1,0,-1,0]
dy = [0,1,0,-1]
d = [[-1]*W for _ in range(H)]
q = deque([])
q.append([sx,sy])
d[sx][sy] = 0
ans = 0
while q:
x,y = q.popleft()
for i in range(4):
nx = x + dx[i]
ny = y + dy[i]
if 0 <= nx < H and 0 <= ny < W and S[nx][ny] != "#" and d[nx][ny] == -1:
q.append([nx,ny])
d[nx][ny] = d[x][y] + 1
ans = max(ans,d[nx][ny])
return ans
# In[5]:
ans = 0
for sh in range(H):
if "." in S[sh]:
for sw in range(W):
if S[sh][sw] == ".":
ans = max(ans,bfs(sh,sw))
print(ans)
# In[ ]:
|
[
"assignment.add"
] | 607,312
| 607,313
|
u085717502
|
python
|
p02803
|
from collections import deque
h,w = map(int,input().split())
s_input = [list(input()) for i in range(h)]
mx = [0,0,1,-1]
my = [1,-1,0,0]
ans = 0
for i in range(h):
for j in range(w):
if s_input[i][j]=='#':
continue
queue = deque()
queue.append([j,i])
visited = [[-1]*w for i in range(h)]
visited[i][j]=0
res = 0
while queue:
y,x = queue.popleft()
for k in range(4):
nx = x+mx[k]
ny = y+my[k]
if 0<=nx<w and 0<=ny<h:
if visited[ny][nx]!=-1:
continue
if s_input[ny][nx]=='#':
continue
visited[ny][nx]=visited[y][x]+1
queue.append([nx,ny])
res = max(res,visited[ny][nx])
ans = max(ans,res)
print(ans)
|
from collections import deque
h,w = map(int,input().split())
s_input = [list(input()) for i in range(h)]
mx = [0,0,1,-1]
my = [1,-1,0,0]
ans = 0
for i in range(h):
for j in range(w):
if s_input[i][j]=='#':
continue
queue = deque()
queue.append([j,i])
visited = [[-1]*w for i in range(h)]
visited[i][j]=0
res = 0
while queue:
x,y = queue.popleft()
for k in range(4):
nx = x+mx[k]
ny = y+my[k]
if 0<=nx<w and 0<=ny<h:
if visited[ny][nx]!=-1:
continue
if s_input[ny][nx]=='#':
continue
visited[ny][nx]=visited[y][x]+1
queue.append([nx,ny])
res = max(res,visited[ny][nx])
ans = max(ans,res)
print(ans)
|
[] | 607,352
| 607,353
|
u535171899
|
python
|
p02803
|
H,W = map(int,input().split())
S = [input() for i in range(H)]
dxy = [(0,1),(1,0),(0,-1),(-1,0)]
from collections import deque
ans = 0
for y in range(H):
for x in range(W):
if S[y][x] == '#': continue
dist = [[0]*W for i in range(H)]
visited = [[0]*W for i in range(H)]
visited[y][x] = 1
q = deque([(x,y)])
while q:
x,y = q.popleft()
for dx,dy in dxy:
nx,ny = x+dx,y+dy
if not 0 <= nx < W: continue
if not 0 <= ny < H: continue
if visited[ny][nx]: continue
if S[ny][nx] == '#': continue
visited[ny][nx] = 1
dist[ny][nx] = dist[y][x] + 1
q.append((nx,ny))
for i in range(H):
ans = max(ans, dist[i])
print(ans)
|
H,W = map(int,input().split())
S = [input() for i in range(H)]
dxy = [(0,1),(1,0),(0,-1),(-1,0)]
from collections import deque
ans = 0
for y in range(H):
for x in range(W):
if S[y][x] == '#': continue
dist = [[0]*W for i in range(H)]
visited = [[0]*W for i in range(H)]
visited[y][x] = 1
q = deque([(x,y)])
while q:
x,y = q.popleft()
for dx,dy in dxy:
nx,ny = x+dx,y+dy
if not 0 <= nx < W: continue
if not 0 <= ny < H: continue
if visited[ny][nx]: continue
if S[ny][nx] == '#': continue
visited[ny][nx] = 1
dist[ny][nx] = dist[y][x] + 1
q.append((nx,ny))
for i in range(H):
ans = max(ans, max(dist[i]))
#ans = max(ans, max(max(row) for row in dist))
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 607,369
| 607,370
|
u037430802
|
python
|
p02803
|
from collections import deque
H, W = map(int, input().split())
S = [list(input().rstrip('\n') ) for _ in range(H)]
moves = [[-1,0], [1,0], [0,-1], [0,1]]
min_val = 0
for i in range(H):
for j in range(W):
if S[i][j] == "#":
continue
todo = deque([[i,j]])
shortest = [[-10e+10 for _ in range(W)] for _ in range(H)]
shortest[i][j] = 0
while len(todo) > 0:
print(todo)
checking = todo.popleft()
for move in moves:
if checking[0] + move[0] >= 0 and checking[0] + move[0] < H and checking[1] + move[1] >= 0 and checking[1] + move[1] < W:
if shortest[checking[0]+move[0]][checking[1]+move[1]] == -10e+10 and S[checking[0]+move[0]][checking[1]+move[1]] == ".":
shortest[checking[0]+move[0]][checking[1]+move[1]] = shortest[checking[0]][checking[1]]+1
todo.append([checking[0]+move[0],checking[1]+move[1]])
if min_val < max([max(row) for row in shortest]):
min_val = max([max(row) for row in shortest])
print(min_val)
|
from collections import deque
H, W = map(int, input().split())
S = [list(input().rstrip('\n') ) for _ in range(H)]
moves = [[-1,0], [1,0], [0,-1], [0,1]]
min_val = 0
for i in range(H):
for j in range(W):
if S[i][j] == "#":
continue
todo = deque([[i,j]])
shortest = [[-10e+10 for _ in range(W)] for _ in range(H)]
shortest[i][j] = 0
while len(todo) > 0:
checking = todo.popleft()
for move in moves:
if checking[0] + move[0] >= 0 and checking[0] + move[0] < H and checking[1] + move[1] >= 0 and checking[1] + move[1] < W:
if shortest[checking[0]+move[0]][checking[1]+move[1]] == -10e+10 and S[checking[0]+move[0]][checking[1]+move[1]] == ".":
shortest[checking[0]+move[0]][checking[1]+move[1]] = shortest[checking[0]][checking[1]]+1
todo.append([checking[0]+move[0],checking[1]+move[1]])
if min_val < max([max(row) for row in shortest]):
min_val = max([max(row) for row in shortest])
print(min_val)
|
[
"call.remove"
] | 607,389
| 607,390
|
u207097826
|
python
|
p02803
|
H, W = map(int, input().split())
S = [input() for _ in range(H)]
dx = [1, -1, 0, 0]
dy = [0, 0, 1, -1]
def longest_BFS(h, w):
ret = -1
if S[h][w] == '#':
return -1
table = [[-1 for i in range(W)] for j in range(H)]
table[h][w]
next_step = [[h, w]]
while next_step:
ret += 1
step = next_step[:]
next_step = []
while step:
u = step.pop()
for i in range(4):
if u[0]+dx[i] >= 0 and u[0]+dx[i] < H \
and u[1]+dy[i] >= 0 and u[1]+dy[i] < W \
and S[u[0]+dx[i]][u[1]+dy[i]] == '.' \
and table[u[0]+dx[i]][u[1]+dy[i]] == -1:
next_step += [[u[0]+dx[i], u[1]+dy[i]]]
table[u[0]+dx[i]][u[1]+dy[i]] = ret
return ret
ans = -1
for h in range(H):
for w in range(W):
ans = max(ans, longest_BFS(h, w))
print(ans)
|
H, W = map(int, input().split())
S = [input() for _ in range(H)]
dx = [1, -1, 0, 0]
dy = [0, 0, 1, -1]
def longest_BFS(h, w):
ret = -1
if S[h][w] == '#':
return -1
table = [[-1 for i in range(W)] for j in range(H)]
table[h][w] = 0
next_step = [[h, w]]
while next_step:
ret += 1
step = next_step[:]
next_step = []
while step:
u = step.pop()
for i in range(4):
if u[0]+dx[i] >= 0 and u[0]+dx[i] < H \
and u[1]+dy[i] >= 0 and u[1]+dy[i] < W \
and S[u[0]+dx[i]][u[1]+dy[i]] == '.' \
and table[u[0]+dx[i]][u[1]+dy[i]] == -1:
next_step += [[u[0]+dx[i], u[1]+dy[i]]]
table[u[0]+dx[i]][u[1]+dy[i]] = ret
return ret
ans = 0
for h in range(H):
for w in range(W):
ans = max(ans, longest_BFS(h, w))
print(ans)
|
[
"assignment.value.change",
"expression.operation.unary.remove"
] | 607,406
| 607,405
|
u667084803
|
python
|
p02803
|
from collections import deque
def maze(h, w, sh, sw, list1):
if list1[sh][sw]=="#":
return 0
flag = True
for i in range(h):
for j in range(w):
if list1[i][j]=="#":
flag=False
if flag:
return 10000000000
que = deque()
que.append([sh, sw, 0])
list2 = list1.copy()
direct = [(0,1), (0,-1), (1,0), (-1, 0)]
count = 0
while que:
nh, nw, co = que.pop()
count = co
co +=1
li=list(list2[nh])
li[nw]="#"
list2[nh]="".join(li)
for i, j in direct:
if nh+i<0 or nh+i>=h or nw+j<0 or nw+j>=w:
pass
elif list2[nh+i][nw+j]==".":
que.appendleft([nh+i, nw+j, co])
return count
h, w = (int(x) for x in input().split())
list1 = []
ans = 0
for i in range(h):
list1.append(input())
for i in range(h):
for j in range(w):
ans_ij = maze(h, w, i, j , list1)
if ans_ij>ans:
ans=ans_ij
print(ans)
|
from collections import deque
def maze(h, w, sh, sw, list1):
if list1[sh][sw]=="#":
return 0
flag = True
for i in range(h):
for j in range(w):
if list1[i][j]=="#":
flag=False
if flag:
return h+w-2
que = deque()
que.append([sh, sw, 0])
list2 = list1.copy()
direct = [(0,1), (0,-1), (1,0), (-1, 0)]
count = 0
while que:
nh, nw, co = que.pop()
count = co
co +=1
li=list(list2[nh])
li[nw]="#"
list2[nh]="".join(li)
for i, j in direct:
if nh+i<0 or nh+i>=h or nw+j<0 or nw+j>=w:
pass
elif list2[nh+i][nw+j]==".":
que.appendleft([nh+i, nw+j, co])
return count
h, w = (int(x) for x in input().split())
list1 = []
ans = 0
for i in range(h):
list1.append(input())
for i in range(h):
for j in range(w):
ans_ij = maze(h, w, i, j , list1)
if ans_ij>ans:
ans=ans_ij
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 607,407
| 607,408
|
u207137484
|
python
|
p02803
|
h,w = map(int,input().split())
from copy import deepcopy
from collections import deque
a = [input().split() for l in range(h)]
c = [[None for i in range(w)]for j in range(h)]
for i in range(h):
for j in range(w):
if a[i][j] == '.':
c[i][j] = -1
ans = 0
g = deque()
for l in range(h):
for k in range(w):
b = deepcopy(c)
if a[l][k] == '.':
b[l][k] = 0
g.append((l,k))
while len(g)>0:
i,j = g.popleft()
dis = b[i][j]
for dx,dy in ((1,0),(0,1),(-1,0), (0,-1)):
newi = i + dx
newj = j +dy
if newi < 0 or newi > h-1 or newj < 0 or newj > w-1:
continue
if b[newi][newj] == -1:
b[newi][newj] = dis + 1
ans = max(ans,dis+1)
g.append((newi,newj))
print(ans)
|
h,w = map(int,input().split())
from copy import deepcopy
from collections import deque
a = [list(input()) for l in range(h)]
c = [[None for i in range(w)]for j in range(h)]
for i in range(h):
for j in range(w):
if a[i][j] == '.':
c[i][j] = -1
ans = 0
g = deque()
for l in range(h):
for k in range(w):
b = deepcopy(c)
if a[l][k] == '.':
b[l][k] = 0
g.append((l,k))
while len(g)>0:
i,j = g.popleft()
dis = b[i][j]
for dx,dy in ((1,0),(0,1),(-1,0), (0,-1)):
newi = i + dx
newj = j +dy
if newi < 0 or newi > h-1 or newj < 0 or newj > w-1:
continue
if b[newi][newj] == -1:
b[newi][newj] = dis + 1
ans = max(ans,dis+1)
g.append((newi,newj))
print(ans)
|
[
"call.add",
"call.remove"
] | 607,409
| 607,410
|
u342563578
|
python
|
p02803
|
from collections import defaultdict,deque
H, W = map(int,input().split())
MAP = []
for _ in range(H):
MAP.append(tuple(map(str,input())))
move = [[0,1],[0,-1],[1,0],[-1,0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth =dict()
depth[tuple(s)] = 0
while stack:
v = stack.popleft()
for m in move:
a = tuple([v[0]+m[0], v[1] + m[1]])
if a[0] < H and a[0] >= 0 and a[1] < W and a[1] >= 0:
if MAP[a[0]][a[1]] == '.' and not a in depth:
stack.append(a)
depth[a] = depth[v] + 1
for d in depth.values():
MAX = max(MAX,d)
for i in range(0,H):
for j in (0,W-1):
if MAP[i][j] == '.':
bfs(tuple([i,j]))
for i in range(0,W):
for j in (0,H-1):
if MAP[j][i] == '.':
bfs(tuple([j,i]))
print(MAX)
|
from collections import defaultdict,deque
H, W = map(int,input().split())
MAP = []
for _ in range(H):
MAP.append(tuple(map(str,input())))
move = [[0,1],[0,-1],[1,0],[-1,0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth =dict()
depth[tuple(s)] = 0
while stack:
v = stack.popleft()
for m in move:
a = tuple([v[0]+m[0], v[1] + m[1]])
if a[0] < H and a[0] >= 0 and a[1] < W and a[1] >= 0:
if MAP[a[0]][a[1]] == '.' and not a in depth:
stack.append(a)
depth[a] = depth[v] + 1
for d in depth.values():
MAX = max(MAX,d)
for i in range(0,H):
for j in range(0,W):
if MAP[i][j] == '.':
bfs(tuple([i,j]))
for i in range(0,W):
for j in range(0,H):
if MAP[j][i] == '.':
bfs(tuple([j,i]))
print(MAX)
|
[
"call.add",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 607,411
| 607,412
|
u619144316
|
python
|
p02803
|
from collections import deque
inf = float('inf')
di = [1, 0, -1, 0]
dj = [0, 1, 0, -1]
h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]
# bfs
for si in range(h):
for sj in range(w):
if s[si][sj] == '#':
continue
dist = [[inf for j in range(w)] for i in range(h)]
q = deque()
def update(i, j, x):
if dist[i][j] != inf:
return
dist[i][j] = x
q.append([i, j])
update(si, sj, 0)
while len(q):
i = q[0][0]
j = q[0][1]
q.popleft()
for dir in range(4):
ni = i + di[dir]
nj = j + dj[dir]
if ni < 0 or ni >= h or nj < 0 or nj >= w:
continue
if s[ni][nj] == '#':
continue
update(ni, nj, dist[i][j] + 1)
ans = 0
for i in range(h):
for j in range(w):
if dist[i][j] == inf:
continue
ans = max(ans, dist[i][j])
print(ans)
|
from collections import deque
inf = float('inf')
di = [1, 0, -1, 0]
dj = [0, 1, 0, -1]
h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]
ans = 0
# bfs
for si in range(h):
for sj in range(w):
if s[si][sj] == '#':
continue
dist = [[inf for j in range(w)] for i in range(h)]
q = deque()
def update(i, j, x):
if dist[i][j] != inf:
return
dist[i][j] = x
q.append([i, j])
update(si, sj, 0)
while len(q):
i = q[0][0]
j = q[0][1]
q.popleft()
for dir in range(4):
ni = i + di[dir]
nj = j + dj[dir]
if ni < 0 or ni >= h or nj < 0 or nj >= w:
continue
if s[ni][nj] == '#':
continue
update(ni, nj, dist[i][j] + 1)
for i in range(h):
for j in range(w):
if dist[i][j] == inf:
continue
ans = max(ans, dist[i][j])
print(ans)
|
[
"assignment.add",
"assignment.remove"
] | 607,413
| 607,414
|
u697101155
|
python
|
p02803
|
import queue
H,W = map(int,input().split())
maze = list()
q = queue.Queue()
for i in range(H):
maze.append( [x for x in input()])
print(maze)
maxim = 1
for i in range(H):
for j in range(W):
if maze[i][j] == "." :
maze_score = [[0]*W for k in range(H)]
maze_score[i][j] = 1
q.put([i,j])
else :
continue
while(True):
if q.empty() :
if maze_score[x][y] > maxim:
maxim = maze_score[x][y]
break
[x,y] = q.get()
##top
if x != 0:
if maze_score[x-1][y] ==0 and maze[x-1][y] == ".":
maze_score[x-1][y] = maze_score[x][y] +1
q.put([x-1,y])
##right
if y+1 != W:
if maze_score[x][y+1] ==0 and maze[x][y+1] == ".":
maze_score[x][y+1] = maze_score[x][y] +1
q.put([x,y+1])
##bottom
if x != H-1:
if maze_score[x+1][y] ==0 and maze[x+1][y] == ".":
maze_score[x+1][y] = maze_score[x][y] +1
q.put([x+1,y])
##left
if y != 0:
if maze_score[x][y-1] ==0 and maze[x][y-1] == ".":
maze_score[x][y-1] = maze_score[x][y] +1
q.put([x,y-1])
print(maxim-1)
|
import queue
H,W = map(int,input().split())
maze = list()
q = queue.Queue()
for i in range(H):
maze.append( [x for x in input()])
maxim = 1
for i in range(H):
for j in range(W):
if maze[i][j] == "." :
maze_score = [[0]*W for k in range(H)]
maze_score[i][j] = 1
q.put([i,j])
else :
continue
while(True):
if q.empty() :
if maze_score[x][y] > maxim:
maxim = maze_score[x][y]
break
[x,y] = q.get()
##top
if x != 0:
if maze_score[x-1][y] ==0 and maze[x-1][y] == ".":
maze_score[x-1][y] = maze_score[x][y] +1
q.put([x-1,y])
##right
if y+1 != W:
if maze_score[x][y+1] ==0 and maze[x][y+1] == ".":
maze_score[x][y+1] = maze_score[x][y] +1
q.put([x,y+1])
##bottom
if x != H-1:
if maze_score[x+1][y] ==0 and maze[x+1][y] == ".":
maze_score[x+1][y] = maze_score[x][y] +1
q.put([x+1,y])
##left
if y != 0:
if maze_score[x][y-1] ==0 and maze[x][y-1] == ".":
maze_score[x][y-1] = maze_score[x][y] +1
q.put([x,y-1])
print(maxim-1)
|
[
"call.remove"
] | 607,417
| 607,418
|
u652445326
|
python
|
p02803
|
from collections import deque
def bfs(start, maze, H, W):
max_step = 0
used = [[False for _ in range(W)] for _ in range(H)]
start_x, start_y = start
used[start_x][start_y] = True
stack = deque([[start, 0]])
while stack:
(i, j), step = stack.popleft()
if maze[i][j] == '#':
continue
max_step = max(max_step, step)
for x, y in [(i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)]:
if 0 <= x < H and 0 <= y < W and not used[x][y]:
stack.append([(x, y), step + 1])
used[x][y] = True
return max_step
if __name__ == '__main__':
H, W = map(int, input().split())
S = []
for _ in range(H):
S.append(list(input()))
ret = 0
for i in range(H):
for j in range(W):
ret = max(ret, bfs((i, j), S, H, W))
break
break
print(ret)
|
from collections import deque
def bfs(start, maze, H, W):
max_step = 0
used = [[False for _ in range(W)] for _ in range(H)]
start_x, start_y = start
used[start_x][start_y] = True
stack = deque([[start, 0]])
while stack:
(i, j), step = stack.popleft()
if maze[i][j] == '#':
continue
max_step = max(max_step, step)
for x, y in [(i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)]:
if 0 <= x < H and 0 <= y < W and not used[x][y]:
stack.append([(x, y), step + 1])
used[x][y] = True
return max_step
if __name__ == '__main__':
H, W = map(int, input().split())
S = []
for _ in range(H):
S.append(list(input()))
ret = 0
for i in range(H):
for j in range(W):
ret = max(ret, bfs((i, j), S, H, W))
print(ret)
|
[
"control_flow.break.remove"
] | 607,439
| 607,440
|
u669819350
|
python
|
p02803
|
import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
grid = [sr() for _ in range(H)]
def bfs(sy, sx):
d = [[float('inf')] * W for _ in range(H)]
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]
que = deque()
que.append((sy, sx))
d[sy][sx] = 0
while que:
p = que.popleft()
for i in range(4):
ny = p[0] + dy[i]
nx = p[1] + dx[i]
if 0 <= ny < H and 0 <= nx < W and \
grid[ny][nx] != '#' and d[ny][nx] == float('inf'):
d[ny][nx] = d[p[0]][p[1]] + 1
que.append((ny, nx))
max = 0
for row in d:
for r in row:
if r != float('inf') and r > max:
max = r
return max
answer = 0
for i in range(H):
for j in range(W):
if S[i][j] == '#':
continue
result = bfs(i, j)
if result > answer:
answer = result
print(answer)
# 49
|
import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
grid = [sr() for _ in range(H)]
def bfs(sy, sx):
d = [[float('inf')] * W for _ in range(H)]
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]
que = deque()
que.append((sy, sx))
d[sy][sx] = 0
while que:
p = que.popleft()
for i in range(4):
ny = p[0] + dy[i]
nx = p[1] + dx[i]
if 0 <= ny < H and 0 <= nx < W and \
grid[ny][nx] != '#' and d[ny][nx] == float('inf'):
d[ny][nx] = d[p[0]][p[1]] + 1
que.append((ny, nx))
max = 0
for row in d:
for r in row:
if r != float('inf') and r > max:
max = r
return max
answer = 0
for i in range(H):
for j in range(W):
if grid[i][j] == '#':
continue
result = bfs(i, j)
if result > answer:
answer = result
print(answer)
# 49
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 607,470
| 607,471
|
u600402037
|
python
|
p02803
|
from collections import deque
H,W = map(int,input().split())
S = [list(input()) for _ in range(H)]
def bfs(startx,starty):
d = [[-1]*W for _ in range(H)]
q = deque([[startx,starty]])
d[startx][starty] = 0
cnt = 0
while(q):
x,y = q.popleft()
for i,j in ([1,0],[-1,0],[0,1],[0,-1]):
new_x,new_y = x+i,y+j
if(new_x>H-1 or new_x<0 or new_y>W-1 or new_y<0):
continue
elif(S[new_x][new_y] == "#"):
continue
elif(d[new_x][new_y] == -1):
d[new_x][new_y] = d[x][y] + 1
q.append([new_x,new_y])
cnt = max(cnt,d[new_x][new_y])
print(d)
return cnt
ans = 0
for i in range(H):
for j in range(W):
if(S[i][j]=="."):
ans = max(ans,bfs(i,j))
print(ans)
|
from collections import deque
H,W = map(int,input().split())
S = [list(input()) for _ in range(H)]
def bfs(startx,starty):
d = [[-1]*W for _ in range(H)]
q = deque([[startx,starty]])
d[startx][starty] = 0
cnt = 0
while(q):
x,y = q.popleft()
for i,j in ([1,0],[-1,0],[0,1],[0,-1]):
new_x,new_y = x+i,y+j
if(new_x>H-1 or new_x<0 or new_y>W-1 or new_y<0):
continue
elif(S[new_x][new_y] == "#"):
continue
elif(d[new_x][new_y] == -1):
d[new_x][new_y] = d[x][y] + 1
q.append([new_x,new_y])
cnt = max(cnt,d[new_x][new_y])
return cnt
ans = 0
for i in range(H):
for j in range(W):
if(S[i][j]=="."):
ans = max(ans,bfs(i,j))
print(ans)
|
[
"call.remove"
] | 607,488
| 607,489
|
u557282438
|
python
|
p02803
|
from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!="#":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.pop()
for ni,nj in [(si+1,sj),(si-1,sj),(si,sj+1),(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!="#":
if dp[ni][nj]>dp[si][sj]+1:
dp[ni][nj]=dp[si][sj]+1
que.append((ni,nj))
ans=max(ans,dp[si][sj]+1)
print(ans)
|
from collections import deque
h,w=map(int,input().split())
S=[input()for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]==".":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.popleft()
for ni,nj in [(si+1,sj),(si-1,sj),(si,sj+1),(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!='#':
if dp[ni][nj]>dp[si][sj]+1:
dp[ni][nj]=dp[si][sj]+1
que.append((ni,nj))
ans=max(ans,dp[si][sj]+1)
print(ans)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"assignment.value.change",
"identifier.change"
] | 607,493
| 607,494
|
u573754721
|
python
|
p02803
|
from collections import deque
h,w=map(int,input().split())
S=[input()for _ in range(h)]
inf=float('inf')
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!='#':
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.pop()
for ni,nj in [(si+1,sj),(si-1,sj),(si,sj+1),(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!='#':
if dp[ni][nj]>dp[si][sj]+1:
dp[ni][nj]=dp[si][sj]+1
ans=max(ans,dp[si][sj]+1)
que.append((ni,nj))
print(ans)
|
from collections import deque
h,w=map(int,input().split())
S=[input()for _ in range(h)]
inf=float('inf')
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!='#':
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.popleft()
for ni,nj in [(si+1,sj),(si-1,sj),(si,sj+1),(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!='#':
if dp[ni][nj]>dp[si][sj]+1:
dp[ni][nj]=dp[si][sj]+1
ans=max(ans,dp[si][sj]+1)
que.append((ni,nj))
print(ans)
|
[
"assignment.value.change",
"identifier.change"
] | 607,495
| 607,496
|
u573754721
|
python
|
p02803
|
from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!="#":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.pop()
for ni,nj in [(si+1,sj),(si-1,sj),(si,sj+1),(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!="#":
if dp[ni][nj]>dp[si][sj]+1:
dp[ni][nj]=dp[si][sj]+1
que.append((ni,nj))
ans=max(ans,dp[si][sj]+1)
print(ans)
|
from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!="#":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.popleft()
for ni,nj in [(si+1,sj),(si-1,sj),(si,sj+1),(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!="#":
if dp[ni][nj]>dp[si][sj]+1:
dp[ni][nj]=dp[si][sj]+1
que.append((ni,nj))
ans=max(ans,dp[si][sj]+1)
print(ans)
|
[
"assignment.value.change",
"identifier.change"
] | 607,493
| 607,497
|
u573754721
|
python
|
p02803
|
from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]=="#":
continue
else:
DP=[[inf for _ in range(w)]for _ in range(h)]
DP[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.popleft()
for ni,nj in [(si+1,sj)(si-1,sj)(si,sj+1)(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!="#":
if DP[ni][nj]>DP[si][sj]+1:
DP[ni][nj]=DP[si][sj]+1
que.append((ni,nj))
ans=max(ans,DP[si][sj]+1)
print(ans)
|
from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]=="#":
continue
else:
DP=[[inf for _ in range(w)]for _ in range(h)]
DP[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que.popleft()
for ni,nj in [(si+1,sj),(si-1,sj),(si,sj+1),(si,sj-1)]:
if 0<=ni<h and 0<=nj<w and S[ni][nj]!="#":
if DP[ni][nj]>DP[si][sj]+1:
DP[ni][nj]=DP[si][sj]+1
que.append((ni,nj))
ans=max(ans,DP[si][sj]+1)
print(ans)
|
[] | 607,498
| 607,499
|
u573754721
|
python
|
p02803
|
h,w = map(int,input().split())
maze = [input() for _ in range(h)]
from collections import deque
D = [(0,1),(1,0),(-1,0),(0,-1)]
ans = 0
for i in range(h):
for j in range(w):
if maze[i][j]=='#':
continue
queue = deque([(i,j,0)])
checked = [[0 for _ in range(w)] for _ in range(h)]
checked[i][j] = 1
while queue:
j,k,d = queue.popleft()
for dx,dy in D:
x,y = j+dx,k+dy
if not(0<=x<h) or not(0<=y<w):
continue
if maze[x][y] == '#':
continue
if checked[x][y]:
continue
checked[x][y] = d+1
queue.append((x,y,d+1))
for j in range(h):
for k in range(w):
if checked:
ans = max(ans,checked[j][k])
print(max(2,ans))
|
h,w = map(int,input().split())
maze = [input() for _ in range(h)]
from collections import deque
D = [(0,1),(1,0),(-1,0),(0,-1)]
ans = 0
for i in range(h):
for j in range(w):
if maze[i][j]=='#':
continue
queue = deque([(i,j,0)])
checked = [[0 for _ in range(w)] for _ in range(h)]
checked[i][j] = 1
while queue:
j,k,d = queue.popleft()
for dx,dy in D:
x,y = j+dx,k+dy
if not(0<=x<h) or not(0<=y<w):
continue
if maze[x][y] == '#':
continue
if checked[x][y]:
continue
checked[x][y] = d+1
queue.append((x,y,d+1))
for j in range(h):
for k in range(w):
if checked:
ans = max(ans,checked[j][k])
print(ans)
|
[
"call.remove",
"call.arguments.change"
] | 607,504
| 607,505
|
u103902792
|
python
|
p02803
|
H, W = map(int, input().split())
S = [input().split() for _ in range(H)]
from collections import deque
def bfs(sy, sx):
q = deque([[sy, sx]])
visited = [[-1]*W for _ in range(H)]
visited[sy][sx] = 0
while q:
y, x = q.popleft()
for i, j in ([1, 0], [-1, 0], [0, 1], [0, -1]):
new_y, new_x = y+i, x+j
if not 0 <= new_y < H or not 0 <= new_x < W:
continue
if S[new_y][new_x] == "." and visited[new_y][new_x] == -1:
visited[new_y][new_x] = visited[y][x]+1
q.append([new_y, new_x])
return max(max(l) for l in visited)
ans = 0
for i in range(H):
for j in range(W):
if S[i][j] == ".":
ans = max(ans, bfs(i, j))
print (ans)
|
H, W = map(int, input().split())
S = [input() for _ in range(H)]
from collections import deque
def bfs(sy, sx):
q = deque([[sy, sx]])
visited = [[-1]*W for _ in range(H)]
visited[sy][sx] = 0
while q:
y, x = q.popleft()
for i, j in ([1, 0], [-1, 0], [0, 1], [0, -1]):
new_y, new_x = y+i, x+j
if not 0 <= new_y < H or not 0 <= new_x < W:
continue
if S[new_y][new_x] == "." and visited[new_y][new_x] == -1:
visited[new_y][new_x] = visited[y][x]+1
q.append([new_y, new_x])
return max(max(l) for l in visited)
ans = 0
for i in range(H):
for j in range(W):
if S[i][j] == ".":
ans = max(ans, bfs(i, j))
print (ans)
|
[] | 607,530
| 607,531
|
u375477204
|
python
|
p02803
|
#D
from collections import deque
h,w=map(int,input().split())
s=[]
for i in range(h):
s.append(list(input()))
dx=[1,0,-1,0]#東南西北
dy=[0,-1,0,1]
ans=0
def search(i,j):
if s[i][j]=="#":
return 0
max_step=0
que=deque()
que.append([i,j])#1現在地
dist=[[-1 for _ in range(w)] for _ in range (h)]
#(h,w)
dist[i][j]=0#現在地は0
while que:#行き先が無くなるまで
y,x=que.popleft()#現在地を取り出す(y,x)
for dir in range(4):
nx=x+dx[dir]#行き先(nx,xy)
ny=y+dy[dir]
if ny<0 or ny>=h or nx<0 or nx>=w or s[ny][nx]=="#":#壁の中
pass#何もしない
elif dist[ny][nx]!=-1:#捜索済み
pass
elif s[ny][nx]==".":
#未捜索地点"."
dist[ny][nx]=dist[y][x]+1#1進む
que.append([ny,nx])
out=0
for i in range(h):
for j in range(w):
if dist[i][j]==-1:
pass
out=max(out,dist[i][j])
return out
for i in range(h):
for j in range(w):
step=search(i,j)#(j,i)の時の最大移動数を求める
print(step)
if ans<step:
ans=step
print(ans)
|
#D
from collections import deque
h,w=map(int,input().split())
s=[]
for i in range(h):
s.append(list(input()))
dx=[1,0,-1,0]#東南西北
dy=[0,-1,0,1]
ans=0
def search(i,j):
if s[i][j]=="#":
return 0
max_step=0
que=deque()
que.append([i,j])#1現在地
dist=[[-1 for _ in range(w)] for _ in range (h)]
#(h,w)
dist[i][j]=0#現在地は0
while que:#行き先が無くなるまで
y,x=que.popleft()#現在地を取り出す(y,x)
for dir in range(4):
nx=x+dx[dir]#行き先(nx,xy)
ny=y+dy[dir]
if ny<0 or ny>=h or nx<0 or nx>=w or s[ny][nx]=="#":#壁の中
pass#何もしない
elif dist[ny][nx]!=-1:#捜索済み
pass
elif s[ny][nx]==".":
#未捜索地点"."
dist[ny][nx]=dist[y][x]+1#1進む
que.append([ny,nx])
out=0
for i in range(h):
for j in range(w):
if dist[i][j]==-1:
pass
out=max(out,dist[i][j])
return out
for i in range(h):
for j in range(w):
step=search(i,j)#(j,i)の時の最大移動数を求める
if ans<step:
ans=step
print(ans)
|
[
"call.remove"
] | 607,554
| 607,555
|
u490489966
|
python
|
p02803
|
from collections import deque
h,w=map(int,input().split())
G=[["#"]*(w+2) for i in range(h+2)]
for i in range(1,h+1):
G[i]=["#"]+list(input())+["#"]
ans=0
for sx in range(1,h+1):
for sy in range(1,w+1):
if G[sx][sy]==".":
B=[[0]*(w+2) for i in range(h+2)]
for i in range(h+2):
for j in range(w+2):
if G[i][j]=="#":
B[i][j]=1
INF=10**4
A=[[INF]*(w+2) for i in range(h+2)]
C=[-1,1,0,0]
D=[0,0,-1,1]
A[sx][sy]=0
E=deque([sx,sy])
while len(E)>0:
x=E[0]
E.popleft()
y=E[0]
E.popleft()
B[x][y]=1
for i in range(4):
if B[x+C[i]][y+D[i]]==0:
A[x+C[i]][y+D[i]]=A[x][y]+1
a=A[x+C[i]][y+D[i]]
print(a)
B[x+C[i]][y+D[i]]=1
E.append(x+C[i])
E.append(y+D[i])
if ans<a:
ans=a
else:
continue
print(ans)
|
from collections import deque
h,w=map(int,input().split())
G=[["#"]*(w+2) for i in range(h+2)]
for i in range(1,h+1):
G[i]=["#"]+list(input())+["#"]
ans=0
for sx in range(1,h+1):
for sy in range(1,w+1):
if G[sx][sy]==".":
B=[[0]*(w+2) for i in range(h+2)]
for i in range(h+2):
for j in range(w+2):
if G[i][j]=="#":
B[i][j]=1
INF=10**4
A=[[INF]*(w+2) for i in range(h+2)]
C=[-1,1,0,0]
D=[0,0,-1,1]
A[sx][sy]=0
E=deque([sx,sy])
while len(E)>0:
x=E[0]
E.popleft()
y=E[0]
E.popleft()
B[x][y]=1
for i in range(4):
if B[x+C[i]][y+D[i]]==0:
A[x+C[i]][y+D[i]]=A[x][y]+1
a=A[x+C[i]][y+D[i]]
B[x+C[i]][y+D[i]]=1
E.append(x+C[i])
E.append(y+D[i])
if ans<a:
ans=a
else:
continue
print(ans)
|
[
"call.remove"
] | 607,578
| 607,579
|
u968846084
|
python
|
p02803
|
import sys
import math
from math import sqrt
from collections import deque
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
h,w=map(int,input().split())
miti=[]
for i in range(h):
miti.append(input())
def bfs(x,y):
for i,j in [[x+1,y],[x,y+1],[x-1,y],[x,y-1]]:
if i<0 or h<=i or j<0 or w<=j :continue
if dist[i][j] != -1:continue
if miti[i][j]=="#":continue
dist[i][j]=dist[x][y]+1
queue.append([i,j])
while queue:
t,r=queue.popleft()
bfs(t,r)
ans=0
for i in range(h):
for j in range(w):
if miti[i][j]=="#":continue
dist=[[-1 for i in range(w)] for j in range(h)]
dist[i][j]=0
queue=deque([])
bfs(i,j)
print(dist)
for s in range(h):
for t in range(w):
ans=max(ans,dist[s][t])
print(ans)
|
import sys
import math
from math import sqrt
from collections import deque
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
h,w=map(int,input().split())
miti=[]
for i in range(h):
miti.append(input())
def bfs(x,y):
for i,j in [[x+1,y],[x,y+1],[x-1,y],[x,y-1]]:
if i<0 or h<=i or j<0 or w<=j :continue
if dist[i][j] != -1:continue
if miti[i][j]=="#":continue
dist[i][j]=dist[x][y]+1
queue.append([i,j])
while queue:
t,r=queue.popleft()
bfs(t,r)
ans=0
for i in range(h):
for j in range(w):
if miti[i][j]=="#":continue
dist=[[-1 for i in range(w)] for j in range(h)]
dist[i][j]=0
queue=deque([])
bfs(i,j)
for s in range(h):
for t in range(w):
ans=max(ans,dist[s][t])
print(ans)
|
[
"call.remove"
] | 607,583
| 607,584
|
u023229441
|
python
|
p02803
|
import sys
import math
from collections import deque
import copy
H, W = map(int, input().split())
maps2 = deque([deque(["#" for _ in range(W + 2)])])
MAX = 0
for _ in range(H):
temp = deque(input())
temp.appendleft("#")
temp.append("#")
maps2.append(temp)
maps2.append(deque(["#" for _ in range(W + 2)]))
for i in range(1, H + 1):
for l in range(1, W + 1):
if maps2[i][l] != "#":
maps = copy.deepcopy(maps2)
pos = [[i, l, 0]]
maps[1][1] = "a"
while len(pos) > 0:
y, x, depth = pos.pop(0)
if depth > MAX:
MAX = depth
if maps[y + 1][x] == ".":
pos.append([y + 1, x, depth + 1])
maps[y + 1][x] = "a"
if maps[y][x + 1] == ".":
pos.append([y, x + 1, depth + 1])
maps[y][x + 1] = "a"
if maps[y - 1][x] == ".":
pos.append([y - 1, x, depth + 1])
maps[y - 1][x] = "a"
if maps[y][x - 1] == ".":
pos.append([y, x - 1, depth + 1])
maps[y][x - 1] = "a"
print(MAX)
|
import sys
import math
from collections import deque
import copy
H, W = map(int, input().split())
maps2 = deque([deque(["#" for _ in range(W + 2)])])
MAX = 0
for _ in range(H):
temp = deque(input())
temp.appendleft("#")
temp.append("#")
maps2.append(temp)
maps2.append(deque(["#" for _ in range(W + 2)]))
for i in range(1, H + 1):
for l in range(1, W + 1):
if maps2[i][l] != "#":
maps = copy.deepcopy(maps2)
pos = [[i, l, 0]]
maps[i][l] = "a"
while len(pos) > 0:
y, x, depth = pos.pop(0)
if depth > MAX:
MAX = depth
if maps[y + 1][x] == ".":
pos.append([y + 1, x, depth + 1])
maps[y + 1][x] = "a"
if maps[y][x + 1] == ".":
pos.append([y, x + 1, depth + 1])
maps[y][x + 1] = "a"
if maps[y - 1][x] == ".":
pos.append([y - 1, x, depth + 1])
maps[y - 1][x] = "a"
if maps[y][x - 1] == ".":
pos.append([y, x - 1, depth + 1])
maps[y][x - 1] = "a"
print(MAX)
|
[
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 607,601
| 607,602
|
u385244248
|
python
|
p02803
|
import queue
dx = (1, 0, -1, 0)
dy = (0, 1, 0, -1)
h, w = map(int, input().split())
maze = [list(input()) for _ in range(h)]
ans = 0
#startを順に探索
for y in range(h):
for x in range(w):
i = 0
move = [[-1] * w for _ in range(h)]
print(x, y)
#壁はスキップ
if(maze[y][x] == '#'):
continue
#幅優先探索
q = queue.Queue()
q.put([x, y])
move[y][x] = 0
while not q.empty():
pos = q.get()
for i in range(4):
next = [pos[0] + dx[i], pos[1] + dy[i]]
#端
if(next[0] == w or next[1] == h or next[0] < 0 or next[1] < 0):
continue
if(maze[next[1]][next[0]] == '.' and move[next[1]][next[0]] == -1):
move[next[1]][next[0]] = move[pos[1]][pos[0]] + 1
q.put(next)
ans = max([ans] + [max(v) for v in move])
print(ans)
|
import queue
dx = (1, 0, -1, 0)
dy = (0, 1, 0, -1)
h, w = map(int, input().split())
maze = [list(input()) for _ in range(h)]
ans = 0
#startを順に探索
for y in range(h):
for x in range(w):
i = 0
move = [[-1] * w for _ in range(h)]
#壁はスキップ
if(maze[y][x] == '#'):
continue
#幅優先探索
q = queue.Queue()
q.put([x, y])
move[y][x] = 0
while not q.empty():
pos = q.get()
for i in range(4):
next = [pos[0] + dx[i], pos[1] + dy[i]]
#端
if(next[0] == w or next[1] == h or next[0] < 0 or next[1] < 0):
continue
if(maze[next[1]][next[0]] == '.' and move[next[1]][next[0]] == -1):
move[next[1]][next[0]] = move[pos[1]][pos[0]] + 1
q.put(next)
ans = max([ans] + [max(v) for v in move])
print(ans)
|
[
"call.remove"
] | 607,654
| 607,655
|
u024383312
|
python
|
p02803
|
from collections import deque
w,h = list(map(int,input().split(" ")))
path = [input() for _ in range(w)]
def bfs(sw,sh):
res = 0
dw = [-1,1,0,0]
dh = [0,0,1,-1]
dist = [[-1 for _ in range(w)] for _ in range(h)]
dist[sw][sh] = 0
queue = deque()
queue.append((sw,sh))
while len(queue) != 0:
cw,ch = queue.popleft()
for i in range(4):
nw,nh = cw + dw[i], ch + dh[i]
if not (0<= nw < w and 0 <= nh < h): continue
if path[nw][nh] == "#": continue
if dist[nw][nh] != -1: continue
dist[nw][nh] = dist[cw][ch] + 1
queue.append((nw,nh))
res = max(res, dist[nw][nh])
return res
ans = 0
for i in range(w):
for j in range(h):
if path[i][j] == "#":
continue
ans = max(ans, bfs(i,j))
print(ans)
|
from collections import deque
w,h = list(map(int,input().split(" ")))
path = [input() for _ in range(w)]
def bfs(sw,sh):
res = 0
dw = [-1,1,0,0]
dh = [0,0,1,-1]
dist = [[-1 for _ in range(h)] for _ in range(w)]
dist[sw][sh] = 0
queue = deque()
queue.append((sw,sh))
while len(queue) != 0:
cw,ch = queue.popleft()
for i in range(4):
nw,nh = cw + dw[i], ch + dh[i]
if not (0<= nw < w and 0 <= nh < h): continue
if path[nw][nh] == "#": continue
if dist[nw][nh] != -1: continue
dist[nw][nh] = dist[cw][ch] + 1
queue.append((nw,nh))
res = max(res, dist[nw][nh])
return res
ans = 0
for i in range(w):
for j in range(h):
if path[i][j] == "#":
continue
ans = max(ans, bfs(i,j))
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,689
| 607,690
|
u979126665
|
python
|
p02803
|
import queue
dx=[1,0,-1,0]
dy=[0,1,0,-1]
H,W=map(int,input().split())
S=[]
for h in range(H):
S.append(input())
def bfs(s):
dist = [[-1]*H for _ in range(W)]
h,w = s
dist[h][w]=0
que = queue.Queue()
que.put(s)
while not(que.empty()):
h,w = que.get()
for d in range(4):
nh = h + dx[d]
nw = w + dy[d]
if nh<0 or H<=nh or nw<0 or W<=nw:
continue
if S[nh][nw]=="#":
continue
if dist[nh][nw]==-1:
dist[nh][nw]=dist[h][w]+1
que.put([nh,nw])
return dist[h][w]
ans = 0
for h in range(H):
for w in range(W):
if S[h][w]==".":
ans = max(ans,bfs([h,w]))
print(ans)
|
import queue
dx=[1,0,-1,0]
dy=[0,1,0,-1]
H,W=map(int,input().split())
S=[]
for h in range(H):
S.append(input())
def bfs(s):
dist = [[-1]*W for _ in range(H)]
h,w = s
dist[h][w]=0
que = queue.Queue()
que.put(s)
while not(que.empty()):
h,w = que.get()
for d in range(4):
nh = h + dx[d]
nw = w + dy[d]
if nh<0 or H<=nh or nw<0 or W<=nw:
continue
if S[nh][nw]=="#":
continue
if dist[nh][nw]==-1:
dist[nh][nw]=dist[h][w]+1
que.put([nh,nw])
return dist[h][w]
ans = 0
for h in range(H):
for w in range(W):
if S[h][w]==".":
ans = max(ans,bfs([h,w]))
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,693
| 607,694
|
u118642796
|
python
|
p02803
|
H,W=map(int,input().split())
s=[input() for _ in range(H)]
G=[["#"]*(W+2) for _ in range(H+2)]
for i in range(H):
for j in range(W):
G[i+1][j+1]=s[i][j]
def search(y,x):
q=[(y,x)]
d=[[-1]*(W+2) for _ in range(H+2)]
d[y][x]=0
while q:
y1,x1=q.pop()
for y2,x2 in ((y1+1,x1),(y1,x1+1),(y1-1,x1),(y1,x1-1)):
if G[y2][x2]=="." and d[y2][x2]==-1:
d[y2][x2]=d[y1][x1]+1
q.append((y2,x2))
return max(max(_) for _ in d)
for i in range(H):
for j in range(W):
if G[i+1][j+1]==".":
ans=max(search(i+1,j+1),ans)
print(ans)
|
H,W=map(int,input().split())
s=[input() for _ in range(H)]
G=[["#"]*(W+2) for _ in range(H+2)]
for i in range(H):
for j in range(W):
G[i+1][j+1]=s[i][j]
def search(y,x):
q=[(y,x)]
d=[[-1]*(W+2) for _ in range(H+2)]
d[y][x]=0
while q:
y1,x1=q.pop(0)
for y2,x2 in ((y1+1,x1),(y1,x1+1),(y1-1,x1),(y1,x1-1)):
if G[y2][x2]=="." and d[y2][x2]==-1:
d[y2][x2]=d[y1][x1]+1
q.append((y2,x2))
return max(max(_) for _ in d)
ans=0
for i in range(H):
for j in range(W):
if G[i+1][j+1]==".":
ans=max(search(i+1,j+1),ans)
print(ans)
|
[
"call.arguments.change"
] | 607,740
| 607,741
|
u684305751
|
python
|
p02803
|
import sys
input = sys.stdin.readline
from collections import deque
H, W = map(int, input().split())
S = [list(input().split()[0]) for _ in range(H)]
def bfs(S, H, W, start):
INF = -1
stack=deque([start])
distance = [[INF]*W for _ in range(H)]
distance[start[1]][start[0]] = 0
while stack:
x, y = stack.popleft()
for i, j in [(1,0),(0,1),(-1,0),(0,-1)]:
next_x = x + i
next_y = y + j
if not(0 <= next_x < W and 0 <= next_y < H):
continue
if S[next_y][next_x] != '#' and distance[next_y][next_x] == -1:
stack.append([next_x, next_y])
distance[next_y][next_x] = distance[y][x] + 1
return max(map(max, s))
ans = 0
for i in range(H):
for j in range(W):
if S[i][j] != "#":
ans = max(ans, bfs(S, H, W, (j, i)))
|
import sys
input = sys.stdin.readline
from collections import deque
H, W = map(int, input().split())
S = [list(input().split()[0]) for _ in range(H)]
def bfs(S, H, W, start):
INF = -1
stack=deque([start])
distance = [[INF]*W for _ in range(H)]
distance[start[1]][start[0]] = 0
while stack:
x, y = stack.popleft()
for i, j in [(1,0),(0,1),(-1,0),(0,-1)]:
next_x = x + i
next_y = y + j
if not(0 <= next_x < W and 0 <= next_y < H):
continue
if S[next_y][next_x] != '#' and distance[next_y][next_x] == -1:
stack.append([next_x, next_y])
distance[next_y][next_x] = distance[y][x] + 1
return max(map(max, distance))
ans = 0
for i in range(H):
for j in range(W):
if S[i][j] != "#":
ans = max(ans, bfs(S, H, W, (j, i)))
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"call.add"
] | 607,749
| 607,750
|
u102275718
|
python
|
p02803
|
h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[h - 1][w - 1] = True
queue = [(i, j, 0)]
while queue:
c_i, c_j, level = queue.pop(0)
# visited.append((c_i, c_j))
for n_i, n_j in ((c_i - 1, c_j), (c_i + 1, c_j), (c_i, c_j - 1), (c_i, c_j + 1)):
if 0 <= n_i < h and 0 <= n_j < w and grid[n_i][n_j] == '.' and visited[n_i][n_j] == False:
queue.append((n_i, n_j, level + 1))
visited[n_i][n_j] = True
res = max(res, level)
print(res)
|
h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[i][j] = True
queue = [(i, j, 0)]
while queue:
c_i, c_j, level = queue.pop(0)
# visited.append((c_i, c_j))
for n_i, n_j in ((c_i - 1, c_j), (c_i + 1, c_j), (c_i, c_j - 1), (c_i, c_j + 1)):
if 0 <= n_i < h and 0 <= n_j < w and grid[n_i][n_j] == '.' and visited[n_i][n_j] == False:
queue.append((n_i, n_j, level + 1))
visited[n_i][n_j] = True
res = max(res, level)
print(res)
|
[
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 607,792
| 607,793
|
u598812605
|
python
|
p02803
|
h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[h][w] = True
queue = [(i, j, 0)]
while queue:
c_i, c_j, level = queue.pop(0)
# visited.append((c_i, c_j))
for n_i, n_j in ((c_i - 1, c_j), (c_i + 1, c_j), (c_i, c_j - 1), (c_i, c_j + 1)):
if 0 <= n_i < h and 0 <= n_j < w and grid[n_i][n_j] == '.' and visited[n_i][n_j] == False:
queue.append((n_i, n_j, level + 1))
visited[n_i][n_j] = True
res = max(res, level)
print(res)
|
h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[i][j] = True
queue = [(i, j, 0)]
while queue:
c_i, c_j, level = queue.pop(0)
# visited.append((c_i, c_j))
for n_i, n_j in ((c_i - 1, c_j), (c_i + 1, c_j), (c_i, c_j - 1), (c_i, c_j + 1)):
if 0 <= n_i < h and 0 <= n_j < w and grid[n_i][n_j] == '.' and visited[n_i][n_j] == False:
queue.append((n_i, n_j, level + 1))
visited[n_i][n_j] = True
res = max(res, level)
print(res)
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 607,794
| 607,793
|
u598812605
|
python
|
p02803
|
import queue
h,w = map(int,input().split())
maze = []
for i in range(h):
mazeRow = list(input())
maze.append(mazeRow)
maxRootCnt = 0
#スタート→ゴール全探索（ま？）
for roop_h in range(h):
for roop_w in range(w):
if maze[roop_h][roop_w] == '#':
continue
isSearched = [[0] * w for i in range(h)]
isLevel = [[0] * w for i in range(h)]
nowTansakuCnt = 0
q = queue.Queue()
q.put([roop_h,roop_w])
# 探索済マスセット
isSearched[roop_h][roop_w] = 1
isLevel[roop_h][roop_w] = 0
while not q.empty():
n= q.get()
nowLevel = isLevel[n[0]][n[1]]
if nowLevel > maxRootCnt:
maxRootCnt = nowLevel
#北
if n[0] != 0:
if maze[n[0] -1][n[1]] == '.' and isSearched[n[0] -1][n[1]] == 0:
q.put([n[0]-1,n[1]])
isSearched[n[0] -1][n[1]] = 1
isLevel[n[0] -1][n[1]] = nowLevel + 1
#南
if n[0] != h-1:
if maze[n[0] +1][n[1]] == '.' and isSearched[n[0]+-1][n[1]] == 0:
q.put([n[0]+1,n[1]])
isSearched[n[0] +1][n[1]] = 1
isLevel[n[0] +1][n[1]] = nowLevel + 1
#西
if n[1] != 0:
if maze[n[0]][n[1]-1] == '.' and isSearched[n[0]][n[1]-1] == 0:
q.put([n[0],n[1]-1])
isSearched[n[0]][n[1]-1] = 1
isLevel[n[0]][n[1]-1] = nowLevel + 1
#東
if n[1] != w-1:
if maze[n[0]][n[1]+1] == '.' and isSearched[n[0]][n[1]+1] == 0:
q.put([n[0],n[1]+1])
isSearched[n[0]][n[1]+1] = 1
isLevel[n[0]][n[1]+1] = nowLevel + 1
print(maxRootCnt)
|
import queue
h,w = map(int,input().split())
maze = []
for i in range(h):
mazeRow = list(input())
maze.append(mazeRow)
maxRootCnt = 0
#スタート→ゴール全探索（ま？）
for roop_h in range(h):
for roop_w in range(w):
if maze[roop_h][roop_w] == '#':
continue
isSearched = [[0] * w for i in range(h)]
isLevel = [[0] * w for i in range(h)]
nowTansakuCnt = 0
q = queue.Queue()
q.put([roop_h,roop_w])
# 探索済マスセット
isSearched[roop_h][roop_w] = 1
isLevel[roop_h][roop_w] = 0
while not q.empty():
n= q.get()
nowLevel = isLevel[n[0]][n[1]]
if nowLevel > maxRootCnt:
maxRootCnt = nowLevel
#北
if n[0] != 0:
if maze[n[0] -1][n[1]] == '.' and isSearched[n[0] -1][n[1]] == 0:
q.put([n[0]-1,n[1]])
isSearched[n[0] -1][n[1]] = 1
isLevel[n[0] -1][n[1]] = nowLevel + 1
#南
if n[0] != h-1:
if maze[n[0] +1][n[1]] == '.' and isSearched[n[0]+1][n[1]] == 0:
q.put([n[0]+1,n[1]])
isSearched[n[0] +1][n[1]] = 1
isLevel[n[0] +1][n[1]] = nowLevel + 1
#西
if n[1] != 0:
if maze[n[0]][n[1]-1] == '.' and isSearched[n[0]][n[1]-1] == 0:
q.put([n[0],n[1]-1])
isSearched[n[0]][n[1]-1] = 1
isLevel[n[0]][n[1]-1] = nowLevel + 1
#東
if n[1] != w-1:
if maze[n[0]][n[1]+1] == '.' and isSearched[n[0]][n[1]+1] == 0:
q.put([n[0],n[1]+1])
isSearched[n[0]][n[1]+1] = 1
isLevel[n[0]][n[1]+1] = nowLevel + 1
print(maxRootCnt)
|
[
"control_flow.branch.if.condition.change"
] | 607,809
| 607,810
|
u807084817
|
python
|
p02803
|
h,w=map(int,input().split())
M=[]
for i in range(h):
s=input()
H=[]
for j in range(w):
H.append(0) if s[j]=="." else H.append(1)
M.append(H)
def make2D(x,y):
aM=[]
for i in range(h):
aH=[]
for j in range(w):
aH.append(0) if M[i][j]==0 else aH.append(-1)
aM.append(aH)
return aM
from collections import deque
ans=0
for i in range(h):
for j in range(w):
print(i,j)
if M[i][j]==1:
continue
aM=make2D(h,w)
q=deque()
q.append([i,j])
while q:
now=q.popleft()
for a,b in ([0,1],[1,0],[0,-1],[-1,0]):
if 0<=now[0]+a<h and 0<=now[1]+b<w:
if aM[now[0]+a][now[1]+b]==0 and (now[0]+a!=i or now[1]+b!=j):
aM[now[0]+a][now[1]+b]=aM[now[0]][now[1]]+1
q.append([now[0]+a,now[1]+b])
if len(q)==0:
break
m=0
for z in range(h):
m=max(m,max(aM[z]))
ans=max(ans,m)
print(ans)
|
h,w=map(int,input().split())
M=[]
for i in range(h):
s=input()
H=[]
for j in range(w):
H.append(0) if s[j]=="." else H.append(1)
M.append(H)
def make2D(x,y):
aM=[]
for i in range(h):
aH=[]
for j in range(w):
aH.append(0) if M[i][j]==0 else aH.append(-1)
aM.append(aH)
return aM
from collections import deque
ans=0
for i in range(h):
for j in range(w):
if M[i][j]==1:
continue
aM=make2D(h,w)
q=deque()
q.append([i,j])
while q:
now=q.popleft()
for a,b in ([0,1],[1,0],[0,-1],[-1,0]):
if 0<=now[0]+a<h and 0<=now[1]+b<w:
if aM[now[0]+a][now[1]+b]==0 and (now[0]+a!=i or now[1]+b!=j):
aM[now[0]+a][now[1]+b]=aM[now[0]][now[1]]+1
q.append([now[0]+a,now[1]+b])
if len(q)==0:
break
m=0
for z in range(h):
m=max(m,max(aM[z]))
ans=max(ans,m)
print(ans)
|
[
"call.remove"
] | 607,825
| 607,826
|
u774539708
|
python
|
p02803
|
from collections import deque
from itertools import chain
H, W = map(int, input().split())
M = [list(input()) for _ in range(H)]
inf = float('inf')
def flatten(list_of_lists):
return chain.from_iterable(list_of_lists)
def bfs(start, end):
distance = [[inf for i in range(W)] for j in range(H)]
queue = deque((end, start))
distance[end][start] = 0
while queue:
y, x = queue.pop()
for i in range(0, 4):
nx, ny = x + [1, 0, -1, 0][i], y + [0, 1, 0, -1][i]
if 0 <= nx < W and 0 <= ny < H and M[ny][nx] != '#' and distance[ny][nx] == inf:
queue.insert(0, (ny, nx))
distance[ny][nx] = distance[y][x] + 1
return distance
m = 0
for i in range(W):
for j in range(H):
if M[j][i] != "#":
for length in list(flatten(bfs(i, j))):
if length != inf and m < length:
m = length
print(m)
|
from collections import deque
from itertools import chain
H, W = map(int, input().split())
M = [list(input()) for _ in range(H)]
inf = float('inf')
def flatten(list_of_lists):
return chain.from_iterable(list_of_lists)
def bfs(start, end):
distance = [[inf for i in range(W)] for j in range(H)]
queue = deque([(end, start)])
distance[end][start] = 0
while queue:
y, x = queue.pop()
for i in range(0, 4):
nx, ny = x + [1, 0, -1, 0][i], y + [0, 1, 0, -1][i]
if 0 <= nx < W and 0 <= ny < H and M[ny][nx] != '#' and distance[ny][nx] == inf:
queue.appendleft((ny, nx))
distance[ny][nx] = distance[y][x] + 1
return distance
m = 0
for i in range(W):
for j in range(H):
if M[j][i] != "#":
for length in list(flatten(bfs(i, j))):
if length != inf and m < length:
m = length
print(m)
|
[
"call.arguments.change",
"identifier.change"
] | 607,827
| 607,828
|
u663767599
|
python
|
p02803
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
import math
def inputIntList():
return [int(s) for s in input().split()]
def inputInt():
return int(input())
def main():
H, W = inputIntList()
S = [[s for s in input()] for _ in range(H)]
ans = 0
for si in range(H):
for sj in range(W):
if S[si][sj] == '#':
continue
dist = [[-1 for _ in range(W)] for _ in range(H)]
q = deque()
start = (si, sj)
if dist[si][sj] == -1:
dist[si][sj] = 0
q.append(start)
while q:
qi, qj = q.popleft()
for di, dj in (-1, 0), (0, -1), (1, 0), (0, 1):
ni = qi + di
nj = qj + dj
if ni < 0 or ni >= H:
continue
if nj < 0 or nj >= W:
continue
if S[ni][nj] == '#':
continue
if dist[ni][nj] == -1:
dist[ni][nj] = dist[qi][qj]+1
q.append((ni, nj))
ans = max(ans, dist[qi][qj])
return ans
if __name__ == "__main__":
print(main())
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
import math
def inputIntList():
return [int(s) for s in input().split()]
def inputInt():
return int(input())
def main():
H, W = inputIntList()
S = [[s for s in input()] for _ in range(H)]
ans = 0
for si in range(H):
for sj in range(W):
if S[si][sj] == '#':
continue
dist = [[-1 for _ in range(W)] for _ in range(H)]
q = deque()
start = (si, sj)
if dist[si][sj] == -1:
dist[si][sj] = 0
q.append(start)
while q:
qi, qj = q.popleft()
for di, dj in (-1, 0), (0, -1), (1, 0), (0, 1):
ni = qi + di
nj = qj + dj
if ni < 0 or ni >= H:
continue
if nj < 0 or nj >= W:
continue
if S[ni][nj] == '#':
continue
if dist[ni][nj] == -1:
dist[ni][nj] = dist[qi][qj]+1
q.append((ni, nj))
ans = max(ans, dist[ni][nj])
return ans
if __name__ == "__main__":
print(main())
|
[
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 607,848
| 607,849
|
u343128979
|
python
|
p02803
|
import sys
input = sys.stdin.readline
def dfs(B,si,sj, H, W):
R = [-1]*(H*W)
R[si*W+sj] = 0
d = deque([si*W+sj])
while d:
p = d.popleft()
x = p//W
y = p%W
t = R[x*W+y]
if x > 0:
if B[(x-1)*W+y] == 0:
if R[(x-1)*W+y] == -1:
R[(x-1)*W+y] = t+1
d.append((x-1)*W+y)
if x < H-1:
if B[(x+1)*W+y] == 0:
if R[(x+1)*W+y] == -1:
R[(x+1)*W+y] = t+1
d.append((x+1)*W+y)
if y > 0:
if B[x*W+y-1] == 0:
if R[x*W+y-1] == -1:
R[x*W+y-1] = t+1
d.append(x*W+y-1)
if y < W-1:
if B[x*W+y+1] == 0:
if R[x*W+y+1] == -1:
R[x*W+y+1] = t+1
d.append(x*W+y+1)
return max(R)
def main():
H, W = map( int, input().split())
S = [ list( input()) for _ in range(H)]
B = [0]*(H*W)
for i in range(H):
for j in range(W):
if S[i][j] == '#':
B[i*W+j] = 1
ans = 0
# print(dfs(B,i,j,H,W))
for i in range(H):
for j in range(W):
if B[i*W+j] == 1:
continue
t = dfs(B, i, j, H, W)
if t > ans:
ans = t
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
from collections import deque
def dfs(B,si,sj, H, W):
R = [-1]*(H*W)
R[si*W+sj] = 0
d = deque([si*W+sj])
while d:
p = d.popleft()
x = p//W
y = p%W
t = R[x*W+y]
if x > 0:
if B[(x-1)*W+y] == 0:
if R[(x-1)*W+y] == -1:
R[(x-1)*W+y] = t+1
d.append((x-1)*W+y)
if x < H-1:
if B[(x+1)*W+y] == 0:
if R[(x+1)*W+y] == -1:
R[(x+1)*W+y] = t+1
d.append((x+1)*W+y)
if y > 0:
if B[x*W+y-1] == 0:
if R[x*W+y-1] == -1:
R[x*W+y-1] = t+1
d.append(x*W+y-1)
if y < W-1:
if B[x*W+y+1] == 0:
if R[x*W+y+1] == -1:
R[x*W+y+1] = t+1
d.append(x*W+y+1)
return max(R)
def main():
H, W = map( int, input().split())
S = [ list( input()) for _ in range(H)]
B = [0]*(H*W)
for i in range(H):
for j in range(W):
if S[i][j] == '#':
B[i*W+j] = 1
ans = 0
# print(dfs(B,i,j,H,W))
for i in range(H):
for j in range(W):
if B[i*W+j] == 1:
continue
t = dfs(B, i, j, H, W)
if t > ans:
ans = t
print(ans)
if __name__ == '__main__':
main()
|
[] | 607,899
| 607,900
|
u201234972
|
python
|
p02803
|
from queue import Queue
import itertools
def solve():
H, W = map(int, input().split())
S = []
for i in range(H):
tmp = list(input())
S.append(tmp)
dw = (1,0,-1,0)
dh = (0,1,0,-1)
comb = itertools.combinations(tuple(range(20)), 2)
mx = -1
for c in comb:
startH = c[0]
startW = c[1]
if startH >= H or startW >= W or S[startH][startW] == '#':
continue
q = Queue()
cur = P(startH, startW)
q.put(cur)
time = [[float('inf')] * W for i in range(H)]
time[startH][startW] = 0
while not q.empty():
p = q.get()
for i in range(4):
nh = p.H + dh[i]
nw = p.W + dw[i]
if 0 <= nh and nh < H and 0 <= nw and nw < W and time[nh][nw] == float('inf') and S[nh][nw] != '#':
q.put(P(nh, nw))
time[nh][nw] = time[p.H][p.W] + 1
flatten = list(itertools.chain.from_iterable(time))
for i in range(len(flatten)):
if flatten[i] == float('inf'):
flatten[i] = 0
localmx = max(flatten)
mx = max(localmx, mx)
print(mx)
class P():
def __init__(self, H, W):
self.H = H
self.W = W
if __name__ == '__main__':
solve()
|
from queue import Queue
import itertools
def solve():
H, W = map(int, input().split())
S = []
for i in range(H):
tmp = list(input())
S.append(tmp)
dw = (1,0,-1,0)
dh = (0,1,0,-1)
comb = itertools.permutations(tuple(range(20)), 2)
mx = 0
for c in comb:
startH = c[0]
startW = c[1]
if startH >= H or startW >= W or S[startH][startW] == '#':
continue
q = Queue()
cur = P(startH, startW)
q.put(cur)
time = [[float('inf')] * W for i in range(H)]
time[startH][startW] = 0
while not q.empty():
p = q.get()
for i in range(4):
nh = p.H + dh[i]
nw = p.W + dw[i]
if 0 <= nh and nh < H and 0 <= nw and nw < W and time[nh][nw] == float('inf') and S[nh][nw] != '#':
q.put(P(nh, nw))
time[nh][nw] = time[p.H][p.W] + 1
flatten = list(itertools.chain.from_iterable(time))
for i in range(len(flatten)):
if flatten[i] == float('inf'):
flatten[i] = -1
localmx = max(flatten)
mx = max(localmx, mx)
print(mx)
class P():
def __init__(self, H, W):
self.H = H
self.W = W
if __name__ == '__main__':
solve()
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.unary.remove",
"expression.operation.unary.add"
] | 607,903
| 607,902
|
u647999897
|
python
|
p02803
|
import queue
h, w = map(int, input().split(" "))
s = list()
for l in range(0, h):
line = input(">")
s.append(line)
dx = {(1, 0), (-1, 0), (0, 1), (0, -1)}
def search(start_h, start_w):
if s[start_h][start_w] == "#":
return -1
cost = [[10000000 for i in range(0, w)] for j in range(0, h)]
q = queue.Queue()
q.put((start_h, start_w, 0))
cost[start_h][start_w] = 0
while not q.empty():
current_h, current_w, current_c = q.get()
# print("(%d, %d, %d)" % (current_h, current_w, current_c))
# print("pos_w:%d, pos_h:%d, cost:%d" % (current_w, current_h, current_c))
for dw, dh in dx:
next_h = current_h + dh
next_w = current_w + dw
next_c = current_c + 1
if next_h < 0 or next_h >= h or next_w < 0 or next_w >= w:
continue
if s[next_h][next_w] == "#" or cost[next_h][next_w] <= next_c:
continue
else:
q.put((next_h, next_w, next_c))
cost[next_h][next_w] = next_c
tmp = 0
for a in range(0, w):
for b in range(0, h):
if cost[b][a] > 1000:
continue
else:
tmp = max(tmp, cost[b][a])
return tmp
ans = 0
for i in range(0, w):
for j in range(0, h):
# print("start_h:%d, start_w:%d" % (j, i))
cost_tmp = search(j, i)
ans = max(ans, cost_tmp)
# print("start_h:%d, start_w:%d cost:%d" % (j, i, cost_tmp))
print(ans)
|
import queue
h, w = map(int, input().split(" "))
s = list()
for l in range(0, h):
line = input()
s.append(line)
dx = {(1, 0), (-1, 0), (0, 1), (0, -1)}
def search(start_h, start_w):
if s[start_h][start_w] == "#":
return -1
cost = [[10000000 for i in range(0, w)] for j in range(0, h)]
q = queue.Queue()
q.put((start_h, start_w, 0))
cost[start_h][start_w] = 0
while not q.empty():
current_h, current_w, current_c = q.get()
# print("(%d, %d, %d)" % (current_h, current_w, current_c))
# print("pos_w:%d, pos_h:%d, cost:%d" % (current_w, current_h, current_c))
for dw, dh in dx:
next_h = current_h + dh
next_w = current_w + dw
next_c = current_c + 1
if next_h < 0 or next_h >= h or next_w < 0 or next_w >= w:
continue
if s[next_h][next_w] == "#" or cost[next_h][next_w] <= next_c:
continue
else:
q.put((next_h, next_w, next_c))
cost[next_h][next_w] = next_c
tmp = 0
for a in range(0, w):
for b in range(0, h):
if cost[b][a] > 1000:
continue
else:
tmp = max(tmp, cost[b][a])
return tmp
ans = 0
for i in range(0, w):
for j in range(0, h):
# print("start_h:%d, start_w:%d" % (j, i))
cost_tmp = search(j, i)
ans = max(ans, cost_tmp)
# print("start_h:%d, start_w:%d cost:%d" % (j, i, cost_tmp))
print(ans)
|
[] | 607,951
| 607,952
|
u411965808
|
python
|
p02803
|
from collections import deque
h,w=map(int,input().split())
maze=[list("#"*(w+2))]+[list("#"+input()+"#") for i in range(h)]+[list("#"*(w+2))]
INF=10800 #>50*50
visited=[[-INF]*(w+2) for i in range(h+2)]
ss=[]
for i in range(1,h+1):
for j in range(1,w+1):
if maze[i][j]==".":
ss.append((i,j))
def bfs(maze,visited,sy,sx):#,gy,gx):
queue=deque([[sy,sx]])
visited[sy][sx]=0
while queue:
[y,x]=queue.popleft()
for i,j in ((-1,0),(1,0),(0,1),(0,-1)):
y_new,x_new=y+i,x+j
if maze[y_new][x_new]=="." and visited[y_new][x_new]==-INF:
visited[y_new][x_new]=visited[y][x]+1
queue.append([y_new,x_new])
ans=0
for i,j in ss:
visited=[[-INF]*(w+2) for i in range(h+2)]
bfs(maze,visited,i,j)
for i in range(1,h+1):
for j in range(1,w+1):
ans=max(ans,visited[i][j])
print(ans)
print(ans)
|
from collections import deque
h,w=map(int,input().split())
maze=[list("#"*(w+2))]+[list("#"+input()+"#") for i in range(h)]+[list("#"*(w+2))]
INF=10800 #>50*50
visited=[[-INF]*(w+2) for i in range(h+2)]
ss=[]
for i in range(1,h+1):
for j in range(1,w+1):
if maze[i][j]==".":
ss.append((i,j))
def bfs(maze,visited,sy,sx):#,gy,gx):
queue=deque([[sy,sx]])
visited[sy][sx]=0
while queue:
[y,x]=queue.popleft()
for i,j in ((-1,0),(1,0),(0,1),(0,-1)):
y_new,x_new=y+i,x+j
if maze[y_new][x_new]=="." and visited[y_new][x_new]==-INF:
visited[y_new][x_new]=visited[y][x]+1
queue.append([y_new,x_new])
ans=0
for i,j in ss:
visited=[[-INF]*(w+2) for i in range(h+2)]
bfs(maze,visited,i,j)
for i in range(1,h+1):
for j in range(1,w+1):
ans=max(ans,visited[i][j])
print(ans)
|
[
"call.remove"
] | 607,974
| 607,975
|
u130900604
|
python
|
p02803
|
#幅優先探索
from queue import Queue
ans = 0
h,w = map(int, input().split())
maps = [input() for _ in range(h)]
for i in range(1):
for j in range(1,2):
if maps[i][j] == '.':
visited = [[-1]*w for _ in range(h)]
q = Queue()
q.put([i,j])
visited[i][j] = 0
while not q.empty():
y,x = q.get()
for k,l in [[1,0],[-1,0],[0,1],[0,-1]]:
if 0 <= y+k < h and 0<= x+l < w:
new_y,new_x = y+k,x+l
else: continue
if visited[new_y][new_x]== -1 and maps[new_y][new_x]==".":
visited[new_y][new_x]=visited[y][x]+1
q.put([new_y,new_x])
for ii in range(h):
for jj in range(w):
ans = max(ans,visited[ii][jj])
print(ans)
|
#幅優先探索
from queue import Queue
ans = 0
h,w = map(int, input().split())
maps = [input() for _ in range(h)]
for i in range(h):
for j in range(w):
if maps[i][j] == '.':
visited = [[-1]*w for _ in range(h)]
q = Queue()
q.put([i,j])
visited[i][j] = 0
while not q.empty():
y,x = q.get()
for k,l in [[1,0],[-1,0],[0,1],[0,-1]]:
if 0 <= y+k < h and 0<= x+l < w:
new_y,new_x = y+k,x+l
else: continue
if visited[new_y][new_x]== -1 and maps[new_y][new_x]==".":
visited[new_y][new_x]=visited[y][x]+1
q.put([new_y,new_x])
for ii in range(h):
for jj in range(w):
ans = max(ans,visited[ii][jj])
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.range.bounds.lower.change"
] | 607,978
| 607,979
|
u350836088
|
python
|
p02804
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, -1, -1):
inv[j] = inv[j + 1] * (j + 1) % mod
def comb2(n, r):
if r > n or n < 0 or r < 0:
return 0
return fac[n] * inv[n - r] * inv[r] % mod
COMinit()
ans = 0
for i in range(k+1):
x = comb2(n-1-i, k-1)
ans = (ans - a[i]*x % mod) % mod
ans = (ans + a[-1-i]*x % mod) % mod
print(ans%mod)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, -1, -1):
inv[j] = inv[j + 1] * (j + 1) % mod
def comb2(n, r):
if r > n or n < 0 or r < 0:
return 0
return fac[n] * inv[n - r] * inv[r] % mod
COMinit()
ans = 0
for i in range(n):
x = comb2(n-1-i, k-1)
ans = (ans - a[i]*x % mod) % mod
ans = (ans + a[-1-i]*x % mod) % mod
print(ans%mod)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 608,104
| 608,105
|
u453055089
|
python
|
p02804
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
if n == 1:
print(0)
exit()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, -1, -1):
inv[j] = inv[j + 1] * (j + 1) % mod
def comb2(n, r):
if r > n or n < 0 or r < 0:
return 0
return fac[n] * inv[n - r] * inv[r] % mod
COMinit()
ans = 0
for i in range(k+1):
if k != 1:
x = comb2(n-1-i, k-1)
ans = (ans - a[i]*x % mod) % mod
ans = (ans + a[-1-i]*x % mod) % mod
print(ans%mod)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
if n == 1:
print(0)
exit()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, -1, -1):
inv[j] = inv[j + 1] * (j + 1) % mod
def comb2(n, r):
if r > n or n < 0 or r < 0:
return 0
return fac[n] * inv[n - r] * inv[r] % mod
COMinit()
ans = 0
for i in range(n):
if k != 1:
x = comb2(n-1-i, k-1)
ans = (ans - a[i]*x % mod) % mod
ans = (ans + a[-1-i]*x % mod) % mod
print(ans%mod)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 608,106
| 608,107
|
u453055089
|
python
|
p02804
|
# modular inverse for positive a and b and nCk mod MOD depending on modinv
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
MOD = 10 ** 9 + 7
N,K = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
Combination = []
for i in range(N):
if i < K:
Combination.append(0)
elif i == K:
Combination.append(1)
else:
Combination.append(Combination[-1] * i * modinv(i - K + 1) % MOD)
ans = 0
for i in range(N):
ans += a[i] * Combination[i]
ans -= a[i] * Combination[N - i - 1]
ans %= MOD
print(ans)
|
# modular inverse for positive a and b and nCk mod MOD depending on modinv
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
MOD = 10 ** 9 + 7
N,K = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
Combination = []
for i in range(N):
if i < K - 1:
Combination.append(0)
elif i == K - 1:
Combination.append(1)
else:
Combination.append(Combination[-1] * i * modinv(i - K + 1, MOD) % MOD)
ans = 0
for i in range(N):
ans += a[i] * Combination[i]
ans -= a[i] * Combination[N - i - 1]
ans %= MOD
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.add"
] | 608,114
| 608,115
|
u242757684
|
python
|
p02804
|
MAX = 600000
MOD = 10 ** 9 + 7
fac = [0] * MAX
ifac = [0] * MAX
fac[0] = 1
for i in range(1,MAX):
fac[i] = (fac[i-1] * i) % MOD
ifac[MAX-1] = pow(fac[MAX-1],MOD-2,MOD)
for i in reversed(range(1,MAX)):
ifac[i-1] = (ifac[i] * i) % MOD
def combinations(n, k):
if k < 0 or n < k:
return 0
else:
return (fac[n] * ifac[k] * ifac[n-k]) % MOD
N,K = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
def f(A):
ans = 0
for i in range(K-1,N):
ans += A[i]*combinations(i-1,K-1)
ans %= MOD
return ans
print((f(A) - f(reversed(A))) % MOD )
|
MAX = 600000
MOD = 10 ** 9 + 7
fac = [0] * MAX
ifac = [0] * MAX
fac[0] = 1
for i in range(1,MAX):
fac[i] = (fac[i-1] * i) % MOD
ifac[MAX-1] = pow(fac[MAX-1],MOD-2,MOD)
for i in reversed(range(1,MAX)):
ifac[i-1] = (ifac[i] * i) % MOD
def combinations(n, k):
if k < 0 or n < k:
return 0
else:
return (fac[n] * ifac[k] * ifac[n-k]) % MOD
N,K = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
def f(A):
ans = 0
for i in range(K-1,N):
ans += A[i]*combinations(i,K-1)
ans %= MOD
#print(A[i],combinations(i,K-1))
return ans
print((f(A) - f(list(reversed(A)))) % MOD )
#print(f(A))
|
[
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 608,121
| 608,122
|
u361381049
|
python
|
p02798
|
# coding: utf-8
import sys
from itertools import permutations,combinations
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 全探索
INF = 10 ** 5
answer = INF
N = ir()
if N == 1:
print(0); exit()
A = lr()
B = lr()
for pattern in combinations(range(N), (N+1)//2):
pattern = set(pattern)
red = []
blue = []
for i in range(N):
if i in pattern:
red.append((B[i], i) if i&1 else (A[i], i))
else:
blue.append((A[i], i) if i&1 else (B[i], i))
red.sort()
blue.sort()
result = []
for i in range(N//2):
if red[i][0] > blue[i][0]:
break
if i + 1 < len(red) and red[i+1] < blue[i]:
break
result.append(red[i][1])
result.append(blue[i][1])
else:
if N&1 and blue[-1][0] > red[-1][0]:
continue
if N&1:
result.append(red[-1][1])
temp = 0
used = set()
for i in range(N):
for x in used:
if result[i] < x:
temp += 1
used.add(result[i])
if temp < answer:
answer = temp
print(answer if answer != INF else -1)
# 12
|
# coding: utf-8
import sys
from itertools import permutations,combinations
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 全探索
INF = 10 ** 5
answer = INF
N = ir()
if N == 1:
print(0); exit()
A = lr()
B = lr()
for pattern in combinations(range(N), (N+1)//2):
pattern = set(pattern)
red = []
blue = []
for i in range(N):
if i in pattern:
red.append((B[i], i) if i&1 else (A[i], i))
else:
blue.append((A[i], i) if i&1 else (B[i], i))
red.sort()
blue.sort()
result = []
for i in range(N//2):
if red[i][0] > blue[i][0]:
break
if i + 1 < len(red) and red[i+1][0] < blue[i][0]:
break
result.append(red[i][1])
result.append(blue[i][1])
else:
if N&1 and blue[-1][0] > red[-1][0]:
continue
if N&1:
result.append(red[-1][1])
temp = 0
used = set()
for i in range(N):
for x in used:
if result[i] < x:
temp += 1
used.add(result[i])
if temp < answer:
answer = temp
print(answer if answer != INF else -1)
# 12
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 608,145
| 608,146
|
u600402037
|
python
|
p02798
|
import sys
input = sys.stdin.readline
class BIT:
def __init__(self, size):
self.bit = [0] * (size + 1)
self.size = size
def sum(self, i):
i += 1
s = 0
while i > 0:
s += self.bit[i]
i -= i & -i
return s
def add(self, i, x):
i += 1
while i <= self.size:
self.bit[i] += x
i += i & -i
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = float('inf')
for b in range(1 << N):
even = []
odd = []
for i in range(N):
if b >> i & 1: # red
if i % 2 == 0:
even.append((A[i], i))
else:
odd.append((A[i], i))
else: # blue
if i % 2 == 0:
odd.append((B[i], i))
else:
even.append((B[i], i))
if len(even) != (N + 1) // 2 or len(odd) != N // 2:
continue
even.sort()
odd.sort()
num = []
for i in range(len(odd)):
num += [even[i], odd[i]]
if N % 2 == 1:
num += [even[-1]]
ok = True
for i in range(N-1):
if num[i] > num[i+1]:
ok = False
break
if not ok:
continue
tmp = 0
bit = BIT(N)
for i in range(1, N):
bit.add(i, 1)
for i in range(N):
j = num[i][1]
tmp += bit.sum(j) - i
bit.add(0, 1)
bit.add(j, -1)
ans = min(ans, tmp)
print(ans if ans < float('inf') else -1)
|
import sys
input = sys.stdin.readline
class BIT:
def __init__(self, size):
self.bit = [0] * (size + 1)
self.size = size
def sum(self, i):
i += 1
s = 0
while i > 0:
s += self.bit[i]
i -= i & -i
return s
def add(self, i, x):
i += 1
while i <= self.size:
self.bit[i] += x
i += i & -i
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = float('inf')
for b in range(1 << N):
even = []
odd = []
for i in range(N):
if b >> i & 1: # red
if i % 2 == 0:
even.append((A[i], i))
else:
odd.append((A[i], i))
else: # blue
if i % 2 == 0:
odd.append((B[i], i))
else:
even.append((B[i], i))
if len(even) != (N + 1) // 2 or len(odd) != N // 2:
continue
even.sort()
odd.sort()
num = []
for i in range(len(odd)):
num += [even[i], odd[i]]
if N % 2 == 1:
num += [even[-1]]
ok = True
for i in range(N-1):
if num[i][0] > num[i+1][0]:
ok = False
break
if not ok:
continue
tmp = 0
bit = BIT(N)
for i in range(1, N):
bit.add(i, 1)
for i in range(N):
j = num[i][1]
tmp += bit.sum(j) - i
bit.add(0, 1)
bit.add(j, -1)
ans = min(ans, tmp)
print(ans if ans < float('inf') else -1)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 608,155
| 608,156
|
u144913062
|
python
|
p02804
|
n,k=map(int,input().split())
A=list(map(int,input().split()))
mod=10**9+7
if k==1:
print(sum(A)%mod)
else:
X=[]
A.sort()
x=sum(A[k-1:])
y=sum(A[:n-k+1])
for i in range(k,n+1):
X.append(x-y)
x-=A[i-1]
y-=A[n-i]
ans=0
cmb=1
for i in range(k-2,n-1):
ans+=cmb*X[i-(k-2)]
ans%=mod
cmb*=(i+1)*pow(i-(k-3),mod-2,mod)
cmb%=mod
print(ans)
|
n,k=map(int,input().split())
A=list(map(int,input().split()))
mod=10**9+7
if k==1:
print(0)
else:
X=[]
A.sort()
x=sum(A[k-1:])
y=sum(A[:n-k+1])
for i in range(k,n+1):
X.append(x-y)
x-=A[i-1]
y-=A[n-i]
ans=0
cmb=1
for i in range(k-2,n-1):
ans+=cmb*X[i-(k-2)]
ans%=mod
cmb*=(i+1)*pow(i-(k-3),mod-2,mod)
cmb%=mod
print(ans)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 608,211
| 608,212
|
u210827208
|
python
|
p02804
|
MOD=10**9+7
N,K=map(int,input().split())
alist=list(map(int,input().split()))
alist.sort()
#print(alist)
inv_table = [0]+[1]
for i in range(2,K+3):
inv_table.append(-(MOD//i)*inv_table[MOD%i]%MOD)
min_s,max_s=0,0
old_comb,new_comb=0,1
for i in range(K,N+1):
#print(K,i,new_comb-old_comb)
min_s+=(new_comb-old_comb)*alist[-1-(i-1)]
min_s%=MOD
max_s+=(new_comb-old_comb)*alist[i-1]
max_s%=MOD
old_comb=new_comb
new_comb=old_comb*(i+1)*inv_table[i+1-K]%MOD
#print(min_s,max_s)
print((max_s-min_s)%MOD)
|
MOD=10**9+7
N,K=map(int,input().split())
alist=list(map(int,input().split()))
alist.sort()
#print(alist)
inv_table = [0]+[1]
for i in range(2,N+1):
inv_table.append(-(MOD//i)*inv_table[MOD%i]%MOD)
min_s,max_s=0,0
old_comb,new_comb=0,1
for i in range(K,N+1):
#print(K,i,new_comb-old_comb)
min_s+=(new_comb-old_comb)*alist[-1-(i-1)]
min_s%=MOD
max_s+=(new_comb-old_comb)*alist[i-1]
max_s%=MOD
old_comb=new_comb
new_comb=old_comb*(i+1)*inv_table[i+1-K]%MOD
#print(min_s,max_s)
print((max_s-min_s)%MOD)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change"
] | 608,236
| 608,237
|
u203843959
|
python
|
p02804
|
import sys
readline = sys.stdin.readline
MOD = pow(10,9)+7
def combinations(n,k):
global fac, finv
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD
def main():
global fac, finv
N, K = map(int, readline().split())
A = list(map(int, readline().split()))
A.sort()
MAX_NUM = N + 1
fac = [0 for _ in range(MAX_NUM)]
finv = [0 for _ in range(MAX_NUM)]
inv = [0 for _ in range(MAX_NUM)]
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
summax = 0
summin = 0
for i in range(K+1):
j = N-i
tmp = combinations(j-1, K-1)
summax += A[j-1] * tmp
summin += A[i] * tmp
#print('max:{}, min:{}'.format(A[j-1] * tmp, A[i] * tmp))
ans = (summax - summin) % MOD
print(ans)
if __name__ == "__main__":
main()
|
import sys
readline = sys.stdin.readline
MOD = pow(10,9)+7
def combinations(n,k):
global fac, finv
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD
def main():
global fac, finv
N, K = map(int, readline().split())
A = list(map(int, readline().split()))
A.sort()
MAX_NUM = N + 1
fac = [0 for _ in range(MAX_NUM)]
finv = [0 for _ in range(MAX_NUM)]
inv = [0 for _ in range(MAX_NUM)]
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
summax = 0
summin = 0
for i in range(N-K+1):
j = N-i
tmp = combinations(j-1, K-1)
summax += A[j-1] * tmp
summin += A[i] * tmp
#print('max:{}, min:{}'.format(A[j-1] * tmp, A[i] * tmp))
ans = (summax - summin) % MOD
print(ans)
if __name__ == "__main__":
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 608,238
| 608,239
|
u125545880
|
python
|
p02804
|
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
A = lr()
A.sort()
MOD = 10 ** 9 + 7
if K == 1:
print(0)
exit()
def cmb(n, k):
# nCkを計算する
k = min(k, n-k)
return fac[n] * ifac[k] % MOD * ifac[n-k] % MOD
def cumprod(arr, MOD):
L = len(arr); Lsq = int(L**.5+1)
arr = np.resize(arr, Lsq**2).reshape(Lsq, Lsq)
for n in range(1, Lsq):
arr[:, n] *= arr[:, n-1]; arr[:, n] %= MOD
for n in range(1, Lsq):
arr[n] *= arr[n-1, -1]; arr[n] %= MOD
return arr.ravel()[:L]
def make_fact(U, MOD):
x = np.arange(U, dtype=np.int64); x[0] = 1
fact = cumprod(x, MOD)
x = np.arange(U, 0, -1, dtype=np.int64); x[0] = pow(int(fact[-1]), MOD-2, MOD)
fact_inv = cumprod(x, MOD)[::-1]
return fact, fact_inv
fac, ifac = make_fact(10**6, MOD)
answer = 0
for i in range(K-1, N):
# 最大値として何回登場するか、A[i] * i C (K-1)
answer += A[i] * cmb(i, K-1)
answer %= MOD
for i in range(N-K+1):
# A[i] * (N-(i+1)) C (k-1)
answer += A[i] * cmb(N-(i+1), K-1)
answer %= MOD
print(answer % MOD)
# 51
|
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
A = lr()
A.sort()
MOD = 10 ** 9 + 7
if K == 1:
print(0)
exit()
def cmb(n, k):
# nCkを計算する
k = min(k, n-k)
return fac[n] * ifac[k] % MOD * ifac[n-k] % MOD
def cumprod(arr, MOD):
L = len(arr); Lsq = int(L**.5+1)
arr = np.resize(arr, Lsq**2).reshape(Lsq, Lsq)
for n in range(1, Lsq):
arr[:, n] *= arr[:, n-1]; arr[:, n] %= MOD
for n in range(1, Lsq):
arr[n] *= arr[n-1, -1]; arr[n] %= MOD
return arr.ravel()[:L]
def make_fact(U, MOD):
x = np.arange(U, dtype=np.int64); x[0] = 1
fact = cumprod(x, MOD)
x = np.arange(U, 0, -1, dtype=np.int64); x[0] = pow(int(fact[-1]), MOD-2, MOD)
fact_inv = cumprod(x, MOD)[::-1]
return fact, fact_inv
fac, ifac = make_fact(10**6, MOD)
answer = 0
for i in range(K-1, N):
# 最大値として何回登場するか、A[i] * i C (K-1)
answer += A[i] * cmb(i, K-1)
answer %= MOD
for i in range(N-K+1):
# A[i] * (N-(i+1)) C (k-1)
answer -= A[i] * cmb(N-(i+1), K-1)
answer %= MOD
print(answer % MOD)
# 51
|
[
"expression.operator.change"
] | 608,275
| 608,276
|
u600402037
|
python
|
p02804
|
"""from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1):
fac.append(fac[i-1]*i%mod)
ifac=[pow(i,mod-2,mod) for i in fac]
if K==1:
print(0)
exit()
count=0
ncount=0
for i in range(N-K+1):
n=N-i-K
m=i+1
ncount+=fac[m]*ifac[K-2]*ifac[m-(K-2)]%mod
ncount%=mod
count-=A[n]*ncount
count%=mod
ncount=0
for i in range(K-1,N):
n=i-1
#print(n,K-2,n-(K-2))
ncount+=fac[n]*ifac[K-2]*ifac[n-(K-2)]%mod
ncount%=mod
count+=A[i]*ncount
count%=mod
print(count)
|
"""from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1):
fac.append(fac[i-1]*i%mod)
ifac=[pow(i,mod-2,mod) for i in fac]
if K==1:
print(0)
exit()
count=0
ncount=0
for i in range(N-K+1):
n=N-i-K
m=i+K-2
ncount+=fac[m]*ifac[K-2]*ifac[m-(K-2)]%mod
ncount%=mod
count-=A[n]*ncount
count%=mod
ncount=0
for i in range(K-1,N):
n=i-1
ncount+=fac[n]*ifac[K-2]*ifac[n-(K-2)]%mod
ncount%=mod
count+=A[i]*ncount
count%=mod
print(count)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 608,308
| 608,309
|
u779455925
|
python
|
p02804
|
"""from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1):
fac.append(fac[i-1]*i%mod)
ifac=[pow(i,mod-2,mod) for i in fac]
if K==1:
print(0)
count=0
ncount=0
for i in range(N-K+1):
n=N-i-K
m=i+1
ncount+=fac[m]*ifac[K-2]*ifac[m-(K-2)]%mod
ncount%=mod
count-=A[n]*ncount
count%=mod
ncount=0
for i in range(K-1,N):
n=i-1
#print(n,K-2,n-(K-2))
ncount+=fac[n]*ifac[K-2]*ifac[n-(K-2)]%mod
ncount%=mod
count+=A[i]*ncount
count%=mod
print(count)
|
"""from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1):
fac.append(fac[i-1]*i%mod)
ifac=[pow(i,mod-2,mod) for i in fac]
if K==1:
print(0)
exit()
count=0
ncount=0
for i in range(N-K+1):
n=N-i-K
m=i+K-2
ncount+=fac[m]*ifac[K-2]*ifac[m-(K-2)]%mod
ncount%=mod
count-=A[n]*ncount
count%=mod
ncount=0
for i in range(K-1,N):
n=i-1
ncount+=fac[n]*ifac[K-2]*ifac[n-(K-2)]%mod
ncount%=mod
count+=A[i]*ncount
count%=mod
print(count)
|
[
"call.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 608,310
| 608,309
|
u779455925
|
python
|
p02804
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
MOD = 10**9 + 7
f, inv = prepare(10**5+1, MOD)
n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
p = 0
m = 0
for i in range(n):
if n - i >= k:
cn = n - i - 1
ck = k - 1
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
p += (a[i] * combi) % MOD
else:
p += (a[i] * combi) % -MOD
if p >= 0:
p %= MOD
else:
p %= -MOD
if i >= k - 1:
cn = i
ck = k - 1
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
m += (a[i] * combi) % MOD
else:
m += (a[i] * combi) % -MOD
if m >= 0:
m %= MOD
else:
m %= -MOD
print(p - m)
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
MOD = 10**9 + 7
f, inv = prepare(10**5+1, MOD)
n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
p = 0
m = 0
for i in range(n):
if n - i >= k:
cn = n - i - 1
ck = k - 1
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
p += (a[i] * combi) % MOD
else:
p += (a[i] * combi) % -MOD
if p >= 0:
p %= MOD
else:
p %= -MOD
if i >= k - 1:
cn = i
ck = k - 1
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
m += (a[i] * combi) % MOD
else:
m += (a[i] * combi) % -MOD
if m >= 0:
m %= MOD
else:
m %= -MOD
print((p - m) % MOD)
|
[
"call.arguments.change",
"call.arguments.add"
] | 608,344
| 608,345
|
u612975321
|
python
|
p02804
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
MOD = 10**9 + 7
f, inv = prepare(10**5+100, MOD)
n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
p = 0
m = 0
for i in range(n):
if n - i >= k:
cn = n - i - 1
ck = k - 1
if cn >= ck:
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
p += (a[i] * combi) % MOD
else:
p += (a[i] * combi) % -MOD
if p >= 0:
p %= MOD
else:
p %= -MOD
if i >= k - 1:
cn = i
ck = k - 1
if cn >= ck:
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
m += (a[i] * combi) % MOD
else:
m += (a[i] * combi) % -MOD
if m >= 0:
m %= MOD
else:
m %= -MOD
print(p - m)
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
MOD = 10**9 + 7
f, inv = prepare(10**5+100, MOD)
n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
p = 0
m = 0
for i in range(n):
if n - i >= k:
cn = n - i - 1
ck = k - 1
if cn >= ck:
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
p += (a[i] * combi) % MOD
else:
p += (a[i] * combi) % -MOD
if p >= 0:
p %= MOD
else:
p %= -MOD
if i >= k - 1:
cn = i
ck = k - 1
if cn >= ck:
combi = f[cn] * inv[ck] % MOD * inv[cn - ck] % MOD
if a[i] >= 0:
m += (a[i] * combi) % MOD
else:
m += (a[i] * combi) % -MOD
if m >= 0:
m %= MOD
else:
m %= -MOD
print((p - m)%MOD)
|
[
"call.arguments.change",
"call.arguments.add"
] | 608,346
| 608,347
|
u612975321
|
python
|
p02804
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1] % Mod)
def COM(n, k):
if n < 0 or k < 0 or n < k:
return 0
return fac[n] * (finv[k] * finv[n-k] % Mod) % Mod
COMinit()
comb = {}
for i in range(K-1, N):
comb[(i, K-1)] = COM(i, K-1)
ans = 0
for i in range(K-1, N):
ans += A[i] * comb[(i, K-1)]
ans %= p
for i in range(K-1, N):
ans -= B[i] * comb[(i, K-1)]
ans %= p
print(ans)
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1] % Mod)
def COM(n, k):
if n < 0 or k < 0 or n < k:
return 0
return fac[n] * (finv[k] * finv[n-k] % Mod) % Mod
COMinit()
comb = {}
for i in range(K-1, N):
comb[(i, K-1)] = COM(i, K-1)
ans = 0
for i in range(K-1, N):
ans += A[i] * comb[(i, K-1)]
ans %= Mod
for i in range(K-1, N):
ans -= B[i] * comb[(i, K-1)]
ans %= Mod
print(ans)
|
[
"identifier.change"
] | 608,381
| 608,382
|
u844646164
|
python
|
p02804
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1] % Mod)
def COM(n, k):
if n < 0 or k < 0 or n < k:
return 0
return fac[n] * (finv[k] * finv[n-k] % Mod) % Mod
COMinit()
comb = {}
for i in range(K-1, N):
comb[(i, K-1)] = COM(i, K-1, p)
ans = 0
for i in range(K-1, N):
ans += A[i] * comb[(i, K-1)]
ans %= p
for i in range(K-1, N):
ans -= B[i] * comb[(i, K-1)]
ans %= p
print(ans)
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1] % Mod)
def COM(n, k):
if n < 0 or k < 0 or n < k:
return 0
return fac[n] * (finv[k] * finv[n-k] % Mod) % Mod
COMinit()
comb = {}
for i in range(K-1, N):
comb[(i, K-1)] = COM(i, K-1)
ans = 0
for i in range(K-1, N):
ans += A[i] * comb[(i, K-1)]
ans %= Mod
for i in range(K-1, N):
ans -= B[i] * comb[(i, K-1)]
ans %= Mod
print(ans)
|
[
"call.arguments.change",
"identifier.change"
] | 608,383
| 608,382
|
u844646164
|
python
|
p02804
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % p
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], p - 2, p) * pow(fac[k], p - 2, p) % p
A.sort(reverse=True)
result = 0
for i in range(N - K + 1):
result += A[i] * mcomb(N - (i + 1), K - 1)
result %= p
A.sort()
for i in range(N - K + 1):
result -= A[i] * mcomb(N - (i + 1), K - 1)
result %= p
# result += p
# result %= p
print(result)
|
p = 1000000007
N, K = map(int, input().split())
A = list(map(int, input().split()))
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % p
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], p - 2, p) * pow(fac[k], p - 2, p) % p
A.sort(reverse=True)
result = 0
for i in range(N - K + 1):
result += A[i] * mcomb(N - (i + 1), K - 1)
result %= p
A.reverse()
for i in range(N - K + 1):
result -= A[i] * mcomb(N - (i + 1), K - 1)
result %= p
# result += p
# result %= p
print(result)
|
[
"identifier.change"
] | 608,388
| 608,389
|
u347640436
|
python
|
p02804
|
#
import sys
input=sys.stdin.readline
MOD=10**9+7
fact=[1]*(10**5+1)
for i in range(1,10**5+1):
fact[i]=(fact[i-1]*i)%MOD
def comb(n,r):
nhri=pow(fact[n-r],MOD-2,MOD)
ri=pow(fact[r],MOD-2,MOD)
return fact[n]//(nhri*ri)
def main():
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
maxsum=0
for i in range(K-1,N):
maxsum+=comb(i,K-1)*A[i]
maxsum%=MOD
A.sort(reverse=True)
minsum=0
for i in range(K-1,N):
minsum+=comb(i,K-1)*A[i]
minsum%=MOD
print((maxsum-minsum)%MOD)
if __name__=="__main__":
main()
|
#
import sys
input=sys.stdin.readline
MOD=10**9+7
fact=[1]*(10**5+1)
for i in range(1,10**5+1):
fact[i]=(fact[i-1]*i)%MOD
def comb(n,r):
nhri=pow(fact[n-r],MOD-2,MOD)
ri=pow(fact[r],MOD-2,MOD)
return fact[n]*nhri*ri
def main():
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
maxsum=0
for i in range(K-1,N):
maxsum+=comb(i,K-1)*A[i]
maxsum%=MOD
A.sort(reverse=True)
minsum=0
for i in range(K-1,N):
minsum+=comb(i,K-1)*A[i]
minsum%=MOD
print((maxsum-minsum)%MOD)
if __name__=="__main__":
main()
|
[
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 608,396
| 608,397
|
u847923740
|
python
|
p02804
|
import sys
sys.setrecursionlimit(2147483647)
n,k=map(int,input().split())
#n個の中からk個選んだ時の最大と最小
a=list(map(int,input().split()))
"""
seta=set([])
dic={}
for v in a:
if v in seta:
dic[v]+=1
else:
dic[v]=1
seta.add(v)
a=list(seta)
"""
a.sort()
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10**9+7 #割る数
N = 10 ** 6 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
result=0
for i,v in enumerate(a):
if i>=k-1:
result+=v*cmb(i, k-1, p)
if k-1<=n-i-1:
result-=v*cmb(n-i-1, k-1, p)
print(result)
|
import sys
sys.setrecursionlimit(2147483647)
n,k=map(int,input().split())
#n個の中からk個選んだ時の最大と最小
a=list(map(int,input().split()))
"""
seta=set([])
dic={}
for v in a:
if v in seta:
dic[v]+=1
else:
dic[v]=1
seta.add(v)
a=list(seta)
"""
a.sort()
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10**9+7 #割る数
N = 10 ** 6 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
result=0
for i,v in enumerate(a):
if i>=k-1:
result+=v*cmb(i, k-1, p)
if k-1<=n-i-1:
result-=v*cmb(n-i-1, k-1, p)
print(result%p)
|
[
"expression.operation.binary.add"
] | 608,400
| 608,401
|
u588794534
|
python
|
p02804
|
def COMinit(N, mod):
fac = [0] * N
finv = [0] * N
inv = [0] * N
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, N):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i] * (mod // i) % mod
finv[i] = finv[i-1] * inv[i] % mod
return fac, finv, inv
def COM(n, r, mod, fac, finv, inv):
if n < r:
return 0
if n < 0 or r < 0:
return 0
return fac[n] * (finv[r] * finv[n-r] % mod) % mod
def solve():
N,K = map(int,input().split())
A = list(map(int,input().split()))
MOD = 10**9 + 7
A.sort()
fac, finv, inv = COMinit(N+1,MOD)
max_sm = 0
min_sm = 0
for i in range(N):
smallerNums = i
largerNums = N - i - 1
max_sm += A[i] * COM(smallerNums, K-1, MOD, fac, finv, inv) % MOD
min_sm += A[i] * COM(largerNums, K-1, MOD, fac, finv, inv) % MOD
print(max_sm % MOD - min_sm % MOD)
if __name__ == '__main__':
solve()
|
def COMinit(N, mod):
fac = [0] * N
finv = [0] * N
inv = [0] * N
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, N):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i] * (mod // i) % mod
finv[i] = finv[i-1] * inv[i] % mod
return fac, finv, inv
def COM(n, r, mod, fac, finv, inv):
if n < r:
return 0
if n < 0 or r < 0:
return 0
return fac[n] * (finv[r] * finv[n-r] % mod) % mod
def solve():
N,K = map(int,input().split())
A = list(map(int,input().split()))
MOD = 10**9 + 7
A.sort()
fac, finv, inv = COMinit(N+1,MOD)
max_sm = 0
min_sm = 0
for i in range(N):
smallerNums = i
largerNums = N - i - 1
max_sm += A[i] * COM(smallerNums, K-1, MOD, fac, finv, inv) % MOD
min_sm += A[i] * COM(largerNums, K-1, MOD, fac, finv, inv) % MOD
print((max_sm % MOD - min_sm % MOD) % MOD)
if __name__ == '__main__':
solve()
|
[
"call.arguments.change",
"call.arguments.add"
] | 608,404
| 608,405
|
u647999897
|
python
|
p02804
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
def main():
n,k=map(int, input().split())
A=[int(i) for i in input().split()]
MOD = 10**9 + 7
fac, invs = prepare(n,MOD)
ans = 0
A.sort()
for i in range(n):
tmp=0
tmp2=0
if i<n-k+1:
tmp = (fac[n-(i+1)]%MOD * invs[k-i]%MOD * invs[n-(i+1) - (k-i)]%MOD)%MOD
if i>=k-1:
tmp2 = (fac[i]%MOD * invs[k-1]%MOD * invs[i-(k-1)]%MOD)%MOD
#print("最大になる回数", tmp2, " 最小になる回数", tmp, "A[i]", A[i])
ans = ans%MOD + (tmp2*A[i]%MOD - tmp*A[i]%MOD)%MOD
ans%=MOD
if k==1:
ans = 0
print(ans)
if __name__ == '__main__':
main()
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
def main():
n,k=map(int, input().split())
A=[int(i) for i in input().split()]
MOD = 10**9 + 7
fac, invs = prepare(n,MOD)
ans = 0
A.sort()
for i in range(n):
tmp=0
tmp2=0
if i<n-k+1:
tmp = (fac[n-(i+1)]%MOD * invs[k-1]%MOD * invs[n-(i+1) - (k-1)]%MOD)%MOD
if i>=k-1:
tmp2 = (fac[i]%MOD * invs[k-1]%MOD * invs[i-(k-1)]%MOD)%MOD
#print("最大になる回数", tmp2, " 最小になる回数", tmp, "A[i]", A[i])
ans = ans%MOD + (tmp2*A[i]%MOD - tmp*A[i]%MOD)%MOD
ans%=MOD
if k==1:
ans = 0
print(ans)
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 608,420
| 608,421
|
u685983477
|
python
|
p02804
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
def main():
n,k=map(int, input().split())
A=[int(i) for i in input().split()]
MOD = 10**9 + 7
fac, invs = prepare(n,MOD)
ans = 0
A.sort()
for i in range(n):
tmp=0
tmp2=0
if i<n-k+1:
tmp = (fac[n-(i+1)]%MOD * invs[k-i]%MOD * invs[n-(i+1) - (k-i)]%MOD)%MOD
if i>=k-1:
tmp2 = (fac[i]%MOD * invs[k-1]%MOD * invs[i-(k-1)]%MOD)%MOD
#print("最大になる回数", tmp2, " 最小になる回数", tmp, "A[i]", A[i])
ans = ans + (tmp2*A[i]%MOD - tmp*A[i]%MOD)%MOD
ans%=MOD
#a[i]が最小になる回数と最大になる回数をそれぞれl,rとしてみる。
#r*a[i] - l*a[i]
if k==1:
ans = 0
print(ans)
if __name__ == '__main__':
main()
|
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
def main():
n,k=map(int, input().split())
A=[int(i) for i in input().split()]
MOD = 10**9 + 7
fac, invs = prepare(n,MOD)
ans = 0
A.sort()
for i in range(n):
tmp=0
tmp2=0
if i<n-k+1:
tmp = (fac[n-(i+1)]%MOD * invs[k-1]%MOD * invs[n-(i+1) - (k-1)]%MOD)%MOD
if i>=k-1:
tmp2 = (fac[i]%MOD * invs[k-1]%MOD * invs[i-(k-1)]%MOD)%MOD
#print("最大になる回数", tmp2, " 最小になる回数", tmp, "A[i]", A[i])
ans = ans%MOD + (tmp2*A[i]%MOD - tmp*A[i]%MOD)%MOD
ans%=MOD
if k==1:
ans = 0
print(ans)
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 608,422
| 608,421
|
u685983477
|
python
|
p02804
|
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A.sort()
mod = 10 ** 9 + 7
def make_tables(n, mod = 10 ** 9 + 7):
fac = [1, 1] # 階乗テーブル
finv = [1, 1] #逆元の階乗テーブル
inv = [0, 1] #逆元テーブル
for i in range(2, n + 1):
fac.append((fac[-1] * i) % mod)
inv.append((mod -inv[mod % i] * (mod // i)) % mod)
finv.append((finv[-1] * inv[-1]) % mod)
return fac, finv
def nCk(n, k, mod = 10 ** 9 + 7):
k = min(k, n-k)
return fac[n] * finv[k] * finv[n-k] % mod
fac, finv = make_tables(N)
MAX = 0
MIN = 0
for i in range(N - K + 1):
MIN -= nCk(N - i - 1, K - 1) * A[i]
MIN %= mod
A = sorted(A, reverse=True)
for j in range(N - K + 1):
MAX += nCk(N - j - 1, K - 1) * A[j]
MAX %= mod
print(MAX + MIN)
|
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A.sort()
mod = 10 ** 9 + 7
def make_tables(n, mod = 10 ** 9 + 7):
fac = [1, 1] # 階乗テーブル
finv = [1, 1] #逆元の階乗テーブル
inv = [0, 1] #逆元テーブル
for i in range(2, n + 1):
fac.append((fac[-1] * i) % mod)
inv.append((mod -inv[mod % i] * (mod // i)) % mod)
finv.append((finv[-1] * inv[-1]) % mod)
return fac, finv
def nCk(n, k, mod = 10 ** 9 + 7):
k = min(k, n-k)
return fac[n] * finv[k] * finv[n-k] % mod
fac, finv = make_tables(N)
MAX = 0
MIN = 0
for i in range(N - K + 1):
MIN -= nCk(N - i - 1, K - 1) * A[i]
MIN %= mod
A = sorted(A, reverse=True)
for j in range(N - K + 1):
MAX += nCk(N - j - 1, K - 1) * A[j]
MAX %= mod
print((MAX + MIN) % mod)
|
[
"call.arguments.change",
"call.arguments.add"
] | 608,458
| 608,459
|
u609061751
|
python
|
p02804
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
m=0
M=0
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 6 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
for i in range(n-k+1):
m+=a[i]*cmb(n-i-1,k-1,p)
M+=a[n-1-i]*cmb(n-i-1,k-1,p)
print(M-m)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
m=0
M=0
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 6 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
for i in range(n-k+1):
m+=a[i]*cmb(n-i-1,k-1,p)
M+=a[n-1-i]*cmb(n-i-1,k-1,p)
print((M-m)%p)
|
[
"call.arguments.change",
"call.arguments.add"
] | 608,460
| 608,461
|
u527261492
|
python
|
p02804
|
n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
nums.sort()
mod = 10 ** 9 + 7
# x ** a をmodで割った余りを、O(log(a))時間で求める。
def power(x, a):
if a == 0:
return 1
elif a == 1:
return x
elif a % 2 == 0:
return power(x, a//2) **2 % mod
else:
return power(x, a//2) **2 * x % mod
# xの逆元を求める。フェルマーの小定理より、 x の逆元は x ^ (mod - 2) に等しい。計算時間はO(log(mod))程度。
# https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
def modinv(x):
return power(x, mod-2)
# 二項係数の左側の数字の最大値を max_len とする。nとかだと他の変数と被りそうなので。
# factori_table = [1, 1, 2, 6, 24, 120, ...] 要は factori_table[n] = n!
# 計算時間はO(max_len * log(mod))
max_len = 30 #適宜変更する
factori_table = [1] * (max_len + 1)
factori_inv_table = [1] * (max_len + 1)
for i in range(1, max_len + 1):
factori_table[i] = factori_table[i-1] * (i) % mod
factori_inv_table[i] = modinv(factori_table[i])
def binomial_coefficients(n, k):
# n! / (k! * (n-k)! )
return (factori_table[n] * factori_inv_table[k] * factori_inv_table[n-k]) % mod
print(nums)
ans = 0
for i in reversed(range(k-1, n)):
ans += (nums[i] * binomial_coefficients(i, k-1)) % mod
# print(nums[i] , binomial_coefficients(i, k-1))
for i in range(n-k+1):
ans -= (nums[i] * binomial_coefficients(n-i-1, k-1)) % mod
# print(nums[i] , binomial_coefficients(n-i-1, k-1))
print(ans % mod)
|
n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
nums.sort()
mod = 10 ** 9 + 7
# x ** a をmodで割った余りを、O(log(a))時間で求める。
def power(x, a):
if a == 0:
return 1
elif a == 1:
return x
elif a % 2 == 0:
return power(x, a//2) **2 % mod
else:
return power(x, a//2) **2 * x % mod
# xの逆元を求める。フェルマーの小定理より、 x の逆元は x ^ (mod - 2) に等しい。計算時間はO(log(mod))程度。
# https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
def modinv(x):
return power(x, mod-2)
# 二項係数の左側の数字の最大値を max_len とする。nとかだと他の変数と被りそうなので。
# factori_table = [1, 1, 2, 6, 24, 120, ...] 要は factori_table[n] = n!
# 計算時間はO(max_len * log(mod))
max_len = n #適宜変更する
factori_table = [1] * (max_len + 1)
factori_inv_table = [1] * (max_len + 1)
for i in range(1, max_len + 1):
factori_table[i] = factori_table[i-1] * (i) % mod
factori_inv_table[i] = modinv(factori_table[i])
def binomial_coefficients(n, k):
# n! / (k! * (n-k)! )
return (factori_table[n] * factori_inv_table[k] * factori_inv_table[n-k]) % mod
# print(nums)
ans = 0
for i in reversed(range(k-1, n)):
ans += (nums[i] * binomial_coefficients(i, k-1)) % mod
# print(nums[i] , binomial_coefficients(i, k-1))
for i in range(n-k+1):
ans -= (nums[i] * binomial_coefficients(n-i-1, k-1)) % mod
# print(nums[i] , binomial_coefficients(n-i-1, k-1))
print(ans % mod)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.remove"
] | 608,487
| 608,486
|
u162612857
|
python
|
p02804
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
print(sum([(L[i]-L[N-i-1]+MOD)*F.comb(i, K-1)
for i in reversed(range(K-1, N))]))
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
print(sum([(L[i]-L[N-i-1]+MOD)*F.comb(i, K-1) % MOD
for i in reversed(range(K-1, N))]) % MOD)
|
[
"expression.operation.binary.add"
] | 608,508
| 608,509
|
u375616706
|
python
|
p02804
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
print(sum([(L[i]+L[N-i-1]+MOD)*F.comb(i, K-1)
for i in reversed(range(K-1, N))]))
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
print(sum([(L[i]-L[N-i-1]+MOD)*F.comb(i, K-1) % MOD
for i in reversed(range(K-1, N))]) % MOD)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 608,510
| 608,509
|
u375616706
|
python
|
p02804
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
sub = 0
add = 0
for i in reversed(range(K-1, N)):
add += L[i]*F.comb(i, K-1)
sub += L[N-i-1]*F.comb(N+K-i-1, K-1)
print((-sub+add+MOD) % MOD)
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
sub = 0
add = 0
for i in reversed(range(K-1, N)):
add += L[i]*F.comb(i, K-1)
sub += L[N-i-1]*F.comb(i, K-1)
print((-sub+add+MOD) % MOD)
|
[
"expression.operation.binary.remove"
] | 608,511
| 608,512
|
u375616706
|
python
|
p02804
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
sub = 0
add = 0
for i in range(N-K+1):
sub -= L[i]*F.comb(N-i-1, K-1)
for i in reversed(range(N-K-1, N)):
add += L[i]*F.comb(i, K-1)
print((sub+add) % MOD)
|
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i in range(1, n+1):
self.f[i] = self.f[i-1]*i % mod
self.inv = [pow(self.f[-1], mod-2, mod)]
for i in range(1, n+1)[::-1]:
self.inv.append(self.inv[-1]*i % mod)
self.inv.reverse()
def fact(self, n):
'''
n!の値を返す
'''
return self.f[n]
def comb(self, n, r):
'''
nCrの値を返す
'''
ret = self.f[n] * self.inv[n-r]*self.inv[r]
ret %= self.mod
return ret
def perm(self, n, r):
"""
nPrの値を返す
"""
ret = self.f[n] * self.inv[n-r]
ret %= self.mod
return ret
N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L)
MOD = 10**9+7
F = FactMod(N+1, MOD)
sub = 0
add = 0
for i in range(N-K+1):
sub += L[i]*F.comb(N-i-1, K-1)
for i in reversed(range(K-1, N)):
add += L[i]*F.comb(i, K-1)
print((-sub+add+MOD) % MOD)
|
[
"expression.operator.change",
"expression.operation.binary.remove",
"expression.operation.unary.add",
"call.arguments.change"
] | 608,513
| 608,514
|
u375616706
|
python
|
p02804
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 0
MOD = 10**9 + 7
if k == 1:
print(0)
exit()
mod = 10 ** 9 + 7
fact = [1]
fact_inv = [1]
for i in range(10 ** 5):
new_fact = fact[-1] * (i + 1) % mod
fact.append(new_fact)
fact_inv.append(pow(new_fact, mod - 2, mod))
def cmb(n, k, mod=MOD):
return fact[n] * fact_inv[k] % mod * fact_inv[n - k] % mod
for max_index in range(k-1, n):
ans += a[max_index] * cmb(max_index, k-1)
ans %= MOD
for min_index in range(0, n-k+1):
ans -= a[min_index] * cmb(n-(min_index+1), k-1)
print(ans)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 0
MOD = 10**9 + 7
if k == 1:
print(0)
exit()
mod = 10 ** 9 + 7
fact = [1]
fact_inv = [1]
for i in range(10 ** 5):
new_fact = fact[-1] * (i + 1) % mod
fact.append(new_fact)
fact_inv.append(pow(new_fact, mod - 2, mod))
def cmb(n, k, mod=MOD):
return fact[n] * fact_inv[k] % mod * fact_inv[n - k] % mod
for max_index in range(k-1, n):
ans += a[max_index] * cmb(max_index, k-1)
ans %= MOD
for min_index in range(0, n-k+1):
ans -= a[min_index] * cmb(n-(min_index+1), k-1)
ans %= MOD
print(ans)
|
[] | 608,538
| 608,539
|
u768896740
|
python
|
p02804
|
mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
return fact[n]*fact_inv[k]%mod*fact_inv[n-k]%mod
N,K = map(int,input().split())
arr = list(map(int,input().split()))
arr = sorted(arr)
_max = 0
_min = 0
for i in range(K-1,N):
_max += arr[i]*mod_comb_k(i,K-1,mod)
_min += arr[i-K+1]*mod_comb_k(N-i+K-2,K-1,mod)
print(_max-_min)
|
mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
return fact[n]*fact_inv[k]%mod*fact_inv[n-k]%mod
N,K = map(int,input().split())
arr = list(map(int,input().split()))
arr = sorted(arr)
_max = 0
_min = 0
for i in range(K-1,N):
_max += arr[i]*mod_comb_k(i,K-1,mod)
_min += arr[i-K+1]*mod_comb_k(N-i+K-2,K-1,mod)
print((_max-_min)%mod)
|
[
"call.arguments.change",
"call.arguments.add"
] | 608,542
| 608,543
|
u268181283
|
python
|
p02804
|
import math
n,k = list(map(int, input().split(" ")))
nums = list(map(int, input().split(" ")))
nums.sort()
mod = 10**9 + 7
f = [1]
for i in range(1,10**5+1):
f.append(f[-1] * i)
def nCr(n,r):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
minSum = 0
maxSum = 0
for i in range(n-k+1):
minSum += nums[i] * nCr(n-1-i, k-1)
maxSum += nums[-i-1] * nCr(n-1-i,k-1)
print((maxSum - minSum + mod) % mod)
|
import math
n,k = list(map(int, input().split(" ")))
nums = list(map(int, input().split(" ")))
nums.sort()
mod = 10**9 + 7
f = [1]
for i in range(1,10**5+1):
f.append(f[-1] * i % mod)
def nCr(n,r):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
minSum = 0
maxSum = 0
for i in range(n-k+1):
minSum += nums[i] * nCr(n-1-i, k-1)
maxSum += nums[-i-1] * nCr(n-1-i,k-1)
print((maxSum - minSum + mod) % mod)
|
[
"expression.operation.binary.add"
] | 608,553
| 608,554
|
u979126665
|
python
|
p02804
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
a.sort(reverse = True)
N = n+2
P = mod
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
base = 1
for item in range(n-k+1, n):
base = (base * item) % mod
for i in range(1, k):
base = (base * inv_t[i]) % mod
base2 = base
ans = 0
ans2 = 0
top = n - 1
for ai in a:
if top < k-1:
break
if ai > 0:
ans += base * ai
ans %= mod
else:
ans2 += abs(base * ai)
ans2 %= mod
base = base * inv_t[top] * (top - k + 1) % mod
top -= 1
top = n-1
for ai in reversed(a):
if top < k-1:
break
if ai > 0:
ans2 += base2 * ai
ans2 %= mod
else:
ans += abs(base2 * ai)
ans %= mod
base2 = base2 * inv_t[top] * (top - k + 1) % mod
top -= 1
print(abs(ans - ans2) % mod)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
a.sort(reverse = True)
N = n+2
P = mod
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
base = 1
for item in range(n-k+1, n):
base = (base * item) % mod
for i in range(1, k):
base = (base * inv_t[i]) % mod
base2 = base
ans = 0
ans2 = 0
top = n - 1
for ai in a:
if top < k-1:
break
if ai > 0:
ans += base * ai
ans %= mod
else:
ans2 += abs(base * ai)
ans2 %= mod
base = base * inv_t[top] * (top - k + 1) % mod
top -= 1
top = n-1
for ai in reversed(a):
if top < k-1:
break
if ai > 0:
ans2 += base2 * ai
ans2 %= mod
else:
ans += abs(base2 * ai)
ans %= mod
base2 = base2 * inv_t[top] * (top - k + 1) % mod
top -= 1
print((ans - ans2) % mod)
|
[
"call.arguments.change"
] | 608,561
| 608,562
|
u711539583
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.