message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,509 | 8 | 115,018 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n,m = map(int,input().split())
w = list(map(int,input().split()))
b = list(map(int,input().split()))
when = []
j = n+m
for i in range(n):
try:
j = b.index(i+1)
except:
pass
if j != n+m:
when.append([j,... | output | 1 | 57,509 | 8 | 115,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,510 | 8 | 115,020 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
def f(s):
return int(s) - 1
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(f, input().split()))
c = [[0] * n for i in range(n)]
o = 0
for i in range(m):
for j in range(n):
if j != b[i]:
... | output | 1 | 57,510 | 8 | 115,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,511 | 8 | 115,022 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n, m = [int(x) for x in input().split()]
w = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ans = 0
state = [0] * n
used = [0] * n
ptr = 0
for i in b:
if not used[i - 1]:
used[i - 1] = 1
state[ptr] = (i, w[i ... | output | 1 | 57,511 | 8 | 115,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,512 | 8 | 115,024 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
#!/usr/bin/env python3
n, m = map(int, input().split())
w = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(m):
flag = dict()
for j in range(i-1, -1, -1):
if b[j] == b[i]:
... | output | 1 | 57,512 | 8 | 115,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,513 | 8 | 115,026 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
# coding: utf-8
n, m = [int(i) for i in input().split()]
w = [0]+[int(i) for i in input().split()]
b = [int(i) for i in input().split()]
books = []
for book in b:
if book not in books:
books.append(book)
books.reverse()
ans = ... | output | 1 | 57,513 | 8 | 115,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,514 | 8 | 115,028 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n, m = map(int,input().split())
w = [int(x) for x in input().split()]
b = [(int(x)-1) for x in input().split()]
w += [0]
a = 0
for i in range(m):
for j in range(i-1,-1,-1):
if b[j] == b[i]:
b[j] = n
br... | output | 1 | 57,514 | 8 | 115,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,515 | 8 | 115,030 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n,m=map(int,input().split())
w=list(map(int,input().split()))
b=list(map(int,input().split()))
A=0
for i in range(m):
d,j={},i-1
while j>=0 and b[j]!=b[i]:
if (d.get(b[j],1)):
A+=w[b[j]-1]
d[b[j]]=0
j-=1
print(A)
``` | output | 1 | 57,515 | 8 | 115,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,516 | 8 | 115,032 |
Yes | output | 1 | 57,516 | 8 | 115,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,517 | 8 | 115,034 |
Yes | output | 1 | 57,517 | 8 | 115,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,518 | 8 | 115,036 |
Yes | output | 1 | 57,518 | 8 | 115,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,519 | 8 | 115,038 |
Yes | output | 1 | 57,519 | 8 | 115,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,520 | 8 | 115,040 |
No | output | 1 | 57,520 | 8 | 115,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,521 | 8 | 115,042 |
No | output | 1 | 57,521 | 8 | 115,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,522 | 8 | 115,044 |
No | output | 1 | 57,522 | 8 | 115,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaeh... | instruction | 0 | 57,523 | 8 | 115,046 |
No | output | 1 | 57,523 | 8 | 115,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key ... | instruction | 0 | 57,702 | 8 | 115,404 |
Yes | output | 1 | 57,702 | 8 | 115,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key ... | instruction | 0 | 57,703 | 8 | 115,406 |
Yes | output | 1 | 57,703 | 8 | 115,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key ... | instruction | 0 | 57,704 | 8 | 115,408 |
Yes | output | 1 | 57,704 | 8 | 115,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key ... | instruction | 0 | 57,705 | 8 | 115,410 |
No | output | 1 | 57,705 | 8 | 115,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key ... | instruction | 0 | 57,706 | 8 | 115,412 |
No | output | 1 | 57,706 | 8 | 115,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key ... | instruction | 0 | 57,708 | 8 | 115,416 |
No | output | 1 | 57,708 | 8 | 115,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,237 | 8 | 116,474 |
Tags: dp
Correct Solution:
```
n = int(input())
inf = 10**8
dp = []
for k in range(n + 1):
dp.append([-inf] * 10005)
dp[0][0] = 0
w = 0
for _ in range(k):
a, b = map(int, input().split())
w += b
for k in range(n-1,-1,-1):
for i in range(10005 - a):
dp[k+1][i+a] = max(dp[k+1][i+a... | output | 1 | 58,237 | 8 | 116,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,238 | 8 | 116,476 |
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 | 58,238 | 8 | 116,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,239 | 8 | 116,478 |
Tags: dp
Correct Solution:
```
n = int(input())
p = sorted([tuple(map(int, input().split())) for _ in range(n)], key=lambda x:x[0])
S = sum(v[1] for v in p)
dic = [[-1] * 10001 for _ in range(n + 1)]
dic[0][0] = 0
l, r = [0], [0]
for i in range(n):
dc, dv = p[i]
for k in range(i, -1, -1):
m = -1
... | output | 1 | 58,239 | 8 | 116,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,240 | 8 | 116,480 |
Tags: dp
Correct Solution:
```
#https://codeforces.com/problemset/problem/1458/B
#Knapsack 2D dp
#Greedily take glasses to maximize starting amount.
#For the same cap, I want to know what is the largest starting amount,
#to minimize the remaining amount that will be transferred (and half spilled).
#dp[glass][nGlassesTa... | output | 1 | 58,240 | 8 | 116,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,241 | 8 | 116,482 |
Tags: dp
Correct Solution:
```
from sys import stdin, stdout
def glass_half_spilled(n, ab_a, a_a, sa, sb):
dp = [[-1 for _ in range(sa + 1)] for _ in range(n+1)]
dp[0][0] = 0
for i in range(1, n+1):
for k in range(i, 0, -1):
for A in range(a_a[i], -1, -1):
if dp[k-1][A... | output | 1 | 58,241 | 8 | 116,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,242 | 8 | 116,484 |
Tags: dp
Correct Solution:
```
n = int(input())
p = sorted([tuple(map(int, input().split())) for _ in range(n)], key=lambda x:(x[0], -x[1]))
dic = [[-1] * 10001 for _ in range(n + 1)]
dic[0][0] = 0
l, r, s = [0], [0], 0
for i in range(n):
dc, dv = p[i]
s += dv
for k in range(i, -1, -1):
m = -1
... | output | 1 | 58,242 | 8 | 116,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,243 | 8 | 116,486 |
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 | 58,243 | 8 | 116,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as much water in them as possible. To that effect yo... | instruction | 0 | 58,244 | 8 | 116,488 |
Tags: dp
Correct Solution:
```
n=int(input())
d=[[-10**8]*(10002) for _ in range(n+1)]
d[0][0]=0
s=0
for i in range(n):
a,b=map(int,input().split())
s+=b
for k in range(n-1,-1,-1):
for c in range(10001-a,-1,-1):
d[k+1][c+a]=max(d[k+1][c+a],d[k][c]+b)
ans = [0 for i in range(n+1)]
for ... | output | 1 | 58,244 | 8 | 116,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,245 | 8 | 116,490 |
Yes | output | 1 | 58,245 | 8 | 116,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,246 | 8 | 116,492 |
Yes | output | 1 | 58,246 | 8 | 116,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,247 | 8 | 116,494 |
Yes | output | 1 | 58,247 | 8 | 116,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,248 | 8 | 116,496 |
Yes | output | 1 | 58,248 | 8 | 116,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,249 | 8 | 116,498 |
No | output | 1 | 58,249 | 8 | 116,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,250 | 8 | 116,500 |
No | output | 1 | 58,250 | 8 | 116,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,251 | 8 | 116,502 |
No | output | 1 | 58,251 | 8 | 116,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n glasses on the table numbered 1, …, n. The glass i can hold up to a_i units of water, and currently contains b_i units of water.
You would like to choose k glasses and collect as mu... | instruction | 0 | 58,252 | 8 | 116,504 |
No | output | 1 | 58,252 | 8 | 116,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,253 | 8 | 116,506 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n = int(input())
for i in range(n):
height, rocks = map(int, input().split())
throwHeight = list(map(int, input().split()))
throwHeight.append('$')
for j in range(rocks):
for k in range(height):
if throwHeight[k + 1] ==... | output | 1 | 58,253 | 8 | 116,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,254 | 8 | 116,508 |
Tags: brute force, greedy, implementation
Correct Solution:
```
q = int(input())
for i in range(q):
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
ans = 0
if n==1:
ans =-1
for j in range(k):
if ans > -1:
for x in range(1, n):
if a[... | output | 1 | 58,254 | 8 | 116,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,255 | 8 | 116,510 |
Tags: brute force, greedy, implementation
Correct Solution:
```
t = int(input())
for _ in range(t):
a,b = map(int,input().split())
l = list(map(int,input().split()))
pos = 0
for i in range(1,a):
while(l[i]>l[i-1]):
for j in range(i-1,-1,-1):
l[j]+=1
po... | output | 1 | 58,255 | 8 | 116,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,256 | 8 | 116,512 |
Tags: brute force, greedy, implementation
Correct Solution:
```
R=lambda:map(int,input().split())
t,=R()
for _ in[0]*t:
n,k=R();a=[*R(),101];i=1
while i%n*k:
i=1
while a[i-1]>=a[i]:i+=1
a[i-1]+=1;k-=1
print(i%n or-1)
``` | output | 1 | 58,256 | 8 | 116,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,257 | 8 | 116,514 |
Tags: brute force, greedy, implementation
Correct Solution:
```
import heapq
for _ in range(int(input())):
n, k = map(int, input().split())
l = list(map(int, input().split()))
diff = []
for i in range(n-1):
diff.append([l[i]-l[i+1], i+1])
# diff = list(map(lambda x: [abs(x[0]), x[1]], diff)... | output | 1 | 58,257 | 8 | 116,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,258 | 8 | 116,516 |
Tags: brute force, greedy, implementation
Correct Solution:
```
t = (int)(input())
for i in range(0,t):
m,n = map(int,input().split())
l = list(map(int,input().split(" ")))
maxi = 100
total = 0
for j in l:
if maxi - j > 0:
total = total+maxi-j
if(total < n):
print(-1)... | output | 1 | 58,258 | 8 | 116,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,259 | 8 | 116,518 |
Tags: brute force, greedy, implementation
Correct Solution:
```
# if anyone reaches garbage colleector return -1
# else add max(arr[i+1]-arr[i],k)
# if(k<=0):
# return i
def h(k):
ret=-2
while(k>0):
ret=-2
# print(arr,k)
for i in range(len(arr)-1):
if(arr[i]<arr[i+1]):
... | output | 1 | 58,259 | 8 | 116,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreamin... | instruction | 0 | 58,260 | 8 | 116,520 |
Tags: brute force, greedy, implementation
Correct Solution:
```
import sys
input=sys.stdin.readline
from collections import defaultdict
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
h=list(map(int,input().split()))
fall=defaultdict(lambda: -1)
cnt=0
flag=True
while flag:
... | output | 1 | 58,260 | 8 | 116,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.
A block with side a has volume a3. A tower consisting o... | instruction | 0 | 58,485 | 8 | 116,970 |
Tags: binary search, dp, greedy
Correct Solution:
```
def f(m, cnt, y):
if m == 0: return cnt, y
a = int(m ** (1/3))
k1, k2 = a ** 3, (a - 1) ** 3
return max(f(m - k1, cnt + 1, y + k1), f(k1 - k2 - 1, cnt + 1, y + k2))
print(*f(int(input()), 0, 0))
``` | output | 1 | 58,485 | 8 | 116,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.
A block with side a has volume a3. A tower consisting o... | instruction | 0 | 58,486 | 8 | 116,972 |
Tags: binary search, dp, greedy
Correct Solution:
```
#D razbor 1
def func(n):
if n<8:
return n,n
max_a = int(n**(1/3))
if (max_a+1)**3<=n:
max_a += 1
v1=func(n-max_a**3)
v1=(v1[0]+1,v1[1]+max_a**3)
v2=func(max_a**3-1-(max_a-1)**3)
v2=(v2[0]+1,v2[1]+(max_a-1)*... | output | 1 | 58,486 | 8 | 116,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.
A block with side a has volume a3. A tower consisting o... | instruction | 0 | 58,487 | 8 | 116,974 |
Tags: binary search, dp, greedy
Correct Solution:
```
def f(m, cnt, y):
global ans, x
if m == 0: return cnt, y
a = int(m ** (1/3))
k1, k2 = a ** 3, (a - 1) ** 3
return max(f(m - k1, cnt + 1, y + k1), f(k1 - k2 - 1, cnt + 1, y + k2))
print(*f(int(input()), 0, 0))
``` | output | 1 | 58,487 | 8 | 116,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.
A block with side a has volume a3. A tower consisting o... | instruction | 0 | 58,488 | 8 | 116,976 |
Tags: binary search, dp, greedy
Correct Solution:
```
from math import *
from sys import *
N=int(input())
# if N <= 7:
# print(N,N)
# elif N <= 15:
# print(N-7,N)
# elif N <= 23:
# print(N-14,N)
# else:
memo={}
def solve(n,R):
if n in memo:
return memo[n]
if n == 0:
return 0,0
... | output | 1 | 58,488 | 8 | 116,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.
A block with side a has volume a3. A tower consisting o... | instruction | 0 | 58,489 | 8 | 116,978 |
Tags: binary search, dp, greedy
Correct Solution:
```
def kil(n):
if n<8: return (n,n)
m=int(n**(1/3))
k1,v1=kil(n-m*m*m)
k2,v2=kil(m*m*m-1-(m-1)*(m-1)*(m-1))
return (k1+1,v1+m*m*m) if (k1,v1+m*m*m)>(k2,v2+(m-1)*(m-1)*(m-1)) else (k2+1,v2+(m-1)*(m-1)*(m-1))
n=int(input())
print(*kil(n))
``` | output | 1 | 58,489 | 8 | 116,979 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.