message stringlengths 2 22.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 16 109k | cluster float64 1 1 | __index_level_0__ int64 32 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any square from any other square. The square number 1 ... | instruction | 0 | 61,671 | 1 | 123,342 |
Tags: binary search, dfs and similar, graphs, greedy, trees
Correct Solution:
```
maxn = 200005
cities = [0 for _ in range(maxn)]
n = int(input())
x = list(map(int , input().split(' ')))
total = [0]+list(map(int,input().split(' ')))
ans = 0
for i in range(n,0,-1):
if(cities[i]==0):
cities[i]=1
if(i>=2):... | output | 1 | 61,671 | 1 | 123,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any square from any other square. The square number 1 ... | instruction | 0 | 61,672 | 1 | 123,344 |
Tags: binary search, dfs and similar, graphs, greedy, trees
Correct Solution:
```
n = int(input())
cities = [0 for _ in range(n + 1)]
x = list(map(int, input().split(' ')))
total = [0] + list(map(int, input().split(' ')))
ans = 0
for i in range(n, 0, -1):
if(cities[i] == 0):
cities[i] = 1
if(i >= 2):
... | output | 1 | 61,672 | 1 | 123,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any square from any other square. The square number 1 ... | instruction | 0 | 61,673 | 1 | 123,346 |
Tags: binary search, dfs and similar, graphs, greedy, trees
Correct Solution:
```
from collections import defaultdict, deque
from math import ceil
from sys import setrecursionlimit
import io, os
setrecursionlimit(300000)
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n = int(input())
par = [-1] + list... | output | 1 | 61,673 | 1 | 123,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any square from any other square. The square number 1 ... | instruction | 0 | 61,674 | 1 | 123,348 |
Tags: binary search, dfs and similar, graphs, greedy, trees
Correct Solution:
```
from math import factorial, ceil
from sys import stdin, stdout
from collections import defaultdict
def DFS(arr, citz, n) :
parent = {}
children = defaultdict(lambda : 0)
for i in range(len(arr)) :
parent[ i+2 ] = a... | output | 1 | 61,674 | 1 | 123,349 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,675 | 1 | 123,350 |
Yes | output | 1 | 61,675 | 1 | 123,351 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,676 | 1 | 123,352 |
Yes | output | 1 | 61,676 | 1 | 123,353 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,677 | 1 | 123,354 |
Yes | output | 1 | 61,677 | 1 | 123,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,678 | 1 | 123,356 |
Yes | output | 1 | 61,678 | 1 | 123,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,679 | 1 | 123,358 |
No | output | 1 | 61,679 | 1 | 123,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,680 | 1 | 123,360 |
No | output | 1 | 61,680 | 1 | 123,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,681 | 1 | 123,362 |
No | output | 1 | 61,681 | 1 | 123,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n-1 roads in such a way that it is possible to reach any squ... | instruction | 0 | 61,682 | 1 | 123,364 |
No | output | 1 | 61,682 | 1 | 123,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities on a two dimensional Cartesian plane. The distance between two cities is equal to the Manhattan distance between them (see the Notes for definition). A Hamiltonian cycle of th... | instruction | 0 | 61,753 | 1 | 123,506 |
No | output | 1 | 61,753 | 1 | 123,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities on a two dimensional Cartesian plane. The distance between two cities is equal to the Manhattan distance between them (see the Notes for definition). A Hamiltonian cycle of th... | instruction | 0 | 61,754 | 1 | 123,508 |
No | output | 1 | 61,754 | 1 | 123,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities on a two dimensional Cartesian plane. The distance between two cities is equal to the Manhattan distance between them (see the Notes for definition). A Hamiltonian cycle of th... | instruction | 0 | 61,755 | 1 | 123,510 |
No | output | 1 | 61,755 | 1 | 123,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,927 | 1 | 123,854 |
Tags: brute force, geometry, implementation
Correct Solution:
```
# sqrt((x2-x1)**2 + (y2-y1)**2)
a, b = map(int, input().split())
m = float("inf")
n = int(input())
for _ in range(n):
x, y, v = map(int, input().split())
dist = ((a-x)**2+(b-y)**2)**0.5
m = min(m, dist/v)
print('%.6f' % m)
``` | output | 1 | 61,927 | 1 | 123,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,928 | 1 | 123,856 |
Tags: brute force, geometry, implementation
Correct Solution:
```
import math;
def calLength(p1, p2):
l = math.pow(p1[0] - p2[0], 2) + math.pow(p1[1] - p2[1], 2);
return math.sqrt(l);
def main():
getS = input();
getS = getS.split();
a = int(getS[0]);
b = int(getS[1]);
n = int(input());
... | output | 1 | 61,928 | 1 | 123,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,929 | 1 | 123,858 |
Tags: brute force, geometry, implementation
Correct Solution:
```
import sys
from math import sqrt
(a,b) = map(int,input().split())
n = int(input())
mini = 99999
for i in range(n):
(x,y,v) = map(int, input().split())
t = sqrt( (x-a)**2 + (y - b)**2) / (v * 1.00000000000000000000)
if t < mini:
mini = t
print(mini)... | output | 1 | 61,929 | 1 | 123,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,930 | 1 | 123,860 |
Tags: brute force, geometry, implementation
Correct Solution:
```
x,y=map(int,input().split())
n=int(input())
mi=11**11
for _ in range(n):
xt,yt,v=map(int,input().split())
t=((x-xt)**2+(y-yt)**2)**0.5/v
if t<mi: mi=t
print(mi)
``` | output | 1 | 61,930 | 1 | 123,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,931 | 1 | 123,862 |
Tags: brute force, geometry, implementation
Correct Solution:
```
import math
CarPos = []
def LeastTime(x,y,n,CarPos):
time = []
for i in range(n):
for j in range(3):
dis = math.sqrt((CarPos[i] [0] - x )**2 + (CarPos[i] [1] - y )**2 )
t = dis / CarPos[i] [2]
time.ap... | output | 1 | 61,931 | 1 | 123,863 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,932 | 1 | 123,864 |
Tags: brute force, geometry, implementation
Correct Solution:
```
import math as m
hx, hy = map(int, input().split());
n = int(input());
res = 1000;
for i in range(n):
x, y, v = map(int, input().split());
res = min((m.sqrt(pow((hx - x),2) + pow((hy - y), 2)))/v, res);
print(res)
``` | output | 1 | 61,932 | 1 | 123,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,933 | 1 | 123,866 |
Tags: brute force, geometry, implementation
Correct Solution:
```
x,y =map(int, input().split())
n = int(input())
op = 10000.0
for i in range(n):
a,b,v = map(int , input().split())
d = ( (a-x)**2 + (b-y)**2 )** 0.5
#print(d,a,b,v,x,y)
if (i==1):
op = d/v
elif(op > d/v):
op = d/v
print("%.20f"%op)
``` | output | 1 | 61,933 | 1 | 123,867 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves wi... | instruction | 0 | 61,934 | 1 | 123,868 |
Tags: brute force, geometry, implementation
Correct Solution:
```
from math import sqrt
a, b = map(int, input().split())
n = int(input())
best_time = 999999999
for _ in range(n):
x, y, v = map(int, input().split())
time = sqrt((a-x) ** 2 + (b-y) ** 2) / v
if time < best_time:
best_time = time
pr... | output | 1 | 61,934 | 1 | 123,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,935 | 1 | 123,870 |
Yes | output | 1 | 61,935 | 1 | 123,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,936 | 1 | 123,872 |
Yes | output | 1 | 61,936 | 1 | 123,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,937 | 1 | 123,874 |
Yes | output | 1 | 61,937 | 1 | 123,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,938 | 1 | 123,876 |
Yes | output | 1 | 61,938 | 1 | 123,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,939 | 1 | 123,878 |
No | output | 1 | 61,939 | 1 | 123,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,940 | 1 | 123,880 |
No | output | 1 | 61,940 | 1 | 123,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,941 | 1 | 123,882 |
No | output | 1 | 61,941 | 1 | 123,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th... | instruction | 0 | 61,942 | 1 | 123,884 |
No | output | 1 | 61,942 | 1 | 123,885 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,093 | 1 | 124,186 |
"Correct Solution:
```
t = [0] * 4
for i in range(3):
a, b = map(int, input().split())
t[a - 1] += 1
t[b - 1] += 1
print('NO') if max(t)==3 else print('YES')
``` | output | 1 | 62,093 | 1 | 124,187 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,094 | 1 | 124,188 |
"Correct Solution:
```
a=[0]*4
for i in range(3):
x,y=map(int,input().split())
a[x-1]+=1
a[y-1]+=1
c=0
for i in range(4):
if a[i]%2!=0:
c+=1
if c==0 or c==2:
print("YES")
else:
print("NO")
``` | output | 1 | 62,094 | 1 | 124,189 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,095 | 1 | 124,190 |
"Correct Solution:
```
c = [0]*4
for i in range(3):
a,b = map(int,input().split())
c[a-1] += 1
c[b-1] += 1
c.sort()
print('YES' if c==[1,1,2,2] else 'NO')
``` | output | 1 | 62,095 | 1 | 124,191 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,096 | 1 | 124,192 |
"Correct Solution:
```
town = [0] * 4
for _ in range(3):
a, b = map(int, input().split())
town[a-1] += 1
town[b-1] += 1
if 3 in town or 4 in town:
ans = 'NO'
else:
ans = 'YES'
print(ans)
``` | output | 1 | 62,096 | 1 | 124,193 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,097 | 1 | 124,194 |
"Correct Solution:
```
X=[0]*4
for i in range(3):
A,B=map(int,input().split())
X[A-1]+=1
X[B-1]+=1
X.sort()
if(X[0]==1 and X[1]==1 and X[2]==2):
print("YES")
else:
print("NO")
``` | output | 1 | 62,097 | 1 | 124,195 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,098 | 1 | 124,196 |
"Correct Solution:
```
X = [0 for _ in range(4)]
for _ in range(3):
a, b = [int(_) for _ in input().split()]
X[a-1] += 1
X[b-1] += 1
if max(X) > 2:
print("NO")
else:
print("YES")
``` | output | 1 | 62,098 | 1 | 124,197 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,099 | 1 | 124,198 |
"Correct Solution:
```
g=[0]*5
import sys
input=sys.stdin.readline
for _ in range(3):
a,b=map(int,input().split())
g[a]+=1
g[b]+=1
if g.count(1)==2:
print("YES")
else:
print("NO")
``` | output | 1 | 62,099 | 1 | 124,199 |
Provide a correct Python 3 solution for this coding contest problem.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these ... | instruction | 0 | 62,100 | 1 | 124,200 |
"Correct Solution:
```
lis = [0] * 5
for i in range(3):
a,b = map(int,input().split())
lis[a] += 1
lis[b] += 1
if max(lis) == 3:
print ("NO")
else:
print ("YES")
``` | output | 1 | 62,100 | 1 | 124,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,101 | 1 | 124,202 |
Yes | output | 1 | 62,101 | 1 | 124,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,102 | 1 | 124,204 |
Yes | output | 1 | 62,102 | 1 | 124,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,103 | 1 | 124,206 |
Yes | output | 1 | 62,103 | 1 | 124,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,104 | 1 | 124,208 |
Yes | output | 1 | 62,104 | 1 | 124,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,105 | 1 | 124,210 |
No | output | 1 | 62,105 | 1 | 124,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,106 | 1 | 124,212 |
No | output | 1 | 62,106 | 1 | 124,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,107 | 1 | 124,214 |
No | output | 1 | 62,107 | 1 | 124,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are four towns, numbered 1,2,3 and 4. Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally. No two roads connect the same pair of towns. Other th... | instruction | 0 | 62,108 | 1 | 124,216 |
No | output | 1 | 62,108 | 1 | 124,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The map of the capital of Berland can be viewed on the infinite coordinate plane. Each point with integer coordinates contains a building, and there are streets connecting every building to four neighbouring buildings. All streets are parall... | instruction | 0 | 62,407 | 1 | 124,814 |
Tags: brute force, geometry, greedy, implementation
Correct Solution:
```
from sys import stdin, stdout
n, sx, sy = map(int, stdin.readline().split())
counts = {(1, 0) : 0, (-1, 0) : 0, (0, 1) : 0, (0, -1) : 0}
for _ in range(n):
x,y = map(int, stdin.readline().split())
if x > sx:
counts[(1, 0)]+=1
... | output | 1 | 62,407 | 1 | 124,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The map of the capital of Berland can be viewed on the infinite coordinate plane. Each point with integer coordinates contains a building, and there are streets connecting every building to four neighbouring buildings. All streets are parall... | instruction | 0 | 62,408 | 1 | 124,816 |
Tags: brute force, geometry, greedy, implementation
Correct Solution:
```
def maxi(l,sx,sy):
ans = l[0]
index = 0
for i in range(4):
if l[i] > ans:
ans = l[i]
index = i
if index == 0:
return ans, sx + 1, sy
elif index == 1:
return ans, sx, sy + 1
e... | output | 1 | 62,408 | 1 | 124,817 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The map of the capital of Berland can be viewed on the infinite coordinate plane. Each point with integer coordinates contains a building, and there are streets connecting every building to four neighbouring buildings. All streets are parall... | instruction | 0 | 62,409 | 1 | 124,818 |
Tags: brute force, geometry, greedy, implementation
Correct Solution:
```
n, s_x, s_y = map(int, input().split())
east = west = north = south = 0
for i in range(n):
x, y = map(int, input().split())
if x < s_x:
west += 1
elif x > s_x:
east += 1
if y < s_y:
# south-west
south += 1
elif y > s_y:... | output | 1 | 62,409 | 1 | 124,819 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.