message stringlengths 2 20.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 757 108k | cluster float64 4 4 | __index_level_0__ int64 1.51k 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,323 | 4 | 98,646 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
'''input
3 2 1
'''
b, d, s = map(int, input().split())
x = max(b, d, s)
x = x - 1
a = 0
if b < x:
a = a + x - b
if d < x:
a = a + x - d
if s < x:
a = a + x - s
print(a)
``` | output | 1 | 49,323 | 4 | 98,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,324 | 4 | 98,648 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
read = lambda: map(int, input().split())
b, d, s = read()
A = (0, 0, 0), (1, 0, 0), (1, 1, 0)
B = (0, 0, 0), (0, 0, 1), (0, 1, 1)
ans = float('inf')
for x1, y1, z1 in A:
for x2, y2, z2 in B:
x, y, z = x1 + x2, y... | output | 1 | 49,324 | 4 | 98,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,325 | 4 | 98,650 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
b,d,s=map(int,input().split())
ans=0
mx=max(b,d,s)
if(b<mx-1):
ans+=mx-1-b
if(d<mx-1):
ans+=mx-1-d
if(s<mx-1):
ans+=mx-1-s
print(ans)
``` | output | 1 | 49,325 | 4 | 98,651 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,948 | 4 | 103,896 |
"Correct Solution:
```
l=["SUN","MON","TUE","WED","THU","FRI","SAT"]
S=input()
r=7-l.index(S)
print(r)
``` | output | 1 | 51,948 | 4 | 103,897 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,949 | 4 | 103,898 |
"Correct Solution:
```
print({"SU":7,"MO":6,"TU":5,"WE":4,"TH":3,"FR":2,"SA":1}[input()[:2]])
``` | output | 1 | 51,949 | 4 | 103,899 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,950 | 4 | 103,900 |
"Correct Solution:
```
s=["SUN","MON","TUE","WED","THU","FRI","SAT"]
t=input()
print(7-s.index(t))
``` | output | 1 | 51,950 | 4 | 103,901 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,951 | 4 | 103,902 |
"Correct Solution:
```
a=input()
wday=["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-wday.index(a))
``` | output | 1 | 51,951 | 4 | 103,903 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,952 | 4 | 103,904 |
"Correct Solution:
```
S=input()
day=['SUN','MON','TUE','WED','THU','FRI','SAT']
print(7-(day.index(S)))
``` | output | 1 | 51,952 | 4 | 103,905 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,953 | 4 | 103,906 |
"Correct Solution:
```
S = {"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(S[input()])
``` | output | 1 | 51,953 | 4 | 103,907 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,954 | 4 | 103,908 |
"Correct Solution:
```
a=['SUN','MON','TUE','WED','THU','FRI','SAT']
print(7-a.index(input()))
``` | output | 1 | 51,954 | 4 | 103,909 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomor... | instruction | 0 | 51,955 | 4 | 103,910 |
"Correct Solution:
```
S=input()
print(['','SAT','FRI','THU','WED','TUE','MON','SUN'].index(S))
``` | output | 1 | 51,955 | 4 | 103,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,956 | 4 | 103,912 |
Yes | output | 1 | 51,956 | 4 | 103,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,957 | 4 | 103,914 |
Yes | output | 1 | 51,957 | 4 | 103,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,958 | 4 | 103,916 |
Yes | output | 1 | 51,958 | 4 | 103,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,959 | 4 | 103,918 |
Yes | output | 1 | 51,959 | 4 | 103,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,960 | 4 | 103,920 |
No | output | 1 | 51,960 | 4 | 103,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,961 | 4 | 103,922 |
No | output | 1 | 51,961 | 4 | 103,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,962 | 4 | 103,924 |
No | output | 1 | 51,962 | 4 | 103,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, resp... | instruction | 0 | 51,963 | 4 | 103,926 |
No | output | 1 | 51,963 | 4 | 103,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,739 | 4 | 105,478 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/pypy3
from sys import stdin,stderr
def readInts(): return map(int,stdin.readline().strip().split())
def print_err(*args,**kwargs): print(*args,file=stderr,**kwargs)
def solve(vs):
return None
def run():
n, = readInts()
a = readInts()
m, = rea... | output | 1 | 52,739 | 4 | 105,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,740 | 4 | 105,480 |
Tags: implementation
Correct Solution:
```
n = int(int(input()))
a = list(map(int,input().split()))
a = sum(a)
m = int(input())
for i in range(m):
x,y = input().split()
x,y = int(x),int(y)
if y >= a:
print(max(a,x))
break
else:
print(-1)
``` | output | 1 | 52,740 | 4 | 105,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,741 | 4 | 105,482 |
Tags: implementation
Correct Solution:
```
n = int(input())
t = sum(map(int, input().split()))
m = int(input())
possible = False
best = 1000000000
for i in range(m):
l,r = map(int, input().split())
if l <= t <= r:
possible = True
if l >= t:
best = min(best, l)
if possible:
print(t)
elif ... | output | 1 | 52,741 | 4 | 105,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,742 | 4 | 105,484 |
Tags: implementation
Correct Solution:
```
n = int(input())
time = [int(x) for x in input().split()]
m = int(input())
periods =[]
for i in range(m):
l, r = (int(x) for x in input().split())
periods.append((l, r))
summ = sum(time)
for l, r in periods:
if l <= summ and r >= summ:
print(summ)
... | output | 1 | 52,742 | 4 | 105,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,743 | 4 | 105,486 |
Tags: implementation
Correct Solution:
```
input()
s = sum(map(int, input().split()))
m = int(input())
ans = -1
for _ in range(m):
l, r = map(int, input().split())
if l >= s:
ans = l
break
if r >= s:
ans = s
break
print(ans)
``` | output | 1 | 52,743 | 4 | 105,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,744 | 4 | 105,488 |
Tags: implementation
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
s=sum(l)
q=int(input())
l=[]
for i in range(q):
l.append(list(map(int,input().split())))
ans= int(1e6)
for i in l:
if s<=i[0]:
ans=min(ans,i[0])
elif i[0]<=s<=i[1]:
ans=min(ans,s)
if ans>100000:
ans=-1
print(ans)
``` | output | 1 | 52,744 | 4 | 105,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,745 | 4 | 105,490 |
Tags: implementation
Correct Solution:
```
# cook your dish here
n=input()
l=[int(x) for x in input().split()]
s=sum(l)
m=int(input())
ans=-1
for _ in range(m):
(a,b)=input().split()
(a,b)=(int(a),int(b))
if s<=b and ans==-1:
ans=max(a,s)
print(ans)
``` | output | 1 | 52,745 | 4 | 105,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place!
This contest consists of n problems, and Pasha solves ith problem in ai time units (his sol... | instruction | 0 | 52,746 | 4 | 105,492 |
Tags: implementation
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
m = int(input())
moment = []
my = 0
for i in range(m):
a, b = map(int, input().split())
moment.append((a, b))
if b > my:
my = b
moment = sorted(moment)
total = sum(arr)
if total <= my:
for a, b in moment:
if total ... | output | 1 | 52,746 | 4 | 105,493 |
Provide a correct Python 3 solution for this coding contest problem.
Chokudai loves eating so much. However, his doctor Akensho told him that he was overweight, so he finally decided to lose his weight.
Chokudai made a slimming plan of a $D$-day cycle. It is represented by $D$ integers $w_0, ..., w_{D-1}$. His weight... | instruction | 0 | 53,894 | 4 | 107,788 |
"Correct Solution:
```
S, T, D = map(int, input().split())
S -= T
*W, = map(int, input().split())
F = sum(W)
if F >= 0:
su = S
for i, w in enumerate(W):
su += w
if su <= 0:
print(i+1)
break
else:
print(-1)
exit(0)
su = 0
mi = 0
for d in W:
su += d
... | output | 1 | 53,894 | 4 | 107,789 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,545 | 4 | 109,090 |
"Correct Solution:
```
D = int(input())
c = [int(x) for x in input().split()]
s = []
for i in range(D):
s.append([int(x) for x in input().split()])
ans = 0
nissuu = [0] * 26
for i in range(D):
t = int(input())
for j in range(26):
if j == t-1:
nissuu[j] = 0
else:
nissu... | output | 1 | 54,545 | 4 | 109,091 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,546 | 4 | 109,092 |
"Correct Solution:
```
D = int(input())
C = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(D)]
manzoku = 0
last = [-1]*26
for day in range(D):
t = int(input())-1
manzoku += S[day][t]
last[t] = day
for i in range(26):
manzoku -= C[i]*(day-last[i])
print(... | output | 1 | 54,546 | 4 | 109,093 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,547 | 4 | 109,094 |
"Correct Solution:
```
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)]
MAX = 26
last = [0] * MAX
score = 0
for day, e in enumerate(t, 1):
score += s[day-1][e-1]
last[e-1] = day
for ec, elast in zip(c, last):... | output | 1 | 54,547 | 4 | 109,095 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,548 | 4 | 109,096 |
"Correct Solution:
```
D = int(input())
c = list(map(int, input().split()))
s = []
for _ in range(D):
s.append(list(map(int, input().split())))
t = [(int(input()) - 1) for _ in range(D)]
last = [0] * 26
S = 0
for dd in range(1, D + 1):
S += s[dd - 1][t[dd - 1]]
last[t[dd - 1]] = dd
for i in range(26):... | output | 1 | 54,548 | 4 | 109,097 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,549 | 4 | 109,098 |
"Correct Solution:
```
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)]
v = 0
last = [-1 for _ in range(26)]
for d in range(D):
last[t[d]-1] = d
v += s[d][t[d]-1]
for j in range(26):
v -= c[j]*(d-last[... | output | 1 | 54,549 | 4 | 109,099 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,550 | 4 | 109,100 |
"Correct Solution:
```
import random
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)]
ans = 0
last = [0]*26
for i in range(1,d+1):
#x = 0
x = t[i-1]-1
#x = random.randrange(26)
last[x] = i
ans += s[i-1][... | output | 1 | 54,550 | 4 | 109,101 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,551 | 4 | 109,102 |
"Correct Solution:
```
D=int(input())
*c,=map(int,input().split())
s=[]
for i in range(D):
*x,=map(int,input().split())
s.append(x)
T=[]
for i in range(D):
T.append(int(input()))
last=[-1]*26
v=0
for d in range(D):
v+=s[d][T[d]-1]
last[T[d]-1]=d
for i in range(26):
v-=c[i]*(d-last[i])
... | output | 1 | 54,551 | 4 | 109,103 |
Provide a correct Python 3 solution for this coding contest problem.
You will be given a contest schedule for D days. For each d=1,2,\ldots,D, calculate the satisfaction at the end of day d.
Input
Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.
D
c_1 ... | instruction | 0 | 54,552 | 4 | 109,104 |
"Correct Solution:
```
d = int(input())
c = list(map(int, input().split()))
s = []
for _ in range(d):
s.append(list(map(int, input().split())))
t = []
for _ in range(d):
t.append(int(input())-1)
v = 0
last = [-1]*26
for i in range(d):
v += s[i][t[i]]
last[t[i]] = i
for j in range(26):
v -= c... | output | 1 | 54,552 | 4 | 109,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes.... | instruction | 0 | 54,713 | 4 | 109,426 |
Yes | output | 1 | 54,713 | 4 | 109,427 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,715 | 4 | 109,430 |
"Correct Solution:
```
INF = 10 ** 20
def main():
d, n = map(int,input().split())
temp = [int(input()) for i in range(d)]
temp.insert(0,0)
alst = []
blst = []
clst = []
for i in range(n):
a,b,c = map(int,input().split())
alst.append(a)
blst.append(b)
clst.append(c)
dp = [[0] * ... | output | 1 | 54,715 | 4 | 109,431 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,716 | 4 | 109,432 |
"Correct Solution:
```
def run():
D, N = map(int, input().split())
d_li = [int(input()) for d in range(D)]
clothe_li = [list(map(int, input().split())) for n in range(N)]
dp = [[0]*N for d in range(D)]
#init
d = d_li[0]
for n, (a, b, c) in enumerate(clothe_li):
if (a <= d) and (d <= b):
dp[0][n]... | output | 1 | 54,716 | 4 | 109,433 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,717 | 4 | 109,434 |
"Correct Solution:
```
INF = 10 ** 20
d, n = map(int,input().split())
temp = [int(input()) for i in range(d)]
temp.insert(0,0)
alst = []
blst = []
clst = []
for i in range(n):
a,b,c = map(int,input().split())
alst.append(a)
blst.append(b)
clst.append(c)
dp = [[0] * n for i in range(d + 1)]
for i in range(n):
... | output | 1 | 54,717 | 4 | 109,435 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,718 | 4 | 109,436 |
"Correct Solution:
```
D,N = map(int,input().split())
temperature = []
for _ in range(D):
temperature.append(int(input()))
temperature.insert(0,0)
clothes = []
for _ in range(N):
a,b,c = map(int,input().split())
clothes.append([a,b,c])
dp = [[0]*N for i in range(D+1)]
t1 = temperature[1]
for i in range(N):
if not... | output | 1 | 54,718 | 4 | 109,437 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,719 | 4 | 109,438 |
"Correct Solution:
```
D,N = map(int,input().split())
T = [ int(input()) for i in range(D) ]
clothes = []
for _ in range(N):
a,b,c = map(int,input().split())
clothes.append([a,b,c])
# i日目に服jを来た時の、派手さの絶対値
dp = [ [-1]*(N) for _ in range(D+1) ]
dp[0][0] = 0
for j in range(N):
a,b,c = clothes[j]
if a <= T[0] <= b... | output | 1 | 54,719 | 4 | 109,439 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,720 | 4 | 109,440 |
"Correct Solution:
```
#D
D,N = map(int,input().split())
T = [int(input()) for i in range(D)]
ABC = [list(map(int,input().split())) for i in range(N)]
can = []
for t in T:
mini = []
for abc in ABC:
a,b,c = abc
if a <= t and t <= b:
mini.append(c)
mini.sort()
can.append([mini... | output | 1 | 54,720 | 4 | 109,441 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,721 | 4 | 109,442 |
"Correct Solution:
```
def solve():
from sys import stdin
f_i = stdin
D, N = map(int, f_i.readline().split())
T = tuple(int(f_i.readline()) for i in range(D))
clothes = [tuple(map(int, f_i.readline().split())) for i in range(N)]
clothes.sort(key=lambda x: x[2])
candidate = []
... | output | 1 | 54,721 | 4 | 109,443 |
Provide a correct Python 3 solution for this coding contest problem.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather forecast for a certain D day. The maximum temperature on d... | instruction | 0 | 54,722 | 4 | 109,444 |
"Correct Solution:
```
d,n=map(int,input().split())
t=[int(input()) for _ in [0]*d]
abc=[list(map(int,input().split())) for _ in [0]*n]
memo=[-1]*101
t_list=[set() for _ in [0]*61]
for a,b,c in abc:
for j in range(a,b+1):
t_list[j].add(c)
for i in t_list[t[0]]:
memo[i]=0
for i in t[1:]:... | output | 1 | 54,722 | 4 | 109,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather fo... | instruction | 0 | 54,723 | 4 | 109,446 |
Yes | output | 1 | 54,723 | 4 | 109,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather fo... | instruction | 0 | 54,724 | 4 | 109,448 |
Yes | output | 1 | 54,724 | 4 | 109,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
During this time of winter in Japan, hot days continue in Australia in the Southern Hemisphere. IOI, who lives in Australia, decided to plan what clothes to wear based on the weather fo... | instruction | 0 | 54,725 | 4 | 109,450 |
Yes | output | 1 | 54,725 | 4 | 109,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main server of Gomble company received a log of one top-secret process, the name of which can't be revealed. The log was written in the following format: «[date:time]: message», where for each «[date:time]» value existed not more than 10... | instruction | 0 | 55,045 | 4 | 110,090 |
Tags: implementation, strings
Correct Solution:
```
def compareTime(t1,t2,):
if abs(t2-ref) < abs(t1-ref):
return True
else:
return False
def getTime(msg):
hh = int(msg[1:3])
mm = int(msg[4:6])
if hh == 12 and msg[7] == 'a':
hh = 00
elif msg[7] == 'p' and hh != 12:
... | output | 1 | 55,045 | 4 | 110,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main server of Gomble company received a log of one top-secret process, the name of which can't be revealed. The log was written in the following format: «[date:time]: message», where for each «[date:time]» value existed not more than 10... | instruction | 0 | 55,046 | 4 | 110,092 |
Tags: implementation, strings
Correct Solution:
```
prev = 24 * 60
days = 0
cnt = 0
for i in range(int(input())):
time = input()[1:8].split()
time[0:1] = list(map(int, time[0].split(":")))
if time[0] == 12:
time[0] = 0
if time[2] == "p":
time[0] += 12
curr = time[0] * 60 + time[1]
... | output | 1 | 55,046 | 4 | 110,093 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.