message stringlengths 2 45.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 254 108k | cluster float64 3 3 | __index_level_0__ int64 508 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After the war, the supersonic rocket became the most common public transportation.
Each supersonic rocket consists of two "engines". Each engine is a set of "power sources". The first engine ha... | instruction | 0 | 107,030 | 3 | 214,060 |
No | output | 1 | 107,030 | 3 | 214,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,251 | 3 | 214,502 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
import sys
import math
# working with masth.pow() instead of "**"
r = sys.stdin.readline
t = int(r())
for tests in range(t):
n = int(r())
xarr = []
yarr = []
summ = 0
for i in range(n * 2):
x, y = map(int, r().split())
if... | output | 1 | 107,251 | 3 | 214,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,252 | 3 | 214,504 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
if __name__ == '__main__':
for _ in range (int(input())):
n = int(input())
x = []
y = []
for i in range (2*n):
X,Y = map(int,input().split())
if X==0:
y.append(abs(Y))
else:
x.append(abs(X))
x.sort()
y.sort()
ans = 0
for i in... | output | 1 | 107,252 | 3 | 214,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,253 | 3 | 214,506 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
import math
def main():
t = int(input())
for _ in range(t):
n = int(input())
miners = [-1] * n
mines = [-1] * n
i, j = 0, 0
for _ in range(2*n):
a, b = map(lambda x: abs(int(x)), input().split())... | output | 1 | 107,253 | 3 | 214,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,254 | 3 | 214,508 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
xs, ys = [], []
for _ in range(2 * n):
x, y = map(int, input().split())
if x == 0:
ys.append(y * y)
else:
xs.append(x * x)
xs.sort()
ys.s... | output | 1 | 107,254 | 3 | 214,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,255 | 3 | 214,510 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = []
b = []
for i in range(2*n):
x,y = map(int, input().split())
if y == 0:
a.append(abs(x))
else:
b.append(abs(y))
a.sort()
b.sort()
... | output | 1 | 107,255 | 3 | 214,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,256 | 3 | 214,512 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
import math
import sys;Z=sys.stdin.readline
for _ in range(int(Z())):
n=int(input())
x=[]
y=[]
for i in range(2*n):
a,b=map(int,Z().split())
if b==0:
x.append(abs(a))
else:
y.append(abs(b))
x... | output | 1 | 107,256 | 3 | 214,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,257 | 3 | 214,514 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
t = int(input())
for i in range(t):
n = int(input())
miners, mines = [], []
for i in range(2*n):
x, y = map(int, input().split())
if x:
mines.append(abs(x))
else:
... | output | 1 | 107,257 | 3 | 214,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on the y-axis. There are n diamond mines in the m... | instruction | 0 | 107,258 | 3 | 214,516 |
Tags: geometry, greedy, math, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
import math
import copy
from decimal import Decimal
t = int(input())
for _ in range(t):
n = int(input())
diamond = []
miner = []
for i in range(2*n):
x, y = map(int,input().split())
if x ==... | output | 1 | 107,258 | 3 | 214,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,259 | 3 | 214,518 |
Yes | output | 1 | 107,259 | 3 | 214,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,260 | 3 | 214,520 |
Yes | output | 1 | 107,260 | 3 | 214,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,261 | 3 | 214,522 |
Yes | output | 1 | 107,261 | 3 | 214,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,262 | 3 | 214,524 |
Yes | output | 1 | 107,262 | 3 | 214,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,263 | 3 | 214,526 |
No | output | 1 | 107,263 | 3 | 214,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,264 | 3 | 214,528 |
No | output | 1 | 107,264 | 3 | 214,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,265 | 3 | 214,530 |
No | output | 1 | 107,265 | 3 | 214,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Diamond Miner is a game that is similar to Gold Miner, but there are n miners instead of 1 in this game.
The mining area can be described as a plane. The n miners can be regarded as n points on... | instruction | 0 | 107,266 | 3 | 214,532 |
No | output | 1 | 107,266 | 3 | 214,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider infinite grid of unit cells. Some of those cells are planets.
Meta-universe M = {p1, p2, ..., pk} is a set of planets. Suppose there is an infinite row or column with following two pr... | instruction | 0 | 107,340 | 3 | 214,680 |
No | output | 1 | 107,340 | 3 | 214,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,614 | 3 | 215,228 |
Yes | output | 1 | 107,614 | 3 | 215,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,615 | 3 | 215,230 |
Yes | output | 1 | 107,615 | 3 | 215,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,616 | 3 | 215,232 |
Yes | output | 1 | 107,616 | 3 | 215,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,617 | 3 | 215,234 |
Yes | output | 1 | 107,617 | 3 | 215,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,618 | 3 | 215,236 |
No | output | 1 | 107,618 | 3 | 215,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,619 | 3 | 215,238 |
No | output | 1 | 107,619 | 3 | 215,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,620 | 3 | 215,240 |
No | output | 1 | 107,620 | 3 | 215,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen dreams of one day owning a enormous fleet of electric cars, the car of the future! He knows that this will give him a big status boost. As Allen is planning out all of the different types ... | instruction | 0 | 107,621 | 3 | 215,242 |
No | output | 1 | 107,621 | 3 | 215,243 |
Provide a correct Python 3 solution for this coding contest problem.
Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.
Today's training is to use the Amidakuji to improve luck by gaining the ability to read the future. Of course, not on... | instruction | 0 | 107,821 | 3 | 215,642 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
H, N, P, M, K = map(int, readline().split())
A = [0]*H
for i in range(M):
a, b = map(int, readline().split())
A[a-1] = b
S = [[0]*N for i in range(K+1)]
S[0][P-1] = 1
T = [[0]*... | output | 1 | 107,821 | 3 | 215,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So Rick wants to give his legacy to Morty before bad guys catch them.
There are n planets in t... | instruction | 0 | 108,310 | 3 | 216,620 |
No | output | 1 | 108,310 | 3 | 216,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So Rick wants to give his legacy to Morty before bad guys catch them.
There are n planets in t... | instruction | 0 | 108,311 | 3 | 216,622 |
No | output | 1 | 108,311 | 3 | 216,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So Rick wants to give his legacy to Morty before bad guys catch them.
There are n planets in t... | instruction | 0 | 108,312 | 3 | 216,624 |
No | output | 1 | 108,312 | 3 | 216,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So Rick wants to give his legacy to Morty before bad guys catch them.
There are n planets in t... | instruction | 0 | 108,313 | 3 | 216,626 |
No | output | 1 | 108,313 | 3 | 216,627 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.