message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Buber is a Berland technology company that specializes in waste of investor's money. Recently Buber decided to transfer its infrastructure to a cloud. The company decided to rent CPU cores in th... | instruction | 0 | 59,736 | 10 | 119,472 |
No | output | 1 | 59,736 | 10 | 119,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistan... | instruction | 0 | 60,023 | 10 | 120,046 |
Tags: dp
Correct Solution:
```
n = int(input())
t, c = [], []
for i in range(n):
tt, cc = list(map(int, input().split()))
t.append(tt)
c.append(cc)
def find(i: int, cnt: int) -> int:
if cnt >= n: return 0
if i == n: return int(1e18)
return min(find(i + 1, cnt), c[i] + find(i + 1, cnt + 1 + t[i... | output | 1 | 60,023 | 10 | 120,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistan... | instruction | 0 | 60,024 | 10 | 120,048 |
Tags: dp
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# 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
... | output | 1 | 60,024 | 10 | 120,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistan... | instruction | 0 | 60,025 | 10 | 120,050 |
Tags: dp
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
def main():
n = int(input())
arr = [tuple(map(int,input().split())) for _ in range(n)]
# time ; cost
dp = [10**15]*(n+1)
"""dp[i] gives the price to be paid when... | output | 1 | 60,025 | 10 | 120,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistan... | instruction | 0 | 60,026 | 10 | 120,052 |
Tags: dp
Correct Solution:
```
def read():
return [int(v) for v in input().split()]
def main():
n = read()[0]
t, c = [], []
for i in range(n):
line = read()
t.append(line[0] + 1)
c.append(line[1])
MAX = 10 ** 15
dp = [MAX] * (n + 1)
dp[0] = 0
for i in range(n):... | output | 1 | 60,026 | 10 | 120,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistan... | instruction | 0 | 60,027 | 10 | 120,054 |
Tags: dp
Correct Solution:
```
n=int(input())
ar=[float('inf')]*(n+1)
ar[0]=0
for i in range(n):
t,c=map(int,input().split())
for j in range(n-1,-1,-1):
w=min(j+t+1,n)
ar[w]=min(ar[w],ar[j]+c)
print(ar[n])
``` | output | 1 | 60,027 | 10 | 120,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistan... | instruction | 0 | 60,028 | 10 | 120,056 |
Tags: dp
Correct Solution:
```
inf = float("inf")
n=int(input())
time, val =[0], [0]
ans=[inf for i in range(n+1)]
ans[0]=0
for i in range(n):
timeInp,valInp= [int(x) for x in input().split()]
timeInp+=1#timeInp+=2
time.append(timeInp)
val.append(valInp)
for i in range(1,n+1):
for j in range(n,0,-1)... | output | 1 | 60,028 | 10 | 120,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistan... | instruction | 0 | 60,029 | 10 | 120,058 |
Tags: dp
Correct Solution:
```
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in fi... | output | 1 | 60,029 | 10 | 120,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant s... | instruction | 0 | 60,030 | 10 | 120,060 |
No | output | 1 | 60,030 | 10 | 120,061 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant s... | instruction | 0 | 60,031 | 10 | 120,062 |
No | output | 1 | 60,031 | 10 | 120,063 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant s... | instruction | 0 | 60,032 | 10 | 120,064 |
No | output | 1 | 60,032 | 10 | 120,065 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant s... | instruction | 0 | 60,033 | 10 | 120,066 |
No | output | 1 | 60,033 | 10 | 120,067 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,479 | 10 | 120,958 |
"Correct Solution:
```
A,B,C,X,Y = map(int,input().split())
print(min(A*X+B*Y,2*C*X+B*max(0,Y-X),2*C*Y+A*max(0,X-Y)))
``` | output | 1 | 60,479 | 10 | 120,959 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,480 | 10 | 120,960 |
"Correct Solution:
```
a,b,c,x,y=map(int,input().split())
m=min(a+b,2*c)
if x>=y:print(m*y+min(a,2*c)*(x-y))
else:print(m*x+min(b,2*c)*(y-x))
``` | output | 1 | 60,480 | 10 | 120,961 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,481 | 10 | 120,962 |
"Correct Solution:
```
A,B,C,X,Y=map(int,input().split())
v=10**10
for i in range(0,max(X,Y)*2+2):
v=min(v,A*max(X-i,0)+B*max(Y-i,0)+C*i*2)
print(v)
``` | output | 1 | 60,481 | 10 | 120,963 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,482 | 10 | 120,964 |
"Correct Solution:
```
a,b,c,x,y=map(int,input().split())
ans=float('inf')
for i in range(10**5+1):
tmp=2*i*c+a*max(x-i,0)+b*max(y-i,0)
ans=min(tmp,ans)
print(ans)
``` | output | 1 | 60,482 | 10 | 120,965 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,483 | 10 | 120,966 |
"Correct Solution:
```
A, B, C, X, Y = map(int, input().split())
print(min(A * X + B * Y, C * 2 * max(X,Y), C * 2 * min(X,Y) + max(A * (X - Y), B * (Y - X))))
``` | output | 1 | 60,483 | 10 | 120,967 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,484 | 10 | 120,968 |
"Correct Solution:
```
a,b,c,x,y = map(int,input().split())
if x>y:
s = c*y*2+(x-y)*a
else:
s = c*x*2+(y-x)*b
print(min((a*x+b*y),(c*max(x,y)*2),s))
``` | output | 1 | 60,484 | 10 | 120,969 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,485 | 10 | 120,970 |
"Correct Solution:
```
A,B,C,X,Y=list(map(int,input().split()))
print(min([i*2*C+max(0,X-i)*A+max(0,Y-i)*B for i in range(10**5+1)]))
``` | output | 1 | 60,485 | 10 | 120,971 |
Provide a correct Python 3 solution for this coding contest problem.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-p... | instruction | 0 | 60,486 | 10 | 120,972 |
"Correct Solution:
```
a,b,c,x,y=map(int,input().split())
print(min(max(x,y)*2*c,a*x+b*y,min(x,y)*2*c+a*(x-min(x,y))+(b*(y-min(x,y)))))
``` | output | 1 | 60,486 | 10 | 120,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one ... | instruction | 0 | 60,487 | 10 | 120,974 |
Yes | output | 1 | 60,487 | 10 | 120,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one ... | instruction | 0 | 60,488 | 10 | 120,976 |
Yes | output | 1 | 60,488 | 10 | 120,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one ... | instruction | 0 | 60,489 | 10 | 120,978 |
Yes | output | 1 | 60,489 | 10 | 120,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one ... | instruction | 0 | 60,490 | 10 | 120,980 |
Yes | output | 1 | 60,490 | 10 | 120,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one ... | instruction | 0 | 60,492 | 10 | 120,984 |
No | output | 1 | 60,492 | 10 | 120,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one ... | instruction | 0 | 60,493 | 10 | 120,986 |
No | output | 1 | 60,493 | 10 | 120,987 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,559 | 10 | 121,118 |
"Correct Solution:
```
# coding: utf-8
# Here your code !
dataCount = int(input())
while dataCount > 0:
employeeSalesList = []
for _ in range(dataCount):
dataList = input().split(" ")
employeeId, price = int(dataList[0]), int(dataList[1]) * int(dataList[2])
found = False
for dat... | output | 1 | 60,559 | 10 | 121,119 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,560 | 10 | 121,120 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0: break
data = {}
staff = []
for i in range(n):
x, y, z = [int(el) for el in input().split(' ')]
if x in data:
data[x] += y * z
else:
data[x] = y * z
staff.append(x)
if ... | output | 1 | 60,560 | 10 | 121,121 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,561 | 10 | 121,122 |
"Correct Solution:
```
n = int(input())
while n != 0:
earnings = []
for i in range(0,n):
a = str.split(input(),' ')
if i > 0 :
for j in range(0,len(earnings)):
if a[0] == earnings[j][0]:
earnings[j][1] = str(int(earnings[j][1])+(int(a[1])*int(a[2])))
break
if j == len(earnings) - 1:earnings.a... | output | 1 | 60,561 | 10 | 121,123 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,562 | 10 | 121,124 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
emp = [0] * 4001
used = set()
for i in range(n):
e, p, q = map(int, input().split())
emp[e] += p * q
if 1000000 <= emp[e] and e not in used:
print(e)
used.add(e)
if len(us... | output | 1 | 60,562 | 10 | 121,125 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,563 | 10 | 121,126 |
"Correct Solution:
```
from collections import Counter
while True:
n = int(input())
if n == 0:
break
counter = Counter()
for _ in [0]*n:
a, b, c = map(int, input().split())
counter[a] += b*c
result = [str(k) for k, v in counter.items() if v >= 1000000] or ["NA"]
print("\... | output | 1 | 60,563 | 10 | 121,127 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,564 | 10 | 121,128 |
"Correct Solution:
```
from collections import OrderedDict
while True:
num = int(input())
if not num: break
result = OrderedDict()
for _ in range(num):
x, y, z = [int(el) for el in input().split(' ')]
if x in result:
result[x] += y*z
else:
result[x] = y*z
... | output | 1 | 60,564 | 10 | 121,129 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,565 | 10 | 121,130 |
"Correct Solution:
```
p = []
q = []
while True:
n = int(input())
m = 0
number = [0] * 4000
if n == 0:
break
else:
for i in range(n):
p.append(i)
q.append(i)
e,p[i],q[i] = [int(s) for s in input().split(' ')]
if number[e] >= 1000000:
... | output | 1 | 60,565 | 10 | 121,131 |
Provide a correct Python 3 solution for this coding contest problem.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then,... | instruction | 0 | 60,566 | 10 | 121,132 |
"Correct Solution:
```
while True:
input_n = int(input())
key = 0
if input_n == 0:
break
id_list = [[0 for i in range(2)]for i in range(input_n)]
for i in range(input_n):
id_line = input().split()
for j in id_list:
if j[0] == int(id_line[0]):
j[1] ... | output | 1 | 60,566 | 10 | 121,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,567 | 10 | 121,134 |
Yes | output | 1 | 60,567 | 10 | 121,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,568 | 10 | 121,136 |
Yes | output | 1 | 60,568 | 10 | 121,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,569 | 10 | 121,138 |
Yes | output | 1 | 60,569 | 10 | 121,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,570 | 10 | 121,140 |
Yes | output | 1 | 60,570 | 10 | 121,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,571 | 10 | 121,142 |
No | output | 1 | 60,571 | 10 | 121,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,572 | 10 | 121,144 |
No | output | 1 | 60,572 | 10 | 121,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,573 | 10 | 121,146 |
No | output | 1 | 60,573 | 10 | 121,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is data on sales of your company. Your task is to write a program which identifies good workers.
The program should read a list of data where each item includes the employee ID i, the amo... | instruction | 0 | 60,574 | 10 | 121,148 |
No | output | 1 | 60,574 | 10 | 121,149 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,881 | 10 | 121,762 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
import math
for _ in range(int(input())):
n,W=map(int,input().split())
w=list(map(int,input().split()))
a=[]
s=0
for i in range(n):
if w[i]<=W and w[i]>=math.ceil(W/2):
a=[i+1]
s=w[i]
break;
else:
s+=w[i]
if s>W:
s-=w[i]
... | output | 1 | 60,881 | 10 | 121,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,882 | 10 | 121,764 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
t = int(input())
for _ in range(t):
n, W = map(int, input().split())
w = list(map(int, input().split()))
s = 0
c = []
f = False
for i in range(n):
if (W + 1) // 2 <= w[i] <= W:
print(1)
print(i ... | output | 1 | 60,882 | 10 | 121,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,883 | 10 | 121,766 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
from collections import defaultdict
for _ in range(int(input())):
n,w=map(int,input().split())
a=list(map(int,input().split()))
ex = (w + 1) // 2
gg=False
for i in range(n):
if a[i]>=ex and a[i]<=w:
gg=True
... | output | 1 | 60,883 | 10 | 121,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,884 | 10 | 121,768 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
import sys
import bisect
*data, = map(int, sys.stdin.read().split()[::-1])
def inp():
return data.pop()
output = []
for _ in range(inp()):
n, W = inp(), inp()
*w, = [inp() for _ in range(n)]
lbound = (W + 1) // 2
items = sorted(... | output | 1 | 60,884 | 10 | 121,769 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,885 | 10 | 121,770 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
"""
Don't see the standings during the contest!!! You will lose motivation.
"""
# ---------------------------------------------------Import Libraries---------------------------------------------------
import sys
import time
import os
from math i... | output | 1 | 60,885 | 10 | 121,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,886 | 10 | 121,772 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
from math import ceil
for T in range(int(input())):
n,s=map(int,input().split())
w=list(map(int,input().split()))
w=[[w[i],i+1] for i in range(n)]
w.sort(key=lambda x:x[0])
s1=0
a=[]
for i in range(n-1,-1,-1):
val=... | output | 1 | 60,886 | 10 | 121,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,887 | 10 | 121,774 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
class Weight:
def __init__(self, w, i):
self.weight = w
self.index =i
def __lt__(self, other):
return self.weight < other.weight
def solve():
n, total = (int(x) for x in input().strip().split())
arr ... | output | 1 | 60,887 | 10 | 121,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i.
You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) do... | instruction | 0 | 60,888 | 10 | 121,776 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
t = int(input())
for _ in range(t):
n, w = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
if w <= a[i] * 2 <= w * 2:
print(1)
print(i + 1)
break
else:
... | output | 1 | 60,888 | 10 | 121,777 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.