message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 219 108k | cluster float64 11 11 | __index_level_0__ int64 438 217k |
|---|---|---|---|---|---|
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 incr... | instruction | 0 | 25,247 | 11 | 50,494 |
Yes | output | 1 | 25,247 | 11 | 50,495 |
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 incr... | instruction | 0 | 25,248 | 11 | 50,496 |
No | output | 1 | 25,248 | 11 | 50,497 |
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 incr... | instruction | 0 | 25,249 | 11 | 50,498 |
No | output | 1 | 25,249 | 11 | 50,499 |
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 incr... | instruction | 0 | 25,250 | 11 | 50,500 |
No | output | 1 | 25,250 | 11 | 50,501 |
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 incr... | instruction | 0 | 25,251 | 11 | 50,502 |
No | output | 1 | 25,251 | 11 | 50,503 |
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`, `... | instruction | 0 | 25,425 | 11 | 50,850 |
Yes | output | 1 | 25,425 | 11 | 50,851 |
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`, `... | instruction | 0 | 25,426 | 11 | 50,852 |
Yes | output | 1 | 25,426 | 11 | 50,853 |
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`, `... | instruction | 0 | 25,427 | 11 | 50,854 |
Yes | output | 1 | 25,427 | 11 | 50,855 |
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`, `... | instruction | 0 | 25,428 | 11 | 50,856 |
Yes | output | 1 | 25,428 | 11 | 50,857 |
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`, `... | instruction | 0 | 25,429 | 11 | 50,858 |
No | output | 1 | 25,429 | 11 | 50,859 |
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 = predecesso... | instruction | 0 | 25,571 | 11 | 51,142 |
Yes | output | 1 | 25,571 | 11 | 51,143 |
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,... | instruction | 0 | 25,572 | 11 | 51,144 |
Yes | output | 1 | 25,572 | 11 | 51,145 |
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 ... | instruction | 0 | 25,574 | 11 | 51,148 |
Yes | output | 1 | 25,574 | 11 | 51,149 |
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 ... | instruction | 0 | 25,575 | 11 | 51,150 |
No | output | 1 | 25,575 | 11 | 51,151 |
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 ... | instruction | 0 | 25,576 | 11 | 51,152 |
No | output | 1 | 25,576 | 11 | 51,153 |
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 ... | instruction | 0 | 25,577 | 11 | 51,154 |
No | output | 1 | 25,577 | 11 | 51,155 |
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... | instruction | 0 | 25,578 | 11 | 51,156 |
No | output | 1 | 25,578 | 11 | 51,157 |
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... | instruction | 0 | 25,731 | 11 | 51,462 |
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+r... | output | 1 | 25,731 | 11 | 51,463 |
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... | instruction | 0 | 25,732 | 11 | 51,464 |
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(sudo... | output | 1 | 25,732 | 11 | 51,465 |
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... | instruction | 0 | 25,733 | 11 | 51,466 |
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... | output | 1 | 25,733 | 11 | 51,467 |
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... | instruction | 0 | 25,734 | 11 | 51,468 |
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]))
``` | output | 1 | 25,734 | 11 | 51,469 |
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... | instruction | 0 | 25,735 | 11 | 51,470 |
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(... | output | 1 | 25,735 | 11 | 51,471 |
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... | instruction | 0 | 25,736 | 11 | 51,472 |
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)
... | output | 1 | 25,736 | 11 | 51,473 |
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... | instruction | 0 | 25,737 | 11 | 51,474 |
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
``` | output | 1 | 25,737 | 11 | 51,475 |
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... | instruction | 0 | 25,738 | 11 | 51,476 |
Yes | output | 1 | 25,738 | 11 | 51,477 |
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... | instruction | 0 | 25,739 | 11 | 51,478 |
Yes | output | 1 | 25,739 | 11 | 51,479 |
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... | instruction | 0 | 25,740 | 11 | 51,480 |
Yes | output | 1 | 25,740 | 11 | 51,481 |
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... | instruction | 0 | 25,741 | 11 | 51,482 |
Yes | output | 1 | 25,741 | 11 | 51,483 |
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... | instruction | 0 | 25,742 | 11 | 51,484 |
No | output | 1 | 25,742 | 11 | 51,485 |
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... | instruction | 0 | 25,743 | 11 | 51,486 |
No | output | 1 | 25,743 | 11 | 51,487 |
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... | instruction | 0 | 25,744 | 11 | 51,488 |
No | output | 1 | 25,744 | 11 | 51,489 |
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... | instruction | 0 | 25,745 | 11 | 51,490 |
No | output | 1 | 25,745 | 11 | 51,491 |
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 ... | instruction | 0 | 25,806 | 11 | 51,612 |
Yes | output | 1 | 25,806 | 11 | 51,613 |
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 ... | instruction | 0 | 25,807 | 11 | 51,614 |
Yes | output | 1 | 25,807 | 11 | 51,615 |
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 ... | instruction | 0 | 25,808 | 11 | 51,616 |
Yes | output | 1 | 25,808 | 11 | 51,617 |
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 ... | instruction | 0 | 25,809 | 11 | 51,618 |
Yes | output | 1 | 25,809 | 11 | 51,619 |
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 ... | instruction | 0 | 25,810 | 11 | 51,620 |
No | output | 1 | 25,810 | 11 | 51,621 |
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 ... | instruction | 0 | 25,811 | 11 | 51,622 |
No | output | 1 | 25,811 | 11 | 51,623 |
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 ... | instruction | 0 | 25,812 | 11 | 51,624 |
No | output | 1 | 25,812 | 11 | 51,625 |
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 ... | instruction | 0 | 25,813 | 11 | 51,626 |
No | output | 1 | 25,813 | 11 | 51,627 |
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... | instruction | 0 | 26,235 | 11 | 52,470 |
"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] :(... | output | 1 | 26,235 | 11 | 52,471 |
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... | instruction | 0 | 26,236 | 11 | 52,472 |
"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,in... | output | 1 | 26,236 | 11 | 52,473 |
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... | instruction | 0 | 26,237 | 11 | 52,474 |
"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.readl... | output | 1 | 26,237 | 11 | 52,475 |
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... | instruction | 0 | 26,238 | 11 | 52,476 |
"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)))
``` | output | 1 | 26,238 | 11 | 52,477 |
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... | instruction | 0 | 26,239 | 11 | 52,478 |
"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 ... | output | 1 | 26,239 | 11 | 52,479 |
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... | instruction | 0 | 26,240 | 11 | 52,480 |
"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(... | output | 1 | 26,240 | 11 | 52,481 |
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... | instruction | 0 | 26,241 | 11 | 52,482 |
"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()... | output | 1 | 26,241 | 11 | 52,483 |
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... | instruction | 0 | 26,242 | 11 | 52,484 |
"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]
... | output | 1 | 26,242 | 11 | 52,485 |
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, an... | instruction | 0 | 26,243 | 11 | 52,486 |
Yes | output | 1 | 26,243 | 11 | 52,487 |
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, an... | instruction | 0 | 26,244 | 11 | 52,488 |
Yes | output | 1 | 26,244 | 11 | 52,489 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.