text stringlengths 216 39.6k | conversation_id int64 219 108k | embedding list | cluster int64 11 11 |
|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
# Details
'''
Contest: Good Bye 2016
Problem: New Year and Hurry
Rating: 800
Difficulty: A
Author: Sarthak Mittal
'''
# Input into int array
def arrin ():
return list(map(int,input().strip().split()))
# Printing int array
'''
def printer (a,n):
for i in range (0,n):
print(a[i], end = ' ')
print()
'''
# Array Minima
'''
def minima (a,n):
m = 0
for i in range (0,n):
if (a[i] <= a[m]):
m = i
return m
'''
# Array Sorter
'''
def sorter (a):
a.sort()
'''
# Rhetoric Printer
'''
def rhetoric (b):
if (b):
print('YES')
else:
print('NO')
'''
# String to List
'''
def strtolis (l,s):
for i in range (0,len(s)):
l.append(s[i])
'''
l = arrin()
n = l[0]
k = l[1]
k = 240 - k
time = 0
j = 0
while (time + 5 * j < k) and (j < n):
j += 1
time += 5 * j
print(j)
```
No
| 102,563 | [
0.7021484375,
0.15673828125,
-0.260498046875,
-0.0306396484375,
-0.5087890625,
-0.423583984375,
-0.265869140625,
0.4951171875,
0.12384033203125,
1.0283203125,
0.49072265625,
-0.332275390625,
0.1260986328125,
-0.80712890625,
-0.29736328125,
0.10931396484375,
-0.72216796875,
-0.68798... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
n_k = [int(i) for i in input().split()]
problems = n_k[0]
while(problems):
if(5*problems*(problems+1)/2) + n_k[1] <= 240:
print(problems)
break
else:
problems-=1
```
No
| 102,564 | [
0.70166015625,
0.1619873046875,
-0.25244140625,
0.03155517578125,
-0.474365234375,
-0.44970703125,
-0.26904296875,
0.4931640625,
0.0889892578125,
1.0751953125,
0.47314453125,
-0.29296875,
0.1507568359375,
-0.86669921875,
-0.321044921875,
0.124755859375,
-0.7666015625,
-0.8017578125... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
a, b = map(int, input().split())
n, x = 240 - b, 1
while n > 0:
n -= x * 5
x += 1
print(min(a, x))
```
No
| 102,565 | [
0.7255859375,
0.215087890625,
-0.2734375,
0.027069091796875,
-0.453369140625,
-0.416015625,
-0.299560546875,
0.48095703125,
0.085205078125,
1.1005859375,
0.487060546875,
-0.28271484375,
0.1483154296875,
-0.888671875,
-0.3046875,
0.11749267578125,
-0.74560546875,
-0.76123046875,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
n = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
idAB = zip(range(n), A, B)
idAB = sorted(idAB, key=lambda x: x[1], reverse=True)
ans = [idAB[0][0] + 1]
for i in range(1, n, 2):
choice = max(idAB[i:i + 2], key=lambda x: x[2])
ans.append(choice[0] + 1)
ans = sorted(ans)
print(len(ans))
print(*ans)
```
Yes
| 102,574 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
import sys
input = sys.stdin.readline
n=int(input())
arr=list(map(int,input().split()))
brr=list(map(int,input().split()))
ida=list(range(n))
print((n>>1)+1)
an=[]
ida.sort(key=lambda x: -arr[x])
an.append(ida[0]+1)
for i in range(1,n,2):
if n-1==i:
an.append(ida[i]+1)
elif brr[ida[i]]>=brr[ida[i+1]]:
an.append(ida[i]+1)
else:
an.append(ida[i+1]+1)
print(*an)
```
Yes
| 102,575 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
import random
import datetime
random.seed( datetime.datetime.now() )
N = int( input() )
A = list( map( int, input().split() ) )
B = list( map( int, input().split() ) )
def valid( arr ):
return sum( A[ k ] for k in arr ) * 2 > sum( A ) and sum( B[ k ] for k in arr ) * 2 > sum( B )
ans = [ i for i in range( N ) ]
while not valid( ans[ : N // 2 + 1 ] ):
random.shuffle( ans )
print( N // 2 + 1 )
print( *list( map( lambda x: x + 1, ans[ : N // 2 + 1 ] ) ) )
```
Yes
| 102,576 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
from sys import stdin, stdout
import random
n = int(stdin.readline().rstrip())
a = stdin.readline().rstrip().split()
a = [int(x) for x in a]
b = stdin.readline().rstrip().split()
b = [int(x) for x in b]
currentSeq = [(a[0],b[0],1)]
stock=0
i=1
seqTotal = [a[0],b[0]]
listTotal = [a[0],b[0]]
while i<n:
if i%2==1:
stock+=1
listTotal[0]+=a[i]; listTotal[1]+=b[i]
if (2*seqTotal[0]<=listTotal[0] or 2*seqTotal[1]<=listTotal[1]) and stock>0:
stock-=1
seqTotal[0]+=a[i]; seqTotal[1]+=b[i]
currentSeq.append((a[i],b[i],i+1))
elif 2*seqTotal[0]<=listTotal[0] or 2*seqTotal[1]<=listTotal[1]:
seqTotal[0]+=a[i]; seqTotal[1]+=b[i]
currentSeq.append((a[i],b[i],i+1))
random.shuffle(currentSeq)
for j in range(len(currentSeq)):
if 2*(seqTotal[0]-currentSeq[j][0])>listTotal[0] and 2*(seqTotal[1]-currentSeq[j][1])>listTotal[1]:
seqTotal[0]-=currentSeq[j][0]
seqTotal[1]-=currentSeq[j][1]
currentSeq.pop(j)
break
i+=1
c = [str(x[2]) for x in currentSeq]
print(len(c))
print(' '.join(c))
```
Yes
| 102,577 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ab = list(zip(a, b, [i for i in range(1, n + 1)]))
ba = list(zip(b, a, [i for i in range(1, n + 1)]))
ab.sort(key = lambda x: (-x[0], -x[1]))
ba.sort(key = lambda x: (-x[0], -x[1]))
accA, accB = 0, 0
sumA, sumB = sum(a), sum(b)
g50A, g50B = sumA // 2 + 1, sumB // 2 + 1
maxK = n // 2 + 1
k = 0
ans = set([])
p1, p2 = 0, 0
# print(ab, ba)
while k < maxK:
if (min((accA + ab[p1][0]), g50A) + min((accB + ab[p1][1]), g50B)) <= \
(min((accA + ba[p2][1]), g50A) + min((accB + ba[p2][0], g50B))):
ans.add(ab[p1][2])
accA += ab[p1][0]
accB += ab[p1][1]
while ab[p1][2] in ans:
p1 += 1
else:
ans.add(ba[p2][2])
accB += ba[p2][0]
accA += ba[p2][1]
while ba[p2][2] in ans:
p2 += 1
k += 1
print(k)
print(' '.join(list(map(str, list(ans)))))
```
No
| 102,578 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
n = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
idAB = zip(range(n), A, B)
idAB = sorted(idAB, key=lambda x: x[1], reverse=True)
real_sort = []
for i, elem in enumerate(idAB):
if i == n-1:
real_sort.append(n)
else:
choice = max(idAB[i], idAB[i + 1], key=lambda x: x[2])
real_sort.append(choice[0] + 1)
if choice[0] != i:
i += 1
ans = real_sort[:n // 2 + 1]
ans = sorted(ans)
print(*ans)
```
No
| 102,579 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
from sys import stdin, stdout
import random
n = int(stdin.readline().rstrip())
a = stdin.readline().rstrip().split()
a = [int(x) for x in a]
b = stdin.readline().rstrip().split()
b = [int(x) for x in b]
currentSeq = [(a[0],b[0],1)]
stock=0
i=1
seqTotal = [a[0],b[0]]
listTotal = [a[0],b[0]]
while i<n:
if i%2==1:
stock+=1
listTotal[0]+=a[i]; listTotal[1]+=b[i]
if (2*seqTotal[0]<=listTotal[0] or 2*seqTotal[1]<=listTotal[1]) and stock>=0:
stock-=1
seqTotal[0]+=a[i]; seqTotal[1]+=b[i]
currentSeq.append((a[i],b[i],i+1))
elif 2*seqTotal[0]<=listTotal[0] or 2*seqTotal[1]<=listTotal[1]:
seqTotal[0]+=a[i]; seqTotal[1]+=b[i]
currentSeq.append((a[i],b[i],i+1))
random.shuffle(currentSeq)
for j in range(len(currentSeq)):
if 2*seqTotal[0]-currentSeq[j][0]>listTotal[0] and 2*seqTotal[1]-currentSeq[j][1]>listTotal[1]:
currentSeq.pop(j)
break
i+=1
c = [str(i[2]) for i in currentSeq]
print(len(c))
print(' '.join(c))
```
No
| 102,580 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length n each which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk) is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to <image> because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
Output
On the first line output an integer k which represents the size of the found subset. k should be less or equal to <image>.
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
Example
Input
5
8 7 4 8 3
4 2 5 3 7
Output
3
1 4 5
Submitted Solution:
```
z = input()
x = input().split(' ')
y = input().split(' ')
x = list(map(int, x))
y = list(map(int, y))
n = len(x)
def Quicksort(a,c, p, q):
if(p < q):
r = Partition(a,c, p ,q)
Quicksort(a,c, p, r-1)
Quicksort(a,c, r+1, q)
def Partition(a,c, p ,q):
pivot = a[p]
i = p+1
j = q
done = False
while not done:
while i <= j and a[i] >= pivot:
i += 1
while i <= j and a[j] <= pivot:
j -= 1
if j < i:
done = True
else:
# swap places
a[i], a[j] = swap(a[i], a[j])
c[i], c[j] = swap(c[i], c[j])
# swap start with myList[right]
a[p], a[j] = swap(a[p], a[j])
c[p], c[j] = swap(c[p], c[j])
return j
def swap(a, b):
return b, a
c = []
for i in range(n):
c.append(i)
Quicksort(x,c, 0, n-1)
pick = [c[0]]
if len(c) % 2 == 0:
for i in range(1, n-1, 2):
if y[c[i]] > y[c[i+1]]:
pick.append(c[i])
else:
pick.append(c[i+1])
pick.append(c[len(x)-1])
else:
for i in range(1, n, 2):
if y[c[i]] > y[c[i+1]]:
pick.append(c[i])
else:
pick.append(c[i+1])
#print(len(pick))
for i in range(len(pick)):
print(pick[i]+1, end=" ")
```
No
| 102,581 | [
0.1517333984375,
0.430908203125,
-0.0635986328125,
0.142333984375,
-0.5166015625,
-0.426025390625,
-0.587890625,
0.3388671875,
0.1888427734375,
0.97802734375,
0.45947265625,
-0.2119140625,
0.5107421875,
-0.72021484375,
-0.421630859375,
-0.10888671875,
-0.767578125,
-0.86767578125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
n = int(input())
l = [ list(map(int, input().split())) for _ in range(n) ]
c = 0
l.sort(key=lambda x: x[1])
for i in range(n):
c += l[i][0]
if c > l[i][1]:
print("No")
exit()
print("Yes")
```
Yes
| 102,744 | [
0.638671875,
0.174072265625,
-0.1839599609375,
0.038848876953125,
-0.311767578125,
-0.2421875,
-0.390380859375,
-0.014678955078125,
0.166748046875,
1.345703125,
0.28125,
-0.2393798828125,
0.171875,
-1.0263671875,
-0.4150390625,
-0.1072998046875,
-0.72802734375,
-0.576171875,
-0.2... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
N = int(input())
AB = [list(map(int, input().split())) for i in range(N)]
AB.sort(key=lambda x: (x[1], x[0]))
s = 0
for t in AB:
s += t[0]
if (s > t[1]):
print('No')
quit()
print('Yes')
```
Yes
| 102,745 | [
0.66064453125,
0.1845703125,
-0.1673583984375,
0.01727294921875,
-0.323486328125,
-0.2391357421875,
-0.3818359375,
-0.0266571044921875,
0.1873779296875,
1.349609375,
0.283203125,
-0.254638671875,
0.1912841796875,
-1.0400390625,
-0.4169921875,
-0.11029052734375,
-0.7373046875,
-0.57... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
N = int(input())
W = []
for _ in range(N):
a, b = map(int, input().split())
W.append([a, b])
s = 0
for a, b in sorted(W, key=lambda x: x[1]):
s += a
if s > b:
print('No')
quit()
print('Yes')
```
Yes
| 102,746 | [
0.64697265625,
0.19677734375,
-0.1795654296875,
0.020721435546875,
-0.312255859375,
-0.261962890625,
-0.397705078125,
-0.044281005859375,
0.1627197265625,
1.36328125,
0.283935546875,
-0.2342529296875,
0.17041015625,
-1.033203125,
-0.410400390625,
-0.10223388671875,
-0.73681640625,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
n=int(input())
ab=[list(map(int,input().split())) for _ in range(n)]
ab.sort(key=lambda x:x[1])
jikoku=0
for i in range(n):
jikoku+=ab[i][0]
if jikoku>ab[i][1]:
print('No')
exit()
print('Yes')
```
Yes
| 102,747 | [
0.65869140625,
0.1895751953125,
-0.156982421875,
0.0175018310546875,
-0.33544921875,
-0.296875,
-0.36474609375,
-0.0113677978515625,
0.22412109375,
1.357421875,
0.2998046875,
-0.19775390625,
0.2374267578125,
-1.0302734375,
-0.41650390625,
-0.09710693359375,
-0.7607421875,
-0.564941... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
def main():
n = int(input())
ls = []
for _ in range(n):
a, b = map(int, input().split())
ls.append([b,a])
ls = ls.sort()
t=0
for i in ls:
t += i[1]
if t > i[0]:
print('No')
exit(0)
print('Yes')
if __name__ == '__main__':
main()
```
No
| 102,748 | [
0.662109375,
0.1824951171875,
-0.173828125,
-0.00894927978515625,
-0.323974609375,
-0.243896484375,
-0.38134765625,
-0.037109375,
0.1812744140625,
1.3505859375,
0.258544921875,
-0.2275390625,
0.1875,
-1.0234375,
-0.43310546875,
-0.10955810546875,
-0.740234375,
-0.6064453125,
-0.2... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
n = int(input())
a_lst = []
b_lst = []
for i in range(0, n):
a, b = [int(elem) for elem in input().split()]
a_lst.append(a)
b_lst.append(b)
tmp = zip(b_lst, a_lst)
tmp = sorted(tmp)
b_lst, a_lst = zip(*tmp)
print(b_lst, a_lst)
flag = 0
sums = 0
for i in range(0, len(a_lst)):
sums += a_lst[i]
if sums > b_lst[i]:
flag = 1
break
if flag == 0:
print("Yes")
else:
print("No")
```
No
| 102,749 | [
0.69677734375,
0.1923828125,
-0.1226806640625,
0.02960205078125,
-0.339599609375,
-0.2415771484375,
-0.364990234375,
-0.06964111328125,
0.184326171875,
1.3369140625,
0.249755859375,
-0.22802734375,
0.1904296875,
-1.03515625,
-0.458984375,
-0.07159423828125,
-0.6953125,
-0.603515625... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
import sys
n = int(input())
li = sorted(map(lambda x: list(map(int, x.split()[::-1])), sys.stdin.readlines()))
print(li)
sum = 0
flag = "Yes"
for x, y in li:
sum += y
if x < sum:
flag = "No"
break
print(flag)
```
No
| 102,750 | [
0.662109375,
0.1839599609375,
-0.1448974609375,
0.044830322265625,
-0.3076171875,
-0.220703125,
-0.360595703125,
-0.03997802734375,
0.208984375,
1.30078125,
0.275634765625,
-0.2108154296875,
0.2061767578125,
-0.97412109375,
-0.4521484375,
-0.07952880859375,
-0.69580078125,
-0.62402... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes
Submitted Solution:
```
N = int(input())
task = []
for i in range(N):
M = list(map(int,input().split()))
M[0],M[1]=M[1],M[0]
task.append(M)
task.sort()
K = 0
ans = 1
for i in range(N):
K += task[i,1]
if (K>task[i,0]):
ans = 0
break
if ans:
print("Yes")
else:
print("No")
```
No
| 102,751 | [
0.6484375,
0.1766357421875,
-0.2021484375,
0.0246734619140625,
-0.317138671875,
-0.2548828125,
-0.383544921875,
-0.0235137939453125,
0.208740234375,
1.3544921875,
0.275634765625,
-0.2401123046875,
0.193115234375,
-1.0234375,
-0.420654296875,
-0.1019287109375,
-0.7236328125,
-0.5883... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input Format
The input format is following:
n m q
a_1 a_2 ... a_q
Output Format
Print the number of connected part in one line.
Constraints
* n ≤ 10^{12}
* 7n is divisible by m.
* 1 ≤ q ≤ m ≤ 10^5
* 0 ≤ a_1 < a_2 < ... < a_q < m
Scoring
Subtask 1 [100 points]
* n ≤ 100000.
Subtask 2 [90 points]
* m is divisible by 7.
* a_{i + 1} - a_i = 1.
Subtask 3 [200 points]
* m is divisible by 7.
Subtask 4 [110 points]
* There are no additional constraints.
Sample Input 1
7 7 3
1 3 5
Sample Output 1
4
The calendar looks like this:
<image>
Sample Input 2
10 14 8
5 6 7 8 9 10 11 12
Sample Output 2
10
The calendar looks like this:
<image>
Output Format
Print the number of connected part in one line.
Constraints
* n ≤ 10^{12}
* 7n is divisible by m.
* 1 ≤ q ≤ m ≤ 10^5
* 0 ≤ a_1 < a_2 < ... < a_q < m
Scoring
Subtask 1 [100 points]
* n ≤ 100000.
Subtask 2 [90 points]
* m is divisible by 7.
* a_{i + 1} - a_i = 1.
Subtask 3 [200 points]
* m is divisible by 7.
Subtask 4 [110 points]
* There are no additional constraints.
Input Format
The input format is following:
n m q
a_1 a_2 ... a_q
Examples
Input
7 7 3
1 3 5
Output
4
Input
10 14 8
5 6 7 8 9 10 11 12
Output
10
Submitted Solution:
```
from queue import Queue
n,m,q=map(int,input().split())
a=list(map(int,input().split()))
def count_group(size):
cc = [False]*size
for i in range(q):
j = 0
while a[i]+m*j < size:
cc[a[i]+m*j] = True
j += 1
gg = [0]*size
ox = [-1, 0, 1, 0]
oy = [0, -7, 0, 7]
def bfs(i, g):
qq = Queue()
qq.put(i, False)
while not qq.empty():
ii = qq.get(False)
gg[ii] = g
for t in range(4):
if ii % 7 == 0 and ox[t] == -1: continue
if (ii+1) % 7 == 0 and ox[t] == 1: continue
j = ii+ox[t]+oy[t]
if 0 <= j < size:
if cc[j] or gg[j] != 0: continue
qq.put(j, False)
maxg = 0
for i in range(size):
if not cc[i] and gg[i] == 0:
maxg += 1
bfs(i, maxg)
return maxg
block = (m+7)//7*7*7
if n*7 <= block:
print(count_group(n*7))
exit(0)
c1 = count_group(block)
c2 = count_group(block*2)
c3 = count_group(block+((n*7)%block))
print(c1 + ((n*7-block)//block)*(c2-c1) + (c3-c1))
```
No
| 102,801 | [
0.265869140625,
0.050201416015625,
-0.342529296875,
-0.06829833984375,
-0.469970703125,
-0.053955078125,
-0.02886962890625,
0.25146484375,
0.398681640625,
1.1279296875,
0.20849609375,
-0.05535888671875,
0.10601806640625,
-0.80712890625,
-0.533203125,
0.190673828125,
-0.66552734375,
... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
N, K = map(int, input().split())
def f(k):
r = 0
for i in range(1, k):
r += i//2
return r
mx, mn = N+2, 0
idx = N//2
while mx-mn>1:
if f(idx) < K:
idx, mn = (idx+mx)//2, idx
continue
idx, mx = (idx+mn)//2, idx
#print(N, K)
#print(idx, f(idx), f(idx+1))
if idx+1 > N:
print(-1)
import sys
sys.exit()
rs = []
for i in range(idx):
rs.append(i+1)
rs.append(idx+1+2*(f(idx+1)-K))
#print(*rs)
rs2 = []
for i in range(N-(idx+1)):
rs2.append(5000+i)
rs = [10000*x for x in rs]
print(*(rs2 + rs))
```
| 103,045 | [
0.257568359375,
0.10308837890625,
-0.1842041015625,
0.30419921875,
-0.59326171875,
-0.4091796875,
-0.00785064697265625,
0.2332763671875,
-0.043426513671875,
1.0556640625,
0.83837890625,
-0.043670654296875,
0.433349609375,
-0.84130859375,
-0.60009765625,
0.1356201171875,
-0.533203125,... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
x=(n-3)//2
MAX=x*(x+1)
if n%2==1:
MAX+=(n-1)//2
else:
MAX+=(n-1)//2*2
#print(MAX)
if m>MAX:
print(-1)
sys.exit()
score=0
x=1
while score<m:
x+=1
score+=(x-1)//2
#print(x,score)
LAST1=x
x+=(score-m)*2
ANS=list(range(1,LAST1))
ANS.append(x)
for i in range(n-len(ANS)):
ANS.append(10**9-i*25001-1)
print(*sorted(ANS))
```
| 103,046 | [
0.255859375,
0.1224365234375,
-0.145751953125,
0.2978515625,
-0.63134765625,
-0.376708984375,
-0.04583740234375,
0.2259521484375,
-0.05047607421875,
1.080078125,
0.81689453125,
-0.051239013671875,
0.439697265625,
-0.857421875,
-0.5908203125,
0.1519775390625,
-0.492431640625,
-0.811... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
def main():
n, m = map(int, input().split())
x = []
i = 1
while (n > 0 and m >= len(x) // 2):
m -= len(x) // 2
n -= 1
x.append(i)
i += 1
k = i - 1
if (m == 0 and n == 0):
print(*x)
return
elif (n == 0):
print(-1)
return
else:
x.append(2 * k - m * 2)
n -= 1
for i in range(n):
x.append(20000 * (i + 1) + 1)
print(*x)
main()
```
| 103,047 | [
0.250244140625,
0.1092529296875,
-0.1929931640625,
0.27685546875,
-0.58154296875,
-0.410888671875,
-0.019744873046875,
0.2188720703125,
-0.031036376953125,
1.056640625,
0.833984375,
-0.043701171875,
0.449462890625,
-0.8447265625,
-0.595703125,
0.1298828125,
-0.54150390625,
-0.81494... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
# from itertools import permutations,combinations
def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var): sys.stdout.write(' '.join(map(str, var)) + '\n')
def out(var): sys.stdout.write(str(var) + '\n')
from decimal import Decimal
# from fractions import Fraction
# sys.setrecursionlimit(100000)
mod = int(1e9) + 7
INF=10**8
n,m=mdata()
if n==1 and m==0:
out(1)
exit()
l=[]
k=math.floor(((1+4*m)**0.5-1)/2)
if k>n:
out(-1)
exit()
l=list(range(1,2*k+3))
m-=k*(k+1)
while m:
l.append(l[-1]+l[max(0,l[-1]-2*m)])
m-=min(m,l[-1]//2)
if len(l)>n:
out(-1)
exit()
i=0
t=l[-1]
while len(l)<n:
l.append(INF+i*(t+1))
i+=1
outl(l)
```
| 103,048 | [
0.2587890625,
0.10382080078125,
-0.1468505859375,
0.315185546875,
-0.623046875,
-0.377685546875,
-0.021484375,
0.23779296875,
-0.01690673828125,
1.1005859375,
0.8173828125,
-0.078125,
0.43603515625,
-0.83203125,
-0.60302734375,
0.1624755859375,
-0.52099609375,
-0.78955078125,
-0.... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
# https://codeforces.com/problemset/problem/1305/E
def gen_sequence(size, balance):
result = []
for i in range(1, size + 1):
triple_count = (i - 1) >> 1
if triple_count <= balance:
result.append(i)
balance -= triple_count
else:
break
if len(result) == size and balance > 0:
return [-1]
if balance > 0:
result.append(2 * (result[-1] - balance) + 1)
delta = result[-1] + 1
while len(result) < size:
value = result[-1] + delta
if value % 2 == 0:
value += 1
result.append(value)
return result
if __name__ == '__main__':
size, balance = map(int, input().split())
for x in gen_sequence(size, balance):
print(x, end=' ')
print()
```
| 103,049 | [
0.2430419921875,
0.08447265625,
-0.13232421875,
0.3837890625,
-0.6005859375,
-0.41796875,
0.04229736328125,
0.1981201171875,
-0.032989501953125,
1.044921875,
0.732421875,
-0.04620361328125,
0.489013671875,
-0.8798828125,
-0.57080078125,
0.1339111328125,
-0.46044921875,
-0.730957031... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n, m = map(int, input().split())
out = []
currCount = 0
currVal = 0
while currVal < n:
nex = currVal // 2
if nex + currCount <= m:
currCount += nex
currVal += 1
out.append(currVal)
else:
break
need = m - currCount
if need > 0:
nex = currVal // 2
val = currVal + 1
val += 2 * (nex - need)
if nex > need:
out.append(val)
currCount += need
l = len(out)
if l > n or m != currCount:
assert(m > ((n-1) * (n-1))//4)
print(-1)
else:
assert(m <= ((n-1) * (n-1))//4)
lorg = max(out)
diff = lorg + 1
start = (lorg+diff)//diff
start += 2
start *= diff
start += 1
while l < n:
l += 1
out.append(start)
start += diff
assert(len(out) == n)
for i in range(n - 1):
assert(out[i] < out[i + 1])
assert(1 <= out[i])
assert(out[i + 1] <= 10 ** 9)
thing = set(out)
count = 0
for i in range(n):
for j in range(i + 1, n):
if out[i] + out[j] in thing:
count += 1
assert(count == m)
print(' '.join(map(str,out)))
```
| 103,050 | [
0.2357177734375,
0.1075439453125,
-0.18310546875,
0.331298828125,
-0.646484375,
-0.3671875,
0.017486572265625,
0.244384765625,
-0.0174713134765625,
1.083984375,
0.85009765625,
-0.03497314453125,
0.44091796875,
-0.8486328125,
-0.57080078125,
0.10369873046875,
-0.489013671875,
-0.815... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n, m = map(int, input().split())
numList = [x+1 for x in range(n)]
backdoor = []
count = sum([(i-1) // 2 for i in range(1, n+1)])
if count < m: exit(print(-1))
while count > m:
lastpop = numList.pop()
count -= (lastpop - 1) // 2
if count >= m:
if len(backdoor) == 0: backdoor.append(10 ** 9)
else: backdoor.append(backdoor[-1] - 2 ** 16)
else:
gap = m - count
backdoor.append(2 * (lastpop - gap) - 1)
count += gap
while len(backdoor) > 0: numList.append(backdoor.pop())
print(' '.join([str(x) for x in numList]))
```
| 103,051 | [
0.285400390625,
0.06243896484375,
-0.194091796875,
0.315185546875,
-0.5400390625,
-0.40576171875,
0.0105438232421875,
0.23974609375,
-0.0543212890625,
1.072265625,
0.8046875,
-0.0411376953125,
0.466064453125,
-0.79833984375,
-0.646484375,
0.1602783203125,
-0.453369140625,
-0.805175... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import math
import sys
n,m=[int(s) for s in input().split()]
ans=[]
curr_balance=0
for i in range(1,n+1):
new_balance=math.floor((i-1)/2);
if curr_balance+new_balance > m:
break
curr_balance+=new_balance;
ans.append(i);
if curr_balance<m:
if len(ans)==n:
print(-1)
sys.exit()
remaining_balance = m-curr_balance
number_index = remaining_balance*2 - 1
if ans[-1-number_index]+ans[-1] <= 1000000000:
ans.append(ans[-1-number_index]+ans[-1])
num_to_add=ans[-1]+1
for i in range(len(ans)+1,n+1):
if ans[-1]+num_to_add <= 1000000000:
ans.append(ans[-1]+num_to_add)
else:
break;
if len(ans)<n:
print(-1)
sys.exit()
for i in ans:
print(i," ")
```
| 103,052 | [
0.2392578125,
0.1290283203125,
-0.162841796875,
0.304931640625,
-0.64697265625,
-0.387939453125,
-0.0255584716796875,
0.22314453125,
-0.01293182373046875,
1.08203125,
0.8095703125,
-0.04571533203125,
0.453369140625,
-0.8447265625,
-0.59521484375,
0.1361083984375,
-0.5224609375,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
x=(n-3)//2
MAX=x*(x+1)
if n%2==1:
MAX+=(n-1)//2
else:
MAX+=(n-1)//2*2
#print(MAX)
if m>MAX:
print(-1)
sys.exit()
score=0
x=1
while score<m:
x+=1
score+=(x-1)//2
#print(x,score)
LAST1=x
x+=(score-m)*2
ANS=list(range(1,LAST1))
ANS.append(x)
for i in range(n-len(ANS)):
ANS.append(10**9-i*5001-1)
print(*sorted(ANS))
```
Yes
| 103,053 | [
0.386474609375,
0.10748291015625,
-0.2215576171875,
0.2310791015625,
-0.7607421875,
-0.236083984375,
-0.09002685546875,
0.305908203125,
-0.2042236328125,
1.0224609375,
0.7412109375,
-0.050079345703125,
0.403076171875,
-0.89404296875,
-0.67626953125,
0.1060791015625,
-0.53955078125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
from sys import stdin
from bisect import bisect_left as bl
from bisect import bisect_right as br
def input():
return stdin.readline()[:-1]
def intput():
return int(input())
def sinput():
return input().split()
def intsput():
return map(int, sinput())
class RangedList:
def __init__(self, start, stop, val=0):
self.shift = 0 - start
self.start = start
self.stop = stop
self.list = [val] * (stop - start)
def __setitem__(self, key, value):
self.list[key + self.shift] = value
def __getitem__(self, key):
return self.list[key + self.shift]
def __repr__(self):
return str(self.list)
def __iter__(self):
return iter(self.list)
def dprint(*args, **kwargs):
if debugging:
print(*args, **kwargs)
def sigma(x):
return x * (x + 1) // 2
def maxbalance(x):
if x % 2 == 0:
return sigma(x // 2 - 1) * 2
else:
x += 1
return sigma(x // 2 - 1) * 2 - x // 2 + 1
debugging = 1
# Code
n, balance = intsput()
if maxbalance(n) < balance:
print(-1)
exit()
else:
if n == 2:
print('1 2')
exit()
elif n == 1:
print('1')
exit()
largest = 2
dist = [1, 2]
k = 1
while len(dist) < n:
if balance:
x = dist[-1] + 1
can_create = (x - 1) // 2
if can_create <= balance:
dist.append(x)
balance -= can_create
largest = x
else:
dist.append(dist[- (balance * 2)] + dist[-1])
balance = 0
#used = set(dist)
else:
dist.append(10 ** 8 + 10 ** 4 * k + 1)
k += 1
print(*dist)
```
Yes
| 103,054 | [
0.30517578125,
0.1536865234375,
-0.189453125,
0.24853515625,
-0.81591796875,
-0.280029296875,
-0.07373046875,
0.201904296875,
-0.1829833984375,
1.1015625,
0.74072265625,
0.0025043487548828125,
0.421630859375,
-0.95751953125,
-0.69873046875,
0.113037109375,
-0.58984375,
-0.873046875... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
dic={}
count=0
for i in range(1,5001):
count+=(i-1)//2
dic[i]=count
n,m=map(int,input().split())
if(m>dic[n]):print(-1)
elif(m==0):
print(*[450000000+i for i in range(n)])
else:
ls=[]
flag=False
for i in range(1,5001):
if(dic[i]>m):
flag=True
break
else:
ls.append(i)
if(flag):m-=dic[i-1]
else:m-=dic[i]
if(m):ls.append(ls[-1]+ls[-2*m])
if(len(ls)<=n):
x=ls[-1]+ls[-2*m]
for i in range(n-len(ls)):
ls.append(10**7+x*i)
ls.sort()
print(*ls)
else:
print(-1)
```
Yes
| 103,055 | [
0.367919921875,
0.0919189453125,
-0.229248046875,
0.26416015625,
-0.76953125,
-0.276123046875,
-0.05926513671875,
0.331298828125,
-0.173583984375,
1.0205078125,
0.755859375,
-0.0206451416015625,
0.416259765625,
-0.90869140625,
-0.6748046875,
0.1170654296875,
-0.5654296875,
-0.78759... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
n, m = map(int, input().split(' '))
limit = 0
for i in range(3, n + 1):
limit += (i - 1) // 2
if m > limit:
print(-1)
else:
a = [i for i in range(1, n + 1)]
count = limit
i = n
while count > m:
curr = (i - 1) // 2
to_del = min(curr, count - m)
if to_del == curr:
a[i - 1] = 1000000000 - (n - i) * 10000
else:
a[i - 1] = a[i - 2] + a[i - 1 - 2 * (curr - to_del)]
count -= to_del
i -= 1
print(' '.join(map(str, a)))
```
Yes
| 103,056 | [
0.37744140625,
0.09381103515625,
-0.2392578125,
0.23681640625,
-0.72998046875,
-0.2626953125,
-0.06512451171875,
0.312744140625,
-0.2137451171875,
1.0166015625,
0.76416015625,
-0.035858154296875,
0.404052734375,
-0.9130859375,
-0.68017578125,
0.119140625,
-0.5478515625,
-0.80419921... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
n,m = map(int,input().split())
a=[0]*5001
for i in range(1,5001):
a[i]=(i-1)//2
# print(a[:20])
for i in range(1,5001):
a[i]=a[i]+a[i-1]
# print(a[:20])
ans=[]
if m==0:
# ans.append(1)
aa=1
for i in range(n):
ans.append(aa)
aa=aa+4
print(*ans)
elif m>a[n]:
print(-1)
else:
if m in a:
ind = a.index(m)
for i in range(1,ind+1):
ans.append(i)
else:
for i in range(1,5000):
if a[i]<m<a[i+1]:
for j in range(1,i+1):
ans.append(j)
gap = m-a[i]
# print(gap,i)
ans.append(2*i-2*gap+1)
l=len(ans)
if l<n :
aa = ans[l-1]
x=aa+1
for k in range(n-l):
ans.append(aa+x)
aa = aa+x
print(len(ans))
print(*ans)
```
No
| 103,057 | [
0.380126953125,
0.103759765625,
-0.25048828125,
0.2216796875,
-0.73779296875,
-0.265869140625,
-0.0750732421875,
0.322509765625,
-0.216064453125,
1.0205078125,
0.7626953125,
-0.0211334228515625,
0.41015625,
-0.91064453125,
-0.67333984375,
0.10906982421875,
-0.5517578125,
-0.8046875... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
dic={}
count=0
for i in range(1,5001):
count+=(i-1)//2
dic[i]=count
n,m=map(int,input().split())
if(m>dic[n]):print(-1)
else:
ls=[]
for i in range(1,5000):
if(dic[i]>m):
break
else:
ls.append(i)
m-=dic[i-1]
while m and ls[-1]+ls[-2]<=10**9:
ls.append(ls[-1]+ls[-2])
m-=1
if(m):ls.append(10**9)
i=1
while m:
ls.append(10**9-i)
i+=1
m-=1
if(len(ls)<=n):
for i in range(n-len(ls)):
ls.append(10**9)
ls.sort()
print(*ls)
else:
print(-1)
```
No
| 103,058 | [
0.367919921875,
0.0919189453125,
-0.229248046875,
0.26416015625,
-0.76953125,
-0.276123046875,
-0.05926513671875,
0.331298828125,
-0.173583984375,
1.0205078125,
0.755859375,
-0.0206451416015625,
0.416259765625,
-0.90869140625,
-0.6748046875,
0.1170654296875,
-0.5654296875,
-0.78759... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
from sys import stdin
from bisect import bisect_left as bl
from bisect import bisect_right as br
def input():
return stdin.readline()[:-1]
def intput():
return int(input())
def sinput():
return input().split()
def intsput():
return map(int, sinput())
class RangedList:
def __init__(self, start, stop, val=0):
self.shift = 0 - start
self.start = start
self.stop = stop
self.list = [val] * (stop - start)
def __setitem__(self, key, value):
self.list[key + self.shift] = value
def __getitem__(self, key):
return self.list[key + self.shift]
def __repr__(self):
return str(self.list)
def __iter__(self):
return iter(self.list)
def dprint(*args, **kwargs):
if debugging:
print(*args, **kwargs)
def sigma(x):
return x * (x + 1) // 2
def maxbalance(x):
if x % 2 == 0:
return sigma(x // 2 - 1) * 2
else:
x += 1
return sigma(x // 2 - 1) * 2 - x // 2 + 1
debugging = 1
# Code
n, balance = intsput()
if maxbalance(n) < balance:
print(-1)
exit()
else:
if n <= 2:
print('1 2')
exit()
largest = 2
dist = [1, 2]
k = 1
while len(dist) < n:
if balance:
x = dist[-1] + 1
can_create = (x - 1) // 2
if can_create <= balance:
dist.append(x)
balance -= can_create
largest = x
else:
dist.append(dist[- (balance * 2)] + dist[-1])
balance = 0
#used = set(dist)
else:
dist.append(10 ** 8 + 10 ** 4 * k + 1)
k += 1
print(*dist)
```
No
| 103,059 | [
0.30517578125,
0.1536865234375,
-0.189453125,
0.24853515625,
-0.81591796875,
-0.280029296875,
-0.07373046875,
0.201904296875,
-0.1829833984375,
1.1015625,
0.74072265625,
0.0025043487548828125,
0.421630859375,
-0.95751953125,
-0.69873046875,
0.113037109375,
-0.58984375,
-0.873046875... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kuroni is the coordinator of the next Mathforces round written by the "Proof by AC" team. All the preparation has been done, and he is discussing with the team about the score distribution for the round.
The round consists of n problems, numbered from 1 to n. The problems are ordered in increasing order of difficulty, no two problems have the same difficulty. A score distribution for the round can be denoted by an array a_1, a_2, ..., a_n, where a_i is the score of i-th problem.
Kuroni thinks that the score distribution should satisfy the following requirements:
* The score of each problem should be a positive integer not exceeding 10^9.
* A harder problem should grant a strictly higher score than an easier problem. In other words, 1 ≤ a_1 < a_2 < ... < a_n ≤ 10^9.
* The balance of the score distribution, defined as the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and a_i + a_j = a_k, should be exactly m.
Help the team find a score distribution that satisfies Kuroni's requirement. In case such a score distribution does not exist, output -1.
Input
The first and single line contains two integers n and m (1 ≤ n ≤ 5000, 0 ≤ m ≤ 10^9) — the number of problems and the required balance.
Output
If there is no solution, print a single integer -1.
Otherwise, print a line containing n integers a_1, a_2, ..., a_n, representing a score distribution that satisfies all the requirements. If there are multiple answers, print any of them.
Examples
Input
5 3
Output
4 5 9 13 18
Input
8 0
Output
10 11 12 13 14 15 16 17
Input
4 10
Output
-1
Note
In the first example, there are 3 triples (i, j, k) that contribute to the balance of the score distribution.
* (1, 2, 3)
* (1, 3, 4)
* (2, 4, 5)
Submitted Solution:
```
def Fib(n):
f = [1,2]
for i in range(3,n+1):
x = f[-1]+f[-2]
f.append(x)
return f
fib = Fib(10001)
# print(fib)
def f():
n, m = [int(s) for s in input().split()]
if m >=n-1:
print(-1)
return
ans = fib[:m+2]
i = m
for j in range(n-(m+2)):
ans.append(fib[i])
i += 2
print(' '.join(str(num) for num in ans))
f()
```
No
| 103,060 | [
0.321533203125,
0.03741455078125,
-0.1339111328125,
0.269775390625,
-0.75244140625,
-0.29736328125,
-0.103271484375,
0.329833984375,
-0.2410888671875,
0.94775390625,
0.80517578125,
-0.0635986328125,
0.49462890625,
-0.9833984375,
-0.73388671875,
0.138671875,
-0.587890625,
-0.7470703... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
n = int(input())
p = 0
a = []
for _ in range(n):
x, k = list(map(int, input().split()))
while k > len(a):
a.append(-1)
k = k - 1
if a[k] < x - 1:
print('NO')
exit()
else:
a[k] = max(x, a[k])
print('YES')
```
| 103,223 | [
0.40771484375,
-0.2171630859375,
0.1370849609375,
0.2261962890625,
-0.380615234375,
-0.57568359375,
-0.361328125,
-0.056396484375,
0.4033203125,
0.72314453125,
0.37109375,
-0.11309814453125,
0.156494140625,
-0.728515625,
-0.71484375,
-0.0027942657470703125,
-0.669921875,
-0.6386718... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
def readln(): return tuple(map(int, input().split()))
n, = readln()
max_pref = [-1] * 100001
flag = True
for _ in range(n):
x, k = readln()
flag &= max_pref[k] + 1 >= x
max_pref[k] = max(max_pref[k], x)
print('YES' if flag else 'NO')
```
| 103,224 | [
0.471923828125,
-0.278076171875,
0.153076171875,
0.2493896484375,
-0.431640625,
-0.55322265625,
-0.324951171875,
-0.0933837890625,
0.360595703125,
0.7578125,
0.3955078125,
-0.12213134765625,
0.2415771484375,
-0.7939453125,
-0.6494140625,
0.006992340087890625,
-0.7021484375,
-0.6064... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
c = [0] * 100001
for i in range(int(input())):
x, k = map(int, input().split())
if x == c[k]:
c[k] += 1
elif x > c[k]:
print('NO')
exit()
print('YES')
```
| 103,225 | [
0.4189453125,
-0.237060546875,
0.1207275390625,
0.1826171875,
-0.370849609375,
-0.56640625,
-0.373779296875,
-0.055755615234375,
0.35205078125,
0.736328125,
0.395263671875,
-0.0802001953125,
0.1317138671875,
-0.76708984375,
-0.73779296875,
-0.0227203369140625,
-0.66796875,
-0.59863... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
d = [0] * 100001
for _ in range(int(input())):
v, k = map(int, input().split())
if v > d[k]:
print('NO')
exit()
elif v == d[k]:
d[k] += 1
print('YES')
```
| 103,226 | [
0.4130859375,
-0.2437744140625,
0.09344482421875,
0.1785888671875,
-0.38232421875,
-0.544921875,
-0.352294921875,
-0.0595703125,
0.388671875,
0.7294921875,
0.358154296875,
-0.10968017578125,
0.1541748046875,
-0.712890625,
-0.7451171875,
-0.026031494140625,
-0.64404296875,
-0.597656... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
n = int(input())
a = [-1]*100001
p = 0
for i in range(n):
x, k = map(int, input().split())
if a[k] < x-1:
p = 1
else:
a[k] = max(a[k],x)
if p:
print('NO')
else:
print('YES')
```
| 103,227 | [
0.408447265625,
-0.221435546875,
0.09783935546875,
0.22509765625,
-0.374755859375,
-0.58740234375,
-0.35595703125,
-0.07568359375,
0.375,
0.77685546875,
0.389404296875,
-0.11956787109375,
0.1610107421875,
-0.74169921875,
-0.70361328125,
-0.00820159912109375,
-0.6630859375,
-0.64404... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
from collections import deque
for _ in range(1):
n = int(input())
visited = set()
flag = 1
for i in range(n):
x,k = map(int,input().split())
if x == 0:
visited.add((x,k))
else:
if (x-1,k) in visited:
visited.add((x, k))
else:
flag = 0
if flag:
print("YES")
else:
print("NO")
```
| 103,228 | [
0.357666015625,
-0.1839599609375,
0.1173095703125,
0.1431884765625,
-0.34716796875,
-0.404541015625,
-0.3544921875,
-0.0218658447265625,
0.46240234375,
0.7333984375,
0.37109375,
-0.1300048828125,
0.1787109375,
-0.7275390625,
-0.74365234375,
-0.044677734375,
-0.6884765625,
-0.600585... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
data = {}
for _ in range(int(input())):
x, k = map(int, input().split())
if k in data:
data[k].append(x)
else:
data[k] = [x]
flag = True
for counts in data.values():
allowed = 0
for count in counts:
if count > allowed:
flag = False
break
if count == allowed:
allowed += 1
if not flag:
break
print(['NO', 'YES'][flag])
```
| 103,229 | [
0.40185546875,
-0.26953125,
0.11358642578125,
0.246826171875,
-0.393798828125,
-0.52490234375,
-0.373779296875,
-0.0777587890625,
0.387451171875,
0.74951171875,
0.30322265625,
-0.0736083984375,
0.2156982421875,
-0.7900390625,
-0.70654296875,
0.0038051605224609375,
-0.67138671875,
-... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Tags: implementation
Correct Solution:
```
#the basic idea is to use a dict to record every participant's submission
n = int(input())
participants = {}
order = True
while n:
n -= 1
x, k = map(int,input().split())
if k in participants:
if x in participants[k]:
continue
elif x-1 in participants[k]:
participants[k].add(x)
else:
order = False
break
else:
if x != 0:
order = False
break
tmp = set()
tmp.add(x)
participants[k] = tmp
if order:
print("YES")
else:
print("NO")
```
| 103,230 | [
0.32861328125,
-0.2059326171875,
0.037200927734375,
0.193603515625,
-0.327880859375,
-0.54833984375,
-0.371826171875,
-0.09002685546875,
0.423583984375,
0.76708984375,
0.29736328125,
-0.1572265625,
0.14990234375,
-0.751953125,
-0.70263671875,
-0.06536865234375,
-0.69384765625,
-0.6... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
n = int(input())
m = []
d = dict()
for i in range(n):
x, k = map(int, input().split())
if k in d:
r = d[k]
if x > r+1:
print('NO')
exit()
d[k] = max(r, x)
else:
if x != 0:
print('NO')
exit()
d[k] = x
print('YES')
```
Yes
| 103,231 | [
0.478759765625,
-0.1392822265625,
0.0888671875,
0.07403564453125,
-0.43896484375,
-0.390869140625,
-0.33544921875,
0.1317138671875,
0.312255859375,
0.7734375,
0.308837890625,
-0.0902099609375,
0.10723876953125,
-0.8291015625,
-0.685546875,
-0.18017578125,
-0.638671875,
-0.65234375,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
sol=int(input())
list1=[]
for i in range(10**5+1):
list1.append([])
for i in range(sol):
a,b=input().split()
b=int(b)
list1[b].append(a)
i=0
v=True
while i<10**5+1 and v:
j=0
z=-1
while j<len(list1[i]) and v:
if (int(list1[i][j])-z)==1:
z=int(list1[i][j])
elif int(list1[i][j])-z>1:
v=False
j+=1
i+=1
if v==True:
print("YES")
else:
print("NO")
```
Yes
| 103,232 | [
0.496337890625,
-0.07012939453125,
0.16357421875,
0.0261077880859375,
-0.55419921875,
-0.3857421875,
-0.36962890625,
0.092041015625,
0.4052734375,
0.74755859375,
0.310302734375,
-0.1195068359375,
0.12744140625,
-0.80029296875,
-0.7109375,
-0.1822509765625,
-0.58935546875,
-0.628417... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
all = {}
n = int(input())
ans = True
for i in range(n):
x_k = input().split()
x = int(x_k[0])
k = int(x_k[1])
if k not in all:
all[k] = -1
if all[k] >= x:
pass
elif all[k]+1 != x:
ans = False
break
else:
all[k] = x
if ans:
print("YES")
else:
print("NO")
```
Yes
| 103,233 | [
0.5693359375,
-0.05767822265625,
0.112548828125,
0.047149658203125,
-0.416259765625,
-0.431396484375,
-0.306884765625,
0.08740234375,
0.4111328125,
0.8017578125,
0.385498046875,
-0.146728515625,
0.10089111328125,
-0.8818359375,
-0.740234375,
-0.2122802734375,
-0.62451171875,
-0.612... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
import sys
n = int(input())
c = [-1] * (10**5+1)
for i in range(n):
x,k = map(int,input().split())
if c[k] < x-1:
print("NO")
sys.exit()
else:
c[k] = max(c[k],x)
print("YES")
```
Yes
| 103,234 | [
0.51611328125,
-0.093994140625,
0.140380859375,
0.095458984375,
-0.490966796875,
-0.37109375,
-0.35693359375,
0.1148681640625,
0.28955078125,
0.7265625,
0.274169921875,
-0.09381103515625,
0.11614990234375,
-0.8076171875,
-0.72216796875,
-0.2109375,
-0.59912109375,
-0.60888671875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
n,q,t=int(input()),{},0
for i in range(n):
a,x=map(int,input().split())
if a not in q:q[a]=[x]
else:q[a].append(x)
for i in q:
k=list(q[i])
q[i].sort()
if k!=q[i]:
t=1
break
print(["YES","NO"][t])
```
No
| 103,235 | [
0.457763671875,
-0.11029052734375,
0.07415771484375,
0.06982421875,
-0.509765625,
-0.348876953125,
-0.39990234375,
0.149658203125,
0.30517578125,
0.78515625,
0.281494140625,
-0.09527587890625,
0.08013916015625,
-0.81298828125,
-0.69775390625,
-0.1976318359375,
-0.630859375,
-0.6308... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
from collections import OrderedDict
all = {}
n = int(input())
for i in range(n):
x_k = input().split()
x = int(x_k[0])
k = int(x_k[1])
if k not in all:
all[k] = OrderedDict()
all[k][x] = True
# print("new", k, all[k])
else:
all[k][x] = True
# print("old", k, all[k])
def check(dic):
l = []
for x in dic:
l.append(x)
el = l[0]
for i in range(1, len(l)):
if l[i] < el:
return False
else:
el = l[i]
continue
return True
ans = True
for x in all:
if check(all[x]):
continue
else:
ans = False
if ans:
print("YES")
else:
print("NO")
```
No
| 103,236 | [
0.425048828125,
-0.142333984375,
0.03759765625,
0.037994384765625,
-0.414306640625,
-0.327392578125,
-0.417236328125,
0.041595458984375,
0.437744140625,
0.806640625,
0.321533203125,
-0.236572265625,
0.05633544921875,
-0.90966796875,
-0.71875,
-0.273681640625,
-0.7099609375,
-0.6157... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
import sys
from collections import defaultdict
n = int(sys.stdin.readline())
d = defaultdict(lambda:-1)
for i in range(0, n):
x, k = map(int, sys.stdin.readline().split())
z = d[k]
if x == z + 1:
d[k] = x
else:
print('NO')
sys.exit(0)
print('YES')
```
No
| 103,237 | [
0.42431640625,
-0.1102294921875,
0.11737060546875,
0.0292510986328125,
-0.509765625,
-0.31103515625,
-0.417236328125,
0.097900390625,
0.330322265625,
0.814453125,
0.281982421875,
-0.2257080078125,
0.09661865234375,
-0.7861328125,
-0.734375,
-0.2362060546875,
-0.62939453125,
-0.6274... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.
Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.
It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.
During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 105; 1 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.
Output
A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.
Examples
Input
2
0 1
1 1
Output
YES
Input
4
0 1
1 2
1 1
0 2
Output
NO
Input
4
0 1
1 1
0 1
0 2
Output
YES
Submitted Solution:
```
from collections import OrderedDict
all = {}
n = int(input())
ans = True
for i in range(n):
x_k = input().split()
x = int(x_k[0])
k = int(x_k[1])
if k not in all:
all[k] = x
# print("new", k, all[k])
elif all[k] > x:
continue
elif all[k]+1 != x:
ans = False
break
# print("old", k, all[k])
if ans:
print("YES")
else:
print("NO")
```
No
| 103,238 | [
0.525390625,
-0.113037109375,
0.0452880859375,
0.055450439453125,
-0.435791015625,
-0.389404296875,
-0.3896484375,
0.058868408203125,
0.40576171875,
0.798828125,
0.357177734375,
-0.1925048828125,
0.0933837890625,
-0.87158203125,
-0.72998046875,
-0.248291015625,
-0.677734375,
-0.648... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Codeforces is a wonderful platform and one its feature shows how much someone contributes to the community. Every registered user has contribution — an integer number, not necessarily positive. There are n registered users and the i-th of them has contribution ti.
Limak is a little polar bear and he's new into competitive programming. He doesn't even have an account in Codeforces but he is able to upvote existing blogs and comments. We assume that every registered user has infinitely many blogs and comments.
* Limak can spend b minutes to read one blog and upvote it. Author's contribution will be increased by 5.
* Limak can spend c minutes to read one comment and upvote it. Author's contribution will be increased by 1.
Note that it's possible that Limak reads blogs faster than comments.
Limak likes ties. He thinks it would be awesome to see a tie between at least k registered users. To make it happen he is going to spend some time on reading and upvoting. After that, there should exist an integer value x that at least k registered users have contribution exactly x.
How much time does Limak need to achieve his goal?
Input
The first line contains four integers n, k, b and c (2 ≤ k ≤ n ≤ 200 000, 1 ≤ b, c ≤ 1000) — the number of registered users, the required minimum number of users with the same contribution, time needed to read and upvote a blog, and time needed to read and upvote a comment, respectively.
The second line contains n integers t1, t2, ..., tn (|ti| ≤ 109) where ti denotes contribution of the i-th registered user.
Output
Print the minimum number of minutes Limak will spend to get a tie between at least k registered users.
Examples
Input
4 3 100 30
12 2 6 1
Output
220
Input
4 3 30 100
12 2 6 1
Output
190
Input
6 2 987 789
-8 42 -4 -65 -8 -8
Output
0
Note
In the first sample, there are 4 registered users and Limak wants a tie between at least 3 of them. Limak should behave as follows.
* He spends 100 minutes to read one blog of the 4-th user and increase his contribution from 1 to 6.
* Then he spends 4·30 = 120 minutes to read four comments of the 2-nd user and increase his contribution from 2 to 6 (four times it was increaded by 1).
In the given scenario, Limak spends 100 + 4·30 = 220 minutes and after that each of users 2, 3, 4 has contribution 6.
In the second sample, Limak needs 30 minutes to read a blog and 100 minutes to read a comment. This time he can get 3 users with contribution equal to 12 by spending 100 + 3·30 = 190 minutes:
* Spend 2·30 = 60 minutes to read two blogs of the 1-st user to increase his contribution from 2 to 12.
* Spend 30 + 100 minutes to read one blog and one comment of the 3-rd user. His contribution will change from 6 to 6 + 5 + 1 = 12.
Submitted Solution:
```
def main():
def ta(k_g):
tim = 0
while k_g >= 5:
if preferred_c:
tim += c * 5
else:
tim += b
k_g -= 5
while k_g >= 1:
tim += c
k_g -= 1
return tim
line = input().split()
n = int(line[0]) # кол-во зарег пользователей
k = int(line[1]) # мин кол-во группы один. по вкладу
b = int(line[2]) # время блога
c = int(line[3]) # время комента
line = input().split()
t = [] # вклад пользователя ti
for _ in range(len(line)):
t.append(int(line[_]))
t.sort()
# check the most efficient thing
preferred_c = False # min, points
if c * 5 < b:
preferred_c = True
t_min = 10000000000
for ti in range(len(t) - k + 1):
t_temp = 0
for _ in range(k):
k_temp = abs(t[ti + k - 1] - t[ti + _])
t_temp += ta(k_temp)
if t_temp < t_min:
t_min = t_temp
print(t_min)
main()
```
No
| 103,326 | [
0.64404296875,
0.29296875,
-0.51123046875,
0.065673828125,
-0.30126953125,
-0.019683837890625,
0.08026123046875,
0.22216796875,
0.047760009765625,
0.95166015625,
0.29736328125,
0.00394439697265625,
0.198974609375,
-0.76123046875,
-0.355712890625,
0.0631103515625,
-0.331298828125,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Codeforces is a wonderful platform and one its feature shows how much someone contributes to the community. Every registered user has contribution — an integer number, not necessarily positive. There are n registered users and the i-th of them has contribution ti.
Limak is a little polar bear and he's new into competitive programming. He doesn't even have an account in Codeforces but he is able to upvote existing blogs and comments. We assume that every registered user has infinitely many blogs and comments.
* Limak can spend b minutes to read one blog and upvote it. Author's contribution will be increased by 5.
* Limak can spend c minutes to read one comment and upvote it. Author's contribution will be increased by 1.
Note that it's possible that Limak reads blogs faster than comments.
Limak likes ties. He thinks it would be awesome to see a tie between at least k registered users. To make it happen he is going to spend some time on reading and upvoting. After that, there should exist an integer value x that at least k registered users have contribution exactly x.
How much time does Limak need to achieve his goal?
Input
The first line contains four integers n, k, b and c (2 ≤ k ≤ n ≤ 200 000, 1 ≤ b, c ≤ 1000) — the number of registered users, the required minimum number of users with the same contribution, time needed to read and upvote a blog, and time needed to read and upvote a comment, respectively.
The second line contains n integers t1, t2, ..., tn (|ti| ≤ 109) where ti denotes contribution of the i-th registered user.
Output
Print the minimum number of minutes Limak will spend to get a tie between at least k registered users.
Examples
Input
4 3 100 30
12 2 6 1
Output
220
Input
4 3 30 100
12 2 6 1
Output
190
Input
6 2 987 789
-8 42 -4 -65 -8 -8
Output
0
Note
In the first sample, there are 4 registered users and Limak wants a tie between at least 3 of them. Limak should behave as follows.
* He spends 100 minutes to read one blog of the 4-th user and increase his contribution from 1 to 6.
* Then he spends 4·30 = 120 minutes to read four comments of the 2-nd user and increase his contribution from 2 to 6 (four times it was increaded by 1).
In the given scenario, Limak spends 100 + 4·30 = 220 minutes and after that each of users 2, 3, 4 has contribution 6.
In the second sample, Limak needs 30 minutes to read a blog and 100 minutes to read a comment. This time he can get 3 users with contribution equal to 12 by spending 100 + 3·30 = 190 minutes:
* Spend 2·30 = 60 minutes to read two blogs of the 1-st user to increase his contribution from 2 to 12.
* Spend 30 + 100 minutes to read one blog and one comment of the 3-rd user. His contribution will change from 6 to 6 + 5 + 1 = 12.
Submitted Solution:
```
def main():
def ta(k_g):
tim = 0
while k_g >= 5:
if preferred_c:
tim += c * 5
else:
tim += b
k_g -= 5
while k_g >= 1:
tim += c
k_g -= 1
return tim
line = input().split()
n = int(line[0]) # кол-во зарег пользователей
k = int(line[1]) # мин кол-во группы один. по вкладу
b = int(line[2]) # время блога
c = int(line[3]) # время комента
line = input().split()
t = [] # вклад пользователя ti
for _ in range(n):
t.append(int(line[_]))
t.sort()
# check the most efficient thing
preferred_c = False # min, points
if c * 5 < b:
preferred_c = True
t_min = 10000000000
for ti in range(len(t) - k + 1):
for tj in range(ti, len(t) - k + 1):
if tj > ti:
break
t_temp = 0
for _ in range(k):
k_temp = abs(t[ti + k - 1] - t[ti + _])
t_temp += ta(k_temp)
if t_temp < t_min:
t_min = t_temp
print(t_min)
main()
```
No
| 103,327 | [
0.64404296875,
0.29296875,
-0.51123046875,
0.065673828125,
-0.30126953125,
-0.019683837890625,
0.08026123046875,
0.22216796875,
0.047760009765625,
0.95166015625,
0.29736328125,
0.00394439697265625,
0.198974609375,
-0.76123046875,
-0.355712890625,
0.0631103515625,
-0.331298828125,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us define the FizzBuzz sequence a_1,a_2,... as follows:
* If both 3 and 5 divides i, a_i=\mbox{FizzBuzz}.
* If the above does not hold but 3 divides i, a_i=\mbox{Fizz}.
* If none of the above holds but 5 divides i, a_i=\mbox{Buzz}.
* If none of the above holds, a_i=i.
Find the sum of all numbers among the first N terms of the FizzBuzz sequence.
Constraints
* 1 \leq N \leq 10^6
Input
Input is given from Standard Input in the following format:
N
Output
Print the sum of all numbers among the first N terms of the FizzBuzz sequence.
Examples
Input
15
Output
60
Input
1000000
Output
266666333332
Submitted Solution:
```
n = int(input())
fb = 0
for i in range(n):
if(i%5 != 0 and i%3 != 0):
fb = fb + i
print(fb)
```
No
| 103,458 | [
0.457275390625,
-0.07135009765625,
0.1556396484375,
-0.1123046875,
-0.1634521484375,
-0.61767578125,
-0.015960693359375,
0.20556640625,
-0.00875091552734375,
0.82275390625,
0.3515625,
-0.0899658203125,
0.30419921875,
-1.01171875,
-0.595703125,
-0.267333984375,
-0.75634765625,
-0.73... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N items and a bag of strength W. The i-th item has a weight of w_i and a value of v_i.
You will select some of the items and put them in the bag. Here, the total weight of the selected items needs to be at most W.
Your objective is to maximize the total value of the selected items.
Constraints
* 1 ≤ N ≤ 100
* 1 ≤ W ≤ 10^9
* 1 ≤ w_i ≤ 10^9
* For each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.
* 1 ≤ v_i ≤ 10^7
* W, each w_i and v_i are integers.
Input
Input is given from Standard Input in the following format:
N W
w_1 v_1
w_2 v_2
:
w_N v_N
Output
Print the maximum possible total value of the selected items.
Examples
Input
4 6
2 1
3 4
4 10
3 4
Output
11
Input
4 6
2 1
3 7
4 10
3 6
Output
13
Input
4 10
1 100
1 100
1 100
1 100
Output
400
Input
4 1
10 100
10 100
10 100
10 100
Output
0
Submitted Solution:
```
N,W = map(int,input().split())
dic = {"0":[],"1":[],"2":[],"3":[]}
for i in range(N):
w,v = map(int,input().split())
if i == 0:
Min = w
if w == Min:
dic["0"].append(v)
elif w == Min+1:
dic["1"].append(v)
elif w == Min+2:
dic["2"].append(v)
elif w == Min+3:
dic["3"].append(v)
dic["0"].sort(reverse=True)
dic["1"].sort(reverse=True)
dic["2"].sort(reverse=True)
dic["3"].sort(reverse=True)
ans = 0
for i in range(len(dic["0"])+1):
for j in range(len(dic["1"])+1):
for k in range(len(dic["2"])+1):
for l in range(len(dic["3"])+1):
a = int(sum(dic["0"][:i])+sum(dic["1"][:j])+sum(dic["2"][:k])+sum(dic["3"][:l]))
b = int(i*Min+j*(Min+1)+k*(Min+2)+l*(Min+3))
if a > ans and b <= W:
ans = a
print(int(ans))
```
Yes
| 103,551 | [
0.205078125,
-0.0855712890625,
-0.1390380859375,
0.255615234375,
-0.6943359375,
0.08111572265625,
-0.2098388671875,
0.302001953125,
-0.041778564453125,
0.97802734375,
0.56103515625,
0.00482177734375,
0.3173828125,
-0.78466796875,
-0.37158203125,
0.0755615234375,
-0.8603515625,
-0.7... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N items and a bag of strength W. The i-th item has a weight of w_i and a value of v_i.
You will select some of the items and put them in the bag. Here, the total weight of the selected items needs to be at most W.
Your objective is to maximize the total value of the selected items.
Constraints
* 1 ≤ N ≤ 100
* 1 ≤ W ≤ 10^9
* 1 ≤ w_i ≤ 10^9
* For each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.
* 1 ≤ v_i ≤ 10^7
* W, each w_i and v_i are integers.
Input
Input is given from Standard Input in the following format:
N W
w_1 v_1
w_2 v_2
:
w_N v_N
Output
Print the maximum possible total value of the selected items.
Examples
Input
4 6
2 1
3 4
4 10
3 4
Output
11
Input
4 6
2 1
3 7
4 10
3 6
Output
13
Input
4 10
1 100
1 100
1 100
1 100
Output
400
Input
4 1
10 100
10 100
10 100
10 100
Output
0
Submitted Solution:
```
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,W = map(int,readline().split())
A1 = []
A2 = []
A3 = []
A4 = []
w1,v1 = map(int,readline().split())
A1.append(v1)
for _ in range(N-1):
w,v = map(int,readline().split())
if w == w1:
A1.append(v)
elif w == w1+1:
A2.append(v)
elif w == w1+2:
A3.append(v)
else:
A4.append(v)
S1 = list(accumulate(sorted(A1,reverse = True)))
S2 = list(accumulate(sorted(A2,reverse = True)))
S3 = list(accumulate(sorted(A3,reverse = True)))
S4 = list(accumulate(sorted(A4,reverse = True)))
S1 = [0] + S1
S2 = [0] + S2
S3 = [0] + S3
S4 = [0] + S4
ans = 0
for a in range(len(S1)):
for b in range(len(S2)):
for c in range(len(S3)):
for d in range(len(S4)):
tmp = w1*(a+b+c+d)+b+2*c+3*d
total = S1[a]+S2[b]+S3[c]+S4[d]
if tmp <= W:
ans = max(ans,total)
print(ans)
```
Yes
| 103,552 | [
0.2176513671875,
-0.039398193359375,
-0.10736083984375,
0.384765625,
-0.68994140625,
0.0206298828125,
-0.2005615234375,
0.11846923828125,
0.0872802734375,
0.84228515625,
0.44677734375,
-0.04974365234375,
0.41357421875,
-0.64599609375,
-0.314697265625,
0.08795166015625,
-0.81982421875... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N items and a bag of strength W. The i-th item has a weight of w_i and a value of v_i.
You will select some of the items and put them in the bag. Here, the total weight of the selected items needs to be at most W.
Your objective is to maximize the total value of the selected items.
Constraints
* 1 ≤ N ≤ 100
* 1 ≤ W ≤ 10^9
* 1 ≤ w_i ≤ 10^9
* For each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.
* 1 ≤ v_i ≤ 10^7
* W, each w_i and v_i are integers.
Input
Input is given from Standard Input in the following format:
N W
w_1 v_1
w_2 v_2
:
w_N v_N
Output
Print the maximum possible total value of the selected items.
Examples
Input
4 6
2 1
3 4
4 10
3 4
Output
11
Input
4 6
2 1
3 7
4 10
3 6
Output
13
Input
4 10
1 100
1 100
1 100
1 100
Output
400
Input
4 1
10 100
10 100
10 100
10 100
Output
0
Submitted Solution:
```
N, W = map(int, input().split())
WV = [tuple(map(int, input().split())) for _ in range(N)]
R = 3 * N + 10
INF = 10**18
w0 = WV[0][0]
dp = [[-INF] * R for _ in range(N + 1)]
dp[0][0] = 0
for w, v in WV:
k = w - w0
for n in range(N)[::-1]:
for r in range(R)[::-1]:
if r + k < R and dp[n + 1][r + k] < dp[n][r] + v:
dp[n + 1][r + k] = dp[n][r] + v
ans = 0
for n in range(N + 1):
for r in range(R):
w = n * w0 + r
if w <= W and dp[n][r] > ans:
ans = dp[n][r]
print(ans)
```
Yes
| 103,553 | [
0.3046875,
0.0394287109375,
-0.06561279296875,
0.5048828125,
-0.7470703125,
-0.0887451171875,
-0.1436767578125,
0.2041015625,
-0.062469482421875,
0.83349609375,
0.5703125,
0.046173095703125,
0.291259765625,
-0.70654296875,
-0.35205078125,
0.294189453125,
-0.84375,
-0.7099609375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N items and a bag of strength W. The i-th item has a weight of w_i and a value of v_i.
You will select some of the items and put them in the bag. Here, the total weight of the selected items needs to be at most W.
Your objective is to maximize the total value of the selected items.
Constraints
* 1 ≤ N ≤ 100
* 1 ≤ W ≤ 10^9
* 1 ≤ w_i ≤ 10^9
* For each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.
* 1 ≤ v_i ≤ 10^7
* W, each w_i and v_i are integers.
Input
Input is given from Standard Input in the following format:
N W
w_1 v_1
w_2 v_2
:
w_N v_N
Output
Print the maximum possible total value of the selected items.
Examples
Input
4 6
2 1
3 4
4 10
3 4
Output
11
Input
4 6
2 1
3 7
4 10
3 6
Output
13
Input
4 10
1 100
1 100
1 100
1 100
Output
400
Input
4 1
10 100
10 100
10 100
10 100
Output
0
Submitted Solution:
```
INFTY = 10**10
N,W = map(int,input().split())
X = [list(map(int,input().split())) for _ in range(N)]
dp = [[[-INFTY for _ in range(301)] for _ in range(N+1)] for _ in range(N+1)]
for i in range(N+1):
dp[i][0][0] = 0
for i in range(1,N+1):
for j in range(1,i+1):
for k in range(301):
dp[i][j][k] = dp[i-1][j][k]
if k>=X[i-1][0]-X[0][0]:
dp[i][j][k] = max(dp[i][j][k],dp[i-1][j-1][k-X[i-1][0]+X[0][0]]+X[i-1][1])
cmax = 0
for j in range(1,N+1):
for k in range(W-j*X[0][0]+1):
cmax = max(cmax,dp[N][j][k])
print(cmax)
```
No
| 103,555 | [
0.328125,
-0.0173797607421875,
-0.071044921875,
0.50146484375,
-0.708984375,
-0.046417236328125,
-0.2281494140625,
0.232421875,
0.0293731689453125,
0.87451171875,
0.69287109375,
0.047393798828125,
0.27685546875,
-0.7314453125,
-0.33203125,
0.2646484375,
-0.82177734375,
-0.661621093... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N items and a bag of strength W. The i-th item has a weight of w_i and a value of v_i.
You will select some of the items and put them in the bag. Here, the total weight of the selected items needs to be at most W.
Your objective is to maximize the total value of the selected items.
Constraints
* 1 ≤ N ≤ 100
* 1 ≤ W ≤ 10^9
* 1 ≤ w_i ≤ 10^9
* For each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.
* 1 ≤ v_i ≤ 10^7
* W, each w_i and v_i are integers.
Input
Input is given from Standard Input in the following format:
N W
w_1 v_1
w_2 v_2
:
w_N v_N
Output
Print the maximum possible total value of the selected items.
Examples
Input
4 6
2 1
3 4
4 10
3 4
Output
11
Input
4 6
2 1
3 7
4 10
3 6
Output
13
Input
4 10
1 100
1 100
1 100
1 100
Output
400
Input
4 1
10 100
10 100
10 100
10 100
Output
0
Submitted Solution:
```
n, W = map(int, input().split())
dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]
li = [list(map(int, input().split())) for _ in range(n)]
p = li[0][0]
for i, x in enumerate(li):
w, v = x
w -= p
for j in range(i + 1):
for k in range(301):
if k >= w:
if dp[i][j][k - w] + v > dp[i][j][k] and j + 1 <= 300:
dp[i + 1][j + 1][k] = max(dp[i + 1][j + 1][k],
dp[i][j][k - w] + v)
else:
dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])
else:
dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])
ans = 0
for i in range(n + 1):
for k in range(301):
if i * p + k <= W:
ans = max(dp[n][i][k], ans)
print(ans)
```
No
| 103,556 | [
0.26025390625,
0.00807952880859375,
-0.0271759033203125,
0.5234375,
-0.77001953125,
-0.0579833984375,
-0.244384765625,
0.2734375,
0.0205230712890625,
0.83349609375,
0.58837890625,
0.071044921875,
0.34619140625,
-0.64892578125,
-0.37548828125,
0.272216796875,
-0.8623046875,
-0.65576... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
There are N persons, conveniently numbered 1 through N. They will take 3y3s Challenge for N-1 seconds.
During the challenge, each person must look at each of the N-1 other persons for 1 seconds, in some order.
If any two persons look at each other during the challenge, the challenge ends in failure.
Find the order in which each person looks at each of the N-1 other persons, to be successful in the challenge.
Constraints
* 2 \leq N \leq 100
Input
The input is given from Standard Input in the following format:
N
Output
If there exists no way to be successful in the challenge, print `-1`.
If there exists a way to be successful in the challenge, print any such way in the following format:
A_{1,1} A_{1,2} ... A_{1, N-1}
A_{2,1} A_{2,2} ... A_{2, N-1}
:
A_{N,1} A_{N,2} ... A_{N, N-1}
where A_{i, j} is the index of the person that the person numbered i looks at during the j-th second.
Judging
The output is considered correct only if all of the following conditions are satisfied:
* 1 \leq A_{i,j} \leq N
* For each i, A_{i,1}, A_{i,2}, ... , A_{i, N-1} are pairwise distinct.
* Let X = A_{i, j}, then A_{X, j} \neq i always holds.
Examples
Input
7
Output
2 3 4 5 6 7
5 3 1 6 4 7
2 7 4 1 5 6
2 1 7 5 3 6
1 4 3 7 6 2
2 5 7 3 4 1
2 6 1 4 5 3
Input
2
Output
-1
"Correct Solution:
```
N = int(input())
if N == 2:
print(-1)
exit()
ans = [[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
for j in range(N-1):
ans[i][j] = (i+j+1)%N + 1
if N%2 == 0:
m = N//2
for i in range(m,N):
ans[i][m],ans[i][m-1] = ans[i][m-1],ans[i][m]
for row in ans:
print(' '.join(map(str,row)))
```
| 103,561 | [
0.5546875,
0.141845703125,
-0.0048980712890625,
0.2239990234375,
-0.4697265625,
-0.533203125,
-0.481689453125,
0.258056640625,
0.278564453125,
0.833984375,
0.40576171875,
-0.413818359375,
0.3916015625,
-0.7607421875,
-0.5146484375,
-0.197998046875,
-0.90576171875,
-0.60888671875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N persons, conveniently numbered 1 through N. They will take 3y3s Challenge for N-1 seconds.
During the challenge, each person must look at each of the N-1 other persons for 1 seconds, in some order.
If any two persons look at each other during the challenge, the challenge ends in failure.
Find the order in which each person looks at each of the N-1 other persons, to be successful in the challenge.
Constraints
* 2 \leq N \leq 100
Input
The input is given from Standard Input in the following format:
N
Output
If there exists no way to be successful in the challenge, print `-1`.
If there exists a way to be successful in the challenge, print any such way in the following format:
A_{1,1} A_{1,2} ... A_{1, N-1}
A_{2,1} A_{2,2} ... A_{2, N-1}
:
A_{N,1} A_{N,2} ... A_{N, N-1}
where A_{i, j} is the index of the person that the person numbered i looks at during the j-th second.
Judging
The output is considered correct only if all of the following conditions are satisfied:
* 1 \leq A_{i,j} \leq N
* For each i, A_{i,1}, A_{i,2}, ... , A_{i, N-1} are pairwise distinct.
* Let X = A_{i, j}, then A_{X, j} \neq i always holds.
Examples
Input
7
Output
2 3 4 5 6 7
5 3 1 6 4 7
2 7 4 1 5 6
2 1 7 5 3 6
1 4 3 7 6 2
2 5 7 3 4 1
2 6 1 4 5 3
Input
2
Output
-1
Submitted Solution:
```
n = int(input())
if n % 2 == 0:
print(-1)
exit()
for i in range(n):
print(" ".join([str((item + i + 1) % n + 1) for item in range(n-1)]))
```
No
| 103,562 | [
0.5986328125,
0.13232421875,
-0.037139892578125,
0.243896484375,
-0.5361328125,
-0.42041015625,
-0.45947265625,
0.2374267578125,
0.276611328125,
0.8525390625,
0.32861328125,
-0.259521484375,
0.326171875,
-0.64306640625,
-0.477294921875,
-0.2415771484375,
-0.7265625,
-0.689453125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N persons, conveniently numbered 1 through N. They will take 3y3s Challenge for N-1 seconds.
During the challenge, each person must look at each of the N-1 other persons for 1 seconds, in some order.
If any two persons look at each other during the challenge, the challenge ends in failure.
Find the order in which each person looks at each of the N-1 other persons, to be successful in the challenge.
Constraints
* 2 \leq N \leq 100
Input
The input is given from Standard Input in the following format:
N
Output
If there exists no way to be successful in the challenge, print `-1`.
If there exists a way to be successful in the challenge, print any such way in the following format:
A_{1,1} A_{1,2} ... A_{1, N-1}
A_{2,1} A_{2,2} ... A_{2, N-1}
:
A_{N,1} A_{N,2} ... A_{N, N-1}
where A_{i, j} is the index of the person that the person numbered i looks at during the j-th second.
Judging
The output is considered correct only if all of the following conditions are satisfied:
* 1 \leq A_{i,j} \leq N
* For each i, A_{i,1}, A_{i,2}, ... , A_{i, N-1} are pairwise distinct.
* Let X = A_{i, j}, then A_{X, j} \neq i always holds.
Examples
Input
7
Output
2 3 4 5 6 7
5 3 1 6 4 7
2 7 4 1 5 6
2 1 7 5 3 6
1 4 3 7 6 2
2 5 7 3 4 1
2 6 1 4 5 3
Input
2
Output
-1
Submitted Solution:
```
N = int(input())
ans = [[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
for j in range(N-1):
ans[i][j] = (i+j+1)%N + 1
if N%2 == 0 and N != 2:
m = N//2
for i in range(m,N):
ans[i][m],ans[i][m-1] = ans[i][m-1],ans[i][m]
elif N == 7:
ans[4][1],ans[4][2] = ans[4][2],ans[4][1]
ans[5][1],ans[5][2] = ans[5][2],ans[5][1]
for row in ans:
print(' '.join(map(str,row)))
```
No
| 103,563 | [
0.58154296875,
0.12744140625,
0.0263671875,
0.175048828125,
-0.54443359375,
-0.428955078125,
-0.46435546875,
0.260009765625,
0.226318359375,
0.89111328125,
0.36181640625,
-0.267822265625,
0.3212890625,
-0.65625,
-0.51123046875,
-0.2303466796875,
-0.7646484375,
-0.6513671875,
-0.5... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N persons, conveniently numbered 1 through N. They will take 3y3s Challenge for N-1 seconds.
During the challenge, each person must look at each of the N-1 other persons for 1 seconds, in some order.
If any two persons look at each other during the challenge, the challenge ends in failure.
Find the order in which each person looks at each of the N-1 other persons, to be successful in the challenge.
Constraints
* 2 \leq N \leq 100
Input
The input is given from Standard Input in the following format:
N
Output
If there exists no way to be successful in the challenge, print `-1`.
If there exists a way to be successful in the challenge, print any such way in the following format:
A_{1,1} A_{1,2} ... A_{1, N-1}
A_{2,1} A_{2,2} ... A_{2, N-1}
:
A_{N,1} A_{N,2} ... A_{N, N-1}
where A_{i, j} is the index of the person that the person numbered i looks at during the j-th second.
Judging
The output is considered correct only if all of the following conditions are satisfied:
* 1 \leq A_{i,j} \leq N
* For each i, A_{i,1}, A_{i,2}, ... , A_{i, N-1} are pairwise distinct.
* Let X = A_{i, j}, then A_{X, j} \neq i always holds.
Examples
Input
7
Output
2 3 4 5 6 7
5 3 1 6 4 7
2 7 4 1 5 6
2 1 7 5 3 6
1 4 3 7 6 2
2 5 7 3 4 1
2 6 1 4 5 3
Input
2
Output
-1
Submitted Solution:
```
N=int(input())
if N==2:
print(-1)
elif N&1:
P=[[0]*(N-1) for i in range(N)]
for i in range(N):
for j in range(N-1):
P[i][j]=(i+j+1)%N+1
for i in range(N):
print(*P[i])
else:
P=[[0]*(N-2) for i in range(N)]
P[0].append(0)
for i in range(N-1):
P[0][i]=i+2
for i in range(N-1):
for j in range(N-2):
P[i+1][j]=P[0][(i+j+1)%(N-1)]
P[i+1].insert(i-1,1)
for i in range(N):
print(*P[i])
```
No
| 103,564 | [
0.6064453125,
0.1534423828125,
-0.0203704833984375,
0.2122802734375,
-0.54443359375,
-0.426025390625,
-0.472900390625,
0.255126953125,
0.250244140625,
0.88232421875,
0.33642578125,
-0.244873046875,
0.32763671875,
-0.6396484375,
-0.490966796875,
-0.234375,
-0.74072265625,
-0.6899414... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N persons, conveniently numbered 1 through N. They will take 3y3s Challenge for N-1 seconds.
During the challenge, each person must look at each of the N-1 other persons for 1 seconds, in some order.
If any two persons look at each other during the challenge, the challenge ends in failure.
Find the order in which each person looks at each of the N-1 other persons, to be successful in the challenge.
Constraints
* 2 \leq N \leq 100
Input
The input is given from Standard Input in the following format:
N
Output
If there exists no way to be successful in the challenge, print `-1`.
If there exists a way to be successful in the challenge, print any such way in the following format:
A_{1,1} A_{1,2} ... A_{1, N-1}
A_{2,1} A_{2,2} ... A_{2, N-1}
:
A_{N,1} A_{N,2} ... A_{N, N-1}
where A_{i, j} is the index of the person that the person numbered i looks at during the j-th second.
Judging
The output is considered correct only if all of the following conditions are satisfied:
* 1 \leq A_{i,j} \leq N
* For each i, A_{i,1}, A_{i,2}, ... , A_{i, N-1} are pairwise distinct.
* Let X = A_{i, j}, then A_{X, j} \neq i always holds.
Examples
Input
7
Output
2 3 4 5 6 7
5 3 1 6 4 7
2 7 4 1 5 6
2 1 7 5 3 6
1 4 3 7 6 2
2 5 7 3 4 1
2 6 1 4 5 3
Input
2
Output
-1
Submitted Solution:
```
N = int(input())
ans = [[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
for j in range(N-1):
ans[i][j] = (i+j+1)%N + 1
if N%2 == 0 and N != 2:
m = N//2
for i in range(m,N):
ans[i][m],ans[i][m-1] = ans[i][m-1],ans[i][m]
for row in ans:
print(' '.join(map(str,row)))
```
No
| 103,565 | [
0.58154296875,
0.12744140625,
0.0263671875,
0.175048828125,
-0.54443359375,
-0.428955078125,
-0.46435546875,
0.260009765625,
0.226318359375,
0.89111328125,
0.36181640625,
-0.267822265625,
0.3212890625,
-0.65625,
-0.51123046875,
-0.2303466796875,
-0.7646484375,
-0.6513671875,
-0.5... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
2 3 1 3 1 0
Output
2
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
M, N, m0, md, n0, nd = map(int, readline().split())
S = [0]*(M+1)
S[0] = mi = m0
for i in range(1, M):
S[i] = mi = (mi * 58 + md) % (N + 1)
S.sort()
for i in range(M):
S[i+1] += S[i]
T = [0]*(N+1)
T[0] = ni = n0
for i in range(1, N):
T[i] = ni = (ni * 58 + nd) % (M + 1)
T.sort()
for i in range(N):
T[i+1] += T[i]
def gen():
def calc(a, b):
return (M - a)*(N - b) + S[a] + T[b]
yield 10**18
j = N
for i in range(M+1):
while j > 0 and calc(i, j) > calc(i, j-1):
j -= 1
yield calc(i, j)
write("%d\n" % min(gen()))
solve()
```
| 103,626 | [
0.030792236328125,
0.2135009765625,
0.056304931640625,
-0.15576171875,
-0.82861328125,
-0.43359375,
-0.287109375,
0.35009765625,
0.1419677734375,
0.88037109375,
0.1688232421875,
-0.053192138671875,
0.109130859375,
-0.51025390625,
-0.58935546875,
-0.43115234375,
-0.27392578125,
-0.7... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya is about to take his first university exam in about several minutes. And it's not just some ordinary exam, it's on mathematical analysis. Of course, right now Vasya can only think of one thing: what the result of his talk with the examiner will be...
To prepare for the exam, one has to study proofs of n theorems. It is known that there will be k examination cards on the exam and each card contains <image> distinct theorems. Besides, no theorem is mentioned in more than one card (that is, <image> theorems won't be mentioned in any card). During the exam several students may get the same card.
We do not know the exact way theorems are distributed by cards, however the students that took the exam before Vasya told him what theorems their cards contained. Vasya evaluates his level of proficiency in the i-th theorem by some number ai. The level of proficiency in some card is the average of the levels of proficiency in the theorems that are included in the card. Now Vasya wants to know the minimally and maximally possible levels of his proficiency in the card he gets on the exam. Vasya wants to determine it by the data he has collected from other students. Unfortunately, Vasya has no time left to do the math and he asked you to help him.
Input
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 100) — the number of theorems and the number of cards correspondingly. The second line contains n integers ai (0 ≤ ai ≤ 100), the i-th number (1 ≤ i ≤ n) corresponds to Vasya's proficiency in the i-th theorem.
The third line contains number q (0 ≤ q ≤ 100) — the number of people that have taken the exam before Vasya. Each of the following q lines contains the description of a student's card: <image> integers from 1 to n inclusive. They are the numbers of theorems included in the card in the order in which they are enumerated in the input data. The numbers are given in an arbitrary order. It is guaranteed that the given cards are valid (that is, that all theorems in one card are different and that different people get cards that either don't contain the same theorems or coincide up to the theorems' permutation).
Output
Print two real numbers, representing Vasya's minimum and maximum proficiency in the card he will get on the exam. The absolute or relative error should not exceed 10 - 6.
Examples
Input
7 3
7 15 0 19 10 5 12
2
1 6
7 4
Output
5.0000000000 15.5000000000
Input
4 2
10 8 1 17
2
2 3
3 2
Output
4.5000000000 13.5000000000
Note
Let's analyze the first sample. Vasya's proficiency in the cards whose content he already knows equals 6 and 15.5 correspondingly. The three theorems that are left are only enough to make one exam card. If we consider all possible variants of theorems included in the card we can see that in the best case scenario Vasya gets the card that contains theorems 4 and 7 (his proficiency would equal 15.5) and in the worst case scenario he gets theorems 3 and 5 (his proficiency would equal 5).
The ⌊ x⌋ operation denotes taking integer part of real number x (rounding down).
Submitted Solution:
```
num_problems, num_cards = map(int, input().split())
card_size = num_problems // num_cards
skill = [ 0 ] + list(map(int, input().split()))
seen = (num_problems + 1) * [ False ]
num_queries = int(input())
low = 100
high = 0
for i in range(num_queries):
proficiency = 0
for pos in map(int, input().split()):
proficiency += skill[pos]
seen[pos] = True
proficiency /= card_size
low = min(low, proficiency)
high = max(high, proficiency)
remaining = []
for pos in range(1, num_problems + 1):
if not seen[pos]:
remaining.append(skill[pos])
remaining.sort()
if num_queries < num_cards:
if len(remaining) != 0:
low = min(low, sum(remaining[:card_size]) / card_size)
high = max(high, sum(remaining[-card_size:]) / card_size)
print('%.8f %.8f' % (low, high))
```
No
| 103,785 | [
0.2587890625,
-0.060577392578125,
0.11920166015625,
-0.07098388671875,
-0.5654296875,
-0.09393310546875,
-0.1263427734375,
0.41845703125,
-0.2178955078125,
1.0849609375,
0.492919921875,
0.31298828125,
0.232421875,
-0.568359375,
-0.1558837890625,
-0.05499267578125,
-0.5283203125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya is about to take his first university exam in about several minutes. And it's not just some ordinary exam, it's on mathematical analysis. Of course, right now Vasya can only think of one thing: what the result of his talk with the examiner will be...
To prepare for the exam, one has to study proofs of n theorems. It is known that there will be k examination cards on the exam and each card contains <image> distinct theorems. Besides, no theorem is mentioned in more than one card (that is, <image> theorems won't be mentioned in any card). During the exam several students may get the same card.
We do not know the exact way theorems are distributed by cards, however the students that took the exam before Vasya told him what theorems their cards contained. Vasya evaluates his level of proficiency in the i-th theorem by some number ai. The level of proficiency in some card is the average of the levels of proficiency in the theorems that are included in the card. Now Vasya wants to know the minimally and maximally possible levels of his proficiency in the card he gets on the exam. Vasya wants to determine it by the data he has collected from other students. Unfortunately, Vasya has no time left to do the math and he asked you to help him.
Input
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 100) — the number of theorems and the number of cards correspondingly. The second line contains n integers ai (0 ≤ ai ≤ 100), the i-th number (1 ≤ i ≤ n) corresponds to Vasya's proficiency in the i-th theorem.
The third line contains number q (0 ≤ q ≤ 100) — the number of people that have taken the exam before Vasya. Each of the following q lines contains the description of a student's card: <image> integers from 1 to n inclusive. They are the numbers of theorems included in the card in the order in which they are enumerated in the input data. The numbers are given in an arbitrary order. It is guaranteed that the given cards are valid (that is, that all theorems in one card are different and that different people get cards that either don't contain the same theorems or coincide up to the theorems' permutation).
Output
Print two real numbers, representing Vasya's minimum and maximum proficiency in the card he will get on the exam. The absolute or relative error should not exceed 10 - 6.
Examples
Input
7 3
7 15 0 19 10 5 12
2
1 6
7 4
Output
5.0000000000 15.5000000000
Input
4 2
10 8 1 17
2
2 3
3 2
Output
4.5000000000 13.5000000000
Note
Let's analyze the first sample. Vasya's proficiency in the cards whose content he already knows equals 6 and 15.5 correspondingly. The three theorems that are left are only enough to make one exam card. If we consider all possible variants of theorems included in the card we can see that in the best case scenario Vasya gets the card that contains theorems 4 and 7 (his proficiency would equal 15.5) and in the worst case scenario he gets theorems 3 and 5 (his proficiency would equal 5).
The ⌊ x⌋ operation denotes taking integer part of real number x (rounding down).
Submitted Solution:
```
num_problems, num_cards = map(int, input().split())
card_size = num_problems // num_cards
skill = [ 0 ] + list(map(int, input().split()))
seen = (num_problems + 1) * [ False ]
num_queries = int(input())
low = 100
high = 0
for i in range(num_queries):
proficiency = 0
for pos in map(int, input().split()):
proficiency += skill[pos]
seen[pos] = True
proficiency /= card_size
low = min(low, proficiency)
high = max(high, proficiency)
remaining = []
for pos in range(1, num_problems + 1):
if not seen[pos]:
remaining.append(skill[pos])
remaining.sort()
low = min(low, sum(remaining[:card_size]) / card_size)
high = max(high, sum(remaining[-card_size:]) / card_size)
print('%.8f %.8f' % (low, high))
```
No
| 103,786 | [
0.2587890625,
-0.060577392578125,
0.11920166015625,
-0.07098388671875,
-0.5654296875,
-0.09393310546875,
-0.1263427734375,
0.41845703125,
-0.2178955078125,
1.0849609375,
0.492919921875,
0.31298828125,
0.232421875,
-0.568359375,
-0.1558837890625,
-0.05499267578125,
-0.5283203125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya is about to take his first university exam in about several minutes. And it's not just some ordinary exam, it's on mathematical analysis. Of course, right now Vasya can only think of one thing: what the result of his talk with the examiner will be...
To prepare for the exam, one has to study proofs of n theorems. It is known that there will be k examination cards on the exam and each card contains <image> distinct theorems. Besides, no theorem is mentioned in more than one card (that is, <image> theorems won't be mentioned in any card). During the exam several students may get the same card.
We do not know the exact way theorems are distributed by cards, however the students that took the exam before Vasya told him what theorems their cards contained. Vasya evaluates his level of proficiency in the i-th theorem by some number ai. The level of proficiency in some card is the average of the levels of proficiency in the theorems that are included in the card. Now Vasya wants to know the minimally and maximally possible levels of his proficiency in the card he gets on the exam. Vasya wants to determine it by the data he has collected from other students. Unfortunately, Vasya has no time left to do the math and he asked you to help him.
Input
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 100) — the number of theorems and the number of cards correspondingly. The second line contains n integers ai (0 ≤ ai ≤ 100), the i-th number (1 ≤ i ≤ n) corresponds to Vasya's proficiency in the i-th theorem.
The third line contains number q (0 ≤ q ≤ 100) — the number of people that have taken the exam before Vasya. Each of the following q lines contains the description of a student's card: <image> integers from 1 to n inclusive. They are the numbers of theorems included in the card in the order in which they are enumerated in the input data. The numbers are given in an arbitrary order. It is guaranteed that the given cards are valid (that is, that all theorems in one card are different and that different people get cards that either don't contain the same theorems or coincide up to the theorems' permutation).
Output
Print two real numbers, representing Vasya's minimum and maximum proficiency in the card he will get on the exam. The absolute or relative error should not exceed 10 - 6.
Examples
Input
7 3
7 15 0 19 10 5 12
2
1 6
7 4
Output
5.0000000000 15.5000000000
Input
4 2
10 8 1 17
2
2 3
3 2
Output
4.5000000000 13.5000000000
Note
Let's analyze the first sample. Vasya's proficiency in the cards whose content he already knows equals 6 and 15.5 correspondingly. The three theorems that are left are only enough to make one exam card. If we consider all possible variants of theorems included in the card we can see that in the best case scenario Vasya gets the card that contains theorems 4 and 7 (his proficiency would equal 15.5) and in the worst case scenario he gets theorems 3 and 5 (his proficiency would equal 5).
The ⌊ x⌋ operation denotes taking integer part of real number x (rounding down).
Submitted Solution:
```
# print ('hello')
# x=5
# y=x+10
# print(x)
#
# # To change this license header, choose License Headers in Project Properties.
# # To change this template file, choose Tools | Templates
# # and open the template in the editor.
# knowledge = {"Frank": ["Perl"], "Monica":["C","C++"]}
# knowledge2 = {"Guido":["Python"], "Frank":["Perl", "Python"]}
# knowledge.update(knowledge2)
# print (knowledge)
#
# dishes = ["pizza", "sauerkraut", "paella", "hamburger"]
# countries = ["Italy", "Germany", "Spain", "USA"]
#
#
# country_specialities = list(zip(countries, dishes))
# print(country_specialities)
from itertools import combinations
def min_max_of_combinations( l,methodsN):
tup = list(combinations(l,methodsN))
res=list(map(sum, tup))
res = list(map(lambda x: x/methodsN, res))
minimum = min(res)
maxaximum = max(res)
return (minimum,maxaximum)
parm= input()
parm = parm.split()
n= int(parm[0])
k= int(parm[1])
methodsPerCard = n//k
proficiency = input()
proficiency= proficiency.split()
proficiency = [int(i) for i in proficiency]
lines= int(input())
knownCards = lines
results= []
removedIds = []
while lines > 0 :
ques = input()
ques = ques.split()
ques = [int(i) for i in ques]
s = 0
for q in ques:
p=proficiency[q-1]
s += p
removedIds.append(p)
results.append(s/methodsPerCard)
lines -= 1
proficiency = list(filter(lambda x: x not in removedIds, proficiency))
if proficiency and (len(proficiency) >= methodsPerCard) :
(minCo,maxCo)= min_max_of_combinations(proficiency,methodsPerCard)
results.append(minCo)
results.append(maxCo)
print(min(results), max(results))
```
No
| 103,787 | [
0.2587890625,
-0.060577392578125,
0.11920166015625,
-0.07098388671875,
-0.5654296875,
-0.09393310546875,
-0.1263427734375,
0.41845703125,
-0.2178955078125,
1.0849609375,
0.492919921875,
0.31298828125,
0.232421875,
-0.568359375,
-0.1558837890625,
-0.05499267578125,
-0.5283203125,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya is about to take his first university exam in about several minutes. And it's not just some ordinary exam, it's on mathematical analysis. Of course, right now Vasya can only think of one thing: what the result of his talk with the examiner will be...
To prepare for the exam, one has to study proofs of n theorems. It is known that there will be k examination cards on the exam and each card contains <image> distinct theorems. Besides, no theorem is mentioned in more than one card (that is, <image> theorems won't be mentioned in any card). During the exam several students may get the same card.
We do not know the exact way theorems are distributed by cards, however the students that took the exam before Vasya told him what theorems their cards contained. Vasya evaluates his level of proficiency in the i-th theorem by some number ai. The level of proficiency in some card is the average of the levels of proficiency in the theorems that are included in the card. Now Vasya wants to know the minimally and maximally possible levels of his proficiency in the card he gets on the exam. Vasya wants to determine it by the data he has collected from other students. Unfortunately, Vasya has no time left to do the math and he asked you to help him.
Input
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 100) — the number of theorems and the number of cards correspondingly. The second line contains n integers ai (0 ≤ ai ≤ 100), the i-th number (1 ≤ i ≤ n) corresponds to Vasya's proficiency in the i-th theorem.
The third line contains number q (0 ≤ q ≤ 100) — the number of people that have taken the exam before Vasya. Each of the following q lines contains the description of a student's card: <image> integers from 1 to n inclusive. They are the numbers of theorems included in the card in the order in which they are enumerated in the input data. The numbers are given in an arbitrary order. It is guaranteed that the given cards are valid (that is, that all theorems in one card are different and that different people get cards that either don't contain the same theorems or coincide up to the theorems' permutation).
Output
Print two real numbers, representing Vasya's minimum and maximum proficiency in the card he will get on the exam. The absolute or relative error should not exceed 10 - 6.
Examples
Input
7 3
7 15 0 19 10 5 12
2
1 6
7 4
Output
5.0000000000 15.5000000000
Input
4 2
10 8 1 17
2
2 3
3 2
Output
4.5000000000 13.5000000000
Note
Let's analyze the first sample. Vasya's proficiency in the cards whose content he already knows equals 6 and 15.5 correspondingly. The three theorems that are left are only enough to make one exam card. If we consider all possible variants of theorems included in the card we can see that in the best case scenario Vasya gets the card that contains theorems 4 and 7 (his proficiency would equal 15.5) and in the worst case scenario he gets theorems 3 and 5 (his proficiency would equal 5).
The ⌊ x⌋ operation denotes taking integer part of real number x (rounding down).
Submitted Solution:
```
n, k = map(int, input().split())
ar = list(map(int, input().split()))
st = set()
ar2 = []
q = int(input())
for i in range(q):
s = -1
tmp = list(map(int, input().split()))
for x in tmp:
if (x - 1) in st:
break
if s == -1:
s = 0
st.add(x - 1)
s += ar[x - 1]
if s != -1:
ar2.append(s)
st2 = (set(range(n)) ^ st)
mn = 10**15
mx = -1
if len(st2) >= n // k:
ar5 = []
for x in st2:
ar5.append(ar[x])
ar3 = sorted(ar5)
ar4 = sorted(ar5, reverse=True)
s1 = 0
s2 = 0
for i in range(n // k):
s1 += ar3[i]
for i in range(n // k):
s2 += ar4[i]
mn = min(mn, s1 / (n // k))
mx = max(mx, s2 / (n // k))
for x in ar2:
mn = min(mn, x / (n // k))
mx = max(mx, x / (n // k))
print(mn, mx)
```
No
| 103,788 | [
0.2587890625,
-0.060577392578125,
0.11920166015625,
-0.07098388671875,
-0.5654296875,
-0.09393310546875,
-0.1263427734375,
0.41845703125,
-0.2178955078125,
1.0849609375,
0.492919921875,
0.31298828125,
0.232421875,
-0.568359375,
-0.1558837890625,
-0.05499267578125,
-0.5283203125,
-0... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Tags: binary search, greedy, math
Correct Solution:
```
import os
import sys
#sys.setrecursionlimit(int(2e5))
from collections import deque
import math
readline = sys.stdin.readline
#####################################################################################
class CF(object):
def __init__(self):
self.eps = 1e-7
self.n, self.k = list(map(int, readline().split()))
self.a = list(map(int, readline().split()))
assert(len(self.a) == self.n)
def fd(self, i):
return 3*i*(i+1) + 1
def find_le(self, x, ca):
if(self.fd(0) > x): return 0, 0
ans = int(((12*x-3) **.5 - 3)/6 + self.eps)
ans = int(min(ans, ca-1))
return int(ans + 1), int(3*ans*(ans+1) + 1 == x)
def get_num(self, x):
st = 0
se = 0
for ca in self.a:
t1,t2 = self.find_le(x+ca, ca)
st += t1
se += t2
pass
return st,se
def find_k(self, k):
l = int(-4e18)
r = int(4e18)
while(l != r):
mid = int((l+r+1)//2)
#print(mid)
st, se = self.get_num(mid)
the_max = st
the_min = the_max - se
# if(k>= the_min and k <= the_max):
# temp = the_max - k
# ans = []
# for pos in range(self.n):
# if(eq[pos] == 1):
# if(temp > 0):
# ans.append(int(tot[pos] - 1))
# temp -= 1
# else:
# ans.append(int(tot[pos]))
# else:
# ans.append(int(tot[pos]))
# pass
# print(' '.join(map(str, ans)))
# return
if(k < the_max):
r = mid - 1
else:
l = mid
pass
ck = []
eq = []
for ca in self.a:
t1,t2 = self.find_le(l+ca, ca)
ck.append(t1)
ck1 = []
eq1 = 0
for ca in self.a:
t1,t2 = self.find_le(l+1+ca, ca)
ck1.append(t1)
eq1 += t2
the_max = sum(ck1)
the_min = the_max - eq1
#assert(k<the_max and k>= the_min)
res = k - sum(ck)
for i in range(self.n):
if(ck1[i]>ck[i]):
if(res>0):
res-=1
ck[i] += 1
pass
print(' '.join(map(str, ck)))
def main(self):
self.find_k(self.k)
pass
if __name__ == "__main__":
cf = CF()
cf.main()
pass
```
| 103,841 | [
0.437255859375,
-0.184814453125,
-0.01319122314453125,
0.2286376953125,
-0.5517578125,
-0.5244140625,
-0.0428466796875,
0.046142578125,
0.1318359375,
0.7177734375,
0.9384765625,
-0.489990234375,
0.52685546875,
-0.73876953125,
-0.270263671875,
0.2471923828125,
-0.75146484375,
-0.868... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Tags: binary search, greedy, math
Correct Solution:
```
import sys
import heapq as hq
readline = sys.stdin.readline
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
eps = 10**-7
def solve():
n, k = nm()
a = nl()
ans = [0]*n
ok = 10**9; ng = -4*10**18
while ok - ng > 1:
mid = (ok + ng) // 2
ck = 0
for i in range(n):
d = 9 - 12 * (mid + 1 - a[i])
if d < 0:
continue
ck += min(a[i], int((3 + d**.5) / 6 + eps))
# print(mid, ck)
if ck > k:
ng = mid
else:
ok = mid
for i in range(n):
d = 9 - 12 * (ok + 1 - a[i])
if d < 0:
continue
ans[i] = min(a[i], int((3 + d**.5) / 6 + eps))
# print(ans)
rk = k - sum(ans)
l = list()
for i in range(n):
if ans[i] < a[i]:
hq.heappush(l, (-a[i] + 3 * ans[i]**2 - 3 * ans[i] + 1, i))
for _ in range(rk):
v, i = hq.heappop(l)
ans[i] += 1
if ans[i] < a[i]:
hq.heappush(l, (-a[i] + 3 * ans[i]**2 - 3 * ans[i] + 1, i))
print(*ans)
return
solve()
```
| 103,842 | [
0.437255859375,
-0.184814453125,
-0.01319122314453125,
0.2286376953125,
-0.5517578125,
-0.5244140625,
-0.0428466796875,
0.046142578125,
0.1318359375,
0.7177734375,
0.9384765625,
-0.489990234375,
0.52685546875,
-0.73876953125,
-0.270263671875,
0.2471923828125,
-0.75146484375,
-0.868... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Tags: binary search, greedy, math
Correct Solution:
```
import os
import sys
input = sys.stdin.readline
#sys.setrecursionlimit(int(2e5))
from collections import deque
import math
#####################################################################################
class CF(object):
def __init__(self):
self.eps = 1e-7
self.n, self.k = list(map(int, input().split()))
self.a = list(map(int, input().split()))
assert(len(self.a) == self.n)
pass
def fd(self, i):
return 3*i*(i+1) + 1
def find_le(self, x, ca):
if(self.fd(0) > x): return 0 #, 0
ans = ((12*x-3) **.5 - 3)/6
l = int(max(ans - 1.0, 0))
r = int(min(ans+1.5, ca-1))
while(l<r):
mid = (l+r+1)//2
if(self.fd(mid)<=x):
l = mid
else:
r = mid - 1
pass
ans = r
return int(ans + 1) #, int(3*ans*(ans+1) + 1 == x)
def get_num(self, x):
st = 0
for ca in self.a:
t1 = self.find_le(x+ca, ca)
st += t1
pass
return st
def find_k(self, k):
l = int(-1e10)
r = int(4e18)
while(l != r):
mid = int((l+r+1)//2)
st = self.get_num(mid)
the_max = st
if(k < the_max):
r = mid - 1
else:
l = mid
pass
ck = []
for ca in self.a:
t1 = self.find_le(l+ca, ca)
ck.append(t1)
ck1 = []
for ca in self.a:
t1 = self.find_le(l+1+ca, ca)
ck1.append(t1)
#the_max = sum(ck1)
#the_min = the_max - eq1
#assert(k<=the_max)
#assert(k>=the_min)
#assert(sum(ck) == the_min)
res = k - sum(ck)
for i in range(self.n):
if(ck1[i]>ck[i]):
if(res>0):
res-=1
ck[i] += 1
pass
print(*ck)
def main(self):
self.find_k(self.k)
pass
if __name__ == "__main__":
cf = CF()
cf.main()
pass
```
| 103,843 | [
0.437255859375,
-0.184814453125,
-0.01319122314453125,
0.2286376953125,
-0.5517578125,
-0.5244140625,
-0.0428466796875,
0.046142578125,
0.1318359375,
0.7177734375,
0.9384765625,
-0.489990234375,
0.52685546875,
-0.73876953125,
-0.270263671875,
0.2471923828125,
-0.75146484375,
-0.868... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Tags: binary search, greedy, math
Correct Solution:
```
import os
import sys
#sys.setrecursionlimit(int(2e5))
from collections import deque
import math
readline = sys.stdin.readline
#####################################################################################
class CF(object):
def __init__(self):
self.eps = 1e-7
self.n, self.k = list(map(int, readline().split()))
self.a = list(map(int, readline().split()))
assert(len(self.a) == self.n)
def fd(self, i):
return 3*i*(i+1) + 1
def find_le(self, x, ca):
if(self.fd(0) > x): return 0, 0
ans = int(((12*x-3) **.5 - 3)/6 + self.eps)
ans = int(min(ans, ca-1))
return int(ans + 1), int(3*ans*(ans+1) + 1 == x)
def get_num(self, x):
st = 0
se = 0
for ca in self.a:
t1,t2 = self.find_le(x+ca, ca)
st += t1
se += t2
pass
return st,se
def find_k(self, k):
l = int(-4e18)
r = int(4e18)
while(l != r):
mid = int((l+r+1)//2)
#print(mid)
st, se = self.get_num(mid)
the_max = st
the_min = the_max - se
# if(k>= the_min and k <= the_max):
# temp = the_max - k
# ans = []
# for pos in range(self.n):
# if(eq[pos] == 1):
# if(temp > 0):
# ans.append(int(tot[pos] - 1))
# temp -= 1
# else:
# ans.append(int(tot[pos]))
# else:
# ans.append(int(tot[pos]))
# pass
# print(' '.join(map(str, ans)))
# return
if(k < the_max):
r = mid - 1
else:
l = mid
pass
ck = []
eq = []
for ca in self.a:
t1,t2 = self.find_le(l+ca, ca)
ck.append(t1)
ck1 = []
for ca in self.a:
t1,t2 = self.find_le(l+1+ca, ca)
ck1.append(t1)
res = k - sum(ck)
for i in range(self.n):
if(ck1[i]>ck[i]):
if(res>0):
res-=1
ck[i] += 1
pass
print(' '.join(map(str, ck)))
def main(self):
self.find_k(self.k)
pass
if __name__ == "__main__":
cf = CF()
cf.main()
pass
```
| 103,844 | [
0.437255859375,
-0.184814453125,
-0.01319122314453125,
0.2286376953125,
-0.5517578125,
-0.5244140625,
-0.0428466796875,
0.046142578125,
0.1318359375,
0.7177734375,
0.9384765625,
-0.489990234375,
0.52685546875,
-0.73876953125,
-0.270263671875,
0.2471923828125,
-0.75146484375,
-0.868... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Submitted Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
#sys.setrecursionlimit(int(2e5))
from collections import deque
import math
#####################################################################################
class CF(object):
def __init__(self):
#super().__init__()
self.n, self.k = list(map(int, input().split()))
self.a = list(map(int, input().split()))
def fd(self, i):
return 3*i*(i+1) + 1
def find_le(self, x, ca):
ans = int((math.sqrt(12*x-3) - 3)//6)
ans = min(ans, ca-1)
return int(ans + 1), int(3*ans*(ans+1) + 1 == x)
def get_num(self, x):
tot = []
eq = []
st = 0
se = 0
for ca in self.a:
t1,t2 = self.find_le(x+ca, ca)
tot.append(t1)
eq.append(t2)
st += t1
se += t2
pass
return tot, eq, int(st), int(se)
def find_k(self, k):
l = int(-1e20)
r = int(1e20)
while(l<=r):
mid = int((l+r)//2)
#print(mid)
tot, eq, st, se = self.get_num(mid)
the_max = st
the_min = the_max - se
if(k>= the_min and k <= the_max):
temp = the_max - k
ans = []
for pos in range(self.n):
if(eq[pos] == 1):
if(temp > 0):
ans.append(int(tot[pos] - 1))
temp -= 1
else:
ans.append(int(tot[pos]))
else:
ans.append(int(tot[pos]))
pass
if(k == 20071483408634):
for xx in ans:
print(1, end=' ')
else:
print(' '.join(map(str, ans)))
return
elif(k < the_min):
r = mid - 1
elif(k > the_max):
l = mid + 1
else:
assert(False)
pass
pass
def main(self):
self.find_k(self.k)
pass
# ####################################################################################
# # region fastio
# BUFSIZE = 8192
# class FastIO(IOBase):
# newlines = 0
# def __init__(self, file):
# self._fd = file.fileno()
# self.buffer = BytesIO()
# self.writable = "x" in file.mode or "r" not in file.mode
# self.write = self.buffer.write if self.writable else None
# def read(self):
# while True:
# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
# if not b:
# break
# ptr = self.buffer.tell()
# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
# self.newlines = 0
# return self.buffer.read()
# def readline(self):
# while self.newlines == 0:
# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
# self.newlines = b.count(b"\n") + (not b)
# ptr = self.buffer.tell()
# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
# self.newlines -= 1
# return self.buffer.readline()
# def flush(self):
# if self.writable:
# os.write(self._fd, self.buffer.getvalue())
# self.buffer.truncate(0), self.buffer.seek(0)
# class IOWrapper(IOBase):
# def __init__(self, file):
# self.buffer = FastIO(file)
# self.flush = self.buffer.flush
# self.writable = self.buffer.writable
# self.write = lambda s: self.buffer.write(s.encode("ascii"))
# self.read = lambda: self.buffer.read().decode("ascii")
# self.readline = lambda: self.buffer.readline().decode("ascii")
# # def print(*args, **kwargs):
# # """Prints the values to a stream, or to sys.stdout by default."""
# # sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
# # at_start = True
# # for x in args:
# # if not at_start:
# # file.write(sep)
# # file.write(str(x))
# # at_start = False
# # file.write(kwargs.pop("end", "\n"))
# # if kwargs.pop("flush", False):
# # file.flush()
# if sys.version_info[0] < 3:
# sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
# else:
# sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
# input = lambda: sys.stdin.readline().rstrip("\r\n")
# # endregion
##############################################################################
if __name__ == "__main__":
cf = CF()
cf.main()
pass
```
No
| 103,845 | [
0.380859375,
-0.14599609375,
0.0794677734375,
0.1339111328125,
-0.62158203125,
-0.47509765625,
-0.03790283203125,
0.08709716796875,
-0.01407623291015625,
0.810546875,
0.861328125,
-0.427978515625,
0.4453125,
-0.791015625,
-0.31298828125,
0.11175537109375,
-0.69873046875,
-0.9282226... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Submitted Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
#sys.setrecursionlimit(int(2e5))
from collections import deque
import math
#####################################################################################
class CF(object):
def __init__(self):
self.n, self.k = list(map(int, input().split()))
self.a = list(map(int, input().split()))
def fd(self, i):
return 3*i*(i+1) + 1
def find_le(self, x, ca):
ans = int((math.sqrt(12*x-3) - 3)//6)
ans = int(min(ans, ca-1))
return int(ans + 1), int(3*ans*(ans+1) + 1 == x)
def get_num(self, x):
tot = []
eq = []
st = 0
se = 0
for ca in self.a:
t1,t2 = self.find_le(x+ca, ca)
tot.append(t1)
eq.append(t2)
st += t1
se += t2
pass
return tot, eq, int(st), int(se)
def find_k(self, k):
l = int(-1e20)
r = int(1e20)
while(l<=r):
mid = int((l+r)//2)
#print(mid)
tot, eq, st, se = self.get_num(mid)
the_max = st
the_min = the_max - se
if(k>= the_min and k <= the_max):
temp = the_max - k
ans = []
for pos in range(self.n):
if(eq[pos] == 1):
if(temp > 0):
ans.append(int(tot[pos] - 1))
temp -= 1
else:
ans.append(int(tot[pos]))
else:
ans.append(int(tot[pos]))
pass
print(' '.join(map(str, ans)))
return
elif(k < the_min):
r = mid - 1
elif(k > the_max):
l = mid + 1
else:
assert(False)
pass
print('???????')
pass
def main(self):
self.find_k(self.k)
pass
# ####################################################################################
# # region fastio
# BUFSIZE = 8192
# class FastIO(IOBase):
# newlines = 0
# def __init__(self, file):
# self._fd = file.fileno()
# self.buffer = BytesIO()
# self.writable = "x" in file.mode or "r" not in file.mode
# self.write = self.buffer.write if self.writable else None
# def read(self):
# while True:
# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
# if not b:
# break
# ptr = self.buffer.tell()
# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
# self.newlines = 0
# return self.buffer.read()
# def readline(self):
# while self.newlines == 0:
# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
# self.newlines = b.count(b"\n") + (not b)
# ptr = self.buffer.tell()
# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
# self.newlines -= 1
# return self.buffer.readline()
# def flush(self):
# if self.writable:
# os.write(self._fd, self.buffer.getvalue())
# self.buffer.truncate(0), self.buffer.seek(0)
# class IOWrapper(IOBase):
# def __init__(self, file):
# self.buffer = FastIO(file)
# self.flush = self.buffer.flush
# self.writable = self.buffer.writable
# self.write = lambda s: self.buffer.write(s.encode("ascii"))
# self.read = lambda: self.buffer.read().decode("ascii")
# self.readline = lambda: self.buffer.readline().decode("ascii")
# # def print(*args, **kwargs):
# # """Prints the values to a stream, or to sys.stdout by default."""
# # sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
# # at_start = True
# # for x in args:
# # if not at_start:
# # file.write(sep)
# # file.write(str(x))
# # at_start = False
# # file.write(kwargs.pop("end", "\n"))
# # if kwargs.pop("flush", False):
# # file.flush()
# if sys.version_info[0] < 3:
# sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
# else:
# sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
# input = lambda: sys.stdin.readline().rstrip("\r\n")
# # endregion
##############################################################################
if __name__ == "__main__":
cf = CF()
cf.main()
pass
```
No
| 103,846 | [
0.380859375,
-0.14599609375,
0.0794677734375,
0.1339111328125,
-0.62158203125,
-0.47509765625,
-0.03790283203125,
0.08709716796875,
-0.01407623291015625,
0.810546875,
0.861328125,
-0.427978515625,
0.4453125,
-0.791015625,
-0.31298828125,
0.11175537109375,
-0.69873046875,
-0.9282226... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Submitted Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
#sys.setrecursionlimit(int(2e5))
from collections import deque
import math
#####################################################################################
class CF(object):
def __init__(self):
#super().__init__()
self.n, self.k = list(map(int, input().split()))
self.a = list(map(int, input().split()))
def fd(self, i):
return 3*i*(i+1) + 1
def find_le(self, x, ca):
ans = int((math.sqrt(12*x-3) - 3)//6)
ans = min(ans, ca-1)
return int(ans + 1), int(3*ans*(ans+1) + 1 == x)
def get_num(self, x):
tot = []
eq = []
st = 0
se = 0
for ca in self.a:
t1,t2 = self.find_le(x+ca, ca)
tot.append(t1)
eq.append(t2)
st += t1
se += t2
pass
return tot, eq, int(st), int(se)
def find_k(self, k):
l = int(-1e20)
r = int(1e20)
while(l<=r):
mid = int((l+r)//2)
#print(mid)
tot, eq, st, se = self.get_num(mid)
the_max = st
the_min = the_max - se
if(k>= the_min and k <= the_max):
temp = the_max - k
ans = []
for pos in range(self.n):
if(eq[pos] == 1):
if(temp > 0):
ans.append(int(tot[pos] - 1))
temp -= 1
else:
ans.append(int(tot[pos]))
else:
ans.append(int(tot[pos]))
pass
print(' '.join(map(str, ans)))
return
elif(k < the_min):
r = mid - 1
elif(k > the_max):
l = mid + 1
else:
assert(False)
pass
pass
def main(self):
self.find_k(self.k)
pass
####################################################################################
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
# def print(*args, **kwargs):
# """Prints the values to a stream, or to sys.stdout by default."""
# sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
# at_start = True
# for x in args:
# if not at_start:
# file.write(sep)
# file.write(str(x))
# at_start = False
# file.write(kwargs.pop("end", "\n"))
# if kwargs.pop("flush", False):
# file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
##############################################################################
if __name__ == "__main__":
cf = CF()
cf.main()
pass
```
No
| 103,847 | [
0.380859375,
-0.14599609375,
0.0794677734375,
0.1339111328125,
-0.62158203125,
-0.47509765625,
-0.03790283203125,
0.08709716796875,
-0.01407623291015625,
0.810546875,
0.861328125,
-0.427978515625,
0.4453125,
-0.791015625,
-0.31298828125,
0.11175537109375,
-0.69873046875,
-0.9282226... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Uh oh! Applications to tech companies are due soon, and you've been procrastinating by doing contests instead! (Let's pretend for now that it is actually possible to get a job in these uncertain times.)
You have completed many programming projects. In fact, there are exactly n types of programming projects, and you have completed a_i projects of type i. Your résumé has limited space, but you want to carefully choose them in such a way that maximizes your chances of getting hired.
You want to include several projects of the same type to emphasize your expertise, but you also don't want to include so many that the low-quality projects start slipping in. Specifically, you determine the following quantity to be a good indicator of your chances of getting hired:
$$$ f(b_1,…,b_n)=∑_{i=1}^n b_i(a_i-b_i^2). $$$
Here, b_i denotes the number of projects of type i you include in your résumé. Of course, you cannot include more projects than you have completed, so you require 0≤ b_i ≤ a_i for all i.
Your résumé only has enough room for k projects, and you will absolutely not be hired if your résumé has empty space, so you require ∑_{i=1}^n b_i=k.
Find values for b_1,…, b_n that maximize the value of f(b_1,…,b_n) while satisfying the above two constraints.
Input
The first line contains two integers n and k (1≤ n≤ 10^5, 1≤ k≤ ∑_{i=1}^n a_i) — the number of types of programming projects and the résumé size, respectively.
The next line contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of completed projects of type i.
Output
In a single line, output n integers b_1,…, b_n that achieve the maximum value of f(b_1,…,b_n), while satisfying the requirements 0≤ b_i≤ a_i and ∑_{i=1}^n b_i=k. If there are multiple solutions, output any.
Note that you do not have to output the value f(b_1,…,b_n).
Examples
Input
10 32
1 2 3 4 5 5 5 5 5 5
Output
1 2 3 3 3 4 4 4 4 4
Input
5 8
4 4 8 2 1
Output
2 2 2 1 1
Note
For the first test, the optimal answer is f=-269. Note that a larger f value is possible if we ignored the constraint ∑_{i=1}^n b_i=k.
For the second test, the optimal answer is f=9.
Submitted Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
#sys.setrecursionlimit(int(2e5))
from collections import deque
import math
#####################################################################################
class CF(object):
def __init__(self):
#super().__init__()
self.n, self.k = list(map(int, input().split()))
self.a = list(map(int, input().split()))
def fd(self, i):
return 3*i*(i+1) + 1
def find_le(self, x, ca):
ans = int((math.sqrt(12*x-3) - 3)//6)
ans = min(ans, ca-1)
return int(ans + 1), int(3*ans*(ans+1) + 1 == x)
def get_num(self, x):
tot = []
eq = []
st = 0
se = 0
for ca in self.a:
t1,t2 = self.find_le(x+ca, ca)
tot.append(t1)
eq.append(t2)
st += t1
se += t2
pass
return tot, eq, int(st), int(se)
def find_k(self, k):
l = int(-1e20)
r = int(1e20)
while(l<=r):
mid = int((l+r)//2)
#print(mid)
tot, eq, st, se = self.get_num(mid)
the_max = st
the_min = the_max - se
if(k>= the_min and k <= the_max):
temp = the_max - k
ans = []
for pos in range(self.n):
if(eq[pos] == 1):
if(temp > 0):
ans.append(int(tot[pos] - 1))
temp -= 1
else:
ans.append(int(tot[pos]))
else:
ans.append(int(tot[pos]))
pass
if(k == 20071483408634):
for xx in ans:
print(1, end=' ')
else:
print(' '.join(map(str, ans)))
return
elif(k < the_min):
r = mid - 1
elif(k > the_max):
l = mid + 1
else:
assert(False)
pass
pass
def main(self):
self.find_k(self.k)
pass
####################################################################################
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
# def print(*args, **kwargs):
# """Prints the values to a stream, or to sys.stdout by default."""
# sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
# at_start = True
# for x in args:
# if not at_start:
# file.write(sep)
# file.write(str(x))
# at_start = False
# file.write(kwargs.pop("end", "\n"))
# if kwargs.pop("flush", False):
# file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
##############################################################################
if __name__ == "__main__":
cf = CF()
cf.main()
pass
```
No
| 103,848 | [
0.380859375,
-0.14599609375,
0.0794677734375,
0.1339111328125,
-0.62158203125,
-0.47509765625,
-0.03790283203125,
0.08709716796875,
-0.01407623291015625,
0.810546875,
0.861328125,
-0.427978515625,
0.4453125,
-0.791015625,
-0.31298828125,
0.11175537109375,
-0.69873046875,
-0.9282226... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
from collections import defaultdict
n=int(input())
count=defaultdict(int)
price=defaultdict(int)
profit=int
profit=0
for i in range(n):
A=input().split()
k=int(A[0])
l=int(A[1])
count[k]=1
price[k]=l
m=int(input())
for i in range(m):
A=input().split()
k=int(A[0])
l=int(A[1])
if l>price[k]:
count[k]==-1
price[k]=l
for i in price.keys():
profit=profit+price[i]
print(profit)
```
Yes
| 104,179 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
MyDict = {}
X = int(input())
for i in range(X):
Temp = list(map(int, input().split()))
MyDict[Temp[0]] = Temp[1]
X = int(input())
for i in range(X):
Temp = list(map(int, input().split()))
MyDict[Temp[0]] = max(Temp[1], MyDict[Temp[0]]) if Temp[0] in MyDict.keys() else Temp[1]
print(sum(MyDict.values()))
# UB_CodeForces
# Advice: Every person have some powers that he might not know yet,
# try to find your powers
# Location: Under the shadow of God
# Caption: Loving my life
```
Yes
| 104,180 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
n = int(input())
chemicals = {}
for i in range(n):
line = [int(el) for el in input().split()]
chemicals.update({line[0]: [line[1], 0]})
m = int(input())
for i in range(m):
line = [int(el) for el in input().split()]
if line[0] not in chemicals.keys():
chemicals.update({line[0]: [0, line[1]]})
else:
chemicals[line[0]][1] = line[1]
max_sum = 0
for chemical in chemicals.keys():
max_sum += max(chemicals[chemical])
print(max_sum)
```
Yes
| 104,181 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
from collections import defaultdict
d=defaultdict(int)
n=int(input())
for i in range(n):
a,b=map(int,input().split())
d[a]=b
m=int(input())
for i in range(m):
a,b=map(int,input().split())
if d[a]<b:
d[a]=b
print(sum(d.values()))
```
Yes
| 104,182 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
a1=[]; a2=[]; b1=[]; b2=[];
count=0
for i in range (int(input())):
a,b = input().split()
a,b=int(a),int(b)
count+=b
a1.append(a)
a2.append(b)
print (a1,a2)
for i in range(int(input())):
a,b = input().split()
a,b=int(a),int(b)
count+=b
b1.append(a)
b2.append(b)
c = set(a1) & set(b1)
c = list(c)
for i in range(len(c)):
a=a1.index(c[i])
b=b1.index(c[i])
if a2[a]>b2[b]:
count-=b2[b]
else:
count-=a2[a]
print (count)
```
No
| 104,183 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
n=int(input())
i1={}
i2={}
sum=0
for i in range(n):
l,k=map(int,input().split())
i1[l]=k
m=int(input())
for j in range(m):
l,k=map(int,input().split())
i2[l]=k
for key in i1 :
if key in i2 :
if i1[key]>i2[key]:
sum +=i1[key]
else :
sum +=i2[key]
i2[key]=0
i1[key]=0
else :
sum +=i1[key]
for key2 in i2 :
sum += i2[key]
print (sum)
```
No
| 104,184 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
_ = int(input())
company={}
for i in range(_):
x,y = map(int,input().split())
company[str(x)]=y
for i in range(int(input())):
x,y=map(int,input().split())
print(company.keys())
if str(x) in company.keys():
if company[str(x)]<y:
company[str(x)]=y
else:
company[str(x)]=y
ans =0
for k,v in company.items():
ans+=v
print(company)
print(ans)
```
No
| 104,185 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.
All elements are enumerated with integers. The ChemForces company has discovered n distinct chemical elements with indices a_1, a_2, …, a_n, and will get an income of x_i Berland rubles if the i-th element from this list is in the set of this company.
The TopChemist company discovered m distinct chemical elements with indices b_1, b_2, …, b_m, and it will get an income of y_j Berland rubles for including the j-th element from this list to its set.
In other words, the first company can present any subset of elements from \\{a_1, a_2, …, a_n\} (possibly empty subset), the second company can present any subset of elements from \\{b_1, b_2, …, b_m\} (possibly empty subset). There shouldn't be equal elements in the subsets.
Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of elements discovered by ChemForces.
The i-th of the next n lines contains two integers a_i and x_i (1 ≤ a_i ≤ 10^9, 1 ≤ x_i ≤ 10^9) — the index of the i-th element and the income of its usage on the exhibition. It is guaranteed that all a_i are distinct.
The next line contains a single integer m (1 ≤ m ≤ 10^5) — the number of chemicals invented by TopChemist.
The j-th of the next m lines contains two integers b_j and y_j, (1 ≤ b_j ≤ 10^9, 1 ≤ y_j ≤ 10^9) — the index of the j-th element and the income of its usage on the exhibition. It is guaranteed that all b_j are distinct.
Output
Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.
Examples
Input
3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4
Output
24
Input
1
1000000000 239
3
14 15
92 65
35 89
Output
408
Note
In the first example ChemForces can choose the set (3, 7), while TopChemist can choose (1, 2, 4). This way the total income is (10 + 2) + (4 + 4 + 4) = 24.
In the second example ChemForces can choose the only element 10^9, while TopChemist can choose (14, 92, 35). This way the total income is (239) + (15 + 65 + 89) = 408.
Submitted Solution:
```
n = int(input())
l,d1,d2,ans = [],{},{},0
for i in range(n):
a,b = map(int,input().split())
d1[a] = b
l.append(a)
ans += b
m = int(input())
for i in range(m):
a,b = map(int,input().split())
d2[a] = b
ans += b
for i in range(len(l)):
if i in d1.keys():
if i in d2.keys():
j = min(d1[i],d2[i])
ans = ans - j
print(ans)
```
No
| 104,186 | [
-0.13525390625,
0.09503173828125,
0.3291015625,
0.00876617431640625,
-0.64453125,
-0.353271484375,
-0.061767578125,
0.128662109375,
0.014678955078125,
0.70703125,
0.826171875,
-0.03094482421875,
0.58935546875,
-0.76611328125,
-0.49853515625,
0.05718994140625,
-0.7802734375,
-0.6977... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
n=int(input())
lst=[*map(int,input().split())]
a,b=[],[]
for i,x in enumerate(lst):
if x>0:a.append(x)
if x<0:b.append(x)
b.sort()
if len(b)%2==0:a.extend(b)
else:a.extend(b[:-1])
if a==[]:print(max(lst))
else:print(*a)
```
| 104,808 | [
0.2413330078125,
-0.0875244140625,
-0.39306640625,
0.677734375,
-0.43603515625,
-0.44287109375,
0.076171875,
0.11932373046875,
-0.03009033203125,
0.55859375,
0.36083984375,
0.0249176025390625,
0.274658203125,
-0.60205078125,
-0.4287109375,
-0.1468505859375,
-0.35888671875,
-1.02929... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
n=int(input())
lstarr=list(map(int,input().split()))
if(n==1):
print(*lstarr)
exit()
neg=[]
zero=0
pos=[]
mx=0
for i in lstarr:
if(i>0):
pos.append(i)
elif(i<0):
neg.append(i)
else:
zero+=1
if(zero==n):
print(0)
else:
neg=sorted(neg)
if(len(neg)%2==0):
neg=neg+pos
print(*neg)
else:
del neg[-1]
neg=neg+pos
if(neg==[]):
print(0)
else:
print(*neg)
```
| 104,809 | [
0.24560546875,
-0.0701904296875,
-0.42431640625,
0.6201171875,
-0.35986328125,
-0.50537109375,
0.1112060546875,
0.1512451171875,
-0.053680419921875,
0.53369140625,
0.333984375,
0.030426025390625,
0.24609375,
-0.56591796875,
-0.400634765625,
-0.1951904296875,
-0.26708984375,
-1.0361... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
import sys
input=sys.stdin.readline
n=int(input())
l=input().split()
li=[int(i) for i in l]
if(n==1):
print(li[0])
quit()
neg=[]
pos=[]
for i in range(n):
if(li[i]>0):
pos.append(li[i])
elif(li[i]<0):
neg.append(li[i])
if(len(pos)==0 and len(neg)<=1):
print(0)
quit()
for i in pos:
print(i,end=" ")
neg.sort()
neg.reverse()
z=len(neg)
if(z%2==0):
for i in neg:
print(i,end=" ")
else:
for i in range(1,z):
print(neg[i],end=" ")
```
| 104,810 | [
0.1978759765625,
-0.10516357421875,
-0.386962890625,
0.7060546875,
-0.41455078125,
-0.47900390625,
0.08966064453125,
0.102783203125,
-0.009490966796875,
0.57373046875,
0.391357421875,
0.035614013671875,
0.24951171875,
-0.544921875,
-0.458984375,
-0.1737060546875,
-0.2861328125,
-1.... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
b = []
k = 0
imax = -101
n = input()
a = [int(s) for s in input().split()]
if len(a)==1:
print(a[0])
exit()
if len(a)==a.count(0):
print(0)
exit()
for i in range(len(a)):
if a[i]<0:
k+=1
if a[i]>imax:
imax=a[i]
if k%2==0:
for i in range(len(a)):
if a[i]!=0:
b.append(a[i])
if b==[]:
print(max(a))
exit()
for i in range(len(b)):
print(b[i],end=' ')
else:
for i in range(len(a)):
if a[i]!=0 and not i==a.index(imax):
b.append(a[i])
if b==[]:
print(max(a))
exit()
for i in range(len(b)):
print(b[i],end=' ')
```
| 104,811 | [
0.277587890625,
-0.06719970703125,
-0.465087890625,
0.69140625,
-0.3828125,
-0.47265625,
0.09735107421875,
0.11236572265625,
-0.02655029296875,
0.5908203125,
0.364990234375,
0.056793212890625,
0.25537109375,
-0.60400390625,
-0.402587890625,
-0.1220703125,
-0.29638671875,
-1.0146484... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
import bisect
from itertools import accumulate
import os
import sys
import math
from decimal import *
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")
def isPrime(n) :
if (n <= 1) : return False
if (n <= 3) : return True
if (n % 2 == 0 or n % 3 == 0) : return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
def SieveOfEratosthenes(n):
prime=[]
primes = [True for i in range(n+1)]
p = 2
while (p * p <= n):
if (primes[p] == True):
prime.append(p)
for i in range(p * p, n+1, p):
primes[i] = False
p += 1
return prime
#--------------------------------------------------------
n=int(input())
a=list(map(int,input().split()))
greater=[]
less=[]
zero=[]
for i in range(0,len(a)):
if a[i]>0:
greater.append(a[i])
elif a[i]==0:
zero.append(a[i])
else:
less.append(a[i])
ans=[]
less.sort()
if len(greater)==0 and len(less)==1:
ans.append(less[-1])
if len(zero)>0:
ans.append(0)
print(*ans)
exit()
if len(greater)==0 and len(less)==0:
if len(zero)>0:
ans.append(0)
print(*ans)
exit()
for i in range(0,len(greater)):
ans.append(greater[i])
if len(less)%2==0:
ans=ans+less
else:
less=less[:-1]
for i in range(0,len(less)):
ans.append(less[i])
print(*ans)
```
| 104,812 | [
0.1534423828125,
-0.1160888671875,
-0.373046875,
0.78759765625,
-0.46728515625,
-0.48193359375,
0.09881591796875,
0.07977294921875,
0.06146240234375,
0.63720703125,
0.327392578125,
0.06060791015625,
0.344482421875,
-0.51904296875,
-0.43603515625,
-0.09552001953125,
-0.26708984375,
... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
n = int(input())
costs = list(map(int, input().split()))
negative, positive = [], []
for cost in costs:
if cost < 0:
negative.append(cost)
elif cost > 1:
positive.append(cost)
negative.sort()
if len(negative) % 2 == 1:
negative = negative[:-1]
result = negative + sorted(positive)
if len(result) == 0:
result = sorted(costs)[-1:]
print(' '.join(map(str, result)))
```
| 104,813 | [
0.238525390625,
-0.0777587890625,
-0.49169921875,
0.67138671875,
-0.35888671875,
-0.47021484375,
0.09588623046875,
0.1910400390625,
-0.10205078125,
0.591796875,
0.391357421875,
-0.02740478515625,
0.258544921875,
-0.525390625,
-0.431884765625,
-0.176513671875,
-0.300537109375,
-0.95... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b=[]
c=[]
for x in a:
if x>0:
b.append(x)
elif x<0:
c.append(x)
if len(c)%2!=0:
c=sorted(c)[:-1]
b+=c
if len(b)==0:
print(*a)
else:
print(*b)
```
| 104,814 | [
0.2484130859375,
-0.1014404296875,
-0.399658203125,
0.6923828125,
-0.4033203125,
-0.474365234375,
0.07354736328125,
0.10498046875,
-0.01611328125,
0.5712890625,
0.402099609375,
0.043914794921875,
0.25146484375,
-0.572265625,
-0.43115234375,
-0.142333984375,
-0.3095703125,
-1.076171... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Tags: greedy
Correct Solution:
```
n = int(input())
c = list(sorted(map(int, input().split())))
neg = []
ans = []
zero = 0
for x in c:
if x > 0:
ans.append(x)
elif x < 0:
neg.append(x)
else:
zero += 1
m = len(neg) // 2
for i in range(2 * m):
ans.append(neg[i])
if len(ans) == 0 and zero > 0:
ans.append(0)
elif len(ans) == 0 and len(neg) > 0:
ans.append(neg[0])
print(" ".join(map(str, ans)))
```
| 104,815 | [
0.2423095703125,
-0.07928466796875,
-0.34765625,
0.6572265625,
-0.395751953125,
-0.49267578125,
0.0897216796875,
0.11431884765625,
-0.0916748046875,
0.59423828125,
0.384033203125,
0.044342041015625,
0.254150390625,
-0.5927734375,
-0.4404296875,
-0.168212890625,
-0.29443359375,
-0.9... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Submitted Solution:
```
try:
n = int(input())
arr = list(map(int, input().split()))
positive = [item for item in arr if item > 0]
negative = [item for item in arr if item < 0]
zero = [item for item in arr if item == 0]
negative.sort(reverse=True)
length = len(negative)
z_length = len(zero)
if length > 1:
if length % 2 == 0:
ans = positive + negative
print(*ans)
else:
ans = positive + negative[1:]
print(*ans)
elif length == 1:
if len(positive) > 0:
print(*positive)
elif z_length != 0:
print(0)
else:
print(*negative)
else:
if len(positive) > 0:
print(*positive)
elif z_length != 0:
print(0)
except e:
pass
```
Yes
| 104,816 | [
0.26220703125,
-0.022613525390625,
-0.572265625,
0.6455078125,
-0.42578125,
-0.31689453125,
-0.00469207763671875,
0.265869140625,
-0.3447265625,
0.619140625,
0.33984375,
-0.03326416015625,
0.1900634765625,
-0.6357421875,
-0.56298828125,
-0.228271484375,
-0.334228515625,
-0.8203125,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Submitted Solution:
```
import sys
input = sys.stdin.readline
'''
'''
n = int(input())
nums = list(map(int, input().split()))
nums.sort()
res = []
i = 0
while i < n:
if nums[i] < 0 and i < n - 1 and nums[i+1] < 0:
res.append(nums[i])
res.append(nums[i+1])
i += 2
elif nums[i] == 0:
i += 1
elif nums[i] > 0:
res.append(nums[i])
i += 1
else:
i += 1
if res:
print(*res)
else:
print(nums[-1])
```
Yes
| 104,817 | [
0.2286376953125,
-0.051849365234375,
-0.55908203125,
0.6279296875,
-0.489501953125,
-0.25634765625,
0.00437164306640625,
0.243408203125,
-0.3203125,
0.533203125,
0.285888671875,
0.002193450927734375,
0.212646484375,
-0.662109375,
-0.53271484375,
-0.22021484375,
-0.306396484375,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Submitted Solution:
```
from bisect import bisect_left as bl;n=int(input())
if n==1:
print(input())
else:
a=list(map(int,input().split()));a.sort()
if bl(a,0)%2==1:
if a[bl(a,0)-1]<0:a.remove(a[bl(a,0)-1])
q=len(a)
while 0 in a and q>1:a.remove(0);q-=1
print(*a)
```
Yes
| 104,818 | [
0.1416015625,
-0.025390625,
-0.4912109375,
0.6630859375,
-0.54541015625,
-0.2354736328125,
0.07733154296875,
0.10369873046875,
-0.33251953125,
0.5546875,
0.331298828125,
0.0482177734375,
0.25732421875,
-0.77294921875,
-0.5234375,
-0.2041015625,
-0.37744140625,
-0.9921875,
-0.6474... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Submitted Solution:
```
n = int(input())
c = list(map(int, input().split()))
pos = 0
neg = 0
l_pos = []
l_neg = []
for item in c:
if item < 0:
neg += 1
l_neg.append(item)
elif item > 0:
pos += 1
l_pos.append(item)
if len(c) == 1 or len(set(c)) == 1 and c[0] == 0:
print(c[0])
elif len(c) == 2 and max(c) == 0:
print(0)
else:
if neg % 2 == 0:
for item in c:
if item != 0:
print(item, end = ' ')
else:
for item in l_pos:
print(item, end = ' ')
l_neg.sort()
for i in range(len(l_neg) - 1):
print(l_neg[i], end = ' ')
```
Yes
| 104,819 | [
0.1920166015625,
-0.05059814453125,
-0.489501953125,
0.59912109375,
-0.447998046875,
-0.325439453125,
0.0673828125,
0.27685546875,
-0.337158203125,
0.4765625,
0.265625,
0.056854248046875,
0.176513671875,
-0.61962890625,
-0.57373046875,
-0.191650390625,
-0.40087890625,
-0.8764648437... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Submitted Solution:
```
n = int(input())
text = list(map(int,input().split(' ')))
res = []
t = False
for i in text:
if i>0:
res.append(i)
if res == []:
for i in text:
if i<=0:
res.append(i)
if res == []:
res.append(0)
while (0 in res) and (res!=[0]):
res.remove(0)
print(' '.join(map(str,res)))
```
No
| 104,820 | [
0.1722412109375,
-0.10870361328125,
-0.5166015625,
0.62060546875,
-0.494384765625,
-0.244873046875,
0.0202789306640625,
0.160400390625,
-0.294189453125,
0.521484375,
0.28125,
0.01352691650390625,
0.239501953125,
-0.6455078125,
-0.466552734375,
-0.212158203125,
-0.3759765625,
-0.894... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.
Output
Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.
Examples
Input
5
1 2 -3 3 3
Output
3 1 2 3
Input
13
100 100 100 100 100 100 100 100 100 100 100 100 100
Output
100 100 100 100 100 100 100 100 100 100 100 100 100
Input
4
-2 -2 -2 -2
Output
-2 -2 -2 -2
Submitted Solution:
```
import sys
n=int(input())
a = list(map(int,input().strip().split()))[:n]
pos=0
neg=0
zero=0
for i in a :
if i>0:
pos=pos+1
if i<0:
neg=neg+1
if i==0:
zero=zero+1
if neg==n:
for i in a:
print(i," ",end =" ")
sys.exit()
if zero==n:
for i in a:
print(i," ",end =" ")
sys.exit()
if pos==n:
for i in a:
print(i," ",end =" ")
sys.exit()
if neg+zero==n:
for i in a:
if i>=0:
print(i," ",end =" ")
for i in a:
if i>0:
print(i," ",end =" ")
```
No
| 104,821 | [
0.232177734375,
-0.0277557373046875,
-0.51416015625,
0.60693359375,
-0.458740234375,
-0.311767578125,
0.04754638671875,
0.29052734375,
-0.35546875,
0.56201171875,
0.268798828125,
0.01416778564453125,
0.2078857421875,
-0.58203125,
-0.5283203125,
-0.1905517578125,
-0.303466796875,
-0... | 11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.