message stringlengths 2 19.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 322 108k | cluster float64 15 15 | __index_level_0__ int64 644 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a rectangular grid of size n Γ m. Each cell has a number written on it; the number on the cell (i, j) is a_{i, j}. Your task is to calculate the number of paths from the upper-left cell... | instruction | 0 | 34,253 | 15 | 68,506 |
No | output | 1 | 34,253 | 15 | 68,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a rectangular grid of size n Γ m. Each cell has a number written on it; the number on the cell (i, j) is a_{i, j}. Your task is to calculate the number of paths from the upper-left cell... | instruction | 0 | 34,254 | 15 | 68,508 |
No | output | 1 | 34,254 | 15 | 68,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a rectangular grid of size n Γ m. Each cell has a number written on it; the number on the cell (i, j) is a_{i, j}. Your task is to calculate the number of paths from the upper-left cell... | instruction | 0 | 34,255 | 15 | 68,510 |
No | output | 1 | 34,255 | 15 | 68,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a rectangular grid of size n Γ m. Each cell has a number written on it; the number on the cell (i, j) is a_{i, j}. Your task is to calculate the number of paths from the upper-left cell... | instruction | 0 | 34,256 | 15 | 68,512 |
No | output | 1 | 34,256 | 15 | 68,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,350 | 15 | 68,700 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import sys
n, m, k, q = [int(i) for i in sys.stdin.readline().split()]
indata = sys.stdin.readlines()
data = []
inf = 1<<50
for i in range(k):
data.append(tuple([int(f) for f in indata[i].split()]))
data.sort()
chutes = [int(i) for i in indata... | output | 1 | 34,350 | 15 | 68,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,351 | 15 | 68,702 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
from sys import setrecursionlimit as SRL, stdin
SRL(10 ** 7)
rd = stdin.readline
rrd = lambda: map(int, rd().strip().split())
left = [1000000] * 200005
right = [0] * 200005
n, m, k, q = rrd()
lst = 0
while k:
x, y = rrd()
left[x] = min(y, ... | output | 1 | 34,351 | 15 | 68,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,352 | 15 | 68,704 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import sys
n, m, k, q = list(map(int, sys.stdin.readline().strip().split()))
T = [0] * k
for i in range (0, k):
T[i] = list(map(int, sys.stdin.readline().strip().split()))
T[i][1] = T[i][1] - 1
T[i][0] = T[i][0] - 1
T.sort() # treasures ... | output | 1 | 34,352 | 15 | 68,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,353 | 15 | 68,706 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
# see bisect module:
# https://codeforces.com/contest/1201/submission/58302708
# python complexity:
# https://www.ics.uci.edu/~pattis/ICS-33/lectures/complexitypython.txt
# solve using DP
n, m, k, q = map(int, input().split())
# n rows
# m cols
t... | output | 1 | 34,353 | 15 | 68,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,354 | 15 | 68,708 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
def nearest(point):
l = 0
r = q
while r - l > 1:
mid = int((r + l) / 2)
if safe[mid] <= point:
l = mid
else:
r = mid
if safe[l] > point:
return [safe[l]]
elif l + 1 == q:
... | output | 1 | 34,354 | 15 | 68,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,355 | 15 | 68,710 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
from bisect import *
n, m, k, q = map(int, input().split())
right = [-1] * n
left = [-1] * n
for i in range(k):
row, col = map(int, input().split())
row -= 1
col -= 1
if right[row] == -1:
right[row] = left[row] = col
else... | output | 1 | 34,355 | 15 | 68,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,356 | 15 | 68,712 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import bisect
n, m, k, q = map(int, input().split())
# min, max
vals = {}
vals[1] = [1, 1]
for i in range(k):
r, c = map(int, input().split())
if r not in vals:
vals[r] = [c, c]
else:
vals[r][0] = min(vals[r][0], c)
vals[r][1] = max(vals[r... | output | 1 | 34,356 | 15 | 68,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them is located at the position (r_i, c_i).
Initia... | instruction | 0 | 34,357 | 15 | 68,714 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import sys
from bisect import bisect_left,bisect_right
input=sys.stdin.readline
n,m,k,q=map(int,input().split())
treasure=[[]for i in range(n)]
for _ in range(k):
x,y=map(int,input().split())
treasure[x-1].append(y-1)
safe=list(map(int,inpu... | output | 1 | 34,357 | 15 | 68,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,358 | 15 | 68,716 |
Yes | output | 1 | 34,358 | 15 | 68,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,359 | 15 | 68,718 |
Yes | output | 1 | 34,359 | 15 | 68,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,360 | 15 | 68,720 |
Yes | output | 1 | 34,360 | 15 | 68,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,361 | 15 | 68,722 |
Yes | output | 1 | 34,361 | 15 | 68,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,362 | 15 | 68,724 |
No | output | 1 | 34,362 | 15 | 68,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,363 | 15 | 68,726 |
No | output | 1 | 34,363 | 15 | 68,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,364 | 15 | 68,728 |
No | output | 1 | 34,364 | 15 | 68,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are on the island which can be represented as a n Γ m table. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are k treasures on the island, the i-th of them... | instruction | 0 | 34,365 | 15 | 68,730 |
No | output | 1 | 34,365 | 15 | 68,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,584 | 15 | 69,168 |
Tags: binary search, implementation, math
Correct Solution:
```
dx = {'U': 0, 'D': 0, 'L': -1, 'R': 1}
dy = {'U': 1, 'D': -1, 'L': 0, 'R': 0}
x, y, xl, yl = 0, 0, [], []
a, b = map(int, input().split())
for ch in input():
xl.append(x)
yl.append(y)
x += dx[ch]
y += dy[ch]
for xi, yi in zip(xl, yl):
m... | output | 1 | 34,584 | 15 | 69,169 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,585 | 15 | 69,170 |
Tags: binary search, implementation, math
Correct Solution:
```
a,b=input().split()
a=int(a)
b=int(b)
s=input()
n=len(s)
L=[]
x=0
y=0
hor=s.count('R')-s.count('L')
ver=s.count('U')-s.count('D')
L=[[0,0]]
for i in range(n):
if(s[i]=='U'):
y+=1
elif(s[i]=='D'):
y-=1
elif(s[i]=='R'):
... | output | 1 | 34,585 | 15 | 69,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,586 | 15 | 69,172 |
Tags: binary search, implementation, math
Correct Solution:
```
a, b = (int(x) for x in input().split())
s = input()
if (a, b) == (0, 0):
print('Yes')
exit()
cur = (0, 0)
poss = []
for c in s:
poss.append(cur)
if c == 'U':
cur = (cur[0], cur[1] + 1)
elif c == 'D':
cur = (cur[0], cur[1] - 1)
elif c == 'L':
c... | output | 1 | 34,586 | 15 | 69,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,587 | 15 | 69,174 |
Tags: binary search, implementation, math
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
# from heapq import*
from bisect import *
from io import BytesIO, IOBase
def vsInput():
sys.stdin =... | output | 1 | 34,587 | 15 | 69,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,588 | 15 | 69,176 |
Tags: binary search, implementation, math
Correct Solution:
```
dx = 0
dy = 0
a, b = list(map(int,input().split()))
s = input()
for i in s:
if i == 'U':
dy += 1
elif i == 'D':
dy -= 1
elif i == 'L':
dx -= 1
else:
dx += 1
x0 = 0
y0 = 0
for i in s:
if i == 'U':
... | output | 1 | 34,588 | 15 | 69,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,589 | 15 | 69,178 |
Tags: binary search, implementation, math
Correct Solution:
```
x,y = map(int,input().split())
#print(x,y)
s = input()
#print(s)
pt = (0,0)
path = [(0,0)]
rect = [0,0,1,1]
for c in s:
if c == 'U': pt = (pt[0],pt[1]+1)
elif c == 'D': pt = (pt[0],pt[1]-1)
elif c == 'L': pt = (pt[0]-1,pt[1])
elif c == 'R':... | output | 1 | 34,589 | 15 | 69,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,590 | 15 | 69,180 |
Tags: binary search, implementation, math
Correct Solution:
```
target = tuple(map(int, input().split()))
s = input()
#print(target)
#print(s)
ok = False
pos = (0, 0)
for c in s:
if c == 'L': pos = (pos[0]-1, pos[1])
if c == 'R': pos = (pos[0]+1, pos[1])
if c == 'U': pos = (pos[0], pos[1]+1)
if c == '... | output | 1 | 34,590 | 15 | 69,181 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:
* 'U': go up,... | instruction | 0 | 34,591 | 15 | 69,182 |
Tags: binary search, implementation, math
Correct Solution:
```
a, b = map(int, input().split())
s = str(input())
sl = len(s)
x = [0 for i in range(101)]
y = [0 for i in range(101)]
for i in range(sl):
x[i + 1] = x[i]
y[i + 1] = y[i]
if s[i] == 'U':
y[i + 1] += 1
elif s[i] == 'D':
y[i... | output | 1 | 34,591 | 15 | 69,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,592 | 15 | 69,184 |
Yes | output | 1 | 34,592 | 15 | 69,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,593 | 15 | 69,186 |
Yes | output | 1 | 34,593 | 15 | 69,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,594 | 15 | 69,188 |
Yes | output | 1 | 34,594 | 15 | 69,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,595 | 15 | 69,190 |
Yes | output | 1 | 34,595 | 15 | 69,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,596 | 15 | 69,192 |
No | output | 1 | 34,596 | 15 | 69,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,597 | 15 | 69,194 |
No | output | 1 | 34,597 | 15 | 69,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,598 | 15 | 69,196 |
No | output | 1 | 34,598 | 15 | 69,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There ar... | instruction | 0 | 34,599 | 15 | 69,198 |
No | output | 1 | 34,599 | 15 | 69,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,300 | 15 | 70,600 |
Tags: implementation, sortings
Correct Solution:
```
from collections import Counter
from collections import defaultdict
import math
import random
import heapq as hq
from math import sqrt
import sys
def input():
return sys.stdin.readline().strip()
def iinput():
return int(input())
def tinput():
return... | output | 1 | 35,300 | 15 | 70,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,301 | 15 | 70,602 |
Tags: implementation, sortings
Correct Solution:
```
T=int(input())
for _ in range(T):
n=int(input())
L=[(0,0)]
for i in range(0,n):
x,y=map(int,input().split())
L.append((x,y))
L.sort()
flag=0
for i in range(1,len(L)):
if(L[i][0]==L[i-1][0]):
if(L[i][1]<=L[... | output | 1 | 35,301 | 15 | 70,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,302 | 15 | 70,604 |
Tags: implementation, sortings
Correct Solution:
```
t=int(input())
for _ in range(t):
n=int(input())
lis=[]
for i in range(n):
x,y = map(int,input().split())
lis.append([x,y])
lis=sorted(lis,key=lambda x:x[0]+x[1])
lastx=0
lasty=0
flag=1
for item in lis:
x=item[0... | output | 1 | 35,302 | 15 | 70,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,303 | 15 | 70,606 |
Tags: implementation, sortings
Correct Solution:
```
n = int(input())
for i in range(n):
t = int(input())
x=y=0
z=[]
g=1
s=''
for i in range(t):
a,b=map(int,input().split())
z.append((a,b))
p=sorted(z , key=lambda k: [k[1], k[0]])
# print(p)
for i in p:
p=i... | output | 1 | 35,303 | 15 | 70,607 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,304 | 15 | 70,608 |
Tags: implementation, sortings
Correct Solution:
```
for u in range(int(input())):
n=int(input())
l=[]
for i in range(n):
l.append(list(map(int,input().split())))
l.sort()
r=''
x,y=0,0
f=0
for i in range(n):
if(l[i][0]>=x and l[i][1]>=y):
xx=l[i][0]-x
... | output | 1 | 35,304 | 15 | 70,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,305 | 15 | 70,610 |
Tags: implementation, sortings
Correct Solution:
```
for t in range(int(input())):
n, packages = int(input()), []
for i in range(n):
x, y = map(int, input().split())
packages.append((x,y))
packages.sort()
packages.insert(0, (0,0))
res = ''
for (x1, y1), (x2, y2) in zip(packages, packages[1:]):
if x1 <... | output | 1 | 35,305 | 15 | 70,611 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,306 | 15 | 70,612 |
Tags: implementation, sortings
Correct Solution:
```
for t in range(int(input())):
adj = [[]for i in range(1001)]
for z in range(int(input())):
x,y = map(int,input().split())
adj[x].append(y)
x,y =0,0
s=""
ans = "YES"
for i in range(1001):
adj[i].sort()
if len(adj[i]) != 0:
s+='R'*(i-x)
x=i
... | output | 1 | 35,306 | 15 | 70,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that the... | instruction | 0 | 35,307 | 15 | 70,614 |
Tags: implementation, sortings
Correct Solution:
```
t=int(input())
for i in range(t):
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
a.sort()
cx,cy,nx,ny=0,0,0,0
ans=''
for i in a:
cx,cy,nx,ny=nx,ny,i[0],i[1]
if ny<cy:
print("NO")
bre... | output | 1 | 35,307 | 15 | 70,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:
* An 'L' indicates he should move one unit left.
* ... | instruction | 0 | 35,620 | 15 | 71,240 |
Yes | output | 1 | 35,620 | 15 | 71,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:
* An 'L' indicates he should move one unit left.
* ... | instruction | 0 | 35,621 | 15 | 71,242 |
Yes | output | 1 | 35,621 | 15 | 71,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:
* An 'L' indicates he should move one unit left.
* ... | instruction | 0 | 35,622 | 15 | 71,244 |
Yes | output | 1 | 35,622 | 15 | 71,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:
* An 'L' indicates he should move one unit left.
* ... | instruction | 0 | 35,623 | 15 | 71,246 |
Yes | output | 1 | 35,623 | 15 | 71,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:
* An 'L' indicates he should move one unit left.
* ... | instruction | 0 | 35,624 | 15 | 71,248 |
No | output | 1 | 35,624 | 15 | 71,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:
* An 'L' indicates he should move one unit left.
* ... | instruction | 0 | 35,625 | 15 | 71,250 |
No | output | 1 | 35,625 | 15 | 71,251 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.