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.
Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.
Fortunately the child knows how to solve such complicated test. The child will follow the algorithm:
* If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great.
* If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice).
You are given a multiple-choice questions, can you predict child's choose?
Input
The first line starts with "A." (without quotes), then followed the description of choice A. The next three lines contains the descriptions of the other choices in the same format. They are given in order: B, C, D. Please note, that the description goes after prefix "X.", so the prefix mustn't be counted in description's length.
Each description is non-empty and consists of at most 100 characters. Each character can be either uppercase English letter or lowercase English letter, or "_".
Output
Print a single line with the child's choice: "A", "B", "C" or "D" (without quotes).
Examples
Input
A.VFleaKing_is_the_author_of_this_problem
B.Picks_is_the_author_of_this_problem
C.Picking_is_the_author_of_this_problem
D.Ftiasch_is_cute
Output
D
Input
A.ab
B.abcde
C.ab
D.abc
Output
C
Input
A.c
B.cc
C.c
D.c
Output
B
Note
In the first sample, the first choice has length 39, the second one has length 35, the third one has length 37, and the last one has length 15. The choice D (length 15) is twice shorter than all other choices', so it is great choice. There is no other great choices so the child will choose D.
In the second sample, no choice is great, so the child will choose the luckiest choice C.
In the third sample, the choice B (length 2) is twice longer than all other choices', so it is great choice. There is no other great choices so the child will choose B.
Submitted Solution:
```
import sys
def minp():
return sys.stdin.readline().strip()
a = []
for i in range(4):
a.append(minp())
b = a[::]
if len(b[2]) > len(b[3]):
b[2],b[3] = b[3],b[2]
if len(b[1]) > len(b[2]):
b[1],b[2] = b[2],b[1]
if len(b[0]) > len(b[1]):
b[0],b[1] = b[1],b[0]
if len(b[2]) > len(b[3]):
b[2],b[3] = b[3],b[2]
if len(b[1]) > len(b[2]):
b[1],b[2] = b[2],b[1]
if len(b[2]) > len(b[3]):
b[2],b[3] = b[3],b[2]
m = None
M = None
if len(b[0])*2 - 4 <= len(b[1])-2:
m = b[0]
if len(b[2])*2 - 4 <= len(b[3])-2:
M = b[3]
if m:
if M:
print('C')
else:
print(m[0])
else:
if M:
print(M[0])
else:
print('C')
``` | instruction | 0 | 69,339 | 11 | 138,678 |
Yes | output | 1 | 69,339 | 11 | 138,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.
Fortunately the child knows how to solve such complicated test. The child will follow the algorithm:
* If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great.
* If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice).
You are given a multiple-choice questions, can you predict child's choose?
Input
The first line starts with "A." (without quotes), then followed the description of choice A. The next three lines contains the descriptions of the other choices in the same format. They are given in order: B, C, D. Please note, that the description goes after prefix "X.", so the prefix mustn't be counted in description's length.
Each description is non-empty and consists of at most 100 characters. Each character can be either uppercase English letter or lowercase English letter, or "_".
Output
Print a single line with the child's choice: "A", "B", "C" or "D" (without quotes).
Examples
Input
A.VFleaKing_is_the_author_of_this_problem
B.Picks_is_the_author_of_this_problem
C.Picking_is_the_author_of_this_problem
D.Ftiasch_is_cute
Output
D
Input
A.ab
B.abcde
C.ab
D.abc
Output
C
Input
A.c
B.cc
C.c
D.c
Output
B
Note
In the first sample, the first choice has length 39, the second one has length 35, the third one has length 37, and the last one has length 15. The choice D (length 15) is twice shorter than all other choices', so it is great choice. There is no other great choices so the child will choose D.
In the second sample, no choice is great, so the child will choose the luckiest choice C.
In the third sample, the choice B (length 2) is twice longer than all other choices', so it is great choice. There is no other great choices so the child will choose B.
Submitted Solution:
```
a=input()
b=input()
c=input()
d=input()
lst=[(len(a) - 2 ,"A"),(len(b) - 2,"B"),(len(c) - 2,"C"),(len(d) - 2,"D")]
f1 = 0
f2 = 0
lst.sort(key=lambda x:x[0], reverse=True)
if lst[0][0] >= 2 * lst[1][0]:
f1 = 1
if lst[2][0] >= 2 * lst[3][0]:
f2 = 1
if (f1 and f2) or (not f1 and not f2):
print("C")
elif f1:
print(lst[0][1])
else:
print(lst[3][1])
``` | instruction | 0 | 69,340 | 11 | 138,680 |
Yes | output | 1 | 69,340 | 11 | 138,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.
Fortunately the child knows how to solve such complicated test. The child will follow the algorithm:
* If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great.
* If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice).
You are given a multiple-choice questions, can you predict child's choose?
Input
The first line starts with "A." (without quotes), then followed the description of choice A. The next three lines contains the descriptions of the other choices in the same format. They are given in order: B, C, D. Please note, that the description goes after prefix "X.", so the prefix mustn't be counted in description's length.
Each description is non-empty and consists of at most 100 characters. Each character can be either uppercase English letter or lowercase English letter, or "_".
Output
Print a single line with the child's choice: "A", "B", "C" or "D" (without quotes).
Examples
Input
A.VFleaKing_is_the_author_of_this_problem
B.Picks_is_the_author_of_this_problem
C.Picking_is_the_author_of_this_problem
D.Ftiasch_is_cute
Output
D
Input
A.ab
B.abcde
C.ab
D.abc
Output
C
Input
A.c
B.cc
C.c
D.c
Output
B
Note
In the first sample, the first choice has length 39, the second one has length 35, the third one has length 37, and the last one has length 15. The choice D (length 15) is twice shorter than all other choices', so it is great choice. There is no other great choices so the child will choose D.
In the second sample, no choice is great, so the child will choose the luckiest choice C.
In the third sample, the choice B (length 2) is twice longer than all other choices', so it is great choice. There is no other great choices so the child will choose B.
Submitted Solution:
```
a = list(input())
a.pop(0)
a.pop(0)
b = list(input())
b.pop(0)
b.pop(0)
c = list(input())
c.pop(0)
c.pop(0)
d = list(input())
d.pop(0)
d.pop(0)
list1 = [b,c,d]
list2 = [a,c,d]
list3 = [a,b,c]
list4 = [a,b,d]
empty = []
temp = 1
count = 0
count1 = 0
count2 = 0
for i in range(len(list1)):
if len(a) >= len(list1[i])*2 :
count1+=1
continue
if len(a)<=len(list1[i])/2:
count2+=1
continue
else:
count+=1
temp = 0
break
if temp == 1 and (count1 == 3 or count2 == 3):
empty.append('A')
count1 = 0
count2 = 0
temp = 1
for i in range(len(list2)):
if len(b) >= len(list2[i])*2 :
count1+=1
continue
if len(b)<=len(list2[i])/2 :
count2+=1
continue
else:
count+=1
temp = 0
break
if temp == 1 and (count1 == 3 or count2 == 3):
empty.append('B')
count1 = 0
count2 = 0
temp = 1
for i in range(len(list3)):
if len(d) >= len(list3[i])*2 :
count1+=1
continue
elif len(d)<=len(list3[i])/2:
count2+=1
continue
else:
count+=1
temp = 0
break
if temp == 1 and (count1 == 3 or count2 == 3):
empty.append('D')
count1 = 0
count2 = 0
temp = 1
for i in range(len(list4)):
if len(c) >= len(list4[i])*2 :
count1+=1
continue
if len(a)<=len(list4[i])/2:
count2+=1
continue
else:
count+=1
temp = 0
break
if temp == 1 and (count1==3 or count2 == 3):
empty.append('D')
if len(empty) > 1 or len(empty) == 0:
print('C')
else:
print(empty[0])
``` | instruction | 0 | 69,341 | 11 | 138,682 |
No | output | 1 | 69,341 | 11 | 138,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.
Fortunately the child knows how to solve such complicated test. The child will follow the algorithm:
* If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great.
* If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice).
You are given a multiple-choice questions, can you predict child's choose?
Input
The first line starts with "A." (without quotes), then followed the description of choice A. The next three lines contains the descriptions of the other choices in the same format. They are given in order: B, C, D. Please note, that the description goes after prefix "X.", so the prefix mustn't be counted in description's length.
Each description is non-empty and consists of at most 100 characters. Each character can be either uppercase English letter or lowercase English letter, or "_".
Output
Print a single line with the child's choice: "A", "B", "C" or "D" (without quotes).
Examples
Input
A.VFleaKing_is_the_author_of_this_problem
B.Picks_is_the_author_of_this_problem
C.Picking_is_the_author_of_this_problem
D.Ftiasch_is_cute
Output
D
Input
A.ab
B.abcde
C.ab
D.abc
Output
C
Input
A.c
B.cc
C.c
D.c
Output
B
Note
In the first sample, the first choice has length 39, the second one has length 35, the third one has length 37, and the last one has length 15. The choice D (length 15) is twice shorter than all other choices', so it is great choice. There is no other great choices so the child will choose D.
In the second sample, no choice is great, so the child will choose the luckiest choice C.
In the third sample, the choice B (length 2) is twice longer than all other choices', so it is great choice. There is no other great choices so the child will choose B.
Submitted Solution:
```
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
#f.readline()
#input()
get = lambda :[(f.readline() if mode=="file" else input())]
a={}
for i in range(4):
[y]=get()
a[chr(65+i)]=len(y)
maxx=max(a.values())
minn=min(a.values())
found1=True
for i in a.values():
if minn==i:
continue
if minn*2>i:
found1=False
break
found2=True
for i in a.values():
if maxx==i:
continue
if maxx<i*2:
found2=False
break
if (found1 and found2) or (not found1 and not found2):
print("C")
return
elif found1:
for i in a:
if a[i]==minn:
print(i)
return
else:
for i in a:
if a[i]==maxx:
print(i)
return
if mode=="file":f.close()
if __name__=="__main__":
main()
``` | instruction | 0 | 69,342 | 11 | 138,684 |
No | output | 1 | 69,342 | 11 | 138,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.
Fortunately the child knows how to solve such complicated test. The child will follow the algorithm:
* If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great.
* If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice).
You are given a multiple-choice questions, can you predict child's choose?
Input
The first line starts with "A." (without quotes), then followed the description of choice A. The next three lines contains the descriptions of the other choices in the same format. They are given in order: B, C, D. Please note, that the description goes after prefix "X.", so the prefix mustn't be counted in description's length.
Each description is non-empty and consists of at most 100 characters. Each character can be either uppercase English letter or lowercase English letter, or "_".
Output
Print a single line with the child's choice: "A", "B", "C" or "D" (without quotes).
Examples
Input
A.VFleaKing_is_the_author_of_this_problem
B.Picks_is_the_author_of_this_problem
C.Picking_is_the_author_of_this_problem
D.Ftiasch_is_cute
Output
D
Input
A.ab
B.abcde
C.ab
D.abc
Output
C
Input
A.c
B.cc
C.c
D.c
Output
B
Note
In the first sample, the first choice has length 39, the second one has length 35, the third one has length 37, and the last one has length 15. The choice D (length 15) is twice shorter than all other choices', so it is great choice. There is no other great choices so the child will choose D.
In the second sample, no choice is great, so the child will choose the luckiest choice C.
In the third sample, the choice B (length 2) is twice longer than all other choices', so it is great choice. There is no other great choices so the child will choose B.
Submitted Solution:
```
a = []
a.append(input())
a.append(input())
a.append(input())
a.append(input())
b = []
for i in range(len(a)):
b.append(len(a[i]) - 2)
b.sort()
res = 0
if b[0] * 2 <= b[1]:
res = b[0]
elif b[2] * 2 <= b[3]:
res = b[3]
if res != 0:
for i in range(len(a)):
if len(a[i]) - 2 == res:
print(a[i][:1])
else:
print('С')
``` | instruction | 0 | 69,343 | 11 | 138,686 |
No | output | 1 | 69,343 | 11 | 138,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.
Fortunately the child knows how to solve such complicated test. The child will follow the algorithm:
* If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great.
* If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice).
You are given a multiple-choice questions, can you predict child's choose?
Input
The first line starts with "A." (without quotes), then followed the description of choice A. The next three lines contains the descriptions of the other choices in the same format. They are given in order: B, C, D. Please note, that the description goes after prefix "X.", so the prefix mustn't be counted in description's length.
Each description is non-empty and consists of at most 100 characters. Each character can be either uppercase English letter or lowercase English letter, or "_".
Output
Print a single line with the child's choice: "A", "B", "C" or "D" (without quotes).
Examples
Input
A.VFleaKing_is_the_author_of_this_problem
B.Picks_is_the_author_of_this_problem
C.Picking_is_the_author_of_this_problem
D.Ftiasch_is_cute
Output
D
Input
A.ab
B.abcde
C.ab
D.abc
Output
C
Input
A.c
B.cc
C.c
D.c
Output
B
Note
In the first sample, the first choice has length 39, the second one has length 35, the third one has length 37, and the last one has length 15. The choice D (length 15) is twice shorter than all other choices', so it is great choice. There is no other great choices so the child will choose D.
In the second sample, no choice is great, so the child will choose the luckiest choice C.
In the third sample, the choice B (length 2) is twice longer than all other choices', so it is great choice. There is no other great choices so the child will choose B.
Submitted Solution:
```
a = len(input().split('.')[1])
b = len(input().split('.')[1])
c = len(input().split('.')[1])
d = len(input().split('.')[1])
arr = [a, b, c, d]
ans = False
for i in range(4):
l = arr[i]
c1 = c2 = 0
for j in range(4):
if i != j:
if l <= arr[j]//2:
c1 +=1
elif l >= arr[j]*2:
c2 += 1
if c1 == 3 or c2 == 3:
ans = True
if i == 0:
print('A')
elif i == 1:
print('B')
elif i == 2:
print('C')
else:
print('D')
break
if not ans:
print('C')
``` | instruction | 0 | 69,344 | 11 | 138,688 |
No | output | 1 | 69,344 | 11 | 138,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
dif = list()
for i in range(n-1):
if(i%2==0):
dif.append(int(abs(a[i] - a[i+1])))
else:
dif.append(-1 * int(abs(a[i] - a[i+1])))
#print('dif = ', dif)
pref = list()
for i in range(len(dif)):
if(i==0):
pref.append(dif[0])
else:
pref.append(pref[i-1] + dif[i])
#print('pref = ', pref)
mx = 0
mn = 0
mxidx = 0
mnidx = 0
for i in range(len(pref)):
if(pref[i] > mx):
mx = pref[i]
mxidx = i
if(pref[i] < mn):
mn = pref[i]
mnidx = i
print(mx-mn)
``` | instruction | 0 | 69,498 | 11 | 138,996 |
Yes | output | 1 | 69,498 | 11 | 138,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(map(int, input().split()))
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)]
#MOD = 1000000000 + 7
def Y(c): print(["NO","YES"][c])
def y(c): print(["no","yes"][c])
def Yy(c): print(["No","Yes"][c])
N = int(input())
A= [0] +alele()
l = 1
Ans= -1e15
temp = -1e15
for i in range(1,N):
z = (abs(A[i] - A[i+1]))*((-1)**(i-l))
temp = max(z,temp + z)
Ans = max(Ans,temp)
temp = -1e15
l = 2
temp = -1e15
for i in range(2,N):
z = (abs(A[i] - A[i+1]))*((-1)**(i-l))
temp = max(z,temp + z)
Ans = max(Ans,temp)
print(Ans)
``` | instruction | 0 | 69,499 | 11 | 138,998 |
Yes | output | 1 | 69,499 | 11 | 138,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
import sys
n = int(input())
a = list(map(int, input().split()))
d = []
for i in range(1,n):
d.append(abs(a[i] - a[i - 1]))
evencur = 0;
sgn = 1;
ans = 0;
for i in range(len(d)):
evencur += d[i] * sgn;
sgn *= -1;
ans = max(evencur, ans)
if evencur < 0:
evencur = 0;
sgn = 1;
evencur = 0;
sgn = 1
for i in range(1,len(d)):
evencur += d[i] * sgn;
sgn *= -1;
ans = max(evencur, ans)
if evencur < 0:
evencur = 0;
sgn = 1;
print(ans)
``` | instruction | 0 | 69,500 | 11 | 139,000 |
Yes | output | 1 | 69,500 | 11 | 139,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
from sys import stdin,stdout
# stdin = open("input.txt" , "r")
# stdout = open("output.txt", "w")
n = int(stdin.readline().strip())
arr = list(map(int,stdin.readline().strip().split(' ')))
tarr1 = [abs(arr[1]-arr[0])]
tarr2 = []
for i in range(2,n):
tarr1.append(pow(-1,i-1)*abs(arr[i]-arr[i-1]))
tarr2.append(-1*tarr1[-1])
ans = tarr1[0]
tans =tarr1[0]
for i in tarr1[1:]:
if tans<0:
tans=i
else:
tans+=i
ans=max(tans,ans)
if len(tarr2)>0:
tans=tarr2[0]
ans=max(ans,tans)
for i in tarr2[1:]:
if tans<0:
tans=i
else:
tans+=i
ans=max(tans,ans)
stdout.write(str(ans)+"\n")
``` | instruction | 0 | 69,501 | 11 | 139,002 |
Yes | output | 1 | 69,501 | 11 | 139,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split(' ')))
def sign(n):
return [1, -1][n % 2]
b1 = [abs(a[i]-a[i-1]) for i in range(1, len(a))]
b1 = [sign(i)*b1[i] for i in range(len(b1))]
b2 = [-x for x in b1]
max_ending_here = b1[0]
last_max_ending_here = 0
max_so_far = b1[0]
kurwa = [max_ending_here]
for i, x in enumerate(b1):
if i == 0:
continue
if i % 2 == 1: # x = b1[i]
if b1[i-1] + x > max_ending_here + x:
max_ending_here = b1[i-1] + x
else:
max_ending_here += x
else:
if x > max_ending_here + x:
max_ending_here = x
else:
max_ending_here += x
max_so_far = max(max_so_far, max_ending_here)
kurwa.append(max_ending_here)
last_max_ending_here = max_ending_here
#print(b1, kurwa)
#print(max_so_far)
b1 = b2
max_ending_here = b1[0]
last_max_ending_here = 0
max_so_far2 = b1[0]
kurwa = [max_ending_here]
for i, x in enumerate(b1):
if i == 0:
continue
if i % 2 == 1: # x = b1[i]
if b1[i-1] + x > max_ending_here + x:
max_ending_here = b1[i-1] + x
else:
max_ending_here += x
else:
if x > max_ending_here + x:
max_ending_here = x
else:
max_ending_here += x
max_so_far2 = max(max_so_far2, max_ending_here)
kurwa.append(max_ending_here)
last_max_ending_here = max_ending_here
#print(b1, kurwa)
#print(max_so_far2)
print(max(max_so_far, max_so_far2))
``` | instruction | 0 | 69,502 | 11 | 139,004 |
No | output | 1 | 69,502 | 11 | 139,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
n=int(input())
l=list(map(int,input().split()))
ll=[abs(l[i]-l[i+1]) for i in range(n-1)]
ans=0
for i in range(n-1):
k=ll[i]
for j in range(i+1,n-1):
k+=ll[j]*((-1)**(j-i))
if k>ans: ans=k
print(ans)
``` | instruction | 0 | 69,503 | 11 | 139,006 |
No | output | 1 | 69,503 | 11 | 139,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
n = int(input())
numbers = list(map(int, input().split()))
values = []
for x in range(n - 1):
p = abs(numbers[x] - numbers[x + 1])
if x % 2 == 0:
values.append(p)
else:
values.append(-p)
def add(r, s, t):
global q
a = r
for y in range(x + s, n - 2, 2):
if a > q:
q = a
a += (values[y] + values[y + 1]) * t
if a > q:
q = a
global q
q = 0
for x in range(n - 1):
if x % 2 == 0:
add(values[x], 1, 1)
else:
add(0, 0, -1)
print(q)
``` | instruction | 0 | 69,504 | 11 | 139,008 |
No | output | 1 | 69,504 | 11 | 139,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:
<image>
In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Examples
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6
Note
In the first sample case, the optimal value of f is reached on intervals [1, 2] and [2, 5].
In the second case maximal value of f is reachable only on the whole array.
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
d = [abs(a[i] - a[i+1]) * (-1)**i for i in range(n-1)]
maxsum1 = 0
sum1 = 0
for di in d:
if di * sum1 >= 0 or abs(di) < abs(sum1):
sum1 += di
else:
sum1 = di
maxsum1 = max(maxsum1, abs(sum1))
print(maxsum1)
``` | instruction | 0 | 69,505 | 11 | 139,010 |
No | output | 1 | 69,505 | 11 | 139,011 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,597 | 11 | 139,194 |
"Correct Solution:
```
n,m=map(int,input().split())
acs=[0]*n
was=[0]*n
WA=0
for i in range(m):
p,s=input().split()
p=int(p)
if acs[p-1]==0:
if s=="AC":
acs[p-1]=1
WA+=was[p-1]
else:
was[p-1]+=1
print(sum(acs),WA)
``` | output | 1 | 69,597 | 11 | 139,195 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,598 | 11 | 139,196 |
"Correct Solution:
```
N, M = map(int, input().split())
AC = [0] * N
WA = [0] * N
for _ in range(M):
p, s = input().split()
p = int(p) - 1
if s == 'AC':
AC[p] = 1
elif AC[p] < 1:
WA[p] += 1
WA = [w if AC[p] else 0 for p, w in enumerate(WA)]
print(sum(AC), sum(WA))
``` | output | 1 | 69,598 | 11 | 139,197 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,599 | 11 | 139,198 |
"Correct Solution:
```
N, M=map(int, input().split())
solved=[False]*N
wal=[0]*N
ac=0
wa=0
for _ in range(M):
p, s=input().split()
p=int(p)-1
if solved[p]:
continue
if s=="AC":
solved[p]=True
ac+=1
wa+=wal[p]
else:
wal[p]+=1
print(ac, wa)
``` | output | 1 | 69,599 | 11 | 139,199 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,600 | 11 | 139,200 |
"Correct Solution:
```
n,m=map(int,input().split())
sgn=[0 for i in range(n)]
penal=[0 for i in range(n)]
pp=0
for i in range(m):
p,s=map(str,input().split())
p=int(p)-1
if s=='AC':
if sgn[p]==0: pp+=penal[p]
sgn[p]=1
else:
penal[p]+=1
print(sum(sgn),pp)
``` | output | 1 | 69,600 | 11 | 139,201 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,601 | 11 | 139,202 |
"Correct Solution:
```
n,m = map(int,input().split())
a = [0]*n
AC,WA=0,0
for i in range(m):
x,y = input().split()
x = int(x)
if a[x-1]!=-1 and y=="WA":
a[x-1]+=1
if a[x-1]!=-1 and y=="AC":
WA+=a[x-1]
AC+=1
a[x-1]=-1
print(AC,WA)
``` | output | 1 | 69,601 | 11 | 139,203 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,602 | 11 | 139,204 |
"Correct Solution:
```
n,m=map(int,input().split())
ac=[0]*n
wa=[0]*n
for i in range(m):
p,s=input().split()
p=int(p)-1
if ac[p]==0:
if s=='AC':
ac[p]=1
else:
wa[p]+=1
wasum=0
for i in range(n):
if ac[i]==1:
wasum+=wa[i]
print(sum(ac),wasum)
``` | output | 1 | 69,602 | 11 | 139,205 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,603 | 11 | 139,206 |
"Correct Solution:
```
N,M=map(int,input().split())
AC=[0] * (N + 1)
WA=[0] * (N + 1)
cnt_AC=0
cnt_WA=0
for _ in range(M):
i,s=input().split()
i=int(i)
if AC[i]==0:
if s=='WA':
WA[i]+=1
if s=='AC':
AC[i]=1
cnt_WA+=WA[i]
cnt_AC=sum(AC)
print(cnt_AC,cnt_WA)
``` | output | 1 | 69,603 | 11 | 139,207 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0 | instruction | 0 | 69,604 | 11 | 139,208 |
"Correct Solution:
```
n,m = map(int,input().split())
acwa=[[] for _ in range(n)]
for i in range(m):
pp,ss = input().split()
acwa[int(pp)-1].append(ss)
n_ac=0
n_wa=0
for i in range(n):
if "AC" in acwa[i]:
n_ac +=1
n_wa +=acwa[i].index("AC")
print(n_ac,n_wa)
``` | output | 1 | 69,604 | 11 | 139,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
n, m = map(int, input().split())
wa, ac = [0]*n, [0]*n
for i in range(m):
p, s = input().split()
p = int(p)
if s=="AC": ac[p-1] = 1
else:
if ac[p-1]==0: wa[p-1] += 1
wac = 0
for i in range(n): wac += wa[i] * ac[i]
print(sum(ac), wac)
``` | instruction | 0 | 69,605 | 11 | 139,210 |
Yes | output | 1 | 69,605 | 11 | 139,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
d=dict()
wa=ans=0
N,M=map(int,input().split())
for i in range(M):
p,s=input().split()
if p not in d:
d[p]=0
if d[p]>=0 and s=="AC":
ans+=1
wa+=d[p]
d[p]=-float("inf")
else:
d[p]+=1
print(ans,wa)
``` | instruction | 0 | 69,606 | 11 | 139,212 |
Yes | output | 1 | 69,606 | 11 | 139,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
N,M = map(int,input().split())
ac = (N+1)*[0]
wa = (N+1)*[0]
pt = 0
for i in range(M):
p,s = input().split()
p = int(p)
if ac[p] == 0 and s == "AC":
ac[p] = 1
pt += wa[p]
wa[p] += 1
print(sum(ac),pt)
``` | instruction | 0 | 69,607 | 11 | 139,214 |
Yes | output | 1 | 69,607 | 11 | 139,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
N,M = map(int,input().split())
AC=[0]*N
WA=[0]*N
WAtimes=0
ACtimes=0
for i in range(M):
p,S=map(str,input().split())
p=int(p)-1
if 'AC'==S:
if 0==AC[p]:
ACtimes+=1
WAtimes+=WA[p]
AC[p]+=1
if 'WA'==S:
WA[p]+=1
print(ACtimes,WAtimes)
``` | instruction | 0 | 69,608 | 11 | 139,216 |
Yes | output | 1 | 69,608 | 11 | 139,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
N,M = map(int,input().split())
grid = []
for i in range(M):
array = list(map(str, input().strip().split()))
grid.append(array)
ac_list = [0]*N
wa_list = [0]*N
for a in grid:
if a[1] == 'AC':
ac_list[int(a[0]) - 1] = 1
elif a[1] == 'WA' and ac_list[int(a[0]) - 1] != 1:
wa_list[int(a[0]) - 1] = 1
print(str(sum(ac_list)) + ' ' + str(sum(wa_list)))
``` | instruction | 0 | 69,609 | 11 | 139,218 |
No | output | 1 | 69,609 | 11 | 139,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
N,M=map(int,input().split())
ACs=[]
WAs=0
for i in range(M):
p,s=input().split()
if p not in ACs:
if s=='AC':
ACs.append(p)
else:
WAs+=1
print(len(set(ACs)),WAs)
``` | instruction | 0 | 69,610 | 11 | 139,220 |
No | output | 1 | 69,610 | 11 | 139,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
N,M = list(map(int,input().split()))
p = []
for i in range(M):
x,y = list(map(str, input().split()))
p.append([int(x),y])
count = [[0,0]for i in range(M)]
ansac = 0
answa = 0
for i in range(M):
if count[p[i][0]-1][1] != 0:
pass
else:
if p[i][1] == 'AC':
count[p[i][0]-1][1] += 1
else:
count[p[i][0]-1][0] += 1
for i in range(N):
answa += count[i][0]
ansac += count[i][1]
print(str(ansac) + ' ' + str(answa))
``` | instruction | 0 | 69,611 | 11 | 139,222 |
No | output | 1 | 69,611 | 11 | 139,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi participated in a contest on AtCoder.
The contest had N problems.
Takahashi made M submissions during the contest.
The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).
The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.
The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.
Find the numbers of Takahashi's correct answers and penalties.
Constraints
* N, M, and p_i are integers.
* 1 \leq N \leq 10^5
* 0 \leq M \leq 10^5
* 1 \leq p_i \leq N
* S_i is `AC` or `WA`.
Input
Input is given from Standard Input in the following format:
N M
p_1 S_1
:
p_M S_M
Output
Print the number of Takahashi's correct answers and the number of Takahashi's penalties.
Examples
Input
2 5
1 WA
1 AC
2 WA
2 AC
2 WA
Output
2 2
Input
100000 3
7777 AC
7777 AC
7777 AC
Output
1 0
Input
6 0
Output
0 0
Submitted Solution:
```
N, M = map(int, input().split())
ac = [False] * N
pe = [0] * N
for _ in range(M):
p, s = input().split()
p = int(p) - 1
if ac[p]:
continue
if s == 'AC':
ac[p] = True
else:
pe[p] += 1
print(sum(ac), sum(pe))
``` | instruction | 0 | 69,612 | 11 | 139,224 |
No | output | 1 | 69,612 | 11 | 139,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
hp = [tuple(map(int, input().split())) for _ in range(n)]
hp.sort(key=lambda x: x[0]+x[1])
dp = [10**15] * (n+1)
dp[0] = 0
for i in range(n):
h,p = hp[i]
for j in range(n,0,-1):
if dp[j-1]<=h:
dp[j] = min(dp[j], dp[j-1]+p)
# print(dp)
for i in range(n, -1, -1):
if dp[i]<10**15:
break
ans = i
print(ans)
``` | instruction | 0 | 69,665 | 11 | 139,330 |
Yes | output | 1 | 69,665 | 11 | 139,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
"""
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_d
全て置けるかの判定を考える
H+Pで昇順ソート
後ろから見ていって、その時点での座布団がH+P以下なら○ だめならX
を付けてPを引く
を繰り返し、全て○なら全員置ける(丸の数以上の答えであることが確定する)
あとは前から見ていってdp?
dp[i][j] = i人目まで見てj人置いた時の最小の枚数
→H+Pでソートするのが正しいなら絶対おｋなんだが…
"""
N = int(input())
SHP = []
for i in range(N):
h,p = map(int,input().split())
SHP.append( (h+p,h,p) )
SHP.sort()
dp = [float("inf")] * (N+1)
dp[0] = 0
for i in range(N):
s,h,p = SHP[i]
for j in range(N-1,-1,-1):
if dp[j] <= h:
dp[j+1] = min(dp[j+1] , dp[j] + p)
ans = 0
for i in range(N+1):
if dp[i] != float("inf"):
ans = i
print (ans)
``` | instruction | 0 | 69,666 | 11 | 139,332 |
Yes | output | 1 | 69,666 | 11 | 139,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
N = int(input())
"""
dp[i][j] -> i番目の人間までみる。j人が積むときの最小値。
"""
HP = [list(map(int,input().split())) for _ in range(N)]
HP.sort(key=lambda x:x[0]+x[1])
dp = [float("INF")]*(N+1)
dp[0] = 0
for i in range(1,N+1):
for j in range(N,0,-1):
if dp[j-1] <= HP[i-1][0]:
dp[j] = min(dp[j],dp[j-1]+HP[i-1][1])
for j in range(N,-1,-1):
if dp[j] != float("INF"):
print(j)
break
``` | instruction | 0 | 69,667 | 11 | 139,334 |
Yes | output | 1 | 69,667 | 11 | 139,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
N = int(input())
HP = [tuple(map(int,input().split())) for _ in range(N)]
HP.sort(key=lambda x: sum(x))
INF = float('inf')
dp = [0]
maxj = 0
for i,(h,p) in enumerate(HP):
dp2 = [INF] * (maxj + 2)
for j in range(maxj,-1,-1):
dp2[j] = min(dp2[j], dp[j])
if dp[j] <= h:
dp2[j+1] = min(dp2[j+1], dp[j] + p)
if j == maxj:
maxj += 1
dp = dp2
print(maxj)
``` | instruction | 0 | 69,668 | 11 | 139,336 |
Yes | output | 1 | 69,668 | 11 | 139,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
N = int(input())
A = []
for i in range(N):
A.append(list(map(int, input().split())))
A = sorted(A, key = lambda x:x[0])
A = sorted(A, key = lambda x:x[1])
h = 0
ans = 0
for i in range(N):
if h <= A[i][0]:
h += A[i][1]
ans += 1
print(ans)
``` | instruction | 0 | 69,669 | 11 | 139,338 |
No | output | 1 | 69,669 | 11 | 139,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
N = int(input())
men = []
for _ in range(N):
H,P = map(int,input().split())
men.append((H,P,H+P))
men.sort(key=lambda x: x[2])
inf = max(H)+1
dp = [[inf]*(N+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
h,p,a = men[i-1]
for j in range(1,N+1):
if dp[i-1][j-1] <= h:
dp[i][j] = min(dp[i-1][j],dp[i-1][j-1]+p)
else:
dp[i][j] = dp[i-1][j]
for j in range(N,-1,-1):
if dp[-1][j] != inf:
print(j)
break
``` | instruction | 0 | 69,670 | 11 | 139,340 |
No | output | 1 | 69,670 | 11 | 139,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
n = int(input())
hp = [list(map(int,input().split())) for i in range(n)]
hp.sort(key = lambda x:x[0]+x[1])
dp = [[10**18 for i in range(n+1)] for j in range(n+1)]
dp[0][0] = 0
for i in range(1,n+1):
dp[i] = dp[i-1][:]
h,p = hp[i-1]
for j in range(1,i+1):
if dp[i-1][j-1] <= h:
dp[i][j] = min(dp[i][j],dp[i-1][j-1]+p)
for i in range(n+1):
if dp[-1][i] == 10**18:
print(i-1)
break
``` | instruction | 0 | 69,671 | 11 | 139,342 |
No | output | 1 | 69,671 | 11 | 139,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.
Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?
Constraints
* 1 \leq N \leq 5000
* 0 \leq H_i \leq 10^9
* 1 \leq P_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N
H_1 P_1
H_2 P_2
:
H_N P_N
Output
Print the maximum number of participants who can add zabuton to the stack.
Examples
Input
3
0 2
1 3
3 4
Output
2
Input
3
2 4
3 1
4 1
Output
3
Input
10
1 3
8 4
8 3
9 1
6 4
2 3
4 2
9 2
8 3
0 1
Output
5
Submitted Solution:
```
def main():
import sys
input=sys.stdin.readline
n=int(input())
hp=sorted([list(map(int,input().split())) for _ in [0]*n],key=lambda x:sum(x))
dp=[10**10]*(n+1)
dp[0]=0
for c,[h,p] in enumerate(hp):
for k in range(c,-1,-1):
if dp[k]<=h:
dp[k+1]=min(dp[k+1],dp[k]+p)
for i in range(n,-1,-1):
if dp[i]!=10**10:
print(i)
break
if __name__=='__main__':
main()
``` | instruction | 0 | 69,672 | 11 | 139,344 |
No | output | 1 | 69,672 | 11 | 139,345 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
n = int(input())
ans=[-1]*21
for _ in range(n):
a, b = map(int, input().split())
ans[a] = b
print(ans.index(max(ans)), max(ans))
``` | instruction | 0 | 69,700 | 11 | 139,400 |
Yes | output | 1 | 69,700 | 11 | 139,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
n = int(input())
dic = {}
max_v = 0
for _ in range(n):
a, v = map(int, input().split())
if not v in dic or a < dic[v]:
dic[v] = a
if v > max_v:
max_v = v
print(dic[max_v], max_v)
``` | instruction | 0 | 69,701 | 11 | 139,402 |
Yes | output | 1 | 69,701 | 11 | 139,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append((y,x))
l.sort(key=lambda x:(x[0],x[1]),reverse=True)
maximum=l[0][0]
young=l[0][1]
for i in l:
if maximum==i[0]:
young=i[1]
else:
break
print(young,maximum)
#print(l[0][1],l[0][0])
``` | instruction | 0 | 69,702 | 11 | 139,404 |
Yes | output | 1 | 69,702 | 11 | 139,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
N=int(input())
number={}
for i in range(N):
a,b=map(int,input().split())
number[a] = b
number_max = max(number.values())
answer = []
for v,m in number.items():
if m==number_max:
answer.append(v)
print(min(answer),number_max)
``` | instruction | 0 | 69,703 | 11 | 139,406 |
Yes | output | 1 | 69,703 | 11 | 139,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append((y,x))
l.sort(reverse=True)
print(l[0][1],l[0][0])
``` | instruction | 0 | 69,704 | 11 | 139,408 |
No | output | 1 | 69,704 | 11 | 139,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
# -*- coding: utf-8 -*-
import sys
import os
import math
N = int(input())
A = []
for i in range(N):
id, num = map(int, input().split())
A.append(num)
max_value = max(A)
max_index = A.index(max_value)
print(max_index + 1, max_value)
``` | instruction | 0 | 69,705 | 11 | 139,410 |
No | output | 1 | 69,705 | 11 | 139,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
n = int(input())
av = [int(input().split()[1]) for _ in range(n)]
maxv = max(av)
print(av.index(maxv)+1, maxv)
``` | instruction | 0 | 69,706 | 11 | 139,412 |
No | output | 1 | 69,706 | 11 | 139,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A smelt fishing tournament was held at Lake Hibara. The winner is the one who wins the most smelt.
Create a program that reads the list of participant numbers and the number of fish caught and outputs the number of winners and the number of fish caught. If there are multiple winners, output the one with the lowest participant number.
input
The input is given in the following format.
n
a1 v1
a2 v2
::
an vn
n (1 ≤ n ≤ 20) represents the number of participants and ai represents the participant number. Participant numbers are different integers between 1 and n. vi (0 ≤ vi ≤ 100) is the number of animals acquired by the participant ai.
output
Output the winner's participant number and the number of fish caught on one line separated by blanks.
Example
Input
6
1 14
2 25
3 42
4 11
5 40
6 37
Output
3 42
Submitted Solution:
```
n = int(input())
av = [0] * (n+1)
for _ in range(n):
a, v = map(int, input().split())
av[a] += v
maxv = max(av)
print(av.index(maxv), maxv)
``` | instruction | 0 | 69,707 | 11 | 139,414 |
No | output | 1 | 69,707 | 11 | 139,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a closed world and a set of features that are defined for all the objects in the world. Each feature can be answered with "yes" or "no". Using those features, we can identify any object from the rest of the objects in the world. In other words, each object can be represented as a fixed-length sequence of booleans. Any object is different from other objects by at least one feature.
You would like to identify an object from others. For this purpose, you can ask a series of questions to someone who knows what the object is. Every question you can ask is about one of the features. He/she immediately answers each question with "yes" or "no" correctly. You can choose the next question after you get the answer to the previous question.
You kindly pay the answerer 100 yen as a tip for each question. Because you don' t have surplus money, it is necessary to minimize the number of questions in the worst case. You don’t know what is the correct answer, but fortunately know all the objects in the world. Therefore, you can plan an optimal strategy before you start questioning.
The problem you have to solve is: given a set of boolean-encoded objects, minimize the maximum number of questions by which every object in the set is identifiable.
Input
The input is a sequence of multiple datasets. Each dataset begins with a line which consists of two integers, m and n: the number of features, and the number of objects, respectively. You can assume 0 < m ≤ 11 and 0 < n ≤ 128. It is followed by n lines, each of which corresponds to an object. Each line includes a binary string of length m which represent the value ("yes" or "no") of features. There are no two identical objects.
The end of the input is indicated by a line containing two zeros. There are at most 100 datasets.
Output
For each dataset, minimize the maximum number of questions by which every object is identifiable and output the result.
Example
Input
8 1
11010101
11 4
00111001100
01001101011
01010000011
01100110001
11 16
01000101111
01011000000
01011111001
01101101001
01110010111
01110100111
10000001010
10010001000
10010110100
10100010100
10101010110
10110100010
11001010011
11011001001
11111000111
11111011101
11 12
10000000000
01000000000
00100000000
00010000000
00001000000
00000100000
00000010000
00000001000
00000000100
00000000010
00000000001
00000000000
9 32
001000000
000100000
000010000
000001000
000000100
000000010
000000001
000000000
011000000
010100000
010010000
010001000
010000100
010000010
010000001
010000000
101000000
100100000
100010000
100001000
100000100
100000010
100000001
100000000
111000000
110100000
110010000
110001000
110000100
110000010
110000001
110000000
0 0
Output
0
2
4
11
9
Submitted Solution:
```
from collections import Counter
while True:
m, n = (int(s) for s in input().split())
if not m:
break
objs = [int(input(), 2) for i in range(n)]
f = [[0 for i in range(1 << m)] for i in range(1 << m)]
for mask in reversed(range(1<<m)):
s = Counter(obj & mask for obj in objs)
for mask0 in range(mask + 1):
if s[mask0] > 1:
f[mask][mask0] = n + 1
for b in [1<<k for k in range(m)]:
if not (b & mask):
f[mask][mask0] = min(f[mask][mask0],
max(f[mask + b][mask0],
f[mask + b][mask0 + b]) + 1
)
print(f[0][0])
``` | instruction | 0 | 69,757 | 11 | 139,514 |
No | output | 1 | 69,757 | 11 | 139,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a closed world and a set of features that are defined for all the objects in the world. Each feature can be answered with "yes" or "no". Using those features, we can identify any object from the rest of the objects in the world. In other words, each object can be represented as a fixed-length sequence of booleans. Any object is different from other objects by at least one feature.
You would like to identify an object from others. For this purpose, you can ask a series of questions to someone who knows what the object is. Every question you can ask is about one of the features. He/she immediately answers each question with "yes" or "no" correctly. You can choose the next question after you get the answer to the previous question.
You kindly pay the answerer 100 yen as a tip for each question. Because you don' t have surplus money, it is necessary to minimize the number of questions in the worst case. You don’t know what is the correct answer, but fortunately know all the objects in the world. Therefore, you can plan an optimal strategy before you start questioning.
The problem you have to solve is: given a set of boolean-encoded objects, minimize the maximum number of questions by which every object in the set is identifiable.
Input
The input is a sequence of multiple datasets. Each dataset begins with a line which consists of two integers, m and n: the number of features, and the number of objects, respectively. You can assume 0 < m ≤ 11 and 0 < n ≤ 128. It is followed by n lines, each of which corresponds to an object. Each line includes a binary string of length m which represent the value ("yes" or "no") of features. There are no two identical objects.
The end of the input is indicated by a line containing two zeros. There are at most 100 datasets.
Output
For each dataset, minimize the maximum number of questions by which every object is identifiable and output the result.
Example
Input
8 1
11010101
11 4
00111001100
01001101011
01010000011
01100110001
11 16
01000101111
01011000000
01011111001
01101101001
01110010111
01110100111
10000001010
10010001000
10010110100
10100010100
10101010110
10110100010
11001010011
11011001001
11111000111
11111011101
11 12
10000000000
01000000000
00100000000
00010000000
00001000000
00000100000
00000010000
00000001000
00000000100
00000000010
00000000001
00000000000
9 32
001000000
000100000
000010000
000001000
000000100
000000010
000000001
000000000
011000000
010100000
010010000
010001000
010000100
010000010
010000001
010000000
101000000
100100000
100010000
100001000
100000100
100000010
100000001
100000000
111000000
110100000
110010000
110001000
110000100
110000010
110000001
110000000
0 0
Output
0
2
4
11
9
Submitted Solution:
```
while True:
m, n = (int(s) for s in input().split())
if not m:
break
objs = [int(input(), 2) for i in range(n)]
dp = [[0] * (1<<m) for i in range(1 << m)]
bits = [1 << i for i in range(m)]
for mask in reversed(range(1 << m)):
s = Counter(obj & mask for obj in objs)
for mask0, value in s.items():
if value > 1:
dp[mask][mask0] = min(max(dp[mask | b][mask0],
dp[mask | b][mask0 | b]) + 1
for b in bits if not b & mask)
print(dp[0][0])
``` | instruction | 0 | 69,758 | 11 | 139,516 |
No | output | 1 | 69,758 | 11 | 139,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for- mulas:
<image>
where S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.
Now suppose we have some input string I(⋅), where each character in the string is an integer between 0 and (M - 1). Then, using the pseudo-random number series R(⋅), we obtain another string O(⋅) as the output by the following formula:
<image>
Your task is to write a program that shows the parameters S, A, and C such that the information entropy of the output string O(⋅) is minimized. Here, the information entropy H is given by the following formula:
<image>
where N is the length of the string and #(x) is the number of occurences of the alphabet x.
Input
The input consists of multiple datasets. Each dataset has the following format:
N
I(1) I(2) ... I(N)
N does not exceed 256.
The last dataset is followed by a line containing one zero. This line is not a part of any dataset and should not be processed.
Output
For each dataset, print in a line the values of the three parameters S, A, and C separated by a single space. If more than one solution gives the same minimum entropy, choose the solution with the smallest S, A, and then C.
Example
Input
5
5 4 3 2 1
5
7 7 7 7 7
10
186 8 42 24 154 40 10 56 122 72
0
Output
0 1 1
0 0 0
8 7 14
Submitted Solution:
```
import math
from collections import Counter
M = 256
def entropy(ctr):
ret = 0
for v in ctr.values():
ret -= (v / N) * math.log2(v / N)
return ret
def solve(src):
ans_h = float('inf')
ans = None
for s in range(16):
for a in range(16):
for c in range(16):
ctr = Counter()
r = s
for i in src:
r = (a*r + c) % M
o = (i + r) % M
ctr.update([o])
h = entropy(ctr)
if h < ans_h:
ans = (s,a,c)
ans_h = h
if ans_h == 0:
return ans
return ans
while True:
N = int(input())
if N == 0: break
src = list(map(int,input().split()))
print(' '.join(map(str,solve(src))))
``` | instruction | 0 | 69,778 | 11 | 139,556 |
No | output | 1 | 69,778 | 11 | 139,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for- mulas:
<image>
where S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.
Now suppose we have some input string I(⋅), where each character in the string is an integer between 0 and (M - 1). Then, using the pseudo-random number series R(⋅), we obtain another string O(⋅) as the output by the following formula:
<image>
Your task is to write a program that shows the parameters S, A, and C such that the information entropy of the output string O(⋅) is minimized. Here, the information entropy H is given by the following formula:
<image>
where N is the length of the string and #(x) is the number of occurences of the alphabet x.
Input
The input consists of multiple datasets. Each dataset has the following format:
N
I(1) I(2) ... I(N)
N does not exceed 256.
The last dataset is followed by a line containing one zero. This line is not a part of any dataset and should not be processed.
Output
For each dataset, print in a line the values of the three parameters S, A, and C separated by a single space. If more than one solution gives the same minimum entropy, choose the solution with the smallest S, A, and then C.
Example
Input
5
5 4 3 2 1
5
7 7 7 7 7
10
186 8 42 24 154 40 10 56 122 72
0
Output
0 1 1
0 0 0
8 7 14
Submitted Solution:
```
import math
from collections import Counter
M = 256
def entropy_if_smallest(ctr,bound):
ret = 0
for v in ctr.values():
ret -= (v / N) * math.log2(v / N)
if ret >= bound:
return None
return ret
def solve(src):
ans_h = float('inf')
ans = None
for s in range(16):
for a in range(16):
for c in range(16):
ctr = Counter()
r = s
for i in src:
r = (a*r + c) % M
o = (i + r) % M
ctr.update([o])
h = entropy_if_smallest(ctr,ans_h)
if h is not None:
ans = (s,a,c)
ans_h = h
if ans_h == 0:
return ans
return ans
while True:
N = int(input())
if N == 0: break
src = list(map(int,input().split()))
print(' '.join(map(str,solve(src))))
``` | instruction | 0 | 69,779 | 11 | 139,558 |
No | output | 1 | 69,779 | 11 | 139,559 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.