text stringlengths 216 39.6k | conversation_id int64 219 108k | embedding list | cluster int64 11 11 |
|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: S, M, L, XL, XXL, XXXL (sizes are listed in increasing order). The t-shirts are already prepared. For each size from S to XXXL you are given the number of t-shirts of this size.
During the registration, the organizers asked each of the n participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him.
Write a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size:
* the size he wanted, if he specified one size;
* any of the two neibouring sizes, if he specified two sizes.
If it is possible, the program should find any valid distribution of the t-shirts.
Input
The first line of the input contains six non-negative integers — the number of t-shirts of each size. The numbers are given for the sizes S, M, L, XL, XXL, XXXL, respectively. The total number of t-shirts doesn't exceed 100 000.
The second line contains positive integer n (1 ≤ n ≤ 100 000) — the number of participants.
The following n lines contain the sizes specified by the participants, one line per participant. The i-th line contains information provided by the i-th participant: single size or two sizes separated by comma (without any spaces). If there are two sizes, the sizes are written in increasing order. It is guaranteed that two sizes separated by comma are neighboring.
Output
If it is not possible to present a t-shirt to each participant, print «NO» (without quotes).
Otherwise, print n + 1 lines. In the first line print «YES» (without quotes). In the following n lines print the t-shirt sizes the orginizers should give to participants, one per line. The order of the participants should be the same as in the input.
If there are multiple solutions, print any of them.
Examples
Input
0 1 0 1 1 0
3
XL
S,M
XL,XXL
Output
YES
XL
M
XXL
Input
1 1 2 0 1 1
5
S
M
S,M
XXL,XXXL
XL,XXL
Output
NO
Submitted Solution:
```
# You lost the game.
import sys
T = list(map(int, input().split()))
L = [[] for _ in range(6)]
D = [[] for _ in range(5)]
n = int(input())
S = [str(input()) for _ in range(n)]
for i in range(n):
x = list(S[i].split(","))
if len(x) == 2:
if x[0] == "S":
D[0] += [i]
if x[0] == "M":
D[1] += [i]
if x[0] == "L":
D[2] += [i]
if x[0] == "XL":
D[3] += [i]
if x[0] == "XXL":
D[4] += [i]
if x[0] == "XXXL":
D[5] += [i]
else:
if x[0] == "S":
L[0] += [i]
if x[0] == "M":
L[1] += [i]
if x[0] == "L":
L[2] += [i]
if x[0] == "XL":
L[3] += [i]
if x[0] == "XXL":
L[4] += [i]
if x[0] == "XXXL":
L[5] += [i]
a = 0
ok = 1
R = ["" for _ in range(n)]
# S
if len(L[0]) <= T[0]:
for x in L[0]:
R[x] = "S"
T[0] -= len(L[0])
else:
print("NO")
ok = 0
a = max(0,len(D[0]) - T[0])
for i in range(min(len(D[0]),T[0])):
R[D[0][i]] = "S"
# M
if a+len(L[1]) <= T[1]:
for i in range(len(D[0])-a,len(D[0])):
R[D[0][i]] = "M"
for x in L[1]:
R[x] = "M"
T[1] -= len(L[1])+a
else:
print("NO")
ok = 0
a = max(0,len(D[1]) - T[1])
for i in range(min(len(D[1]),T[1])):
R[D[1][i]] = "M"
# L
if a+len(L[2]) <= T[2]:
for i in range(len(D[1])-a,len(D[1])):
R[D[1][i]] = "L"
for x in L[2]:
R[x] = "L"
T[2] -= len(L[2])+a
else:
print("NO")
ok = 0
a = max(0,len(D[2]) - T[2])
for i in range(min(len(D[2]),T[2])):
R[D[2][i]] = "L"
# XL
if a+len(L[3]) <= T[3]:
for i in range(len(D[2])-a,len(D[2])):
R[D[2][i]] = "XL"
for x in L[3]:
R[x] = "XL"
T[3] -= len(L[3])+a
else:
print("NO")
ok = 0
a = max(0,len(D[3]) - T[3])
for i in range(min(len(D[3]),T[3])):
R[D[3][i]] = "XL"
# XXL
if a+len(L[4]) <= T[4]:
for i in range(len(D[3])-a,len(D[3])):
R[D[3][i]] = "XXL"
for x in L[4]:
R[x] = "XXL"
T[4] -= len(L[4])+a
else:
print("NO")
ok = 0
a = max(0,len(D[4]) - T[4])
for i in range(min(len(D[4]),T[4])):
R[D[4][i]] = "XXL"
# XXXL
if a+len(L[5]) <= T[5]:
for i in range(len(D[4])-a,len(D[4])):
R[D[4][i]] = "XXXL"
for x in L[5]:
R[x] = "XXXL"
else:
print("NO")
ok = 0
if ok:
print("YES")
for i in range(n):
print(R[i])
```
Yes
| 25,247 | [
0.31640625,
0.0477294921875,
0.2352294921875,
0.058990478515625,
-0.7373046875,
-0.335693359375,
-0.26318359375,
0.190185546875,
-0.222412109375,
0.8955078125,
0.27392578125,
-0.11126708984375,
0.30712890625,
-0.2568359375,
-0.33935546875,
0.000018417835235595703,
-0.3251953125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: S, M, L, XL, XXL, XXXL (sizes are listed in increasing order). The t-shirts are already prepared. For each size from S to XXXL you are given the number of t-shirts of this size.
During the registration, the organizers asked each of the n participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him.
Write a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size:
* the size he wanted, if he specified one size;
* any of the two neibouring sizes, if he specified two sizes.
If it is possible, the program should find any valid distribution of the t-shirts.
Input
The first line of the input contains six non-negative integers — the number of t-shirts of each size. The numbers are given for the sizes S, M, L, XL, XXL, XXXL, respectively. The total number of t-shirts doesn't exceed 100 000.
The second line contains positive integer n (1 ≤ n ≤ 100 000) — the number of participants.
The following n lines contain the sizes specified by the participants, one line per participant. The i-th line contains information provided by the i-th participant: single size or two sizes separated by comma (without any spaces). If there are two sizes, the sizes are written in increasing order. It is guaranteed that two sizes separated by comma are neighboring.
Output
If it is not possible to present a t-shirt to each participant, print «NO» (without quotes).
Otherwise, print n + 1 lines. In the first line print «YES» (without quotes). In the following n lines print the t-shirt sizes the orginizers should give to participants, one per line. The order of the participants should be the same as in the input.
If there are multiple solutions, print any of them.
Examples
Input
0 1 0 1 1 0
3
XL
S,M
XL,XXL
Output
YES
XL
M
XXL
Input
1 1 2 0 1 1
5
S
M
S,M
XXL,XXXL
XL,XXL
Output
NO
Submitted Solution:
```
s = list(map(int, input().split()))
d1, d2, d = {}, {}, {}
d1["S"] = 0
d1["M"] = 1
d1["L"] = 2
d1["XL"] = 3
d1["XXL"] = 4
d1["XXXL"] = 5
d2[0] = "S"
d2[1] = "M"
d2[2] = "L"
d2[3] = "XL"
d2[4] = "XXL"
d2[5] = "XXXL"
for i in range(6):
d[i] = s[i]
n = int(input())
ans = ["" for i in range(n)]
ev = []
for i in range(n):
s = input().split(",")
if len(s) == 1:
d[d1[s[0]]] -= 1
ans[i] = s[0]
else:
ev.append([i, [d1[s[0]], d1[s[1]]]])
for i in range(len(ev)):
if d[ev[i][1][0]] > d[ev[i][1][1]] and d[ev[i][1][0]] > 0:
d[ev[i][1][0]] -= 1
ans[i+1] = d2[ev[i][1][0]]
elif d[ev[i][1][0]] < d[ev[i][1][1]] and d[ev[i][1][1]] > 0:
d[ev[i][1][1]] -= 1
ans[i+1] = d2[ev[i][1][1]]
else:
print("NO")
exit(0)
print("YES")
for i in ans:
print(i)
```
No
| 25,248 | [
0.31640625,
0.0477294921875,
0.2352294921875,
0.058990478515625,
-0.7373046875,
-0.335693359375,
-0.26318359375,
0.190185546875,
-0.222412109375,
0.8955078125,
0.27392578125,
-0.11126708984375,
0.30712890625,
-0.2568359375,
-0.33935546875,
0.000018417835235595703,
-0.3251953125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: S, M, L, XL, XXL, XXXL (sizes are listed in increasing order). The t-shirts are already prepared. For each size from S to XXXL you are given the number of t-shirts of this size.
During the registration, the organizers asked each of the n participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him.
Write a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size:
* the size he wanted, if he specified one size;
* any of the two neibouring sizes, if he specified two sizes.
If it is possible, the program should find any valid distribution of the t-shirts.
Input
The first line of the input contains six non-negative integers — the number of t-shirts of each size. The numbers are given for the sizes S, M, L, XL, XXL, XXXL, respectively. The total number of t-shirts doesn't exceed 100 000.
The second line contains positive integer n (1 ≤ n ≤ 100 000) — the number of participants.
The following n lines contain the sizes specified by the participants, one line per participant. The i-th line contains information provided by the i-th participant: single size or two sizes separated by comma (without any spaces). If there are two sizes, the sizes are written in increasing order. It is guaranteed that two sizes separated by comma are neighboring.
Output
If it is not possible to present a t-shirt to each participant, print «NO» (without quotes).
Otherwise, print n + 1 lines. In the first line print «YES» (without quotes). In the following n lines print the t-shirt sizes the orginizers should give to participants, one per line. The order of the participants should be the same as in the input.
If there are multiple solutions, print any of them.
Examples
Input
0 1 0 1 1 0
3
XL
S,M
XL,XXL
Output
YES
XL
M
XXL
Input
1 1 2 0 1 1
5
S
M
S,M
XXL,XXXL
XL,XXL
Output
NO
Submitted Solution:
```
s = list(input().split(' '))
num = int(input())
size = list()
ans = ''
for _ in range(num):
size += (input().split(','))
for i in range(len(size)):
if size [i] == 'S':
a = 0
elif size [i] == 'M':
a = 1
elif size [i] == 'L':
a = 2
elif size [i] == 'XL':
a = 3
elif size [i] == 'XXL':
a = 4
elif size [i] == 'XXXL':
a = 5
if int(s[a]) != 0:
s[a] = int(s[a]) - 1
ans += str(size[i]) + '\n'
num -= 1
if num == 0:
print('YES')
print(ans[:len(ans)-1])
else:
print('NO')
```
No
| 25,249 | [
0.31640625,
0.0477294921875,
0.2352294921875,
0.058990478515625,
-0.7373046875,
-0.335693359375,
-0.26318359375,
0.190185546875,
-0.222412109375,
0.8955078125,
0.27392578125,
-0.11126708984375,
0.30712890625,
-0.2568359375,
-0.33935546875,
0.000018417835235595703,
-0.3251953125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: S, M, L, XL, XXL, XXXL (sizes are listed in increasing order). The t-shirts are already prepared. For each size from S to XXXL you are given the number of t-shirts of this size.
During the registration, the organizers asked each of the n participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him.
Write a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size:
* the size he wanted, if he specified one size;
* any of the two neibouring sizes, if he specified two sizes.
If it is possible, the program should find any valid distribution of the t-shirts.
Input
The first line of the input contains six non-negative integers — the number of t-shirts of each size. The numbers are given for the sizes S, M, L, XL, XXL, XXXL, respectively. The total number of t-shirts doesn't exceed 100 000.
The second line contains positive integer n (1 ≤ n ≤ 100 000) — the number of participants.
The following n lines contain the sizes specified by the participants, one line per participant. The i-th line contains information provided by the i-th participant: single size or two sizes separated by comma (without any spaces). If there are two sizes, the sizes are written in increasing order. It is guaranteed that two sizes separated by comma are neighboring.
Output
If it is not possible to present a t-shirt to each participant, print «NO» (without quotes).
Otherwise, print n + 1 lines. In the first line print «YES» (without quotes). In the following n lines print the t-shirt sizes the orginizers should give to participants, one per line. The order of the participants should be the same as in the input.
If there are multiple solutions, print any of them.
Examples
Input
0 1 0 1 1 0
3
XL
S,M
XL,XXL
Output
YES
XL
M
XXL
Input
1 1 2 0 1 1
5
S
M
S,M
XXL,XXXL
XL,XXL
Output
NO
Submitted Solution:
```
s = list(map(int,input().split()))
n = int(input())
f = 1
S = 0
M = 0
L = 0
XL = 0
XXL = 0
XXXL = 0
por = []
for i in range(n):
a = input()
if a == "S":
if S < s[0]:
S += 1
por.append("S")
else:
f = 0
elif a == "S,M":
if S >= s[0] and M >= s[1]:
f = 0
elif S >= s[0]:
M += 1
por.append("M")
elif M >= s[1]:
S += 1
por.append("S")
if a == "M":
if M < s[1]:
M += 1
por.append("M")
else:
f= 0
elif a == "M,L":
if L >= s[2] and M >= s[1]:
f = 0
elif M >= s[1]:
L += 1
por.append("L")
elif L >= s[2]:
M += 1
por.append("M")
if a == "L":
if L < s[2]:
L += 1
por.append("L")
else:
f = 0
elif a == "L,XL":
if L >= s[2] and XL >= s[3]:
f= 0
elif L >= s[2]:
XL += 1
por.append("XL")
elif XL >= s[3]:
L += 1
por.append("L")
if a == "XL":
if XL < s[3]:
XL += 1
por.append("XL")
else:
f= 0
elif a == "XL,XXL":
if XL >= s[3] and XXL >= s[4]:
f = 0
elif XL >= s[3]:
XXL += 1
por.append("XXL")
elif XXL >= s[4]:
XL += 1
por.append("XL")
if a == "XXL":
if XXL < s[4]:
XXL += 1
por.append("XXL")
else:
f = 0
elif a == "XXL,XXXL":
if XXL >= s[4] and XXXL >= s[5]:
f = 0
elif XXL >= s[4]:
XXXL += 1
por.append("XXXL")
elif XXXL >= s[5]:
XXL += 1
por.append("XXL")
if a == "XXXL":
if XXXL < s[5]:
XXXL += 1
por.append("XXXL")
else:
f = 0
if f== 0:
print("NO")
else:
print("YES")
for i in por:
print(i)
```
No
| 25,250 | [
0.31640625,
0.0477294921875,
0.2352294921875,
0.058990478515625,
-0.7373046875,
-0.335693359375,
-0.26318359375,
0.190185546875,
-0.222412109375,
0.8955078125,
0.27392578125,
-0.11126708984375,
0.30712890625,
-0.2568359375,
-0.33935546875,
0.000018417835235595703,
-0.3251953125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: S, M, L, XL, XXL, XXXL (sizes are listed in increasing order). The t-shirts are already prepared. For each size from S to XXXL you are given the number of t-shirts of this size.
During the registration, the organizers asked each of the n participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him.
Write a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size:
* the size he wanted, if he specified one size;
* any of the two neibouring sizes, if he specified two sizes.
If it is possible, the program should find any valid distribution of the t-shirts.
Input
The first line of the input contains six non-negative integers — the number of t-shirts of each size. The numbers are given for the sizes S, M, L, XL, XXL, XXXL, respectively. The total number of t-shirts doesn't exceed 100 000.
The second line contains positive integer n (1 ≤ n ≤ 100 000) — the number of participants.
The following n lines contain the sizes specified by the participants, one line per participant. The i-th line contains information provided by the i-th participant: single size or two sizes separated by comma (without any spaces). If there are two sizes, the sizes are written in increasing order. It is guaranteed that two sizes separated by comma are neighboring.
Output
If it is not possible to present a t-shirt to each participant, print «NO» (without quotes).
Otherwise, print n + 1 lines. In the first line print «YES» (without quotes). In the following n lines print the t-shirt sizes the orginizers should give to participants, one per line. The order of the participants should be the same as in the input.
If there are multiple solutions, print any of them.
Examples
Input
0 1 0 1 1 0
3
XL
S,M
XL,XXL
Output
YES
XL
M
XXL
Input
1 1 2 0 1 1
5
S
M
S,M
XXL,XXXL
XL,XXL
Output
NO
Submitted Solution:
```
def distribution(available, wish):
people = []
for w in wish:
if w.count(',') == 0:
if available[w] > 0:
available[w] -= 1
people.append(w)
else:
return ['NO']
else:
people.append(w)
for p in people:
if p.count(',') > 0:
lack = True
for size in p.split(','):
if available[size] > 0:
available[size] -= 1
people[people.index(p)] = size
lack = False
break
if lack:
return ['NO']
return ['YES', people]
def stock():
return {size: amount for size, amount in zip(['S', 'M', 'L', 'XL', 'XXL', 'XXXL'], map(int, input().split()))}
def request():
return [input() for i in range(int(input()))]
def solution(n):
return [input() for i in range(n)]
def answer():
ans = distribution(stock(), request())
if ans[0] == 'YES':
print('YES')
for p in ans[1]:
print(p)
else:
print('NO')
def check(s, l):
for size in l:
if size not in s:
return False
else:
s[size] -= 1
if s[size] < 0:
return False
return True
def compare():
s = stock()
r = request()
ans = distribution(s.copy(), r)
try:
usr = input()
if usr == 'YES':
l = solution(len(r))
elif usr == 'NO':
l = []
else:
print(0)
print('Нарушен формат вывода')
exit(0)
except EOFError:
print(0)
print('Нарушен формат вывода')
exit(0)
if usr != ans[0] or ans[0] == 'YES' and not check(s.copy(), l):
print(0)
print('Failed. T-shirts:', s, '. Request:', ';'.join(r), '. Your solution:', usr, ' - ', ';'.join(l))
else:
print(1)
print('Ok')
answer()
```
No
| 25,251 | [
0.31640625,
0.0477294921875,
0.2352294921875,
0.058990478515625,
-0.7373046875,
-0.335693359375,
-0.26318359375,
0.190185546875,
-0.222412109375,
0.8955078125,
0.27392578125,
-0.11126708984375,
0.30712890625,
-0.2568359375,
-0.33935546875,
0.000018417835235595703,
-0.3251953125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N people. The name of the i-th person is S_i.
We would like to choose three people so that the following conditions are met:
* The name of every chosen person begins with `M`, `A`, `R`, `C` or `H`.
* There are no multiple people whose names begin with the same letter.
How many such ways are there to choose three people, disregarding order?
Note that the answer may not fit into a 32-bit integer type.
Constraints
* 1 \leq N \leq 10^5
* S_i consists of uppercase English letters.
* 1 \leq |S_i| \leq 10
* S_i \neq S_j (i \neq j)
Input
Input is given from Standard Input in the following format:
N
S_1
:
S_N
Output
If there are x ways to choose three people so that the given conditions are met, print x.
Examples
Input
5
MASHIKE
RUMOI
OBIRA
HABORO
HOROKANAI
Output
2
Input
4
ZZ
ZZZ
Z
ZZZZZZZZZZ
Output
0
Input
5
CHOKUDAI
RNG
MAKOTO
AOKI
RINGO
Output
7
Submitted Solution:
```
N=int(input())
dic={'M':0,'A':0,'R':0,'C':0,'H':0}
k = dic.keys()
for i in range(N):
s=input()
if s[0] in k:
dic[s[0]]+=1
from itertools import combinations
ans=0
for p,q,r in combinations(k,3):
ans+=dic[p]*dic[q]*dic[r]
print(ans)
```
Yes
| 25,425 | [
0.45263671875,
0.05523681640625,
0.050537109375,
-0.304931640625,
-0.841796875,
-0.3671875,
-0.27197265625,
0.0400390625,
0.0625,
0.6787109375,
0.70947265625,
-0.3662109375,
0.2489013671875,
-0.71484375,
-0.7470703125,
-0.2078857421875,
-0.830078125,
-0.497802734375,
-0.311035156... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N people. The name of the i-th person is S_i.
We would like to choose three people so that the following conditions are met:
* The name of every chosen person begins with `M`, `A`, `R`, `C` or `H`.
* There are no multiple people whose names begin with the same letter.
How many such ways are there to choose three people, disregarding order?
Note that the answer may not fit into a 32-bit integer type.
Constraints
* 1 \leq N \leq 10^5
* S_i consists of uppercase English letters.
* 1 \leq |S_i| \leq 10
* S_i \neq S_j (i \neq j)
Input
Input is given from Standard Input in the following format:
N
S_1
:
S_N
Output
If there are x ways to choose three people so that the given conditions are met, print x.
Examples
Input
5
MASHIKE
RUMOI
OBIRA
HABORO
HOROKANAI
Output
2
Input
4
ZZ
ZZZ
Z
ZZZZZZZZZZ
Output
0
Input
5
CHOKUDAI
RNG
MAKOTO
AOKI
RINGO
Output
7
Submitted Solution:
```
from itertools import combinations as c
n=int(input());l=[input() for _ in range(n)];m="MARCH";p=[0]*5;r=0
for s in l:
for i in range(5):
if s[0]==m[i]:p[i]+=1
for d in c(p,3):r+=d[0]*d[1]*d[2]
print(r)
```
Yes
| 25,426 | [
0.5146484375,
0.10260009765625,
0.01149749755859375,
-0.2783203125,
-0.90625,
-0.32470703125,
-0.184814453125,
0.1297607421875,
0.0044097900390625,
0.56982421875,
0.73779296875,
-0.288330078125,
0.202880859375,
-0.708984375,
-0.8603515625,
-0.21142578125,
-0.7412109375,
-0.55615234... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N people. The name of the i-th person is S_i.
We would like to choose three people so that the following conditions are met:
* The name of every chosen person begins with `M`, `A`, `R`, `C` or `H`.
* There are no multiple people whose names begin with the same letter.
How many such ways are there to choose three people, disregarding order?
Note that the answer may not fit into a 32-bit integer type.
Constraints
* 1 \leq N \leq 10^5
* S_i consists of uppercase English letters.
* 1 \leq |S_i| \leq 10
* S_i \neq S_j (i \neq j)
Input
Input is given from Standard Input in the following format:
N
S_1
:
S_N
Output
If there are x ways to choose three people so that the given conditions are met, print x.
Examples
Input
5
MASHIKE
RUMOI
OBIRA
HABORO
HOROKANAI
Output
2
Input
4
ZZ
ZZZ
Z
ZZZZZZZZZZ
Output
0
Input
5
CHOKUDAI
RNG
MAKOTO
AOKI
RINGO
Output
7
Submitted Solution:
```
from itertools import*;d=[0]*91
for s in open(0).readlines():d[ord(s[0])]+=1
print(sum(d[p]*d[q]*d[r]for p,q,r in combinations(map(ord,'MARCH'),3)))
```
Yes
| 25,427 | [
0.57861328125,
0.170166015625,
-0.035430908203125,
-0.2181396484375,
-0.93701171875,
-0.306884765625,
-0.1748046875,
0.19384765625,
0.0206756591796875,
0.55419921875,
0.7119140625,
-0.35009765625,
0.193115234375,
-0.6767578125,
-0.8076171875,
-0.19775390625,
-0.7021484375,
-0.51806... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N people. The name of the i-th person is S_i.
We would like to choose three people so that the following conditions are met:
* The name of every chosen person begins with `M`, `A`, `R`, `C` or `H`.
* There are no multiple people whose names begin with the same letter.
How many such ways are there to choose three people, disregarding order?
Note that the answer may not fit into a 32-bit integer type.
Constraints
* 1 \leq N \leq 10^5
* S_i consists of uppercase English letters.
* 1 \leq |S_i| \leq 10
* S_i \neq S_j (i \neq j)
Input
Input is given from Standard Input in the following format:
N
S_1
:
S_N
Output
If there are x ways to choose three people so that the given conditions are met, print x.
Examples
Input
5
MASHIKE
RUMOI
OBIRA
HABORO
HOROKANAI
Output
2
Input
4
ZZ
ZZZ
Z
ZZZZZZZZZZ
Output
0
Input
5
CHOKUDAI
RNG
MAKOTO
AOKI
RINGO
Output
7
Submitted Solution:
```
from itertools import combinations
N = int(input())
s = [input()[0] for _ in range(N)]
s.sort()
x = [s.count('M'), s.count('A'), s.count('R'), s.count('C'), s.count('H')]
ans = 0
for v in combinations(x, 3):
ans += v[0] * v[1] * v[2]
print(ans)
```
Yes
| 25,428 | [
0.51806640625,
0.139892578125,
-0.01100921630859375,
-0.25244140625,
-0.89697265625,
-0.330322265625,
-0.262451171875,
0.140380859375,
0.046539306640625,
0.5791015625,
0.79541015625,
-0.399658203125,
0.249267578125,
-0.6806640625,
-0.826171875,
-0.253173828125,
-0.7373046875,
-0.55... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N people. The name of the i-th person is S_i.
We would like to choose three people so that the following conditions are met:
* The name of every chosen person begins with `M`, `A`, `R`, `C` or `H`.
* There are no multiple people whose names begin with the same letter.
How many such ways are there to choose three people, disregarding order?
Note that the answer may not fit into a 32-bit integer type.
Constraints
* 1 \leq N \leq 10^5
* S_i consists of uppercase English letters.
* 1 \leq |S_i| \leq 10
* S_i \neq S_j (i \neq j)
Input
Input is given from Standard Input in the following format:
N
S_1
:
S_N
Output
If there are x ways to choose three people so that the given conditions are met, print x.
Examples
Input
5
MASHIKE
RUMOI
OBIRA
HABORO
HOROKANAI
Output
2
Input
4
ZZ
ZZZ
Z
ZZZZZZZZZZ
Output
0
Input
5
CHOKUDAI
RNG
MAKOTO
AOKI
RINGO
Output
7
Submitted Solution:
```
N=int(input())
S=[input() for _ in range(N)]
cnt=[0]*N
cnt2=[]
flag=0
for i in range(N):
if S[i][0]=='M':
cnt[0]+=1
elif S[i][0]=='A':
cnt[1]+=1
elif S[i][0]=='R':
cnt[2]+=1
elif S[i][0]=='C':
cnt[3]+=1
elif S[i][0]=='H':
cnt[4]+=1
for i in range(N):
if cnt[i]!=0:
cnt2.append(cnt[i])
import math
import itertools
ans=0
for v in itertools.combinations(cnt2, 3):
ans+=v[0]*v[1]*v[2]
print(ans)
```
No
| 25,429 | [
0.421875,
0.1334228515625,
0.007717132568359375,
-0.2783203125,
-0.78125,
-0.27783203125,
-0.18798828125,
0.05792236328125,
0.04022216796875,
0.61474609375,
0.80419921875,
-0.381103515625,
0.1829833984375,
-0.7607421875,
-0.82763671875,
-0.22021484375,
-0.71875,
-0.486328125,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output
Submitted Solution:
```
INF = float('inf')
def trace_back(sink, predecessors):
p = predecessors[sink]
while p is not None:
v, i = p
yield edges[v][i]
p = predecessors[v]
def min_cost_flow(source, sink, required_flow):
res = 0
while required_flow:
dist = [INF] * n
dist[source] = 0
predecessors = [None] * n
while True:
updated = False
for v in range(n):
if dist[v] == INF:
continue
for i, (remain, target, cost, _) in enumerate(edges[v]):
new_dist = dist[v] + cost
if remain and dist[target] > new_dist:
dist[target] = new_dist
predecessors[target] = (v, i)
updated = True
if not updated:
break
if dist[sink] == INF:
return -1
aug = min(required_flow, min(e[0] for e in trace_back(sink, predecessors)))
required_flow -= aug
res += aug * dist[sink]
for e in trace_back(sink, predecessors):
remain, target, cost, idx = e
e[0] -= aug
edges[target][idx][0] += aug
return res
n, m, f = map(int, input().split())
edges = [[] for _ in range(n)]
for _ in range(m):
s, t, c, d = map(int, input().split())
es, et = edges[s], edges[t]
ls, lt = len(es), len(et)
es.append([c, t, d, lt])
et.append([0, s, -d, ls])
print(min_cost_flow(0, n - 1, f))
```
Yes
| 25,571 | [
0.4501953125,
0.4091796875,
-0.1578369140625,
-0.0391845703125,
-0.82177734375,
-0.308837890625,
-0.361083984375,
0.053009033203125,
0.253173828125,
0.6875,
0.32568359375,
-0.060882568359375,
0.239013671875,
-0.73095703125,
-0.421630859375,
-0.06256103515625,
-0.66650390625,
-0.746... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output
Submitted Solution:
```
import sys
readline = sys.stdin.readline
from heapq import heappop as hpp, heappush as hp
class MinCostFlowwithDijkstra:
INF = 1<<31
def __init__(self, N):
self.N = N
self.Edge = [[] for _ in range(N)]
def add_edge(self, st, en, cap, cost):
self.Edge[st].append([en, cap, cost, len(self.Edge[en])])
self.Edge[en].append([st, 0, -cost, len(self.Edge[st])-1])
def get_mf(self, so, si, fl):
N = self.N
INF = self.INF
res = 0
Pot = [0]*N
geta = N
prv = [None]*N
prenum = [None]*N
while fl:
dist = [INF]*N
dist[so] = 0
Q = [so]
while Q:
cost, vn = divmod(hpp(Q), geta)
if dist[vn] < cost:
continue
for enum in range(len(self.Edge[vn])):
vf, cap, cost, _ = self.Edge[vn][enum]
cc = dist[vn] + cost - Pot[vn] + Pot[vf]
if cap > 0 and dist[vf] > cc:
dist[vf] = cc
prv[vf] = vn
prenum[vf] = enum
hp(Q, cc*geta + vf)
if dist[si] == INF:
return -1
for i in range(N):
Pot[i] -= dist[i]
cfl = fl
vf = si
while vf != so:
cfl = min(cfl, self.Edge[prv[vf]][prenum[vf]][1])
vf = prv[vf]
fl -= cfl
res -= cfl*Pot[si]
vf = si
while vf != so:
e = self.Edge[prv[vf]][prenum[vf]]
e[1] -= cfl
self.Edge[vf][e[3]][1] += cfl
vf = prv[vf]
return res
N, M, F = map(int, readline().split())
T = MinCostFlowwithDijkstra(N)
for _ in range(M):
u, v, cap, cost = map(int, readline().split())
T.add_edge(u, v, cap, cost)
print(T.get_mf(0, N-1, F))
```
Yes
| 25,572 | [
0.41650390625,
0.1875,
-0.113037109375,
0.2418212890625,
-0.75439453125,
-0.06915283203125,
-0.0626220703125,
-0.0863037109375,
0.11199951171875,
0.71240234375,
0.61572265625,
-0.291015625,
0.191650390625,
-0.8251953125,
-0.6259765625,
0.10205078125,
-0.480712890625,
-0.88916015625... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output
Submitted Solution:
```
from collections import defaultdict
v_num, e_num, flow = (int(n) for n in input().split(" "))
edges = defaultdict(list)
for _ in range(e_num):
s1, t1, cap, cost = (int(n) for n in input().split(" "))
edges[s1].append([t1, cap, cost, len(edges[t1])])
edges[t1].append([s1, 0, -cost, len(edges[s1]) - 1])
answer = 0
before_vertice = [float("inf") for n in range(v_num)]
before_edge = [float("inf") for n in range(v_num)]
sink = v_num - 1
while True:
distance = [float("inf") for n in range(v_num)]
distance[0] = 0
updated = 1
while updated:
updated = 0
for v in range(v_num):
if distance[v] == float("inf"):
continue
for i, (target, cap, cost, trace_i) in enumerate(edges[v]):
if cap > 0 and distance[target] > distance[v] + cost:
distance[target] = distance[v] + cost
before_vertice[target] = v
before_edge[target] = i
updated = 1
if distance[sink] == float("inf"):
print(-1)
break
decreased = flow
trace_i = sink
while trace_i != 0:
decreased = min(decreased, edges[before_vertice[trace_i]][before_edge[trace_i]][1])
trace_i = before_vertice[trace_i]
flow -= decreased
trace_i = sink
while trace_i != 0:
this_edge = edges[before_vertice[trace_i]][before_edge[trace_i]]
this_edge[1] -= decreased
answer += this_edge[2] * decreased
edges[trace_i][this_edge[3]][1] += decreased
trace_i = before_vertice[trace_i]
if flow <= 0:
print(answer)
break
```
Yes
| 25,574 | [
0.3447265625,
0.53369140625,
-0.1651611328125,
0.0760498046875,
-0.89404296875,
-0.23828125,
-0.35888671875,
0.1123046875,
0.08331298828125,
0.70361328125,
0.51025390625,
-0.1002197265625,
0.2685546875,
-0.9140625,
-0.501953125,
0.036865234375,
-0.71337890625,
-0.74755859375,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output
Submitted Solution:
```
from heapq import heappop, heappush
def trace(source, edge_trace):
v = source
for i in edge_trace:
e = edges[v][i]
yield e
v = e[1]
def min_cost_flow(source, sink, required_flow):
res = 0
while required_flow:
visited = set()
queue = [(0, source, tuple())]
while queue:
total_cost, v, edge_memo = heappop(queue)
if v in visited:
continue
elif v == sink:
dist = total_cost
edge_trace = edge_memo
break
for i, (remain, target, cost, _) in enumerate(edges[v]):
if remain and target not in visited:
heappush(queue, (total_cost + cost, target, edge_memo + (i,)))
else:
return -1
aug = min(required_flow, min(e[0] for e in trace(source, edge_trace)))
required_flow -= aug
res += aug * dist
for e in trace(source, edge_trace):
remain, target, cost, idx = e
e[0] -= aug
edges[target][idx][0] += aug
return res
n, m, f = map(int, input().split())
edges = [[] for _ in range(n)]
for _ in range(m):
s, t, c, d = map(int, input().split())
es, et = edges[s], edges[t]
ls, lt = len(es), len(et)
es.append([c, t, d, lt])
et.append([0, s, d, ls])
print(min_cost_flow(0, n - 1, f))
```
No
| 25,575 | [
0.328369140625,
0.352783203125,
-0.2305908203125,
0.2464599609375,
-0.6474609375,
-0.367919921875,
-0.213623046875,
0.12127685546875,
0.343017578125,
0.68359375,
-0.0247650146484375,
-0.277587890625,
0.197021484375,
-0.64013671875,
-0.55224609375,
-0.05126953125,
-0.61962890625,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output
Submitted Solution:
```
from collections import defaultdict
v_num, e_num, flow = (int(n) for n in input().split(" "))
edges = defaultdict(list)
for _ in range(e_num):
s1, t1, cap, cost = (int(n) for n in input().split(" "))
edges[s1].append([t1, cap, cost, len(edges[t1])])
edges[t1].append([s1, cap, cost, len(edges[s1])])
answer = 0
before_vertice = [float("inf") for n in range(v_num)]
before_edge = [float("inf") for n in range(v_num)]
sink = v_num - 1
while True:
distance = [float("inf") for n in range(v_num)]
distance[0] = 0
updated = 1
while updated:
updated = 0
for v in range(v_num):
if distance[v] == float("inf"):
continue
for i, (target, cap, cost, trace_i) in enumerate(edges[v]):
if cap > 0 and distance[target] > distance[v] + cost:
distance[target] = distance[v] + cost
before_vertice[target] = v
before_edge[target] = i
updated = 1
if distance[sink] == float("inf"):
print(-1)
break
decreased = flow
trace_i = sink
while trace_i != 0:
decreased = min(decreased, edges[before_vertice[trace_i]][before_edge[trace_i]][1])
trace_i = before_vertice[trace_i]
flow -= decreased
answer += decreased * distance[sink]
trace_i = sink
while trace_i != 0:
this_edge = edges[before_vertice[trace_i]][before_edge[trace_i]]
this_edge[1] -= decreased
trace_i = before_vertice[trace_i]
edges[trace_i][this_edge[3]][1] += decreased
if flow <= 0:
print(answer)
break
```
No
| 25,576 | [
0.3232421875,
0.533203125,
-0.1558837890625,
0.0748291015625,
-0.875,
-0.2484130859375,
-0.345703125,
0.111328125,
0.09857177734375,
0.69970703125,
0.52392578125,
-0.1107177734375,
0.27099609375,
-0.900390625,
-0.4765625,
0.05181884765625,
-0.70849609375,
-0.77490234375,
-0.72216... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output
Submitted Solution:
```
from heapq import heappop, heappush
def trace(source, edge_trace):
v = source
for i in edge_trace:
e = edges[v][i]
yield e
v = e[1]
def min_cost_flow(source, sink, required_flow):
res = 0
while required_flow:
dist = [-1] * n
queue = [(0, source, tuple())]
edge_trace = None
while queue:
total_cost, v, edge_memo = heappop(queue)
if dist[v] != -1:
continue
dist[v] = total_cost
if v == sink:
edge_trace = edge_memo
break
for i, (remain, target, cost, _) in enumerate(edges[v]):
if remain and dist[target] == -1:
heappush(queue, (total_cost + cost, target, edge_memo + (i,)))
if dist[sink] == -1:
return -1
aug = min(required_flow, min(e[0] for e in trace(source, edge_trace)))
required_flow -= aug
res += aug * dist[sink]
for e in trace(source, edge_trace):
remain, target, cost, idx = e
e[0] -= aug
edges[target][idx][0] += aug
return res
n, m, f = map(int, input().split())
edges = [[] for _ in range(n)]
for _ in range(m):
s, t, c, d = map(int, input().split())
es, et = edges[s], edges[t]
ls, lt = len(es), len(et)
es.append([c, t, d, lt])
et.append([0, s, d, ls])
print(min_cost_flow(0, n - 1, f))
```
No
| 25,577 | [
0.346435546875,
0.32763671875,
-0.235107421875,
0.2900390625,
-0.62158203125,
-0.41552734375,
-0.10980224609375,
-0.0235443115234375,
0.27294921875,
0.79248046875,
0.024139404296875,
-0.324462890625,
0.155517578125,
-0.66796875,
-0.46240234375,
-0.057037353515625,
-0.5634765625,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output
Submitted Solution:
```
from collections import defaultdict
import sys
sys.setrecursionlimit(200000)
def dfs(source, used, all_weight, connect):
max_weight = all_weight
max_source = source
used[source] = 1
for target, weight in connect[source]:
if not used[target]:
now_weight = all_weight + weight
this_source, this_weight = dfs(target, used, now_weight, connect)
if max_weight < this_weight:
max_weight = this_weight
max_source = this_source
return [max_source, max_weight]
vertice = int(input())
connect = defaultdict(list)
for _ in range(vertice - 1):
v1, v2, weight = (int(n) for n in input().split(" "))
connect[v1].append([v2, weight])
connect[v2].append([v1, weight])
answer = 0
start_v = 0
for i in range(2):
used = [0 for n in range(vertice)]
start_v, answer = dfs(start_v, used, 0, connect)
print(answer)
```
No
| 25,578 | [
0.2198486328125,
0.1400146484375,
0.2401123046875,
0.40087890625,
-0.9482421875,
0.1689453125,
-0.2177734375,
0.34619140625,
0.09613037109375,
0.55078125,
0.4677734375,
-0.266357421875,
0.4013671875,
-0.66259765625,
-0.409423828125,
0.2159423828125,
-0.75634765625,
-0.533203125,
... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Tags: constructive algorithms, implementation
Correct Solution:
```
t = int(input())
for case in range(t):
sud =[]
change = [0,3,6]
digit =["1","2","3","4","5","6","7","8","9"]
for i in range(9):
row = list(input())
col_set = i//3
row_set = change[i%3]
tot_set = col_set+row_set
ofset = 1
if tot_set==8:
ofset-=1
c = row[tot_set]
for d in digit:
if d!=c:
row[tot_set]=d
break
sud.append("".join(row))
for r in sud:
print(r)
```
| 25,731 | [
0.28271484375,
0.10296630859375,
-0.3291015625,
0.10675048828125,
-0.55078125,
-0.5693359375,
-0.116943359375,
0.047698974609375,
0.59375,
1.3310546875,
0.70458984375,
0.01763916015625,
0.262451171875,
-0.6171875,
-0.54833984375,
-0.2978515625,
-0.578125,
-0.4189453125,
-0.200927... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Tags: constructive algorithms, implementation
Correct Solution:
```
import sys
import io, os
def main():
input=sys.stdin.readline
t=int(input())
for i in range(t):
sudoku=[]
for i in range(9):
r=[int(i) for i in input() if i!='\n']
sudoku.append(r)
#print(sudoku)
sudoku[0][0]=sudoku[0][0]+1
if sudoku[0][0]==10:
sudoku[0][0]=1
sudoku[1][3]=sudoku[1][3]+1
if sudoku[1][3]==10:
sudoku[1][3]=1
sudoku[2][6]=sudoku[2][6]+1
if sudoku[2][6]==10:
sudoku[2][6]=1
sudoku[3][1]=sudoku[3][1]+1
if sudoku[3][1]==10:
sudoku[3][1]=1
sudoku[4][4]=sudoku[4][4]+1
if sudoku[4][4]==10:
sudoku[4][4]=1
sudoku[5][7]=sudoku[5][7]+1
if sudoku[5][7]==10:
sudoku[5][7]=1
sudoku[6][2]=sudoku[6][2]+1
if sudoku[6][2]==10:
sudoku[6][2]=1
sudoku[7][5]=sudoku[7][5]+1
if sudoku[7][5]==10:
sudoku[7][5]=1
sudoku[8][8]=sudoku[8][8]+1
if sudoku[8][8]==10:
sudoku[8][8]=1
for i in sudoku:
i=''.join(map(str,i))
sys.stdout.write(i+'\n')
if __name__ == "__main__":
main()
```
| 25,732 | [
0.29248046875,
0.0701904296875,
-0.236083984375,
0.050750732421875,
-0.60400390625,
-0.583984375,
-0.141357421875,
0.0750732421875,
0.5576171875,
1.3173828125,
0.65234375,
-0.018829345703125,
0.25732421875,
-0.517578125,
-0.54541015625,
-0.2880859375,
-0.619140625,
-0.471435546875,... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Tags: constructive algorithms, implementation
Correct Solution:
```
"""
Author: Q.E.D
Time: 2020-04-13 10:20:12
"""
T = int(input())
for _ in range(T):
s = []
for _ in range(9):
tmp = input()
s.append(list(map(int, list(tmp))))
for i in range(3):
d = i
for j in range(3):
x = i * 3 + d
y = j * 3 + d
v = s[i * 3 + (d + 1) % 3][j * 3 + (d + 1) % 3]
s[x][y] = v
d = (d + 1) % 3
print('\n'.join([''.join(list(map(str, s[i]))) for i in range(9)]))
```
| 25,733 | [
0.32861328125,
0.047637939453125,
-0.31591796875,
0.07586669921875,
-0.54541015625,
-0.5498046875,
-0.0645751953125,
0.039093017578125,
0.59326171875,
1.31640625,
0.6884765625,
0.0069122314453125,
0.22900390625,
-0.57275390625,
-0.501953125,
-0.302734375,
-0.60498046875,
-0.4355468... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Tags: constructive algorithms, implementation
Correct Solution:
```
for i in range(int(input())):
result = []
for j in range(9):
l1 = list(input())
a = l1.index('2')
l1[a] = '1'
result.append(l1)
for k in range(9):
print("".join(result[k]))
```
| 25,734 | [
0.341796875,
0.06707763671875,
-0.26123046875,
0.08990478515625,
-0.5751953125,
-0.57568359375,
-0.054534912109375,
0.06463623046875,
0.63525390625,
1.3564453125,
0.64453125,
0.02734375,
0.245849609375,
-0.58251953125,
-0.53662109375,
-0.25830078125,
-0.6240234375,
-0.430419921875,... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Tags: constructive algorithms, implementation
Correct Solution:
```
def hhh(i, j):
x[i][j] += 1
if x[i][j] == 10:
x[i][j] = 1
for t in range(int(input())):
x = []
for a in range(9):
a = list(map(int, list(input())))
x.append(a)
hhh(0, 0)
hhh(1, 3)
hhh(2, 6)
hhh(3, 1)
hhh(4, 4)
hhh(5, 7)
hhh(6, 2)
hhh(7, 5)
hhh(8, 8)
for i in range(9):
print(''.join(map(str, x[i])))
```
| 25,735 | [
0.3369140625,
0.09228515625,
-0.279052734375,
0.0936279296875,
-0.52734375,
-0.5546875,
-0.061614990234375,
0.06890869140625,
0.61474609375,
1.298828125,
0.69287109375,
0.024444580078125,
0.251953125,
-0.5634765625,
-0.51318359375,
-0.25732421875,
-0.63720703125,
-0.47314453125,
... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Tags: constructive algorithms, implementation
Correct Solution:
```
t = int(input())
for _ in range(t):
m = []
for i in range(9):
s = input()
n = ''
for j in range(9):
if s[j] == '1':
n += '2'
else:
n += s[j]
m.append(n)
for i in m:
print(i)
```
| 25,736 | [
0.319580078125,
0.07098388671875,
-0.28662109375,
0.0670166015625,
-0.53759765625,
-0.55908203125,
-0.0506591796875,
0.042572021484375,
0.61328125,
1.32421875,
0.66796875,
0.0017156600952148438,
0.246337890625,
-0.59326171875,
-0.53076171875,
-0.2900390625,
-0.62158203125,
-0.42456... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Tags: constructive algorithms, implementation
Correct Solution:
```
for t in range(int(input())):
c=0
for i in range(1,10):
st=input()
newst=st[0:c]+str(int(st[c])%9+1)+st[c+1:9]
print(newst)
if i%3==0:
c = c%3+1
else:
c = c + 3
```
| 25,737 | [
0.290771484375,
0.08905029296875,
-0.241943359375,
0.07635498046875,
-0.5732421875,
-0.57421875,
-0.0994873046875,
0.059417724609375,
0.53076171875,
1.2958984375,
0.64306640625,
-0.01126861572265625,
0.2425537109375,
-0.57763671875,
-0.541015625,
-0.314697265625,
-0.6416015625,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
from sys import stdin
t = int(stdin.readline())
for _ in range(t):
n = 9
a=[]
for _ in range(n):
a+=[list(map(int,list(stdin.readline())[:-1]))]
for i in range(n):
j = i//3 + 3*(i%3)
a[i][j] = 1+(a[i][j]+1)%9
for i in range(n):
print(''.join(map(str,a[i])))
```
Yes
| 25,738 | [
0.3603515625,
0.11529541015625,
-0.33984375,
-0.0136871337890625,
-0.7255859375,
-0.308349609375,
-0.1072998046875,
0.250244140625,
0.4345703125,
1.2822265625,
0.677734375,
0.039825439453125,
0.09942626953125,
-0.609375,
-0.64501953125,
-0.3564453125,
-0.59375,
-0.53515625,
-0.23... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
t=int(input())
for _ in range(t):
x=[]
for _ in range(9):
a=input()
a=a.replace('1','2')
x.append(a)
for i in x:
print(i)
```
Yes
| 25,739 | [
0.40380859375,
0.07647705078125,
-0.347412109375,
0.02093505859375,
-0.798828125,
-0.34814453125,
-0.03741455078125,
0.271240234375,
0.5166015625,
1.2490234375,
0.6806640625,
0.053924560546875,
0.12066650390625,
-0.55712890625,
-0.62890625,
-0.2763671875,
-0.55029296875,
-0.5991210... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
test = int(input())
def solve():
r = []
for x in range(9):
s = input()
m = s.replace("1","2")
r.append(m)
for y in r:
print(y)
for x in range(test):
solve()
```
Yes
| 25,740 | [
0.384033203125,
0.0899658203125,
-0.394775390625,
-0.0208740234375,
-0.70068359375,
-0.326416015625,
-0.06915283203125,
0.27734375,
0.52978515625,
1.2451171875,
0.74267578125,
0.07000732421875,
0.07879638671875,
-0.65576171875,
-0.6083984375,
-0.329833984375,
-0.576171875,
-0.54345... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
t=int(input())
a=1
for i in range(t*9):
b=input()
print(b.replace('1','7'))
a=a+1
```
Yes
| 25,741 | [
0.386474609375,
0.10400390625,
-0.383544921875,
-0.027191162109375,
-0.69775390625,
-0.318115234375,
-0.0634765625,
0.2449951171875,
0.495849609375,
1.2275390625,
0.69677734375,
0.08587646484375,
0.0721435546875,
-0.6689453125,
-0.62353515625,
-0.3779296875,
-0.58349609375,
-0.5395... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
from math import *
def main():
for _ in range(int(input())):
c=0
for i in range(9):
row=list(map(int,input()))
row[c]=(row[c]+1)%9
if row[c]==0:
row[c]=1
for e in row:
print(e,end='')
c+=1
print()
main()
```
No
| 25,742 | [
0.376953125,
0.11395263671875,
-0.3955078125,
-0.0577392578125,
-0.66552734375,
-0.300537109375,
-0.07391357421875,
0.2490234375,
0.474609375,
1.283203125,
0.71630859375,
0.05889892578125,
0.1019287109375,
-0.61279296875,
-0.60888671875,
-0.348876953125,
-0.61083984375,
-0.51855468... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
t=int(input())
for tt in range(t):
sudoku=[]
for i in range(9):
x=input()
arr=[]
for j in x:
arr.append(int(j))
sudoku.append(arr)
sudoku[0][0]=9-sudoku[0][0]
sudoku[1][3]=9-sudoku[1][3]
sudoku[2][6]=9-sudoku[2][6]
sudoku[3][1]=9-sudoku[3][1]
sudoku[4][4]=9-sudoku[4][4]
sudoku[5][7]=9-sudoku[5][7]
sudoku[6][2]=9-sudoku[6][2]
sudoku[7][5]=9-sudoku[7][5]
sudoku[8][8]=9-sudoku[8][8]
for i in sudoku:
for j in i:
print(j,end='')
print()
```
No
| 25,743 | [
0.375,
0.1146240234375,
-0.36376953125,
-0.0204010009765625,
-0.66259765625,
-0.324462890625,
-0.0909423828125,
0.2396240234375,
0.48291015625,
1.2734375,
0.7333984375,
0.089599609375,
0.061737060546875,
-0.69873046875,
-0.62158203125,
-0.36376953125,
-0.5947265625,
-0.5244140625,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
"""
Template written to be used by Python Programmers.
Use at your own risk!!!!
Owned by enraged(rating - 5 star at CodeChef and Specialist at Codeforces).
"""
import sys
from functools import lru_cache
from heapq import merge, heapify, heappop, heappush
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf
from collections import defaultdict as dd, deque, Counter as c
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
# sys.setrecursionlimit(2*pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(var): sys.stdout.write(str(var))
def outln(var): sys.stdout.write(str(var)+"\n")
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
for _ in range(int(data())):
mat = []
for i in range(9):
mat.append(list(data()))
mat[0][0] = str(10 - int(mat[0][0]))
mat[5][5] = str(10 - int(mat[5][5]))
mat[7][7] = str(10 - int(mat[7][7]))
mat[3][6] = str(10 - int(mat[3][6]))
mat[4][1] = str(10 - int(mat[4][1]))
mat[6][3] = str(10 - int(mat[6][3]))
mat[8][2] = str(10 - int(mat[8][2]))
mat[2][8] = str(10 - int(mat[2][8]))
mat[1][4] = str(10 - int(mat[1][4]))
for i in mat:
outln(''.join(i))
```
No
| 25,744 | [
0.35791015625,
0.12274169921875,
-0.40576171875,
0.056854248046875,
-0.75341796875,
-0.30419921875,
-0.0340576171875,
0.292724609375,
0.51708984375,
1.2060546875,
0.68408203125,
0.01190948486328125,
0.11785888671875,
-0.6259765625,
-0.634765625,
-0.338134765625,
-0.587890625,
-0.58... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).
The picture showing the correct sudoku solution:
<image>
Blocks are bordered with bold black color.
Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:
* Any number in this field is in range [1; 9];
* each row contains at least two equal elements;
* each column contains at least two equal elements;
* each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.
Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.
Example
Input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
Output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
Submitted Solution:
```
#!/usr/bin/env python3
import atexit
import io
import sys
_I_B = sys.stdin.read().splitlines()
input = iter(_I_B).__next__
_O_B = io.StringIO()
sys.stdout = _O_B
@atexit.register
def write():
sys.__stdout__.write(_O_B.getvalue())
def main():
for _ in range(int(input())):
so=[]
r=[1]*9
c=[1]*9
for i in range(9):
so.append(list(input().strip()))
for i in range(9):
for j in range(9):
if so[i][j]!="1":
if r[i] and c[j]:
so[i][j]="1"
r[i]=0
c[j]=0
for i in so:
print("".join(i))
if __name__=='__main__':
main()
```
No
| 25,745 | [
0.273193359375,
0.0933837890625,
-0.444091796875,
-0.02142333984375,
-0.73876953125,
-0.326171875,
-0.1434326171875,
0.220458984375,
0.54345703125,
1.2548828125,
0.57275390625,
0.03399658203125,
0.1151123046875,
-0.54345703125,
-0.61865234375,
-0.34033203125,
-0.65966796875,
-0.591... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
def fun1(xx):
# [[x1,y1],[x2,y2],[x3,y3],[x4,y4]]
global ar,ans,mai
zer=[]
one=[]
for i in xx:
if(ar[i[0]][i[1]]==0):
zer.append([i[0],i[1]])
else:
one.append([i[0],i[1]])
ans+=2
mai.append([])
for i in zer:
mai[-1].append(i[0]+1)
mai[-1].append(i[1]+1)
ar[i[0]][i[1]]=1
for i in one:
mai[-1].append(i[0]+1)
mai[-1].append(i[1]+1)
ar[i[0]][i[1]]=0
break
del one[0]
mai.append([])
for i in zer:
mai[-1].append(i[0]+1)
mai[-1].append(i[1]+1)
ar[i[0]][i[1]]=0
for i in one:
mai[-1].append(i[0]+1)
mai[-1].append(i[1]+1)
ar[i[0]][i[1]]=0
def fun2(xx):
global ar,ans,mai
zer=[]
one=[]
for i in xx:
if(ar[i[0]][i[1]]==0):
zer.append([i[0],i[1]])
else:
one.append([i[0],i[1]])
ans+=1
mai.append([])
zer.pop()
for i in zer:
mai[-1].append(i[0]+1)
mai[-1].append(i[1]+1)
ar[i[0]][i[1]]=1
for i in one:
mai[-1].append(i[0]+1)
mai[-1].append(i[1]+1)
ar[i[0]][i[1]]=0
fun1(xx)
def fun3(xx):
global ar,ans,mai
zer=[]
one=[]
for i in xx:
if(ar[i[0]][i[1]]==0):
zer.append([i[0],i[1]])
else:
one.append([i[0],i[1]])
ans+=1
mai.append([])
for i in one:
mai[-1].append(i[0]+1)
mai[-1].append(i[1]+1)
ar[i[0]][i[1]]=0
for _ in range(int(input())):
n,m=map(int,input().split())
ar=[]
ans=0
mai=[]
for i in range(n):
ar.append(list(map(int,list(input()))))
for i in range(n-1):
for j in range(m-1):
zero=0
one=0
if(ar[i][j]==0):
zero+=1
else:
one+=1
if(ar[i+1][j]==0):
zero+=1
else:
one+=1
if(ar[i][j+1]==0):
zero+=1
else:
one+=1
if(ar[i+1][j+1]==0):
zero+=1
else:
one+=1
if(one==4):
ans+=1
mai.append([])
mai[-1].append(i+1)
mai[-1].append(j+1)
mai[-1].append(i+2)
mai[-1].append(j+1)
mai[-1].append(i+1)
mai[-1].append(j+2)
ar[i][j]=0
ar[i][j+1]=0
ar[i+1][j]=0
elif(one==2 and zero==2):
fun1([[i,j],[i,j+1],[i+1,j],[i+1,j+1]])
elif(zero==3 and one==1):
fun2([[i,j],[i,j+1],[i+1,j],[i+1,j+1]])
elif(one==3):
fun3([[i,j],[i,j+1],[i+1,j],[i+1,j+1]])
zero=0
one=0
if(ar[i][j]==0):
zero+=1
else:
one+=1
if(ar[i+1][j]==0):
zero+=1
else:
one+=1
if(ar[i][j+1]==0):
zero+=1
else:
one+=1
if(ar[i+1][j+1]==0):
zero+=1
else:
one+=1
if(one==4):
ans+=1
mai.append([])
mai[-1].append(i+1)
mai[-1].append(j+1)
mai[-1].append(i+2)
mai[-1].append(j+1)
mai[-1].append(i+1)
mai[-1].append(j+2)
ar[i][j]=0
ar[i][j+1]=0
ar[i+1][j]=0
elif(one==2 and zero==2):
fun1([[i,j],[i,j+1],[i+1,j],[i+1,j+1]])
elif(zero==3 and one==1):
fun2([[i,j],[i,j+1],[i+1,j],[i+1,j+1]])
elif(one==3):
fun3([[i,j],[i,j+1],[i+1,j],[i+1,j+1]])
print(ans)
for i in mai:
print(*i)
```
Yes
| 25,806 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
# Author : raj1307 - Raj Singh
# Date : 14.09.2020
from __future__ import division, print_function
import os,sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().strip().split(" "))
def msi(): return map(str,input().strip().split(" "))
def li(): return list(mi())
def dmain():
sys.setrecursionlimit(1000000)
threading.stack_size(1024000)
thread = threading.Thread(target=main)
thread.start()
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial,cos,tan,sin,radians
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *
#import threading
#from itertools import permutations
#Copy 2D list m = [x[:] for x in mark] .. Avoid Using Deepcopy
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def getKey(item): return item[1]
def sort2(l):return sorted(l, key=getKey,reverse=True)
def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
def decimalToBinary(n): return bin(n).replace("0b","")
def ntl(n):return [int(i) for i in str(n)]
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
def ceil(x,y):
if x%y==0:
return x//y
else:
return x//y+1
def powerMod(x,y,p):
res = 1
x %= p
while y > 0:
if y&1:
res = (res*x)%p
y = y>>1
x = (x*x)%p
return res
def gcd(x, y):
while y:
x, y = y, x % y
return x
def isPrime(n) : # Check Prime Number or not
if (n <= 1) : return False
if (n <= 3) : return True
if (n % 2 == 0 or n % 3 == 0) : return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
def read():
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
def main():
I = lambda : list(map(int,input().split()))
A,B,C,D=[0,0],[0,1],[1,0],[1,1]
def ch(a,b,c,d):
a,b,c,d=int(a),int(b),int(c),int(d)
x=a+b+c+d
zz=A*(not a)+B*(not b)+C*(not c)+D*(not d)
oo=A*a+B*b+C*c+D*d
ar=[]
if x==1:
ar.append(oo+zz[2:])
ar.append(oo+zz[:2]+zz[4:])
ar.append(oo+zz[:4])
elif x==2:
ar.append(zz+oo[:2])
ar.append(zz+oo[2:])
elif x==3:
ar.append(A*a+B*b+C*c+D*d)
elif x==4:
ar.append(oo[2:])
zz=oo[2:];oo=oo[:2]
ar.append(oo+zz[2:])
ar.append(oo+zz[:2]+zz[4:])
ar.append(oo+zz[:4])
return ar
for tc in range(int(input())):
n,m=I()
l=[]
for i in range(n):
l.append(list(input().strip()) )
an=[]
"""
Last time I wrecked it, last time I whipped around
Last time I did the whippets (yeah), last time I live reverse (yeah, yeah, ooh)
Pour the brown, hit the reverend (yeah), last time I hit your crib (yeah)
Last time there was no tenants
I done went back in myself, felt like hell
Fuck, I risked it, patience sell (yeah)
Found you livin', know you thrillin', not for sinnin' (yeah)
How I got my stripes in business, backin' out in the street (yeah)
What is wild, let it be, ragers out, gotta eat (yeah)
Not a vibe (yeah), but a wave, with the sound by the way
Count it down, by the days (ooh)
"""
for i in range(0,n-1):
for j in range(0,m-1):
x=ch(l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1])
for pp in x:
for k in range(6):
pp[k]+=1+i*(k%2==0)+j*(k%2)
an+=x
l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1]=list("0000")
"""
Move in 'verse on my turf, I'm outta line, I put in work
I draw the line and cross it first
I need the time, I need the search
It's just like wine, it make it worse
Skrrt, skrrt in the 'vert, skrrt, skrrt
Ride on land, Boeing jet, make it land
It's slow motion when I dance
In your eyes, I see your trance
I run away and then you prance
If I show the hideaway, would you hide out and let it blam?
Ain't no time, I'm facin' scams, nah, nah (yeah)
"""
print(len(an))
for i in an:
print(*i)
# region fastio
# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
#read()
main()
#dmain()
# Comment Read()
```
Yes
| 25,807 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
for _ in range(int(input())):
n, m = map(int, input().split())
cnt, A = 0, []
for i in range(n):
A.append(input())
cnt += A[i].count('1')
print(3*cnt)
for i in range(n):
for j in range(m):
if A[i][j] == '1':
x, y = 1, 1
if i==n-1:x=-1
if j==m-1:y=-1
print(i+1, j+1, i+x+1, j+1, i+1, j+y+1)
print(i+1, j+1, i+x+1, j+y+1, i+1, j+y+1)
print(i+1, j+1, i+x+1, j+1, i+x+1, j+y+1)
```
Yes
| 25,808 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
t=int(input())
for _ in range(t):
n,m=map(int,input().split())
l=[]
for i in range(n):
l.append(list(input()))
o=0
a=[]
for i in range(n):
for j in range(m):
if l[i][j]=='1' and j!=m-1 and i!=n-1:
o+=3
a.append([i+1,j+1,i+1,j+1+1,i+1+1,j+1])
a.append([i+1,j+1,i+1,j+1+1,i+1+1,j+1+1])
a.append([i+1,j+1,i+1+1,j+1,i+1+1,j+1+1])
elif l[i][j]=='1' and j==m-1 and i!=n-1:
o+=3
a.append([i+1,j+1,i+1,j,i+2,j+1])
a.append([i+1,j+1,i+1,j,i+2,j])
a.append([i+1,j+1,i+2,j+1,i+2,j])
elif l[i][j]=='1' and i==n-1 and j!=m-1:
o+=3
a.append([i+1,j+1,i,j+1,i+1,j+2])
a.append([i+1,j+1,i+1,j+2,i,j+2])
a.append([i+1,j+1,i,j+1,i,j+2])
elif l[i][j]=='1' and i==n-1 and j==m-1:
o+=3
a.append([i+1,j+1,i+1,j,i,j+1])
a.append([i+1,j+1,i+1,j,i,j])
a.append([i+1,j+1,i,j+1,i,j])
print(o)
for i in range(len(a)):
for j in range(6):
print(a[i][j],end=' ')
print('')
```
Yes
| 25,809 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
t=int(input())
for _ in range(t):
n,m=map(int,input().split())
l=[]
for i in range(n):
l.append(list(input()))
o=0
a=[]
for i in range(n):
for j in range(m):
if l[i][j]=='1' and j!=m-1 and i!=n-1:
o+=3
a.append([i+1,j+1,i+1,j+1+1,i+1+1,j+1])
a.append([i+1,j+1,i+1,j+1+1,i+1+1,j+1+1])
a.append([i+1,j+1,i+1+1,j+1,i+1+1,j+1+1])
elif l[i][j]=='1' and j==m-1:
o+=3
a.append([i+1,j+1,i+1,j,i+2,j+1])
a.append([i+1,j+1,i+1,j,i+2,j])
a.append([i+1,j+1,i+2,j+1,i+2,j])
elif l[i][j]=='1' and i==n-1:
o+=3
a.append([i+1,j+1,i,j+1,i+1,j+2])
a.append([i+1,j+1,i+1,j+2,i,j+2])
a.append([i+1,j+1,i,j+1,i,j+2])
print(o)
for i in range(len(a)):
for j in range(6):
print(a[i][j],end=' ')
print('')
```
No
| 25,810 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
#list(map(int, input().rstrip().split()))
t = int(input())
for test in range(t):
[n,m] = list(map(int, input().rstrip().split()))
g = [[0 for _ in range(m)] for _ in range(n)]
for i in range(n):
s = input()
for j in range(m):
g[i][j] = int(s[j])
o = 0
op = list()
for i in range(n-2):
for j in range(m-2):
if g[i][j] == 1:
o += 1
op.append([i, j, i+1, j, i, j+1])
g[i+1][j] = 1 - g[i+1][j]
g[i][j+1] = 1 - g[i][j+1]
for i in range(n-2):
if g[i][m-2] == 1:
o += 1
if g[i][m-1] == 1:
op.append([i, m-2, i, m-1, i+1, m-2])
g[i+1][m-2] = 1 - g[i+1][m-2]
else:
op.append([i, m-2, i+1, m-1, i+1, m-2])
g[i+1][m-2] = 1 - g[i+1][m-2]
g[i+1][m-1] = 1 - g[i+1][m-1]
for j in range(m-2):
if g[n-2][j] == 1:
o += 1
if g[n-1][j] == 1:
op.append([n-2, j, n-1, j, n-2, j+1])
g[n-2][j+1] = 1 - g[n-2][j+1]
else:
op.append([n-2, j, n-1, j+1, n-2, j+1])
g[n-2][j+1] = 1 - g[n-2][j+1]
g[n-1][j+1] = 1 - g[n-1][j+1]
d = {0: [], 1: []}
for i in range(n-2, n):
for j in range(m-2, m):
d[g[i][j]].append([i,j])
if len(d[1]) == 4:
o += 4
op.append([n-2, m-2, n-1, m-2, n-2, m-1])
op.append([n-1, m-1, n-2, m-2, n-1, m-2])
op.append([n-2, m-1, n-1, m-1, n-2, m-2])
op.append([n-1, m-2, n-2, m-1, n-1, m-1])
elif len(d[1]) == 3:
o += 1
oper = []
l = d[1]
for x, y in l:
oper.append(x)
oper.append(y)
op.append(oper)
elif len(d[1]) == 2:
o += 2
oper = []
l = d[0]
for x, y, in l:
oper.append(x)
oper.append(y)
oper.append(d[1][0][0])
oper.append(d[1][0][1])
op.append(oper)
oper = []
for x, y, in l:
oper.append(x)
oper.append(y)
oper.append(d[1][1][0])
oper.append(d[1][1][1])
op.append(oper)
elif len(d[1]) == 1:
o += 3
oper = []
oper.append(d[1][0][0])
oper.append(d[1][0][1])
oper.append(d[0][0][0])
oper.append(d[0][0][1])
oper.append(d[0][1][0])
oper.append(d[0][1][1])
op.append(oper)
newd = {0: [d[1][0], d[0][2]], 1: [d[0][0], d[0][1]]}
d = newd
oper = []
l = d[0]
for x, y, in l:
oper.append(x)
oper.append(y)
oper.append(d[1][0][0])
oper.append(d[1][0][1])
op.append(oper)
oper = []
for x, y, in l:
oper.append(x)
oper.append(y)
oper.append(d[1][1][0])
oper.append(d[1][1][1])
op.append(oper)
print(o)
for i in range(o):
print(" ".join(map(str, op[i])))
```
No
| 25,811 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
from sys import stdout,stdin
from collections import defaultdict,deque
import math
d=defaultdict(tuple)
d[('1','1','1','1')]=('0','0','1','0')
d[('1','1','1','0')]=('0','0','0','0')
d[('1','1','0','1')]=('0','0','0','0')
d[('1','1','0','0')]=('0','0','1','0')
d[('1','0','1','1')]=('0','0','0','0')
d[('1','0','1','0')]=('0','0','0','1')
d[('1','0','0','1')]=('1','1','1','0')
d[('1','0','0','0')]=('0','1','1','0')
d[('0','1','1','1')]=('0','0','0','0')
d[('0','1','1','0')]=('1','0','1','1')
d[('0','1','0','1')]=('1','1','1','0')
d[('0','1','0','0')]=('1','0','0','1')
d[('0','0','1','1')]=('0','1','0','0')
d[('0','0','1','0')]=('1','0','0','1')
d[('0','0','0','1')]=('0','1','1','0')
d[('0','0','0','0')]=('0','0','0','0')
t=int(stdin.readline())
for _ in range(t):
#n=int(stdin.readline())
n,m=map(int,stdin.readline().split())
#l=list(map(int,stdin.readline().split()))
l=[]
for i in range(n):
l.append(list(stdin.readline().strip()))
x,y=False,False
if n%2!=0:
n-=1
x=True
if m%2!=0:
m-=1
y=True
an=0
ans=[]
for i in range(0,n,2):
for j in range(0,m,2):
temp=(l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1])
while(temp!=('0','0','0','0')):
an+=1
ll=[]
kk=d[temp]
if kk[0]!=temp[0]:
ll.append(i+1)
ll.append(j+1)
if kk[1]!=temp[1]:
ll.append(i+1)
ll.append(j+2)
if kk[2]!=temp[2]:
ll.append(i+2)
ll.append(j+1)
if kk[3]!=temp[3]:
ll.append(i+2)
ll.append(j+2)
temp=kk
ans.append(ll)
#print(ans)
if x:
for j in range(0,m,2):
temp=('0','0',l[n][j],l[n][j+1])
while(temp!=('0','0','0','0')):
an+=1
ll=[]
kk=d[temp]
if kk[0]!=temp[0]:
ll.append(n+1)
ll.append(j+1)
if kk[1]!=temp[1]:
ll.append(n+1)
ll.append(j+2)
if kk[2]!=temp[2]:
ll.append(n+2)
ll.append(j+1)
if kk[3]!=temp[3]:
ll.append(n+2)
ll.append(j+2)
temp=kk
ans.append(ll)
if y:
for j in range(0,n,2):
temp=('0',l[i][m],'0',l[i+1][m])
while(temp!=('0','0','0','0')):
an+=1
ll=[]
kk=d[temp]
if kk[0]!=temp[0]:
ll.append(i+1)
ll.append(m+1)
if kk[1]!=temp[1]:
ll.append(i+1)
ll.append(m+2)
if kk[2]!=temp[2]:
ll.append(i+2)
ll.append(m+1)
if kk[3]!=temp[3]:
ll.append(i+2)
ll.append(m+2)
temp=kk
ans.append(ll)
if(x&y):
temp=('0','0','0',l[n][m])
while(temp!=('0','0','0','0')):
an+=1
ll=[]
kk=d[temp]
if kk[0]!=temp[0]:
ll.append(n+1)
ll.append(m+1)
if kk[1]!=temp[1]:
ll.append(n+1)
ll.append(m+2)
if kk[2]!=temp[2]:
ll.append(n+2)
ll.append(m+1)
if kk[3]!=temp[3]:
ll.append(n+2)
ll.append(m+2)
temp=kk
ans.append(ll)
print(an)
for i in range(an):
print(*ans[i])
```
No
| 25,812 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.
You are given a binary table of size n × m. This table consists of symbols 0 and 1.
You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).
Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.
It can be proved that it is always possible.
Input
The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.
The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).
Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.
It is guaranteed that the sum of nm for all test cases does not exceed 20000.
Output
For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.
In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.
Example
Input
5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101
Output
1
1 1 2 1 2 2
2
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2
1 4 1 5 2 5
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2
Note
In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.
In the second test case:
* operation with cells (2, 1), (3, 1), (3, 2). After it the table will be:
011
001
000
* operation with cells (1, 2), (1, 3), (2, 3). After it the table will be:
000
000
000
In the fifth test case:
* operation with cells (1, 3), (2, 2), (2, 3). After it the table will be:
010
110
* operation with cells (1, 2), (2, 1), (2, 2). After it the table will be:
000
000
Submitted Solution:
```
import sys
ii = lambda: sys.stdin.readline().strip()
idata = lambda: [int(qw) for qw in ii().split()]
def check(a, b, c, d, x, y):
if a == b == c == d == '0':
return []
if a == b == c == d == '1':
return [[x, y, x + 1, y, x, y + 1], [x + 1, y, x, y + 1, x + 1, y + 1],
[x + 1, y, x, y, x + 1, y + 1], [x, y, x + 1, y + 1, x, y + 1]]
if int(a) + int(b) + int(c) + int(d) == 1:
if a == '1':
return [[x, y, x + 1, y, x, y + 1], [x, y, x + 1, y + 1, x + 1, y], [x, y, x + 1, y + 1, x, y + 1]]
if d == '1':
return [[x + 1, y + 1, x + 1, y, x, y + 1], [x, y, x + 1, y + 1, x + 1, y], [x, y, x + 1, y + 1, x, y + 1]]
if b == '1':
return [[x + 1, y, x, y, x + 1, y + 1], [x, y, x + 1, y, x, y + 1], [x, y + 1, x + 1, y + 1, x + 1, y]]
return [[x, y + 1, x, y, x + 1, y + 1], [x, y, x + 1, y, x, y + 1], [x, y + 1, x + 1, y + 1, x + 1, y]]
if int(a) + int(b) + int(c) + int(d) == 2:
if a == d == '0':
return [[x + 1, y, x, y, x + 1, y + 1], [x, y, x + 1, y + 1, x, y + 1]]
if c == b == '0':
return [[x, y, x + 1, y, x, y + 1], [x + 1, y, x, y + 1, x + 1, y + 1]]
if a == b == '0':
return [[x, y, x + 1, y, x, y + 1], [x + 1, y, x, y, x + 1, y + 1]]
if c == d == '0':
return [[x, y, x + 1, y + 1, x, y + 1], [x + 1, y, x, y + 1, x + 1, y + 1]]
if a == c == '0':
return [[x + 1, y, x, y, x, y + 1], [x, y, x, y + 1, x + 1, y + 1]]
return [[x, y, x + 1, y, x + 1, y + 1], [x + 1, y, x + 1, y + 1, x, y + 1]]
if int(a) + int(b) + int(c) + int(d) == 3:
if a == '0':
return [[x + 1, y, x, y + 1, x + 1, y + 1]]
if b == '0':
return [[x, y, x + 1, y + 1, x, y + 1]]
if c == '0':
return [[x + 1, y, x, y, x + 1, y + 1]]
return [[x, y, x + 1, y, x, y + 1]]
def solve():
n, m = idata()
data = []
moves = []
for i in range(n):
data += [list(ii())]
for i in range(0, n - 1, 2):
for j in range(0, m - 1, 2):
d = check(data[i][j], data[i][j + 1], data[i + 1][j], data[i + 1][j + 1], i + 1, j + 1)
for e in d:
a1, a2, a3, a4, a5, a6 = e
moves += [[a2, a1, a4, a3, a6, a5]]
if n % 2 == 0 and m % 2 == 0:
print(len(moves))
for i in range(len(moves)):
print(*moves[i])
else:
if n % 2 == 0:
for i in range(n - 1):
data[i][-2] = '0'
for i in range(0, n - 1, 2):
d = check(data[i][-2], data[i][-1], data[i + 1][-2], data[i + 1][-1], i + 1, m - 1)
for e in d:
a1, a2, a3, a4, a5, a6 = e
moves += [[a2, a1, a4, a3, a6, a5]]
elif m % 2 == 0:
for i in range(m - 1):
data[-2][i] = '0'
for i in range(0, m - 1, 2):
d = check(data[-2][i], data[-2][i + 1], data[-1][i], data[-1][i + 1], n - 1, i + 1)
for e in d:
a1, a2, a3, a4, a5, a6 = e
moves += [[a2, a1, a4, a3, a6, a5]]
else:
for i in range(n - 1):
data[i][-2] = '0'
for i in range(m - 1):
data[-2][i] = '0'
for i in range(0, n - 1, 2):
d = check(data[i][-2], data[i][-1], data[i + 1][-2], data[i + 1][-1], i + 1, m - 1)
for e in d:
a1, a2, a3, a4, a5, a6 = e
moves += [[a2, a1, a4, a3, a6, a5]]
data[-2][-2] = '0'
data[-2][-1] = '0'
for i in range(0, m - 1, 2):
d = check(data[-2][i], data[-2][i + 1], data[-1][i], data[-1][i + 1], n - 1, i + 1)
for e in d:
a1, a2, a3, a4, a5, a6 = e
moves += [[a2, a1, a4, a3, a6, a5]]
data[-1][-2] = '0'
d = check(data[-2][-2], data[-2][-1], data[-1][-2], data[-1][-1], n - 1, m - 1)
for e in d:
a1, a2, a3, a4, a5, a6 = e
moves += [[a2, a1, a4, a3, a6, a5]]
print(len(moves))
for i in range(len(moves)):
print(*moves[i])
return
for _t in range(int(ii())):
solve()
```
No
| 25,813 | [
0.1719970703125,
0.007114410400390625,
-0.0394287109375,
-0.2083740234375,
-0.61181640625,
-0.351318359375,
-0.07958984375,
-0.036285400390625,
0.1978759765625,
0.8388671875,
0.87060546875,
-0.09039306640625,
0.24853515625,
-0.76416015625,
-0.30908203125,
-0.0297393798828125,
-0.6474... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
def f(a,d,T):
try:
return T.index(a,d+1)
except ValueError:
return len(T)
def g(a,d,T):
try:
return (d-1)-T[d-1::-1].index(a)
except ValueError:
return 0
A=26
D=int(input())
C=[0]+list(map(int,input().split())) #減る満足度のベース
S=[0]*(D+1) #S[d][i] :(d+1)日目にコンテストiを開催した時の満足度
for i in range(1,D+1):
S[i]=[0]+list(map(int,input().split()))
T=[0]
for i in range(D):
T.append(int(input()))
X=0
L=[0]*(A+1)
for d in range(1,D+1):
X+=S[d][T[d]]
for j in range(1,A+1):
if j!=T[d]:
L[j]+=1
X-=C[j]*L[j]
else:
L[j]=0
M=int(input())
for _ in range(M):
d,q=map(int,input().split())
p=T[d]
Y=(d-g(p,d,T))*(f(p,d,T)-d)
Z=(d-g(q,d,T))*(f(q,d,T)-d)
T[d]=q
X+=(S[d][q]-S[d][p])+Z*C[q]-Y*C[p]
print(X)
```
| 26,235 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
def f(a,d,T):
try:
return T[d:].index(a)+d
except ValueError:
return len(T)
from random import randint
A=26
D=int(input())
C=[0]+list(map(int,input().split())) #減る満足度のベース
S=[0]*(D+1) #S[d][i] :(d+1)日目にコンテストiを開催した時の満足度
for i in range(1,D+1):
S[i]=[0]+list(map(int,input().split()))
T=[0]
for i in range(D):
T.append(int(input()))
L=[[0]*(A+1) for _ in range(D+1)]
for x in range(1,D+1):
t=T[x]
for j in range(1,A+1):
if t!=j:
L[x][j]=L[x-1][j]+1
else:
L[x][j]=0
X=0
for d in range(1,D+1):
X+=S[d][T[d]]
for j in range(1,A+1):
X-=C[j]*L[d][j]
M=int(input())
for _ in range(M):
d,q=map(int,input().split())
p=T[d]
a=f(p,d+1,T)
b=f(q,d+1,T)
Y=0
h=L[d-1][p]
for i in range(d,a):
h+=1
Y+=h-L[i][p]
L[i][p]=h
m=0
Z=0
for j in range(d,b):
Z-=m-L[j][q]
L[j][q]=m
m+=1
X+=(S[d][q]-S[d][p])+Z*C[q]-Y*C[p]
print(X)
T[d]=q
```
| 26,236 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
import sys
sys.setrecursionlimit(300000)
from collections import defaultdict
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')
D = I()
C = LMI()
S = [LMI() for _ in range(D)]
T = [I() - 1 for _ in range(D)]
M = I()
last = [[i + 1] * 26 for i in range(D)]
for d in range(D):
i = T[d]
j = 0
for dd in range(d, D):
last[dd][i] = j
j += 1
def eval(d, q):
i = T[d]
val = S[d][q] - S[d][i]
contrib = 0
if d == 0:
j = 1
else:
j = last[d - 1][i] + 1
for dd in range(d, D):
if dd > d and last[dd][i] == 0:
break
contrib += j - last[dd][i]
last[dd][i] = j
j += 1
val -= contrib * C[i]
contrib = 0
j = 0
for dd in range(d, D):
if last[dd][q] == 0:
break
contrib += last[dd][q] - j
last[dd][q] = j
j += 1
val += contrib * C[q]
T[d] = q
return val
def score0(T):
last = defaultdict(int)
ans = 0
for d in range(D):
ans += S[d][T[d]]
last[T[d]] = d + 1
for i in range(26):
ans -= C[i] * (d + 1 - last[i])
return ans
score = score0(T)
for d, q in [tuple(MI0()) for _ in range(M)]:
val = eval(d, q)
score += val
print(score)
```
| 26,237 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
def P(s):
i,R,P,*L=[0]*29
while i<D:t=I[i+D][0]-1;P+=s-(i+1-L[t])*C[t];R+=I[i][t]-P;i+=1;L[t]=i
return R
(D,),C,*I=[[*map(int,t.split())]for t in open(0)]
for d,q in I[D-~D:]:I[d-1+D][0]=q;print(P(sum(C)))
```
| 26,238 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
import sys
from bisect import bisect_left
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10
def get_sum(a, d, n):
""" 等差数列の和：(初項a, 公差d, 項数n) """
return (2*a + (n-1)*d) * n // 2
D = INT()
M = 26
C = LIST()
S = [[]] * (D+1)
S[0] = [0] * M
for i in range(1, D+1):
S[i] = LIST()
adjli = [[0] for i in range(M)]
T = [0] + [t-1 for t in LIST(D)]
for d, t in enumerate(T[1:], 1):
adjli[t].append(d)
for i in range(M):
adjli[i].append(D+1)
def check(T):
score = 0
for a in range(M):
for i in range(1, len(adjli[a])):
curd = adjli[a][i-1]
nxtd = adjli[a][i]
cnt = nxtd - curd
score += S[curd][a]
score -= C[a] * get_sum(0, 1, cnt)
return score
# day日目のコンテストをaからbに変更する
def change(day, a, b):
res = 0
# コンテストaのコストを再計算
res -= S[day][a]
di = adjli[a].index(day)
for i in range(di, di+2):
curd = adjli[a][i-1]
nxtd = adjli[a][i]
cnt = nxtd - curd
res += C[a] * get_sum(0, 1, cnt)
adjli[a].pop(di)
curd = adjli[a][di-1]
nxtd = adjli[a][di]
cnt = nxtd - curd
res -= C[a] * get_sum(0, 1, cnt)
# コンテストbのコストを再計算
res += S[day][b]
di = bisect_left(adjli[b], day)
curd = adjli[b][di-1]
nxtd = adjli[b][di]
cnt = nxtd - curd
res += C[b] * get_sum(0, 1, cnt)
adjli[b].insert(di, day)
for i in range(di, di+2):
curd = adjli[b][i-1]
nxtd = adjli[b][i]
cnt = nxtd - curd
res -= C[b] * get_sum(0, 1, cnt)
return res
score = check(T)
Q = INT()
for i in range(Q):
d, q = MAP()
q -= 1
score += change(d, T[d], q)
print(score)
T[d] = q
```
| 26,239 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
import random
D=int(input())
c=list(map(int,input().split()))
s=[list(map(int,input().split())) for i in range(D)]
plus=0
minus=0
data=[[1 for i in range(D)] for j in range(26)]
ans=[0]*D
for i in range(D):
t=int(input())
ans[i]=t
plus+=s[i][t-1]
if i!=0:
for j in range(26):
data[j][i]=data[j][i-1]+1
data[t-1][i]=0
minus+=sum(c[j]*data[j][i] for j in range(26))
#for i in range(26):
#print(data[i])
M=int(input())
for _ in range(M):
d,q=map(int,input().split())
plus+=s[d-1][q-1]-s[d-1][ans[d-1]-1]
pre=ans[d-1]
#print("pre",pre)
ans[d-1]=q
for j in range(d-1,D):
if data[q-1][j]!=0:
if j==d-1:
minus+=0*c[q-1]-data[q-1][d-1]*c[q-1]
data[q-1][d-1]=0
else:
minus+=(data[q-1][j-1]+1-data[q-1][j])*c[q-1]
data[q-1][j]=data[q-1][j-1]+1
else:
break
for j in range(d-1,D):
if data[pre-1][j]!=0 or j==d-1:
if j==0:
minus+=c[pre-1]
data[pre-1][0]=1
else:
minus+=(data[pre-1][j-1]+1-data[pre-1][j])*c[pre-1]
data[pre-1][j]=data[pre-1][j-1]+1
else:
break
print(plus-minus)
#for i in range(26):
#print(data[i])
```
| 26,240 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
from bisect import bisect_left
D = int(input())
C = [0]+list(map(int, input().split()))
S = [0]+[[0] + list(map(int, input().split())) for _ in range(D)]
contest = [[0] for _ in range(27)]
#SL:満足度、sch：スケジュール
SL, sch = 0, [0]
#tの日程でコンテストを行った時の満足度を計算
for d in range(1, D+1):
t = int(input())
sch.append(t)
#コンテストの開催日時を記録
contest[t].append(d)
SL += S[d][t]
for i in range(1, 27):
SL -= C[i]*(d-contest[i][-1])
for i in range(1, 27):
contest[i].append(D+1)
# print("contest", contest)
# print("sch", sch)
# print(S)
M = int(input())
for i in range(M):
d, q = map(int, input().split())
SL += S[d][q]-S[d][sch[d]]
# print("1", contest[sch[d]])
ind = bisect_left(contest[sch[d]], d)
# print("2", ind)
k = d-contest[sch[d]][ind-1]
l = contest[sch[d]][ind+1]-d
SL -= C[sch[d]]*k*l
del contest[sch[d]][ind]
ind = bisect_left(contest[q], d)
contest[q].insert(ind, d)
k = d-contest[q][ind-1]
l = contest[q][ind+1]-d
SL += C[q]*k*l
sch[d] = q
print(SL)
```
| 26,241 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
"Correct Solution:
```
import bisect
D = int(input())
c = [0] + list(map(int, input().split()))
s = [0] + [[0] + list(map(int, input().split())) for _ in range(D)]
held = [[0] for _ in range(27)]
SL, sch = 0, [0]
for d in range(1, D+1):
t = int(input())
sch.append(t)
held[t].append(d)
SL += s[d][t]
for i in range(1, 27):
SL -= c[i] * (d - held[i][-1])
for i in range(1, 27):
held[i].append(D+1)
M = int(input())
for i in range(M):
d, q = map(int, input().split())
SL += s[d][q] - s[d][sch[d]]
ind = bisect.bisect_left(held[sch[d]], d)
k = d - held[sch[d]][ind-1]
l = held[sch[d]][ind+1] - d
SL -= c[sch[d]] * k * l
del held[sch[d]][ind]
ind = bisect.bisect_left(held[q], d)
held[q].insert(ind, d)
k = d - held[q][ind-1]
l = held[q][ind+1] - d
SL += c[q] * k * l
sch[d] = q
print(SL)
```
| 26,242 | [
0.258544921875,
0.0345458984375,
-0.252197265625,
-0.2083740234375,
-0.93408203125,
-0.280517578125,
-0.66162109375,
0.2034912109375,
0.0113067626953125,
0.76806640625,
0.317626953125,
-0.4052734375,
0.2177734375,
-0.9677734375,
-0.4619140625,
-0.279541015625,
-0.69140625,
-0.69433... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
from random import randint
import sys
input = sys.stdin.readline
INF = 9223372036854775808
def calc_score(D, C, S, T):
"""
開催日程Tを受け取ってそこまでのスコアを返す
コンテストi 0-indexed
d 0-indexed
"""
score = 0
last = [0]*26 # コンテストiを前回開催した日
for d, t in enumerate(T):
last[t] = d + 1
for i in range(26):
score -= (d + 1 - last[i]) * C[i]
score += S[d][t]
return score
def update_score(D, C, S, T, score, ct, ci):
"""
ct日目のコンテストをコンテストciに変更する
スコアを差分更新する
ct: change t 変更日 0-indexed
ci: change i 変更コンテスト 0-indexed
"""
new_score = score
last = [0]*26 # コンテストiを前回開催した日
prei = T[ct] # 変更前に開催する予定だったコンテストi
for d, t in enumerate(T, start=1):
last[t] = d
new_score += (d - last[prei])*C[prei]
new_score += (d - last[ci])*C[ci]
last = [0]*26
T[ct] = ci
for d, t in enumerate(T, start=1):
last[t] = d
new_score -= (d - last[prei])*C[prei]
new_score -= (d - last[ci])*C[ci]
new_score -= S[ct][prei]
new_score += S[ct][ci]
return new_score
def local_search():
pass
def main(D, C, S):
T = []
for d in range(D):
# d日目終了時点で満足度が一番高くなるようなコンテストiを開催する
max_score = -INF
best_i = 1
for i in range(26):
T.append(i)
score = calc_score(D, C, S, T)
if max_score < score:
max_score = score
best_i = i
T.pop()
T.append(best_i)
return T
if __name__ == '__main__':
D = int(input())
C = [int(i) for i in input().split()]
S = [[int(i) for i in input().split()] for j in range(D)]
T = [int(input())-1 for i in range(D)]
M = int(input())
DQ = [[int(i)-1 for i in input().split()] for j in range(M)]
score = calc_score(D, C, S, T)
for d, q in DQ:
score = update_score(D, C, S, T, score, d, q)
T[d] = q
print(score)
```
Yes
| 26,243 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
import sys
input = lambda: sys.stdin.buffer.readline()
L = 26
D = int(input())
C = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(input()) for _ in range(D)]
M = int(input())
class BinaryIndexedTree:
def __init__(self, n):
self.n = n
self.data = [0] * (self.n+1)
def sum(self, i):
res = 0
while i > 0:
res += self.data[i]
i -= i & -i
return res
def add(self, i, x):
if i <= 0: raise IndexError
while i <= self.n:
self.data[i] += x
i += i & -i
def lower_bound(self, x):
if x <= 0: return 0
cur, s, k = 0, 0, 1 << (self.n.bit_length()-1)
while k:
nxt = cur + k
if nxt <= self.n and s + self.data[nxt] < x:
s += self.data[nxt]
cur = nxt
k >>= 1
return cur + 1
def rsum(x):
return x*(x+1)//2
b = [BinaryIndexedTree(D) for _ in range(L)]
score = 0
for d, cont in enumerate(T):
cont -= 1
b[cont].add(d+1, 1)
score += S[d][cont]
for i in range(L):
m = b[i].sum(D)
tmp = 0
s = [0]
for j in range(1, m+1):
s.append(b[i].lower_bound(j))
s.append(D+1)
for j in range(len(s)-1):
x = s[j+1] - s[j] - 1
tmp += rsum(x)
score -= tmp*C[i]
def chg(d, q):
diff = 0
p = T[d]-1
d += 1
o = b[p].sum(d)
d1 = b[p].lower_bound(o-1)
d2 = b[p].lower_bound(o+1)
diff += rsum(d-d1) * C[p]
diff += rsum(d2-d) * C[p]
diff -= rsum(d2-d1) * C[p]
o = b[q].sum(d)
d1 = b[q].lower_bound(o)
d2 = b[q].lower_bound(o+1)
diff += rsum(d2-d1) * C[q]
diff -= rsum(d-d1) * C[q]
diff -= rsum(d2-d) * C[q]
b[p].add(d, -1)
b[q].add(d, 1)
d -= 1
T[d] = q+1
diff -= S[d][p]
diff += S[d][q]
return diff
for _ in range(M):
d, q = map(lambda x: int(x)-1, input().split())
diff = chg(d, q)
score += diff
print(score)
```
Yes
| 26,244 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
def calcScore():
for d in range(1, D + 1):
id = t[d] # この日に開催するコンテスト
sinceLast[d][id] = 0
score[d][id] = s[d][id]
for i in range(1, 26 + 1):
if i == id: continue
sinceLast[d][i] = sinceLast[d - 1][i] + 1
score[d][i] = -c[i] * sinceLast[d][i]
ans = 0
for d in range(1, D + 1):
ans += sum(score[d])
return ans
def calcScoreDiff(score, d, before, after):
ans = 0
for dd in range(d, D + 1):
if dd > d and t[dd] == before: break
sinceLast[dd][before] = sinceLast[dd - 1][before] + 1
ans -= score[dd][before]
score[dd][before] = -c[before] * sinceLast[dd][before]
ans += score[dd][before]
ans -= score[d][after]
sinceLast[d][after] = 0
score[d][after] = s[d][after]
ans += score[d][after]
for dd in range(d + 1, D + 1):
if t[dd] == after: break
sinceLast[dd][after] = sinceLast[dd - 1][after] + 1
ans -= score[dd][after]
score[dd][after] = -c[after] * sinceLast[dd][after]
ans += score[dd][after]
return ans
D = int(input())
c = [0] + [int(x) for x in input().split()]
s = [[0 for _ in range(26 + 1)]] + \
[[0] + [int(x) for x in input().split()] for _ in range(D)]
t = [0] + [int(input()) for _ in range(D)]
score = [[0] * (26 + 1) for _ in range(D + 1)]
sinceLast = [[0] * (26 + 1) for _ in range(D + 1)]
tot = calcScore()
M = int(input())
for i in range(M):
d, after = [int(x) for x in input().split()]
before = t[d]
t[d] = after
diff = calcScoreDiff(score, d, before, after)
tot += diff
print(tot)
```
Yes
| 26,245 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10
D = INT()
C = LIST()
S = [[]] * (D+1)
for i in range(1, D+1):
S[i] = LIST()
T = [0] + [t-1 for t in LIST(D)]
M = 26
last = list2d(M, D+2, 0)
def check(T):
score = 0
for i, t in enumerate(T[1:], 1):
score += S[i][t]
for j in range(M):
last[j][i] = last[j][i-1] + 1
last[t][i] = 0
for j in range(M):
score -= C[j] * last[j][i]
return score
def change(day, a, b):
nxtday = last[a].index(0, day+1)
w = nxtday - day
h = last[a][day-1] + 1
a_change = C[a] * h * w
for d in range(day, nxtday):
last[a][d] = last[a][d-1] + 1
nxtday = last[b].index(0, day+1)
w = nxtday - day
h = last[b][day-1] + 1
b_change = C[b] * h * w
last[b][day] = 0
for d in range(day+1, nxtday):
last[b][d] = last[b][d-1] + 1
res = -a_change + b_change - S[day][a] + S[day][b]
return res
score = check(T)
Q = INT()
for i in range(Q):
d, q = MAP()
q -= 1
prev = T[d]
nxt = q
score += change(d, prev, nxt)
print(score)
T[d] = q
```
Yes
| 26,246 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
D=int(input())
c=input().split()
c=[int(a) for a in c]
S=[]
for _ in range(D):
s=input().split()
s=[int(a) for a in s]
S.append(s)
T=[]
for _ in range(D):
t=int(input())-1
T.append(t)
M=int(input())
numbers=[]
for _ in range(M):
d,q=map(int,input().split())
numbers.append([d,q])
for m in range(M):
ans = 0
held = [0 for _ in range(26)]
e=numbers[m][0]-1
q=numbers[m][1]-1
a=T[e]
T[e]=q
for d in range(D):
s = S[d]
place = T[d]
held[place] = d + 1
ans += s[place]
for n in range(26):
ans -= c[n] * (d + 1 - held[n])
print(ans)
```
No
| 26,247 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
D = int(input())#D=365
c = list(map(int, input().split()))#0<=c<=100
s = [list(map(int, input().split())) for _ in range(D)]#0<=s<=20000
t = [int(input()) for _ in range(D)]
M = int(input())
dq = [list(map(int, input().split())) for _ in range(M)]
def culc_value(t):
last = [0] * 26
value = 0
for d in range(D):
type = t[d]
value += s[d][type - 1]
last[type - 1] = d + 1
for i in range(26):
value -= c[i] * (d + 1 - last[i])
return value
v_lastday = []
for d, q in dq:
t[d - 1] = q
v_lastday.append(culc_value(t))
for x in v_lastday:
print(x)
"""
for i in range(D):
print(v[i])
"""
```
No
| 26,248 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
def c_incremental_scoring():
"""B 問題の入力と、追加で「d 日目のコンテストのタイプを q に変更するクエリ」が
与えられるので、それに基づいて日毎の満足度を計算せよ。
(A 問題では (大雑把に言って) クエリをうまく与えて満足度を可能な限り高くしていく)"""
D = int(input())
Contests = [int(i) for i in input().split()]
Satisfaction = [[int(i) for i in input().split()] for j in range(D)]
Contest_type = [int(input()) for _ in range(D)]
M = int(input())
Queries = [[int(i) for i in input().split()] for j in range(M)]
ans = []
s = 0
last = {i: 0 for i in range(1, 27)}
for d, q in Queries:
Contest_type[d - 1] = q
for d, t in enumerate(Contest_type, 1):
print(d, t)
s += Satisfaction[d - 1][t - 1]
last[t] = d
satisfaction_decreasing = 0
for i in range(1, 27):
satisfaction_decreasing += Contests[i - 1] * (d - last[i])
s -= satisfaction_decreasing
ans.append(s)
return '\n'.join(map(str, ans))
print(c_incremental_scoring())
```
No
| 26,249 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You will be given a contest schedule for D days and M queries of schedule modification. In the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule. Note that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.
D
c_1 c_2 \cdots c_{26}
s_{1,1} s_{1,2} \cdots s_{1,26}
\vdots
s_{D,1} s_{D,2} \cdots s_{D,26}
t_1
t_2
\vdots
t_D
M
d_1 q_1
d_2 q_2
\vdots
d_M q_M
* The constraints and generation methods for the input part are the same as those for Problem A.
* For each d=1,\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26}.
* The number of queries M is an integer satisfying 1\leq M\leq 10^5.
* For each i=1,\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D}.
* For each i=1,\ldots,26, q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Output
Let v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query. Print M integers v_i to Standard Output in the following format:
v_1
v_2
\vdots
v_M
Example
Input
5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19
Output
72882
56634
38425
27930
42884
Submitted Solution:
```
D = int(input())
C = list(map(int ,input().split()))
S = [list(map(int, input().split())) for i in range(D)]
sumc = sum(C)
last = [0 for i in range(26)]
check = [0 for i in range(26)]
con = []
ans = 0
for i in range(D):
t = int(input())
last[t-1] = i+1
ans += S[i][t-1]
check[t-1] += 1
con.append(t)
for j in range(26):
ans -= C[j]*(i+1 - last[j])
M = int(input())
for i in range(M):
d, q = map(int, input().split())
e = con[d-1] #i日目にやるコンテスト
l1 = 0
l2 = 0
tmpe = 0
tmpq = 0
f1 = D
f2 = D
for j in range(D):
if check[e-1] == 0 and check[q-1] == 0:
break
if tmpe == 0 and tmpq == 0:
break
if j < d-1:
if con[j] == e:
l1 = j #変更前のコンテストを直前の最後にいつやったか
if con[j] == q:
l2 = j #変更後のコンテストを直前の最後にいつやったか
if j > d-1:
if con[j] == e and tmpe == 0:
f1 = j #変更前のコンテストを直後にいつやったか
tmpe = 1
if con[j] == q and tmpq == 0:
f2 = j #変更後のコンテストを直後にいつやったか
tmpq = 1
con[d-1] = q
check[e-1] -= 1
check[q-1] += 1
ans = ans - S[d-1][e-1] + S[d-1][q-1] + C[q-1]*(f2-d+1)*(d-l2-1) - C[e-1]*(f1-d+1)*(d-l1-1)
print(ans)
```
No
| 26,250 | [
0.255859375,
0.07208251953125,
-0.2213134765625,
-0.1474609375,
-0.78369140625,
-0.20263671875,
-0.556640625,
0.21728515625,
-0.0726318359375,
0.8349609375,
0.26708984375,
-0.27392578125,
0.23876953125,
-0.8955078125,
-0.401611328125,
-0.236083984375,
-0.58837890625,
-0.78125,
-0... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
"Correct Solution:
```
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2,gcd
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
def main():
ans=[]
while 1:
n = INT()
if n==0:
break
else:
a=LIST()
a.sort()
mi=max(a)
for i in range(n-1):
for j in range(i+1,n):
mi=min(mi,a[j]-a[i])
ans.append(mi)
for x in ans:
print(x)
if __name__ == '__main__':
main()
```
| 26,452 | [
0.0284881591796875,
0.146484375,
-0.036895751953125,
0.0300445556640625,
-1.0380859375,
-0.347412109375,
-0.299072265625,
0.05596923828125,
-0.1898193359375,
0.91796875,
0.302734375,
0.09613037109375,
0.33251953125,
-0.67333984375,
-0.57763671875,
-0.2333984375,
-0.3662109375,
-0.7... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
"Correct Solution:
```
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
flag = True
ans_list = []
N = 1
while(flag == True):
N = INT()
if N == 0:
flag = False
else:
A = LIST()
A.sort()
ans = abs(A[0] - A[1])
for i in range(N - 1):
ans = min(ans, abs(A[i] - A[i + 1]))
ans_list.append(ans)
# ans = abs(A[0] - A[1])
for ans in ans_list:
print(ans)
```
| 26,454 | [
0.04345703125,
0.1494140625,
-0.038482666015625,
0.0246124267578125,
-1.0537109375,
-0.3427734375,
-0.29931640625,
0.06500244140625,
-0.177001953125,
0.91845703125,
0.296142578125,
0.11163330078125,
0.326416015625,
-0.64697265625,
-0.58642578125,
-0.2342529296875,
-0.3603515625,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
while True:
n=int(input())
if n==0:break;
a=list(map(int, input().split()))
a.sort()
ans=a[1]-a[0]
for i in range(2, n):
if a[i]-a[i-1]<ans:ans=a[i]-a[i-1]
print(ans)
```
Yes
| 26,455 | [
0.049713134765625,
0.1571044921875,
-0.01922607421875,
0.1337890625,
-1.052734375,
-0.2734375,
-0.2091064453125,
0.1475830078125,
-0.1649169921875,
0.90673828125,
0.372802734375,
0.204345703125,
0.2159423828125,
-0.65625,
-0.49609375,
-0.299072265625,
-0.3759765625,
-0.6708984375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
n=int(input())
while n!=0:
a=list(map(int,input().split()))
ans=10**18
for i in range(len(a)):
for j in range(len(a)):
if i!=j:
ans=min(ans,abs(a[i]-a[j]))
print(ans)
n=int(input())
```
Yes
| 26,456 | [
0.057525634765625,
0.1617431640625,
-0.0249786376953125,
0.1400146484375,
-1.0771484375,
-0.267333984375,
-0.1951904296875,
0.134033203125,
-0.169677734375,
0.919921875,
0.382080078125,
0.2235107421875,
0.2174072265625,
-0.66845703125,
-0.51513671875,
-0.296630859375,
-0.394287109375... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
min_list = []
while True:
n = int(input())
if n == 0:
break
s = list(map(int, input().split()))
s.sort(reverse=True)
min1 = s[0] - s[1]
for i in range(n-1):
min1 = min(min1, s[i]-s[i+1])
min_list.append(min1)
for i in range(len(min_list)):
print(min_list[i])
```
Yes
| 26,457 | [
0.02783203125,
0.1298828125,
-0.014404296875,
0.11627197265625,
-1.0546875,
-0.289306640625,
-0.2403564453125,
0.1456298828125,
-0.189208984375,
0.91064453125,
0.3740234375,
0.1824951171875,
0.2083740234375,
-0.6806640625,
-0.54541015625,
-0.2861328125,
-0.42919921875,
-0.667480468... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
while int(input()):
l=sorted(map(int,input().split()))
ll=range(len(l))
m=[0 for _ in ll]
m[1]=abs(l[0]-l[1])
for i in ll[2:]:
m[i]=min(m[i-1],abs(l[i]-l[i-1]))
print(m[-1])
```
Yes
| 26,458 | [
0.043243408203125,
0.1650390625,
-0.01910400390625,
0.160400390625,
-1.0732421875,
-0.23779296875,
-0.2176513671875,
0.1712646484375,
-0.1796875,
0.921875,
0.357666015625,
0.1964111328125,
0.2197265625,
-0.68017578125,
-0.53125,
-0.2861328125,
-0.396240234375,
-0.67578125,
-0.693... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
while True:
n,m = map(int,input().split())
if n == 0 and m == 0:
break
a = list(map(int,input().split()))
a.sort()
list1 = []
for i in range(n):
for j in range(i + 1, n):
price1 = a[i] + a[j]
list1.append(price1)
list1.sort()
list2 = list(filter(lambda p: m >= p, list1))
if list2:
print(max(list2))
else:
print("NONE")
```
No
| 26,459 | [
-0.0127410888671875,
0.1839599609375,
-0.0262298583984375,
0.104248046875,
-1.0498046875,
-0.3046875,
-0.2047119140625,
0.165283203125,
-0.1552734375,
0.89892578125,
0.403076171875,
0.208251953125,
0.2105712890625,
-0.6474609375,
-0.489990234375,
-0.250732421875,
-0.40625,
-0.71972... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
while True:
n = int(input())
a = list(map(int, input().split()))
l = list()
for i in range(1, n-1):
for j in range(i+1,n):
l.append(abs(a[i]-a[j]))
if l == []:
continue
if n == 0:
break
print(min(l))
```
No
| 26,460 | [
0.0545654296875,
0.1817626953125,
-0.002490997314453125,
0.144775390625,
-1.0673828125,
-0.28076171875,
-0.212646484375,
0.1480712890625,
-0.1578369140625,
0.89599609375,
0.392333984375,
0.2257080078125,
0.231201171875,
-0.650390625,
-0.50927734375,
-0.268310546875,
-0.392333984375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
while True:
n = int(input())
a = list(map(int, input().split()))
l = list()
for i in range(1, n-1):
for j in range(i+1,n):
l.append(abs(a[i]-a[j]))
if l == []:
break
if n == 0:
break
print(min(l))
```
No
| 26,461 | [
0.050079345703125,
0.18212890625,
-0.0008869171142578125,
0.142578125,
-1.064453125,
-0.2822265625,
-0.212158203125,
0.147216796875,
-0.1636962890625,
0.89501953125,
0.394287109375,
0.225830078125,
0.2296142578125,
-0.65283203125,
-0.51171875,
-0.2734375,
-0.39306640625,
-0.6884765... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Selection of Participants of an Experiment
Dr. Tsukuba has devised a new method of programming training. In order to evaluate the effectiveness of this method, he plans to carry out a control experiment. Having two students as the participants of the experiment, one of them will be trained under the conventional method and the other under his new method. Comparing the final scores of these two, he will be able to judge the effectiveness of his method.
It is important to select two students having the closest possible scores, for making the comparison fair. He has a list of the scores of all students who can participate in the experiment. You are asked to write a program which selects two of them having the smallest difference in their scores.
Input
The input consists of multiple datasets, each in the following format.
n
a1 a2 … an
A dataset consists of two lines. The number of students n is given in the first line. n is an integer satisfying 2 ≤ n ≤ 1000. The second line gives scores of n students. ai (1 ≤ i ≤ n) is the score of the i-th student, which is a non-negative integer not greater than 1,000,000.
The end of the input is indicated by a line containing a zero. The sum of n's of all the datasets does not exceed 50,000.
Output
For each dataset, select two students with the smallest difference in their scores, and output in a line (the absolute value of) the difference.
Sample Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output for the Sample Input
0
1
5
Example
Input
5
10 10 10 10 10
5
1 5 8 9 11
7
11 34 83 47 59 29 70
0
Output
0
1
5
Submitted Solution:
```
f=lambda s,t:abs(s-t)
while 1:
n=int(input())
if not n:break
a=sorted(list(map(int,input().split())))
s,t=a[:2]
for i in a[2:]:
u=f(s,t)
if u>abs(s-i):
t=i
elif u>abs(t-i):
s=i
print(f(s,t))
```
No
| 26,462 | [
0.0231781005859375,
0.2266845703125,
-0.022796630859375,
0.2054443359375,
-1.0615234375,
-0.2449951171875,
-0.245849609375,
0.1571044921875,
-0.1529541015625,
0.8935546875,
0.390625,
0.1512451171875,
0.211181640625,
-0.67919921875,
-0.53173828125,
-0.301025390625,
-0.378662109375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
#input
n = int(input())
fo,br,bz,qu = 0,0,0,1
for i in range(n):
p = int(input())
fo = fo+p
br = br+1
if bz/qu<=fo/br:
bz = fo
qu = br
else :
break
print(bz/qu)
```
Yes
| 26,836 | [
0.56787109375,
-0.1697998046875,
0.031097412109375,
0.3701171875,
-0.7646484375,
-0.9052734375,
0.1392822265625,
0.0689697265625,
0.0775146484375,
0.9697265625,
0.469970703125,
-0.01007080078125,
-0.059722900390625,
-0.8046875,
-0.1912841796875,
0.011993408203125,
-0.298583984375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
tux = int(input())
foo = 0
bar = 0
baz = 0
quz = 1
for i in range(tux):
pur = int(input())
foo += pur
bar += 1
if foo * quz > baz * bar:
baz = foo
quz = bar
print(baz / quz)
```
Yes
| 26,837 | [
0.5703125,
-0.15625,
0.0149688720703125,
0.3525390625,
-0.75634765625,
-0.9013671875,
0.127685546875,
0.10015869140625,
0.108154296875,
0.8955078125,
0.5224609375,
-0.041015625,
-0.0938720703125,
-0.75634765625,
-0.14453125,
0.013641357421875,
-0.210205078125,
-0.82470703125,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
tux = input()
foo, bar, baz,quz = 0,0,0,1
tux = int(tux)
for i in range(tux):
pur = int(input())
foo+=pur
bar+=1
if foo*quz > bar*baz:
baz = foo
quz = bar
print(round(baz/quz,6))
```
Yes
| 26,838 | [
0.55908203125,
-0.129638671875,
0.003864288330078125,
0.3427734375,
-0.79150390625,
-0.8974609375,
0.13427734375,
0.0897216796875,
0.10931396484375,
0.91748046875,
0.51171875,
-0.0304107666015625,
-0.083984375,
-0.7958984375,
-0.1490478515625,
0.0447998046875,
-0.234619140625,
-0.8... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
TUX=int(input())
FOO=0
BAR=0
BAZ=0
QUZ=1
for i in range(TUX):
PUR=int(input())
FOO=FOO+PUR
BAR=BAR+1
if FOO*QUZ>BAZ*BAR:
BAZ=FOO
QUZ=BAR
print(BAZ/QUZ)
```
Yes
| 26,839 | [
0.5869140625,
-0.15625,
0.017730712890625,
0.358154296875,
-0.75927734375,
-0.91259765625,
0.12249755859375,
0.09674072265625,
0.11944580078125,
0.90185546875,
0.5205078125,
-0.0390625,
-0.10125732421875,
-0.75830078125,
-0.13427734375,
0.0167694091796875,
-0.2177734375,
-0.8325195... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
n = int(input())
cnt = 0
for i in range(n):
cnt += int(input())
print(cnt / n)
```
No
| 26,840 | [
0.5615234375,
-0.1937255859375,
-0.0276641845703125,
0.3095703125,
-0.7060546875,
-0.873046875,
0.1439208984375,
0.023529052734375,
0.127685546875,
1.005859375,
0.479248046875,
-0.040740966796875,
-0.10333251953125,
-0.7666015625,
-0.2261962890625,
-0.03424072265625,
-0.244873046875,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
t = int(input())
p, q = 0, 0
for i in range(t):
d = int(input())
p += d
q += 1
print(p / q)
```
No
| 26,841 | [
0.58349609375,
-0.1600341796875,
0.0072174072265625,
0.33740234375,
-0.7861328125,
-0.8974609375,
0.11676025390625,
0.07568359375,
0.09686279296875,
0.9609375,
0.453125,
-0.044219970703125,
-0.0897216796875,
-0.7333984375,
-0.2098388671875,
-0.0054931640625,
-0.24072265625,
-0.8154... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
numbers = []
for _ in range(int(input())):
numbers.append(int(input()))
print(sum(numbers)/len(numbers))
```
No
| 26,842 | [
0.5947265625,
-0.1904296875,
0.0094451904296875,
0.333740234375,
-0.81005859375,
-0.90576171875,
0.166015625,
0.052886962890625,
0.159912109375,
0.97021484375,
0.462890625,
-0.1162109375,
-0.062042236328125,
-0.7099609375,
-0.2418212890625,
-0.006381988525390625,
-0.274169921875,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RLY
BAZ R FOO
QUZ R BAR
OIC
IM OUTTA YR LOOP
BAZ IS NOW A NUMBAR
VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ
KTHXBYE
Input
The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).
Output
Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.
Examples
Input
3
0
1
1
Output
0.666667
Submitted Solution:
```
s=input()
n=int(input())
ans=""
for i in range(len(s)):
x=s[i]
if(ord(x)<n+97):
ans+=x.upper()
else:
ans+=x.lower()
print(ans)
```
No
| 26,843 | [
0.56640625,
-0.1961669921875,
-0.01342010498046875,
0.34521484375,
-0.7841796875,
-0.8876953125,
0.17919921875,
0.07354736328125,
0.106689453125,
0.95849609375,
0.51904296875,
-0.047607421875,
-0.08148193359375,
-0.76416015625,
-0.1651611328125,
0.01258087158203125,
-0.2362060546875,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
n = int(input())
a = [-int(i) for i in input().split()]
b = 1
c = 1
d = {}
e = a[:]
a.sort()
d[a[0]] = 1
for i in range(1, n):
if a[i] > a[i - 1]:
b += c
c = 1
else:
c += 1
d[a[i]] = b
for i in e:
print(d[i], end = ' ')
```
Yes
| 26,929 | [
0.442138671875,
-0.1461181640625,
-0.10650634765625,
0.0013780593872070312,
-0.59375,
-0.6513671875,
-0.08782958984375,
0.352783203125,
-0.005802154541015625,
0.8779296875,
0.6181640625,
-0.009124755859375,
0.1358642578125,
-0.7216796875,
-0.26171875,
-0.36572265625,
-0.368896484375,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
b = [[0]*2 for i in range(n)]
for i in range(n):
b[i][0] = a[i]
b[i][1] = i
b = sorted(b)[::-1]
ans = [0]*n
place = 1
num_m = 0
m = b[0][0]
for i in range(n):
if b[i][0] != m:
place += num_m
m = b[i][0]
num_m = 1
else:
num_m += 1
ans[b[i][1]] = place
for i in range(n-1):
print(ans[i], end = ' ')
print(ans[n-1])
```
Yes
| 26,930 | [
0.43994140625,
-0.1275634765625,
-0.11407470703125,
0.015655517578125,
-0.5849609375,
-0.68505859375,
-0.09033203125,
0.35205078125,
-0.025970458984375,
0.88427734375,
0.63232421875,
0.0205841064453125,
0.1517333984375,
-0.705078125,
-0.252685546875,
-0.36376953125,
-0.35595703125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
n=int(input())
s=input()
a=list(map(int,s.split()))
i=0
while(i<n):
count=0
j=0
while(j<n):
if(a[j]>a[i]):
count+=1
j+=1
print(1+count,end=" ")
i=i+1
```
Yes
| 26,931 | [
0.48828125,
-0.08624267578125,
-0.12261962890625,
0.041900634765625,
-0.58203125,
-0.69677734375,
-0.0809326171875,
0.3642578125,
-0.004428863525390625,
0.875,
0.61767578125,
0.0006480216979980469,
0.174072265625,
-0.72314453125,
-0.258544921875,
-0.383056640625,
-0.347412109375,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
n = int(input())
rating = [int(i) for i in input().split()]
rank = sorted(rating, reverse = True)
res = {}
count = 1
for i in rank:
if i not in res:
res[i] = count
count+=1
ans = []
for i in rating:
ans.append(str(res[i]))
print(" ".join(ans))
```
Yes
| 26,932 | [
0.47802734375,
-0.15380859375,
-0.11724853515625,
0.0011587142944335938,
-0.54736328125,
-0.67822265625,
-0.078369140625,
0.326171875,
0.014862060546875,
0.8759765625,
0.59521484375,
-0.0252227783203125,
0.1448974609375,
-0.7119140625,
-0.269287109375,
-0.3466796875,
-0.3564453125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
from sys import *
n=int(input())
A=list(map(int,stdin.readline().split()))
B=A.copy()
B.sort(reverse=True)
dp=[-1 for i in range(n)]
dp[0],count,dict,m=1,1,{},[]
for i in range(1,n):
if B[i]==B[i-1]:
dp[i]=dp[i-1]
count+=1
dict.update({B[i]: dp[i]})
elif count>1:
dp[i]=dp[i-1]+count
count=1
dict.update({B[i]: dp[i]})
else:
dp[i]=dp[i-1]+1
count=1
dict.update({B[i]: dp[i]})
for i in range(len(A)):
if A[i] in dict.keys():
m.append(str(dict[A[i]]))
stdout.write(str(" ".join(m))+"\n")
```
No
| 26,933 | [
0.446533203125,
-0.140625,
-0.08380126953125,
0.0416259765625,
-0.607421875,
-0.6416015625,
-0.1064453125,
0.35205078125,
-0.01520538330078125,
0.86767578125,
0.607421875,
-0.05755615234375,
0.18505859375,
-0.712890625,
-0.263671875,
-0.36474609375,
-0.32080078125,
-0.806640625,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
n=int(input())
l=list(map(int,input().split()))
s=''
for k in range(n):
l1=[i for i in l if i>k]
s=s+str(len(l1))
print(s)
```
No
| 26,934 | [
0.4736328125,
-0.113037109375,
-0.1065673828125,
0.0264892578125,
-0.60791015625,
-0.6884765625,
-0.05731201171875,
0.3349609375,
-0.01181793212890625,
0.857421875,
0.6181640625,
0.0029754638671875,
0.15087890625,
-0.708984375,
-0.2388916015625,
-0.374267578125,
-0.347900390625,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
n=int(input())
ls=list(map(int,input().split()))
ls=sorted(ls)
for x in ls:
print(ls[::-1].index(x)+1,end=" ")
```
No
| 26,935 | [
0.464111328125,
-0.124755859375,
-0.143310546875,
0.0285797119140625,
-0.56103515625,
-0.66162109375,
-0.08502197265625,
0.377685546875,
0.00954437255859375,
0.880859375,
0.5908203125,
-0.021026611328125,
0.175537109375,
-0.74072265625,
-0.26416015625,
-0.345458984375,
-0.36865234375... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.
He thinks that each student will take place equal to <image>. In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.
GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.
Input
The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.
The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).
Output
In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.
Examples
Input
3
1 3 3
Output
3 1 1
Input
1
1
Output
1
Input
5
3 5 3 4 5
Output
4 1 4 3 1
Note
In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.
In the second sample, first student is the only one on the contest.
In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.
Submitted Solution:
```
def function(array,r,output):
if r>=len(output):
print(*output)
return
q = array.count(max(array))
for _ in range(q):
output[output.index(max(array))] = 1 + r
del array[array.index(max(array))]
r+=q
function(array,r,output)
n = int(input())
st = list(map(int,input().split()))
out = st
function(st,0,st[:])
```
No
| 26,936 | [
0.400146484375,
-0.1279296875,
-0.11968994140625,
0.089111328125,
-0.59033203125,
-0.7158203125,
-0.09918212890625,
0.357666015625,
0.018280029296875,
0.87646484375,
0.6279296875,
-0.0248260498046875,
0.1583251953125,
-0.6826171875,
-0.29541015625,
-0.357666015625,
-0.38623046875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
from sys import stdin, stdout
def main():
T = int(stdin.readline())
for zzz in range(T):
arr = list(map(int, stdin.readline().split()))
n,m,k = arr
item = list(map(int, stdin.readline().split()))
if m <= k:
k = m - 1
luck = m - k - 1
maxer = 0
for i in range(k+1):
left = i
right = n - k + i - 1
temp_min = 99999999999
for j in range(luck+1):
left2 = j
right2 = luck - j
temp_max = max(item[left + left2], item[right - right2])
temp_min = min(temp_min, temp_max)
if maxer == 0:
maxer = temp_min
else:
maxer = max(maxer, temp_min)
stdout.write(str(maxer)+"\n")
main()
```
Yes
| 27,553 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
t = int(input())
for ti in range(t):
n,m,k = input().split()
n = int(n)
m = int(m)
k = int(k)
a = input().split()
for i in range(n):
a[i] = int(a[i])
if m <= k+1:
# all under control
b = a[:m]+a[-m:]
print(str(max(b)))
else:
notcontrol = m - k - 1
allans = []
for j in range(k+1):
if j == k:
newa = a[j:]
else:
newa = a[j:-k+j]
# while k > 0:
# if a[0] < a[-1]:
# a = a[1:]
# else:
# a = a[:-1]
# k -= 1
# if lol =ue
rang = notcontrol+1
b = newa[:rang]+newa[-rang:]
allpairs = []
for i in range(rang):
if b[i] > b[i+rang]:
allpairs.append(b[i])
else:
allpairs.append(b[i+rang])
ans = min(allpairs)
allans.append(ans)
print(str(max(allans)))
```
Yes
| 27,554 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
import sys
import math
import heapq
import collections
def inputnum():
return(int(input()))
def inputnums():
return(map(int,input().split()))
def inputlist():
return(list(map(int,input().split())))
def inputstring():
return([x for x in input()])
def inputstringnum():
return([ord(x)-ord('a') for x in input()])
def inputmatrixchar(rows):
arr2d = [[j for j in input().strip()] for i in range(rows)]
return arr2d
def inputmatrixint(rows):
arr2d = []
for _ in range(rows):
arr2d.append([int(i) for i in input().split()])
return arr2d
t = int(input())
for q in range(t):
n, m, k = inputnums()
a = inputlist()
m -= 1
if k > m-1:
k = m
ans = 0
for r in range(k+1):
l = k-r
mn = 1000000001
for j in range(l, m-r+1):
mn = min(mn, max(a[j], a[n-1-(m-j)]))
ans = max(ans, mn)
print(ans)
```
Yes
| 27,555 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
from collections import defaultdict, deque, Counter
from bisect import *
from math import sqrt, pi, ceil, log, inf,gcd
from itertools import permutations
from copy import deepcopy
from heapq import *
def main():
for _ in range(int(input())):
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
if k >= m - 1:
print(max(max(a[:m]), max(a[-m:])))
else:
ma = 0
for i in range(k + 1):
mi, z = inf, m - k - 1
for j in range(z + 1):
mi = min(mi, max(a[i + j], a[n - k - 1 - z + j + i]))
ma = max(ma, mi)
print(ma)
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
if __name__ == "__main__":
main()
```
Yes
| 27,556 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
for _ in range(int(input())):
n,m,k=map(int, input().split())
a=list(map(int, input().split()))
k=min(m-1,k)
ans=0
for i in range(k+1):
curr = 1000000
for j in range(m-1-k+1):
curr=min(curr, max(a[i+j],a[i+j+n-m]))
ans=max(ans, curr)
print(ans)
```
No
| 27,557 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class SegmentTree():
# to par: (n-1) // 2
# to chr: 2n+1, 2n+2
def __init__(self, N, operator, identity_element):
""" operator and identity_element has to be a monoid.
"""
self.__N = 2**int(math.ceil(math.log(N, 2)))
self.__table = [identity_element] * (self.__N * 2 - 1)
self.__op = operator
self.__ie = identity_element
def update(self, idx, x):
i = self.__N - 1 + idx # target leaf
t = self.__table
o = self.__op
t[i] = x
while i != 0:
pi = (i - 1) // 2 # parent
li = 2*pi + 1
ri = 2*pi + 2
v = o(t[li], t[ri])
if t[pi] != v:
t[pi] = v
else:
break
i = pi
def query(self, a, b):
# error_print(a, b)
stack = [(0, 0, self.__N)]
t = self.__table
o = self.__op
ans = self.__ie
c = 0
while stack:
c += 1
k, l, r = stack.pop()
cnd = t[k]
if a <= l and r <= b:
ans = o(ans, cnd)
else:
if (l + r) // 2 > a and b > l:
stack.append((2 * k + 1, l, (l + r) // 2))
if r > a and b > (l + r) // 2:
stack.append((2 * k + 2, (l + r) // 2, r))
return ans
def print(self):
print(self.__table)
def slv(N, M, K, A):
K = min(M-1, K)
R = M - K - 1
st = SegmentTree(N, min, INF)
for i, a in enumerate(A):
st.update(i, a)
ans = -1
if R != 0:
for i in range(K+1):
l = st.query(i, i+R)
r = st.query(N-(K-i)-R, N-(K-i))
ans = max(ans, min(l, r))
else:
for i in range(K+1):
ans = max(ans, min(A[i], A[N-(K-i)-1]))
return ans
def main():
T = read_int()
for _ in range(T):
N, M, K = read_int_n()
A = read_int_n()
print(slv(N, M, K, A))
# N = 3500
# M = 3000
# K = 2000
# A = [random.randint(0, 10**9) for _ in range(N)]
# print(slv(N, M, K, A))
if __name__ == '__main__':
main()
```
No
| 27,558 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
t=int(input())
while t>0:
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
x=0
if m-k-1>0:
for i in range(k+1):
bad=99999
for j in range(m-k):
bad=min(bad,max(a[m-1-i-j],a[n-1-i-j]))
x=max(x,bad)
else:
for i in range(m):
x=max(a[m-1-i],a[n-1-i])
print(x)
t-=1
```
No
| 27,559 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your n - 1 friends have found an array of integers a_1, a_2, ..., a_n. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.
You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.
Suppose that you're doing your choices optimally. What is the greatest integer x such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to x?
Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.
Input
The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three space-separated integers n, m and k (1 ≤ m ≤ n ≤ 3500, 0 ≤ k ≤ n - 1) — the number of elements in the array, your position in line and the number of people whose choices you can fix.
The second line of each test case contains n positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 3500.
Output
For each test case, print the largest integer x such that you can guarantee to obtain at least x.
Example
Input
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2
Output
8
4
1
1
Note
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.
* the first person will take the last element (5) because he or she was forced by you to take the last element. After this turn the remaining array will be [2, 9, 2, 3, 8];
* the second person will take the first element (2) because he or she was forced by you to take the first element. After this turn the remaining array will be [9, 2, 3, 8];
* if the third person will choose to take the first element (9), at your turn the remaining array will be [2, 3, 8] and you will take 8 (the last element);
* if the third person will choose to take the last element (8), at your turn the remaining array will be [9, 2, 3] and you will take 9 (the first element).
Thus, this strategy guarantees to end up with at least 8. We can prove that there is no strategy that guarantees to end up with at least 9. Hence, the answer is 8.
In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with 4.
Submitted Solution:
```
for i in range(int(input())):
n, m, k = map(int, input().split())
a, ans = list(map(int, input().split())), 0
if m == 1:
print(max(a[0], a[-1]))
continue
if k == 0:
tem = float('inf')
for c in range(m):
tem = min(tem, max(a[c], a[m - (m - c)]))
print(tem)
continue
if k >= m:
k = m - 1
for j in range(k + 1):
for z in range(n - 1, n - k - 2 + j, -1):
num = m - (n - (z - j))
# print(j, z, num)
tem = float('inf')
for c in range(j, j + num + 1):
tem = min(tem, max(a[c], a[z - num]))
# print(a[c], a[z - num])
num -= 1
ans = max(tem, ans)
print(ans)
```
No
| 27,560 | [
0.4169921875,
-0.0266876220703125,
-0.0178680419921875,
0.3642578125,
-0.63427734375,
-0.75537109375,
-0.1129150390625,
0.2783203125,
0.311279296875,
0.72705078125,
0.888671875,
-0.2188720703125,
0.375732421875,
-0.54833984375,
-0.62109375,
-0.0211639404296875,
-1.0029296875,
-0.79... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently a serious bug has been found in the FOS code. The head of the F company wants to find the culprit and punish him. For that, he set up an organizational meeting, the issue is: who's bugged the code? Each of the n coders on the meeting said: 'I know for sure that either x or y did it!'
The head of the company decided to choose two suspects and invite them to his office. Naturally, he should consider the coders' opinions. That's why the head wants to make such a choice that at least p of n coders agreed with it. A coder agrees with the choice of two suspects if at least one of the two people that he named at the meeting was chosen as a suspect. In how many ways can the head of F choose two suspects?
Note that even if some coder was chosen as a suspect, he can agree with the head's choice if he named the other chosen coder at the meeting.
Input
The first line contains integers n and p (3 ≤ n ≤ 3·105; 0 ≤ p ≤ n) — the number of coders in the F company and the minimum number of agreed people.
Each of the next n lines contains two integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of coders named by the i-th coder. It is guaranteed that xi ≠ i, yi ≠ i, xi ≠ yi.
Output
Print a single integer — the number of possible two-suspect sets. Note that the order of the suspects doesn't matter, that is, sets (1, 2) and (2, 1) are considered identical.
Examples
Input
4 2
2 3
1 4
1 4
2 1
Output
6
Input
8 6
5 6
5 7
5 8
6 2
2 1
7 3
1 3
1 4
Output
1
Submitted Solution:
```
from collections import defaultdict
from bisect import bisect_left as lower
import sys
input = sys.stdin.readline
def put():
return map(int, input().split())
try:
n,m = put()
cnt, mp = [0]*n, defaultdict()
for _ in range(n):
x,y = put()
x,y = x-1,y-1
key = (min(x,y), max(x,y))
if key in mp:
mp[key]+=1
else:
mp[key]=1
cnt[x]+=1
cnt[y]+=1
for (x,y),val in mp.items():
if cnt[x]+cnt[y]>= m and cnt[x]+cnt[y]-val<m:
ans[x]-=1
ans[y]-=1
except:
print('lol')
scnt,ans = cnt.copy(), [0]*n
scnt.sort()
for i in range(n):
ans[i]+= n-lower(scnt, m-cnt[i])
if 2*cnt[i]>=m:
ans[i]-=1
print(sum(ans)//2)
```
No
| 27,815 | [
0.105712890625,
-0.346923828125,
-0.0170745849609375,
0.12054443359375,
-0.85986328125,
-0.619140625,
-0.23779296875,
0.169677734375,
0.0794677734375,
0.83203125,
0.83154296875,
-0.0269775390625,
0.609375,
-0.4287109375,
-0.6689453125,
-0.051910400390625,
-0.609375,
-0.6904296875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently a serious bug has been found in the FOS code. The head of the F company wants to find the culprit and punish him. For that, he set up an organizational meeting, the issue is: who's bugged the code? Each of the n coders on the meeting said: 'I know for sure that either x or y did it!'
The head of the company decided to choose two suspects and invite them to his office. Naturally, he should consider the coders' opinions. That's why the head wants to make such a choice that at least p of n coders agreed with it. A coder agrees with the choice of two suspects if at least one of the two people that he named at the meeting was chosen as a suspect. In how many ways can the head of F choose two suspects?
Note that even if some coder was chosen as a suspect, he can agree with the head's choice if he named the other chosen coder at the meeting.
Input
The first line contains integers n and p (3 ≤ n ≤ 3·105; 0 ≤ p ≤ n) — the number of coders in the F company and the minimum number of agreed people.
Each of the next n lines contains two integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of coders named by the i-th coder. It is guaranteed that xi ≠ i, yi ≠ i, xi ≠ yi.
Output
Print a single integer — the number of possible two-suspect sets. Note that the order of the suspects doesn't matter, that is, sets (1, 2) and (2, 1) are considered identical.
Examples
Input
4 2
2 3
1 4
1 4
2 1
Output
6
Input
8 6
5 6
5 7
5 8
6 2
2 1
7 3
1 3
1 4
Output
1
Submitted Solution:
```
n, p = map(int, input().split())
coders = [0] * n
ans = 0
for _ in range(n):
a, b = map(int, input().split())
coders[a - 1] += 1
coders[b - 1] += 1
candidate_amount = sum(1 for c in coders if c >= p)
if candidate_amount:
for i in range(n):
if coders[i] >= p:
candidate_amount -= 1
ans += n - 1 - i
else:
ans += candidate_amount
else:
m = coders.count(max(coders))
if m > 1:
ans = m * (m - 1) // 2
else:
coders.remove(max(coders))
ans = coders.count(max(coders))
print(ans)
```
No
| 27,816 | [
0.235107421875,
-0.379150390625,
-0.11163330078125,
0.054168701171875,
-0.70751953125,
-0.66064453125,
-0.163818359375,
0.304443359375,
0.09991455078125,
0.71875,
0.88671875,
0.0022411346435546875,
0.6259765625,
-0.302978515625,
-0.5625,
0.050445556640625,
-0.53857421875,
-0.629394... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently a serious bug has been found in the FOS code. The head of the F company wants to find the culprit and punish him. For that, he set up an organizational meeting, the issue is: who's bugged the code? Each of the n coders on the meeting said: 'I know for sure that either x or y did it!'
The head of the company decided to choose two suspects and invite them to his office. Naturally, he should consider the coders' opinions. That's why the head wants to make such a choice that at least p of n coders agreed with it. A coder agrees with the choice of two suspects if at least one of the two people that he named at the meeting was chosen as a suspect. In how many ways can the head of F choose two suspects?
Note that even if some coder was chosen as a suspect, he can agree with the head's choice if he named the other chosen coder at the meeting.
Input
The first line contains integers n and p (3 ≤ n ≤ 3·105; 0 ≤ p ≤ n) — the number of coders in the F company and the minimum number of agreed people.
Each of the next n lines contains two integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of coders named by the i-th coder. It is guaranteed that xi ≠ i, yi ≠ i, xi ≠ yi.
Output
Print a single integer — the number of possible two-suspect sets. Note that the order of the suspects doesn't matter, that is, sets (1, 2) and (2, 1) are considered identical.
Examples
Input
4 2
2 3
1 4
1 4
2 1
Output
6
Input
8 6
5 6
5 7
5 8
6 2
2 1
7 3
1 3
1 4
Output
1
Submitted Solution:
```
__author__ = 'Lipen'
def main():
n, p = map(int, input().split())
votes = [0]*n
for _ in range(n):
x, y = map(int, input().split())
votes[x-1] += 1
votes[y-1] += 1
k = 0
for i in range(n):
for j in range(i+1, n):
if votes[i] + votes[j] >= p:
k += 1
print(k)
main()
```
No
| 27,817 | [
0.2998046875,
-0.3701171875,
-0.1114501953125,
0.020172119140625,
-0.736328125,
-0.61962890625,
-0.20166015625,
0.2734375,
0.06536865234375,
0.80078125,
0.779296875,
0.0936279296875,
0.6201171875,
-0.332275390625,
-0.59375,
-0.005542755126953125,
-0.5859375,
-0.6435546875,
-0.139... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently a serious bug has been found in the FOS code. The head of the F company wants to find the culprit and punish him. For that, he set up an organizational meeting, the issue is: who's bugged the code? Each of the n coders on the meeting said: 'I know for sure that either x or y did it!'
The head of the company decided to choose two suspects and invite them to his office. Naturally, he should consider the coders' opinions. That's why the head wants to make such a choice that at least p of n coders agreed with it. A coder agrees with the choice of two suspects if at least one of the two people that he named at the meeting was chosen as a suspect. In how many ways can the head of F choose two suspects?
Note that even if some coder was chosen as a suspect, he can agree with the head's choice if he named the other chosen coder at the meeting.
Input
The first line contains integers n and p (3 ≤ n ≤ 3·105; 0 ≤ p ≤ n) — the number of coders in the F company and the minimum number of agreed people.
Each of the next n lines contains two integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of coders named by the i-th coder. It is guaranteed that xi ≠ i, yi ≠ i, xi ≠ yi.
Output
Print a single integer — the number of possible two-suspect sets. Note that the order of the suspects doesn't matter, that is, sets (1, 2) and (2, 1) are considered identical.
Examples
Input
4 2
2 3
1 4
1 4
2 1
Output
6
Input
8 6
5 6
5 7
5 8
6 2
2 1
7 3
1 3
1 4
Output
1
Submitted Solution:
```
import itertools
n, p = tuple(map(int, str.split(input())))
c = [0] * n
for _ in range(n):
for i in tuple(map(int, str.split(input()))):
c[i - 1] += 1
count = 0
for i, j in itertools.combinations(range(n), 2):
if c[i] + c[j] >= p:
count += 1
print(count)
```
No
| 27,818 | [
0.2305908203125,
-0.493896484375,
-0.11419677734375,
0.052703857421875,
-0.7900390625,
-0.8076171875,
-0.2568359375,
0.2109375,
0.0828857421875,
0.77294921875,
0.79345703125,
-0.0002200603485107422,
0.63134765625,
-0.26953125,
-0.55859375,
-0.001529693603515625,
-0.58935546875,
-0.... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Examples
Input
3 3
1 0 5
2 2 3
4 2 4
Output
21
Input
6 6
1 2 3 4 5 6
8 6 9 1 2 0
3 1 4 1 5 9
2 6 5 3 5 8
1 4 1 4 2 1
2 7 1 8 2 8
Output
97
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from heapq import heappop, heappush
import itertools
"""
・最小費用流。流量2を流せばよい。
・頂点xをx_in,x_outに拡張。x_inからx_outにcapacity1で、価値 a と 0 の辺を貼る
・このままだと最大化問題になっているので、辺のコストをX - a_{ij}とする感じで
"""
class MinCostFlow:
"""
最小費用流。負辺がないと仮定して、BellmanFordを省略している。
"""
def __init__(self, N, source, sink):
self.N = N
self.G = [[] for _ in range(N)]
self.source = source
self.sink = sink
def add_edge(self, fr, to, cap, cost):
n1 = len(self.G[fr])
n2 = len(self.G[to])
self.G[fr].append([to, cap, cost, n2])
self.G[to].append([fr, 0, -cost, n1])
def MinCost(self, flow, negative_edge = False):
if negative_edge:
raise ValueError
N = self.N; G = self.G; source = self.source; sink = self.sink
INF = 10 ** 18
prev_v = [0] * N; prev_e = [0] * N # 経路復元用
H = [0] * N # potential
mincost=0
while flow:
dist=[INF] * N
dist[source]=0
q = [source]
mask = (1 << 20) - 1
while q:
x = heappop(q)
dv = (x >> 20); v = x & mask
if dist[v] < dv:
continue
if v == sink:
break
for i,(w,cap,cost,rev) in enumerate(G[v]):
dw = dist[v] + cost + H[v] - H[w]
if (not cap) or (dist[w] <= dw):
continue
dist[w] = dw
prev_v[w] = v; prev_e[w] = i
heappush(q, (dw << 20) + w)
if dist[sink] == INF:
raise Exception('No Flow Exists')
# ポテンシャルの更新
for v,d in enumerate(dist):
H[v] += d
# 流せる量を取得する
d = flow; v = sink
while v != source:
pv = prev_v[v]; pe = prev_e[v]
cap = G[pv][pe][1]
if d > cap:
d = cap
v = pv
# 流す
mincost += d * H[sink]
flow -= d
v = sink
while v != source:
pv = prev_v[v]; pe = prev_e[v]
G[pv][pe][1] -= d
rev = G[pv][pe][3]
G[v][rev][1] += d
v = pv
return mincost
H,W = map(int,readline().split())
A = list(map(int,read().split()))
N = 2 * H * W + 2
source = N-2; sink = N-1
G = MinCostFlow(N,source,sink)
add = G.add_edge
X = 10 ** 6
# スタート地点
add(fr=source, to=0, cap=2, cost=0)
# ゴール
add(2*H*W-1, sink, 2, 0)
# x_in to x_out
for x,a in enumerate(A):
add(x+x,x+x+1,1,X) # とらない
add(x+x,x+x+1,1,X - a) # とる
# 左から右への辺
for i,j in itertools.product(range(H),range(W-1)):
x = W * i + j; y = x + 1
add(x+x+1,y+y,1,0)
# 上から下への辺
for i,j in itertools.product(range(H-1),range(W)):
x = W * i + j; y = x + W
add(x+x+1,y+y,1,0)
cost = G.MinCost(2)
# 1点通るごとに、X - costになっている。2人合わせて、(H+W-1) * 2個のXが足されている
answer = 2 * (H+W-1) * X -cost
print(answer)
```
| 28,146 | [
0.095458984375,
0.1546630859375,
-0.07452392578125,
0.16455078125,
-0.88720703125,
-0.39599609375,
-0.291015625,
0.389892578125,
0.349853515625,
0.493408203125,
0.39697265625,
-0.1668701171875,
0.51708984375,
-0.970703125,
-0.381591796875,
0.2127685546875,
-0.6083984375,
-0.5029296... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Examples
Input
3 3
1 0 5
2 2 3
4 2 4
Output
21
Input
6 6
1 2 3 4 5 6
8 6 9 1 2 0
3 1 4 1 5 9
2 6 5 3 5 8
1 4 1 4 2 1
2 7 1 8 2 8
Output
97
"Correct Solution:
```
H,W = map(int,input().split())
src = [list(map(int,input().split())) for i in range(H)]
dp = [[[0 for ex in range(W)] for sx in range(W)] for xy in range(H+W-1)]
dp[0][0][0] = src[0][0]
for xy in range(H+W-2):
n = min(xy+1,H,W,H+W-xy-1)
sx0 = max(0,xy-H+1)
for sx in range(sx0, sx0+n):
for ex in range(sx, sx0+n):
sy,ey = xy-sx, xy-ex
if sx < W-1 and ex < W-1:
gain = src[sy][sx+1]
if sx+1 != ex+1: gain += src[ey][ex+1]
if dp[xy+1][sx+1][ex+1] < dp[xy][sx][ex] + gain:
dp[xy+1][sx+1][ex+1] = dp[xy][sx][ex] + gain
if sx < W-1 and ey < H-1:
gain = src[sy][sx+1]
if sx+1 != ex: gain += src[ey+1][ex]
if dp[xy+1][sx+1][ex] < dp[xy][sx][ex] + gain:
dp[xy+1][sx+1][ex] = dp[xy][sx][ex] + gain
if sy < H-1 and ex < W-1:
gain = src[sy+1][sx]
if sx != ex+1: gain += src[ey][ex+1]
if dp[xy+1][sx][ex+1] < dp[xy][sx][ex] + gain:
dp[xy+1][sx][ex+1] = dp[xy][sx][ex] + gain
if sy < H-1 and ey < H-1:
gain = src[sy+1][sx]
if sx != ex: gain += src[ey+1][ex]
if dp[xy+1][sx][ex] < dp[xy][sx][ex] + gain:
dp[xy+1][sx][ex] = dp[xy][sx][ex] + gain
print(dp[-1][-1][-1])
```
| 28,147 | [
0.095458984375,
0.1546630859375,
-0.07452392578125,
0.16455078125,
-0.88720703125,
-0.39599609375,
-0.291015625,
0.389892578125,
0.349853515625,
0.493408203125,
0.39697265625,
-0.1668701171875,
0.51708984375,
-0.970703125,
-0.381591796875,
0.2127685546875,
-0.6083984375,
-0.5029296... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Examples
Input
3 3
1 0 5
2 2 3
4 2 4
Output
21
Input
6 6
1 2 3 4 5 6
8 6 9 1 2 0
3 1 4 1 5 9
2 6 5 3 5 8
1 4 1 4 2 1
2 7 1 8 2 8
Output
97
Submitted Solution:
```
H, W = map(int, input().split())
A = [list(map(int, input().split())) for i in range(H)]
if H == 1 or W == 1:
print(sum(map(sum, A)))
exit(0)
memo = [{} for i in range(W+H)]
def calc(c, p, q):
yield 0
if c+1-H < p:
yield dfs(c+1, p, q)
if q+1 < W:
yield dfs(c+1, p, q+1)
if p+1 < q:
yield dfs(c+1, p+1, q)
if q+1 < W:
yield dfs(c+1, p+1, q+1)
def dfs(c, p, q):
mc = memo[c]
if (p, q) in mc:
return mc[p, q]
mc[p, q] = r = max(calc(c, p, q)) + A[c-p][p] + A[c-q][q]
return r
print(dfs(1, 0, 1) + A[0][0] + A[-1][-1])
```
No
| 28,148 | [
0.1925048828125,
0.1927490234375,
-0.040130615234375,
0.146484375,
-0.904296875,
-0.28662109375,
-0.31884765625,
0.4091796875,
0.263427734375,
0.5361328125,
0.320068359375,
-0.12408447265625,
0.381591796875,
-0.89013671875,
-0.348388671875,
0.13330078125,
-0.5595703125,
-0.48388671... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Examples
Input
3 3
1 0 5
2 2 3
4 2 4
Output
21
Input
6 6
1 2 3 4 5 6
8 6 9 1 2 0
3 1 4 1 5 9
2 6 5 3 5 8
1 4 1 4 2 1
2 7 1 8 2 8
Output
97
Submitted Solution:
```
H, W = map(int, input().split())
A = [list(map(int, input().split())) for i in range(H)]
memo = {(W+H-2, H-2, H-1): 0}
def dfs(c, p, q):
if (c, p, q) in memo:
return memo[c, p, q]
res = 0
if c+1-W < p < q < H:
res = max(res, dfs(c+1, p, q))
if c+1-W < p+1 < q < H:
res = max(res, dfs(c+1, p+1, q))
if c+1-W < p < q+1 < H:
res = max(res, dfs(c+1, p, q+1))
if c+1-W < p+1 < q+1 < H:
res = max(res, dfs(c+1, p+1, q+1))
memo[c, p, q] = res = res + A[c-p][p] + A[c-q][q]
return res
print(dfs(1, 0, 1) + A[0][0] + A[-1][-1])
```
No
| 28,149 | [
0.1925048828125,
0.1927490234375,
-0.040130615234375,
0.146484375,
-0.904296875,
-0.28662109375,
-0.31884765625,
0.4091796875,
0.263427734375,
0.5361328125,
0.320068359375,
-0.12408447265625,
0.381591796875,
-0.89013671875,
-0.348388671875,
0.13330078125,
-0.5595703125,
-0.48388671... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Examples
Input
3 3
1 0 5
2 2 3
4 2 4
Output
21
Input
6 6
1 2 3 4 5 6
8 6 9 1 2 0
3 1 4 1 5 9
2 6 5 3 5 8
1 4 1 4 2 1
2 7 1 8 2 8
Output
97
Submitted Solution:
```
H, W = map(int, input().split())
A = [list(map(int, input().split())) for i in range(H)]
if H <= 2 or W <= 2:
print(sum(map(sum, A)))
exit(0)
def solve(A, W, H):
S = {(0, 1): 0}
for c in range(1, H-1):
T = {}
for p, q in S:
v = S[p, q] + A[c-p][p] + A[c-q][q]
T[p, q] = max(T.get((p, q), 0), v)
if p+1 < q:
T[p+1, q] = max(T.get((p+1, q), 0), v)
if q+1 < W:
T[p, q+1] = max(T.get((p, q+1), 0), v)
T[p+1, q+1] = max(T.get((p+1, q+1), 0), v)
S = T
print(c, S)
return S
B = [e[::-1] for e in A[::-1]]
S0 = solve(A, W, H)
S1 = solve(B, H, W)
print(A[0][0] + A[-1][-1] + max(S0[p, q] + S1[H-1-q, H-1-p] + A[H-1-p][p] + A[H-1-q][q] for p, q in S0))
```
No
| 28,150 | [
0.1925048828125,
0.1927490234375,
-0.040130615234375,
0.146484375,
-0.904296875,
-0.28662109375,
-0.31884765625,
0.4091796875,
0.263427734375,
0.5361328125,
0.320068359375,
-0.12408447265625,
0.381591796875,
-0.89013671875,
-0.348388671875,
0.13330078125,
-0.5595703125,
-0.48388671... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Output
* Print the maximum number of souvenirs they can get.
Constraints
* $1 \le H, W \le 200$
* $0 \le a_{i, j} \le 10^5$
Subtasks
Subtask 1 [ 50 points ]
* The testcase in the subtask satisfies $1 \le H \le 2$.
Subtask 2 [ 80 points ]
* The testcase in the subtask satisfies $1 \le H \le 3$.
Subtask 3 [ 120 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 7$.
Subtask 4 [ 150 points ]
* The testcase in the subtask satisfies $1 \le H, W \le 30$.
Subtask 5 [ 200 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $H \ W$ $a_{1, 1} \ a_{1, 2} \ \cdots \ a_{1, W}$ $a_{2, 1} \ a_{2, 2} \ \cdots \ a_{2, W}$ $\vdots \ \ \ \ \ \ \ \ \ \ \vdots \ \ \ \ \ \ \ \ \ \ \vdots$ $a_{H, 1} \ a_{H, 2} \ \cdots \ a_{H, W}$
Examples
Input
3 3
1 0 5
2 2 3
4 2 4
Output
21
Input
6 6
1 2 3 4 5 6
8 6 9 1 2 0
3 1 4 1 5 9
2 6 5 3 5 8
1 4 1 4 2 1
2 7 1 8 2 8
Output
97
Submitted Solution:
```
#tle -solution
import copy
def main():
H,W = map(int,input().split())
data = [[0]+list(map(int,input().split())) for i in range(H)]
a = copy.deepcopy(data)
for i in range(H):
for j in range(1,W+1):
data[i][j] += data[i][j-1]
#dp[height][left][right] assert 1<=height<=H, 1<=left<right<=W
dp = [[[0]*(W+1) for j in range(W+1)] for i in range(H+1)]
#initializaton : height is 1.
for i in range(1,W+1):
for j in range(i,W+1):
dp[1][i][j] =data[0][j]
for height in range(2,H+1):
for i in range(1,W+1):
for j in range(i+1,W+1):
dp[height][i][j] = max(max(dp[height-1][i][k] +data[height-1][j]-data[height-1][k-1] for k in range(i+1,j+1))+a[height-1][i],dp[height][i][j])
dp[height][i][j] = max(max(dp[height-1][l][j]+data[height-1][i]-data[height-1][l-1] for l in range(1,i+1))+a[height-1][j],dp[height][i][j])
if i > 1:
dp[height][i][j] = max(dp[height][i-1][j],dp[height][i][j-1],dp[height][i][j])
ans = max(dp[H][i][i+1]+data[-1][W] -data[-1][i+1] for i in range(1,W))
print(ans)
return
if __name__ == "__main__":
main()
```
No
| 28,151 | [
0.1925048828125,
0.1927490234375,
-0.040130615234375,
0.146484375,
-0.904296875,
-0.28662109375,
-0.31884765625,
0.4091796875,
0.263427734375,
0.5361328125,
0.320068359375,
-0.12408447265625,
0.381591796875,
-0.89013671875,
-0.348388671875,
0.13330078125,
-0.5595703125,
-0.48388671... | 11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.