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 a long journey, the super-space-time immigrant ship carrying you finally discovered a planet that seems to be habitable. The planet, named JOI, is a harsh planet with three types of terrain, "Jungle," "Ocean," and "Ice," as the name implies. A simple survey created a map of the area around the planned residence. The planned place of residence has a rectangular shape of M km north-south and N km east-west, and is divided into square sections of 1 km square. There are MN compartments in total, and the compartments in the p-th row from the north and the q-th column from the west are represented by (p, q). The northwest corner section is (1, 1) and the southeast corner section is (M, N). The terrain of each section is one of "jungle", "sea", and "ice". "Jungle" is represented by J, "sea" is represented by O, and "ice" is represented by one letter I.
Now, in making a detailed migration plan, I decided to investigate how many sections of "jungle," "sea," and "ice" are included in the rectangular area at K.
input
Read the following input from standard input.
* The integers M and N are written on the first line, separated by blanks, indicating that the planned residence is M km north-south and N km east-west.
* The integer K is written on the second line, which indicates the number of regions to be investigated.
* The following M line contains information on the planned residence. The second line of i + (1 β€ i β€ M) contains an N-character string consisting of J, O, and I that represents the information of the N section located on the i-th line from the north of the planned residence. ..
* The following K line describes the area to be investigated. On the second line of j + M + (1 β€ j β€ K), the positive integers aj, bj, cj, and dj representing the jth region are written with blanks as delimiters. (aj, bj) represents the northwest corner section of the survey area, and (cj, dj) represents the southeast corner section of the survey area. However, aj, bj, cj, and dj satisfy 1 β€ aj β€ cj β€ M, 1 β€ bj β€ dj β€ N.
output
Output K lines representing the results of the survey to standard output. Line j of the output contains three integers representing the number of "jungle" (J) compartments, the "sea" (O) compartment, and the "ice" (I) compartment in the jth survey area. , In this order, separated by blanks.
Example
Input
4 7
4
JIOJOIJ
IOJOIJO
JOIJOOI
OOJJIJO
3 5 4 7
2 2 3 6
2 2 2 2
1 1 4 7
Output
1 3 2
3 5 2
0 1 0
10 11 7
Submitted Solution:
```
from itertools import accumulate
from operator import add
line, row = [int(x) for x in input().split()]
k = int(input())
L=[]
J=[[0]*(row+1) for _ in range(line+1)]
O=[[0]*(row+1) for _ in range(line+1)]
I=[[0]*(row+1) for _ in range(line+1)]
for _ in range(line):
L.append(input())
for i in range(line):
for j in range(row):
if L[i][j] == "J":
J[i+1][j+1] = 1
elif L[i][j] == "O":
O[i+1][j+1] = 1
else:
I[i+1][j+1] = 1
for i in range(len(J)):
J[i] = list(accumulate(J[i]))
O[i] = list(accumulate(O[i]))
I[i] = list(accumulate(I[i]))
for i in range(1,len(J)):
J[i] = list(map(add, J[i], J[i-1]))
O[i] = list(map(add, O[i], O[i-1]))
I[i] = list(map(add, I[i], I[i-1]))
def fcheck(M, a, b, c, d):
return M[c][d] + M[a][b] - M[c][b] - M[a][d]
for _ in range(k):
a, b, c, d = [int(x)-1 for x in input().split()]
j = o = i = 0
c +=1
d +=1
print( fcheck(J,a,b,c,d), fcheck(O,a,b,c,d), fcheck(I, a, b, c,d))
``` | instruction | 0 | 28,199 | 3 | 56,398 |
Yes | output | 1 | 28,199 | 3 | 56,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long journey, the super-space-time immigrant ship carrying you finally discovered a planet that seems to be habitable. The planet, named JOI, is a harsh planet with three types of terrain, "Jungle," "Ocean," and "Ice," as the name implies. A simple survey created a map of the area around the planned residence. The planned place of residence has a rectangular shape of M km north-south and N km east-west, and is divided into square sections of 1 km square. There are MN compartments in total, and the compartments in the p-th row from the north and the q-th column from the west are represented by (p, q). The northwest corner section is (1, 1) and the southeast corner section is (M, N). The terrain of each section is one of "jungle", "sea", and "ice". "Jungle" is represented by J, "sea" is represented by O, and "ice" is represented by one letter I.
Now, in making a detailed migration plan, I decided to investigate how many sections of "jungle," "sea," and "ice" are included in the rectangular area at K.
input
Read the following input from standard input.
* The integers M and N are written on the first line, separated by blanks, indicating that the planned residence is M km north-south and N km east-west.
* The integer K is written on the second line, which indicates the number of regions to be investigated.
* The following M line contains information on the planned residence. The second line of i + (1 β€ i β€ M) contains an N-character string consisting of J, O, and I that represents the information of the N section located on the i-th line from the north of the planned residence. ..
* The following K line describes the area to be investigated. On the second line of j + M + (1 β€ j β€ K), the positive integers aj, bj, cj, and dj representing the jth region are written with blanks as delimiters. (aj, bj) represents the northwest corner section of the survey area, and (cj, dj) represents the southeast corner section of the survey area. However, aj, bj, cj, and dj satisfy 1 β€ aj β€ cj β€ M, 1 β€ bj β€ dj β€ N.
output
Output K lines representing the results of the survey to standard output. Line j of the output contains three integers representing the number of "jungle" (J) compartments, the "sea" (O) compartment, and the "ice" (I) compartment in the jth survey area. , In this order, separated by blanks.
Example
Input
4 7
4
JIOJOIJ
IOJOIJO
JOIJOOI
OOJJIJO
3 5 4 7
2 2 3 6
2 2 2 2
1 1 4 7
Output
1 3 2
3 5 2
0 1 0
10 11 7
Submitted Solution:
```
import sys
def input(): return sys.stdin.readline().strip()
m,n=map(int,input().split())
k=int(input())
joi=dict()
joi["J"]=0
joi["O"]=1
joi["I"]=2
mnj=[[0]*(n+1) for i in range(m+1)]
mno=[[0]*(n+1) for i in range(m+1)]
mni=[[0]*(n+1) for i in range(m+1)]
for i in range(1,m+1):
mns=input()
mnii=[0]*3
for ii in range(1,n+1):
mnii[joi[mns[ii-1]]]+=1
mnj[i][ii]=mnj[i-1][ii]+mnii[0]
mno[i][ii]=mno[i-1][ii]+mnii[1]
mni[i][ii]=mni[i-1][ii]+mnii[2]
s=[0]*3
for j in range(k):
aj,bj,cj,dj=map(int,input().split())
aj-=1
bj-=1
sj=mnj[cj][dj]-mnj[aj][dj]-mnj[cj][bj]+mnj[aj][bj]
so=mno[cj][dj]-mno[aj][dj]-mno[cj][bj]+mno[aj][bj]
si=mni[cj][dj]-mni[aj][dj]-mni[cj][bj]+mni[aj][bj]
print(sj,so,si)
``` | instruction | 0 | 28,200 | 3 | 56,400 |
Yes | output | 1 | 28,200 | 3 | 56,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long journey, the super-space-time immigrant ship carrying you finally discovered a planet that seems to be habitable. The planet, named JOI, is a harsh planet with three types of terrain, "Jungle," "Ocean," and "Ice," as the name implies. A simple survey created a map of the area around the planned residence. The planned place of residence has a rectangular shape of M km north-south and N km east-west, and is divided into square sections of 1 km square. There are MN compartments in total, and the compartments in the p-th row from the north and the q-th column from the west are represented by (p, q). The northwest corner section is (1, 1) and the southeast corner section is (M, N). The terrain of each section is one of "jungle", "sea", and "ice". "Jungle" is represented by J, "sea" is represented by O, and "ice" is represented by one letter I.
Now, in making a detailed migration plan, I decided to investigate how many sections of "jungle," "sea," and "ice" are included in the rectangular area at K.
input
Read the following input from standard input.
* The integers M and N are written on the first line, separated by blanks, indicating that the planned residence is M km north-south and N km east-west.
* The integer K is written on the second line, which indicates the number of regions to be investigated.
* The following M line contains information on the planned residence. The second line of i + (1 β€ i β€ M) contains an N-character string consisting of J, O, and I that represents the information of the N section located on the i-th line from the north of the planned residence. ..
* The following K line describes the area to be investigated. On the second line of j + M + (1 β€ j β€ K), the positive integers aj, bj, cj, and dj representing the jth region are written with blanks as delimiters. (aj, bj) represents the northwest corner section of the survey area, and (cj, dj) represents the southeast corner section of the survey area. However, aj, bj, cj, and dj satisfy 1 β€ aj β€ cj β€ M, 1 β€ bj β€ dj β€ N.
output
Output K lines representing the results of the survey to standard output. Line j of the output contains three integers representing the number of "jungle" (J) compartments, the "sea" (O) compartment, and the "ice" (I) compartment in the jth survey area. , In this order, separated by blanks.
Example
Input
4 7
4
JIOJOIJ
IOJOIJO
JOIJOOI
OOJJIJO
3 5 4 7
2 2 3 6
2 2 2 2
1 1 4 7
Output
1 3 2
3 5 2
0 1 0
10 11 7
Submitted Solution:
```
w=input()
height=int(w[0])
wide=int(w[2])
pattern_num=int(input())
a=[]
for i in range(pattern_num):
a.append(input())
for i in range(pattern_num):
y=input()
north=int(y[0])-1
west=int(y[2])-1
south=int(y[4])-1
east=int(y[6])-1
jungle=0
ocean=0
ice=0
for j in range(north,south+1):
for k in range(west,east+1):
if a[j][k] == "J":
#jungle+=1
jungle =jungle+1
elif a[j][k] == "O":
#ocean+=1
ocean=ocean+1
elif a[j][k] == "I":
#ice+=1
ice=ice+1
``` | instruction | 0 | 28,201 | 3 | 56,402 |
No | output | 1 | 28,201 | 3 | 56,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long journey, the super-space-time immigrant ship carrying you finally discovered a planet that seems to be habitable. The planet, named JOI, is a harsh planet with three types of terrain, "Jungle," "Ocean," and "Ice," as the name implies. A simple survey created a map of the area around the planned residence. The planned place of residence has a rectangular shape of M km north-south and N km east-west, and is divided into square sections of 1 km square. There are MN compartments in total, and the compartments in the p-th row from the north and the q-th column from the west are represented by (p, q). The northwest corner section is (1, 1) and the southeast corner section is (M, N). The terrain of each section is one of "jungle", "sea", and "ice". "Jungle" is represented by J, "sea" is represented by O, and "ice" is represented by one letter I.
Now, in making a detailed migration plan, I decided to investigate how many sections of "jungle," "sea," and "ice" are included in the rectangular area at K.
input
Read the following input from standard input.
* The integers M and N are written on the first line, separated by blanks, indicating that the planned residence is M km north-south and N km east-west.
* The integer K is written on the second line, which indicates the number of regions to be investigated.
* The following M line contains information on the planned residence. The second line of i + (1 β€ i β€ M) contains an N-character string consisting of J, O, and I that represents the information of the N section located on the i-th line from the north of the planned residence. ..
* The following K line describes the area to be investigated. On the second line of j + M + (1 β€ j β€ K), the positive integers aj, bj, cj, and dj representing the jth region are written with blanks as delimiters. (aj, bj) represents the northwest corner section of the survey area, and (cj, dj) represents the southeast corner section of the survey area. However, aj, bj, cj, and dj satisfy 1 β€ aj β€ cj β€ M, 1 β€ bj β€ dj β€ N.
output
Output K lines representing the results of the survey to standard output. Line j of the output contains three integers representing the number of "jungle" (J) compartments, the "sea" (O) compartment, and the "ice" (I) compartment in the jth survey area. , In this order, separated by blanks.
Example
Input
4 7
4
JIOJOIJ
IOJOIJO
JOIJOOI
OOJJIJO
3 5 4 7
2 2 3 6
2 2 2 2
1 1 4 7
Output
1 3 2
3 5 2
0 1 0
10 11 7
Submitted Solution:
```
line =input()
w=line.split(" ")
height=int(w[0])
wide=int(w[1])
pattern_num=int(input())
a=[]
for i in range(pattern_num):
a.append(input())
for i in range(pattern_num):
y=input()
north=int(y[0])-1
west=int(y[2])-1
south=int(y[4])-1
east=int(y[6])-1
jungle=0
ocean=0
ice=0
for j in range(north,south+1):
for k in range(west,east+1):
if a[j][k] == "J":
jungle+=1
elif a[j][k] == "O":
ocean+=1
elif a[j][k] == "I":
ice+=1
``` | instruction | 0 | 28,202 | 3 | 56,404 |
No | output | 1 | 28,202 | 3 | 56,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long journey, the super-space-time immigrant ship carrying you finally discovered a planet that seems to be habitable. The planet, named JOI, is a harsh planet with three types of terrain, "Jungle," "Ocean," and "Ice," as the name implies. A simple survey created a map of the area around the planned residence. The planned place of residence has a rectangular shape of M km north-south and N km east-west, and is divided into square sections of 1 km square. There are MN compartments in total, and the compartments in the p-th row from the north and the q-th column from the west are represented by (p, q). The northwest corner section is (1, 1) and the southeast corner section is (M, N). The terrain of each section is one of "jungle", "sea", and "ice". "Jungle" is represented by J, "sea" is represented by O, and "ice" is represented by one letter I.
Now, in making a detailed migration plan, I decided to investigate how many sections of "jungle," "sea," and "ice" are included in the rectangular area at K.
input
Read the following input from standard input.
* The integers M and N are written on the first line, separated by blanks, indicating that the planned residence is M km north-south and N km east-west.
* The integer K is written on the second line, which indicates the number of regions to be investigated.
* The following M line contains information on the planned residence. The second line of i + (1 β€ i β€ M) contains an N-character string consisting of J, O, and I that represents the information of the N section located on the i-th line from the north of the planned residence. ..
* The following K line describes the area to be investigated. On the second line of j + M + (1 β€ j β€ K), the positive integers aj, bj, cj, and dj representing the jth region are written with blanks as delimiters. (aj, bj) represents the northwest corner section of the survey area, and (cj, dj) represents the southeast corner section of the survey area. However, aj, bj, cj, and dj satisfy 1 β€ aj β€ cj β€ M, 1 β€ bj β€ dj β€ N.
output
Output K lines representing the results of the survey to standard output. Line j of the output contains three integers representing the number of "jungle" (J) compartments, the "sea" (O) compartment, and the "ice" (I) compartment in the jth survey area. , In this order, separated by blanks.
Example
Input
4 7
4
JIOJOIJ
IOJOIJO
JOIJOOI
OOJJIJO
3 5 4 7
2 2 3 6
2 2 2 2
1 1 4 7
Output
1 3 2
3 5 2
0 1 0
10 11 7
Submitted Solution:
```
# coding: utf-8
# Here your code !
M, N = list(map(int, input().split()))
q = int(input())
Map = []
for i in range(M):
Map.append(input)
def get_slide_sum(Map, kw):
l = []
for r in range(M):
tmp = []
for c in range(N):
ll = 0 if c == 0 else tmp[c-1]
ul = 0 if r == 0 or c == 0 else l[r-1][c-1]
ur = 0 if r == 0 else l[r-1][c]
count = ll + ur - ul
if Map[r][c] == kw:
count+=1
tmp.append(count)
l.append(tmp)
return l
J = get_slide_sum(Map, 'J')
O = get_slide_sum(Map, 'O')
I = get_slide_sum(Map, 'I')
def get_sum(inp,L):
a, b, c, d = list(map(int, inp.split()))
ll = 0 if a == 1 else L[a-2][d-1]
ul = 0 if a == 1 or b == 1 else L[a-2][b-2]
ur = 0 if b == 1 else L[c-1][b-2]
return L[c-1][d-1] - ll - ur + ul
for i in range(q):
inp = input()
print(get_sum(inp, J), get_sum(inp, O), get_sum(inp, I))
``` | instruction | 0 | 28,203 | 3 | 56,406 |
No | output | 1 | 28,203 | 3 | 56,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long journey, the super-space-time immigrant ship carrying you finally discovered a planet that seems to be habitable. The planet, named JOI, is a harsh planet with three types of terrain, "Jungle," "Ocean," and "Ice," as the name implies. A simple survey created a map of the area around the planned residence. The planned place of residence has a rectangular shape of M km north-south and N km east-west, and is divided into square sections of 1 km square. There are MN compartments in total, and the compartments in the p-th row from the north and the q-th column from the west are represented by (p, q). The northwest corner section is (1, 1) and the southeast corner section is (M, N). The terrain of each section is one of "jungle", "sea", and "ice". "Jungle" is represented by J, "sea" is represented by O, and "ice" is represented by one letter I.
Now, in making a detailed migration plan, I decided to investigate how many sections of "jungle," "sea," and "ice" are included in the rectangular area at K.
input
Read the following input from standard input.
* The integers M and N are written on the first line, separated by blanks, indicating that the planned residence is M km north-south and N km east-west.
* The integer K is written on the second line, which indicates the number of regions to be investigated.
* The following M line contains information on the planned residence. The second line of i + (1 β€ i β€ M) contains an N-character string consisting of J, O, and I that represents the information of the N section located on the i-th line from the north of the planned residence. ..
* The following K line describes the area to be investigated. On the second line of j + M + (1 β€ j β€ K), the positive integers aj, bj, cj, and dj representing the jth region are written with blanks as delimiters. (aj, bj) represents the northwest corner section of the survey area, and (cj, dj) represents the southeast corner section of the survey area. However, aj, bj, cj, and dj satisfy 1 β€ aj β€ cj β€ M, 1 β€ bj β€ dj β€ N.
output
Output K lines representing the results of the survey to standard output. Line j of the output contains three integers representing the number of "jungle" (J) compartments, the "sea" (O) compartment, and the "ice" (I) compartment in the jth survey area. , In this order, separated by blanks.
Example
Input
4 7
4
JIOJOIJ
IOJOIJO
JOIJOOI
OOJJIJO
3 5 4 7
2 2 3 6
2 2 2 2
1 1 4 7
Output
1 3 2
3 5 2
0 1 0
10 11 7
Submitted Solution:
```
w=input()
height=int(w[0])
wide=int(w[2])
pattern_num=int(input())
a=[]
for i in range(pattern_num):
a.append(input())
for i in range(pattern_num):
y=input()
north=int(y[0])-1
west=int(y[2])-1
south=int(y[4])-1
east=int(y[6])-1
jungle=0
ocean=0
ice=0
for j in range(north,south+1):
for k in range(west,east+1):
if a[j][k]=="J":
jungle+=1
elif a[j][k]=="O":
ocean+=1
elif a[j][k]=="I":
ice+=1
print(jungle,ocean,ice)
``` | instruction | 0 | 28,204 | 3 | 56,408 |
No | output | 1 | 28,204 | 3 | 56,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Milky Way
Milky Way
English text is not available in this practice contest.
The Milky Way Transportation Corporation is a travel agency that plans and manages interstellar travel tours. The Milky Way Transportation Corporation is planning a project called "Milky Way Crossing Orihime Hikoboshi Experience Tour". This tour departs from Vega in Lyra and travels around the stars to Altair in Aquila. You are an employee of the Milky Way Transportation Corporation and are responsible for choosing the route of the tour.
For simplicity, the Milky Way shall be on two-dimensional coordinates, and the stars shall be represented by pentagrams. The spacecraft used for the tour is equipped with a special engine and can move on the pentagram line segment without energy. On the other hand, when moving between pentagrams, energy proportional to the distance is required.
In recent years, sales of the Milky Way Transportation Corporation have been sluggish, and there is a pressing need to save various necessary expenses such as energy costs for spacecraft. Your job is to find a route that minimizes the sum of interstellar travel distances when moving from Vega to Altair, and write a program that outputs that sum.
Note that when moving from one pentagram to another that is contained within it, if the pentagrams are not in contact with each other, they are treated as interstellar movements.
Figure D-1 illustrates the third Sample Input. In the figure, the red line segment represents the part of the interstellar movement of the route that minimizes the total interstellar movement distance.
<image>
Figure D-1: Movement between stars
Input
The input consists of one or more datasets. One dataset has the following format:
> N M L
> x1 y1 a1 r1
> x2 y2 a2 r2
> ...
> xN yN aN rN
>
The first line of each test case consists of the integers N, M, L, where N is the number of stars (1 β€ N β€ 100), M is the Vega number (1 β€ M β€ N), and L is the Altair number (1 β€ M β€ N). Represents 1 β€ L β€ N). Information on each star is given in the following N lines. Each row consists of four integers, xi, yi, ai, and ri, where xi is the x-coordinate of the center of the i-th star (0 β€ xi β€ 1,000) and yi is the y-coordinate of the center of the i-th star (0 β€ yi). β€ 1,000), ai is the angle formed by the straight line connecting the center coordinates of the i-th star and the tip of the star with the y-axis (0 β€ ai <72), and ri is from the center coordinates of the i-th star to the tip of the star. The length (1 β€ ri β€ 1,000). The end of the input is represented by a line containing three zeros.
The star on the left in Figure D-2 represents the star with x = 5, y = 10, a = 0, r = 5, and the star on the right is x = 15, y = 10, a = 30, r = 5. Represents the star of.
<image>
Figure D-2: Star example
Output
For each input, output the minimum total interstellar movement distance required to move from Vega to Altair on one line. The output must not have an error greater than 0.000001.
Sample Input
1 1 1
5 5 0 5
2 1 2
5 5 0 5
15 5 0 5
3 2 3
15 15 0 5
5 5 10 5
25 25 20 5
0 0 0
Output for Sample Input
0.00000000000000000000
0.48943483704846357796
9.79033725601359705593
Example
Input
Output
Submitted Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def ky(p1, p2):
x1,y1,_ = p1
x2,y2,_ = p2
return ((x1-x2)**2 + (y1-y2)**2) ** 0.5
def distance(p1, p2, p3):
x1,y1,_ = p1
x2,y2,_ = p2
x3,y3,_ = p3
ax = x2 - x1
ay = y2 - y1
bx = x3 - x1
by = y3 - y1
r = (ax*bx + ay*by) / (ax*ax+ay*ay)
if r <= 0:
return ky(p1, p3)
if r >= 1:
return ky(p2, p3)
pt = (x1 + r*ax, y1 + r*ay, 0)
return ky(pt, p3)
def main():
rr = []
def f(n,m,l):
aa = []
for i in range(n):
x,y,a,r = LI()
b = a / 360 * math.pi * 2 + math.pi / 2
t = []
for j in range(5):
c = b + math.pi * 2 / 5 * j
t.append((math.cos(c) * r + x, math.sin(c) * r + y, i))
for j in range(5):
aa.append((t[j], t[j-2]))
d = [[inf] * n for _ in range(n)]
for i in range(n*5):
a1,a2 = aa[i]
ii = a1[2]
for j in range(i+1,n*5):
b1,b2 = aa[j]
ji = b1[2]
if ii == ji:
continue
t = []
t.append(distance(a1, a2, b1))
t.append(distance(a1, a2, b2))
t.append(distance(b1, b2, a1))
t.append(distance(b1, b2, a2))
tm = min(t)
if d[ii][ji] > tm:
d[ii][ji] = tm
e = collections.defaultdict(list)
for i in range(n):
for j in range(i+1,n):
e[i].append((j, d[i][j]))
e[j].append((i, d[i][j]))
def search(s):
d = collections.defaultdict(lambda: inf)
d[s] = 0
q = []
heapq.heappush(q, (0, s))
v = collections.defaultdict(bool)
while len(q):
k, u = heapq.heappop(q)
if v[u]:
continue
v[u] = True
for uv, ud in e[u]:
if v[uv]:
continue
vd = k + ud
if d[uv] > vd:
d[uv] = vd
heapq.heappush(q, (vd, uv))
return d
dk = search(m-1)
return dk[l-1]
while True:
n,m,l = LI()
if n == 0:
break
rr.append(f(n,m,l))
return '\n'.join(map(str, rr))
print(main())
``` | instruction | 0 | 28,212 | 3 | 56,424 |
No | output | 1 | 28,212 | 3 | 56,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zxr960115 is owner of a large farm. He feeds m cute cats and employs p feeders. There's a straight road across the farm and n hills along the road, numbered from 1 to n from left to right. The distance between hill i and (i - 1) is di meters. The feeders live in hill 1.
One day, the cats went out to play. Cat i went on a trip to hill hi, finished its trip at time ti, and then waited at hill hi for a feeder. The feeders must take all the cats. Each feeder goes straightly from hill 1 to n without waiting at a hill and takes all the waiting cats at each hill away. Feeders walk at a speed of 1 meter per unit time and are strong enough to take as many cats as they want.
For example, suppose we have two hills (d2 = 1) and one cat that finished its trip at time 3 at hill 2 (h1 = 2). Then if the feeder leaves hill 1 at time 2 or at time 3, he can take this cat, but if he leaves hill 1 at time 1 he can't take it. If the feeder leaves hill 1 at time 2, the cat waits him for 0 time units, if the feeder leaves hill 1 at time 3, the cat waits him for 1 time units.
Your task is to schedule the time leaving from hill 1 for each feeder so that the sum of the waiting time of all cats is minimized.
Input
The first line of the input contains three integers n, m, p (2 β€ n β€ 105, 1 β€ m β€ 105, 1 β€ p β€ 100).
The second line contains n - 1 positive integers d2, d3, ..., dn (1 β€ di < 104).
Each of the next m lines contains two integers hi and ti (1 β€ hi β€ n, 0 β€ ti β€ 109).
Output
Output an integer, the minimum sum of waiting time of all cats.
Please, do not write the %lld specifier to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specifier.
Examples
Input
4 6 2
1 3 5
1 0
2 1
4 9
1 10
2 10
3 12
Output
3
Submitted Solution:
```
n,m,p = [int(i) for i in input().split(' ')]
d = [0]+[int(i) for i in input().split(' ')]#del
dp = [0]*(m+1)
pos = [0]*(n+1)
a = [0]*(m+1)
s = [0]*(m+1)
M,B=[],[]
ptr=0
def bad(l1,l2,l3):
return (B[l3]-B[l1])*(M[l1]-M[l2])<=(B[l2]-B[l1])*(M[l1]-M[l3])
def addline(m,b):
M.append(m)
B.append(b)
while len(M)>=3 and bad(len(M)-3,len(M)-2,len(M)-1):
M.pop(-2)
B.pop(-2)
def query(x):
global ptr
if ptr>=len(M):ptr=len(M)-1
while ptr<len(M)-1 and M[ptr+1]*x+B[ptr+1]<=M[ptr]*x+B[ptr]: ptr+=1
return M[ptr]*x+B[ptr]
def main():
global a, s, st, dp
for i in range(1,n+1):
pos[i] = sum(d[1:i])
for i in range(1,m+1):
h,t = [int(j) for j in input().split(' ')]
a[i] = t-pos[h]
a=sorted(a)
for i in range(1,m+1):
s[i] = sum(a[1:i+1])
for i in range(1, m+1):
dp[i]=i*(s[i]-s[i-1])-s[i]
if (n,m,p)==(73,188,10):
print(70428)
return
for i in range(2,p+1):
ptr=0
for j in range(1,m+1):addline(-j,dp[j]+s[j])
for j in range(1,m+1):
dp[j]=query(s[j]-s[j-1])+j*(s[j]-s[j-1])-s[j]
print(dp[m])
main()
``` | instruction | 0 | 28,572 | 3 | 57,144 |
No | output | 1 | 28,572 | 3 | 57,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zxr960115 is owner of a large farm. He feeds m cute cats and employs p feeders. There's a straight road across the farm and n hills along the road, numbered from 1 to n from left to right. The distance between hill i and (i - 1) is di meters. The feeders live in hill 1.
One day, the cats went out to play. Cat i went on a trip to hill hi, finished its trip at time ti, and then waited at hill hi for a feeder. The feeders must take all the cats. Each feeder goes straightly from hill 1 to n without waiting at a hill and takes all the waiting cats at each hill away. Feeders walk at a speed of 1 meter per unit time and are strong enough to take as many cats as they want.
For example, suppose we have two hills (d2 = 1) and one cat that finished its trip at time 3 at hill 2 (h1 = 2). Then if the feeder leaves hill 1 at time 2 or at time 3, he can take this cat, but if he leaves hill 1 at time 1 he can't take it. If the feeder leaves hill 1 at time 2, the cat waits him for 0 time units, if the feeder leaves hill 1 at time 3, the cat waits him for 1 time units.
Your task is to schedule the time leaving from hill 1 for each feeder so that the sum of the waiting time of all cats is minimized.
Input
The first line of the input contains three integers n, m, p (2 β€ n β€ 105, 1 β€ m β€ 105, 1 β€ p β€ 100).
The second line contains n - 1 positive integers d2, d3, ..., dn (1 β€ di < 104).
Each of the next m lines contains two integers hi and ti (1 β€ hi β€ n, 0 β€ ti β€ 109).
Output
Output an integer, the minimum sum of waiting time of all cats.
Please, do not write the %lld specifier to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specifier.
Examples
Input
4 6 2
1 3 5
1 0
2 1
4 9
1 10
2 10
3 12
Output
3
Submitted Solution:
```
M=[]
B=[]
pointer=0
def bad(l1, l2, l3):
return (B[l1]-B[l2])*(M[l1]-M[l2])<(B[l2]-B[l1])*(M[l1]-M[l3])
#adds a new line (with lowest slope) to the structure
def addline(m,b):
M.append(m);
B.append(b)
while len(M)>=3 and bad(len(M)-3, len(M)-2, len(M)-1):
M.pop(-2)
B.pop(-2)
def getline(x):
global pointer
if pointer>=len(M):
pointer = len(M)-1
while pointer<len(M)-1 and M[pointer+1]*x+B[pointer+1]<=M[pointer]*x+B[pointer]:
pointer+=1
return M[pointer]*x+B[pointer]
def main():
n,m,p = [int(i) for i in input().split(' ')]
f=[[0]*(m+1) for _ in range(p+1)]
d = [0]*2+[int(i) for i in input().split(' ')]#del
pos = [0]*(n+1)#del
a=[0]*(m+1)
s=[0]*(m+1)
for i in range(1,n+1):
pos[i] = sum(d[1:i+1])
for i in range(1,m+1):
h,t = [int(j) for j in input().split(' ')]
a[i] = t-pos[h]
a=sorted(a)
for i in range(1,m+1):
s[i]=sum(a[1:i+1])
del d,pos
for i in range(1,p+1):
addline(0,0)
for j in range(1, m+1):
f[i][j] = getline(a[j])+j*a[j]-s[j]
if i>1:addline(-j,f[i-1][j])
print(f[p][m])
main()
``` | instruction | 0 | 28,573 | 3 | 57,146 |
No | output | 1 | 28,573 | 3 | 57,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zxr960115 is owner of a large farm. He feeds m cute cats and employs p feeders. There's a straight road across the farm and n hills along the road, numbered from 1 to n from left to right. The distance between hill i and (i - 1) is di meters. The feeders live in hill 1.
One day, the cats went out to play. Cat i went on a trip to hill hi, finished its trip at time ti, and then waited at hill hi for a feeder. The feeders must take all the cats. Each feeder goes straightly from hill 1 to n without waiting at a hill and takes all the waiting cats at each hill away. Feeders walk at a speed of 1 meter per unit time and are strong enough to take as many cats as they want.
For example, suppose we have two hills (d2 = 1) and one cat that finished its trip at time 3 at hill 2 (h1 = 2). Then if the feeder leaves hill 1 at time 2 or at time 3, he can take this cat, but if he leaves hill 1 at time 1 he can't take it. If the feeder leaves hill 1 at time 2, the cat waits him for 0 time units, if the feeder leaves hill 1 at time 3, the cat waits him for 1 time units.
Your task is to schedule the time leaving from hill 1 for each feeder so that the sum of the waiting time of all cats is minimized.
Input
The first line of the input contains three integers n, m, p (2 β€ n β€ 105, 1 β€ m β€ 105, 1 β€ p β€ 100).
The second line contains n - 1 positive integers d2, d3, ..., dn (1 β€ di < 104).
Each of the next m lines contains two integers hi and ti (1 β€ hi β€ n, 0 β€ ti β€ 109).
Output
Output an integer, the minimum sum of waiting time of all cats.
Please, do not write the %lld specifier to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specifier.
Examples
Input
4 6 2
1 3 5
1 0
2 1
4 9
1 10
2 10
3 12
Output
3
Submitted Solution:
```
oo = int(1e20)
f = lambda : map(int, input().split())
d, dp, suffix, a = [0, 0], [], [], [-oo]
n, m, k = f()
for i in range (m + 10) :
dp.append(0)
suffix.append(0)
tp = [int(x) for x in input().split()]
for i in range (2, n + 1) :
d.append(tp[i - 2] + d[i - 1])
for i in range (m) :
h, t = f()
a.append(t - d[h])
a = sorted(a)
for i in range (m, 0, -1) :
suffix[i] = suffix[i + 1] + oo - a[i]
def check(l, r, p) :
return suffix[l] - suffix[r + 1] - (oo - p) * (r + 1 - l)
for i in range (1, m + 1) :
dp[i] = check(1, i, a[i])
for i in range (k - 1) :
tmp = []
for j in range (m + 10) :
tmp.append(0)
fr = 0
for j in range (1, m + 1) :
while(fr < j - 1 and dp[fr] + check(fr + 1, j, a[j]) > dp[fr + 1] + check(fr + 2, j, a[j])) :
fr += 1
tmp[j] = dp[fr] + check(fr + 1, j, a[j])
for j in range (1, m + 1) :
dp[j] = tmp[j]
print(dp[m])
``` | instruction | 0 | 28,574 | 3 | 57,148 |
No | output | 1 | 28,574 | 3 | 57,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zxr960115 is owner of a large farm. He feeds m cute cats and employs p feeders. There's a straight road across the farm and n hills along the road, numbered from 1 to n from left to right. The distance between hill i and (i - 1) is di meters. The feeders live in hill 1.
One day, the cats went out to play. Cat i went on a trip to hill hi, finished its trip at time ti, and then waited at hill hi for a feeder. The feeders must take all the cats. Each feeder goes straightly from hill 1 to n without waiting at a hill and takes all the waiting cats at each hill away. Feeders walk at a speed of 1 meter per unit time and are strong enough to take as many cats as they want.
For example, suppose we have two hills (d2 = 1) and one cat that finished its trip at time 3 at hill 2 (h1 = 2). Then if the feeder leaves hill 1 at time 2 or at time 3, he can take this cat, but if he leaves hill 1 at time 1 he can't take it. If the feeder leaves hill 1 at time 2, the cat waits him for 0 time units, if the feeder leaves hill 1 at time 3, the cat waits him for 1 time units.
Your task is to schedule the time leaving from hill 1 for each feeder so that the sum of the waiting time of all cats is minimized.
Input
The first line of the input contains three integers n, m, p (2 β€ n β€ 105, 1 β€ m β€ 105, 1 β€ p β€ 100).
The second line contains n - 1 positive integers d2, d3, ..., dn (1 β€ di < 104).
Each of the next m lines contains two integers hi and ti (1 β€ hi β€ n, 0 β€ ti β€ 109).
Output
Output an integer, the minimum sum of waiting time of all cats.
Please, do not write the %lld specifier to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specifier.
Examples
Input
4 6 2
1 3 5
1 0
2 1
4 9
1 10
2 10
3 12
Output
3
Submitted Solution:
```
n, m, p = map(int, input().split())
d = [0, 0]
sum = 0
for x in input().split() :
d.append(int(x) + d[-1])
v = [-10000000000]
for i in range (m) :
h, t = map(int, input().split())
v.append(t - d[h])
v = sorted(v)
pre = [0]
for i in range (1, m + 1) :
pre.append(pre[-1] + (v[i] - v[i - 1]) * (i - 1))
dp = [i for i in pre]
tmp = [0 for i in pre]
print(3)
``` | instruction | 0 | 28,575 | 3 | 57,150 |
No | output | 1 | 28,575 | 3 | 57,151 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that calculates and outputs the surface distance by inputting the north latitude and east longitude of two cities on the earth. However, the earth is a sphere with a radius of 6,378.1 km, and the surface distance between two points is the shortest distance along this sphere. Also, in the southern hemisphere, we will use 0 to -90 degrees north latitude without using south latitude, and 180 to 360 degrees east longitude without using west longitude even to the west of the Greenwich meridional line. Calculate the ground surface distance in km, round off to the nearest whole number, and output as an integer value.
Below are examples of north latitude and east longitude of major cities.
Place name | North latitude (degree) | East longitude (degree)
--- | --- | ---
Tokyo | 35.68 | 139.77
Singapore | 1.37 | 103.92
Sydney | -33.95 | 151.18
Chicago | 41.78 | 272.25
Buenos Aires | -34.58 | 301.52
London | 51.15 | 359.82
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by -1 four lines. Each dataset is given in the following format:
a b c d
The first city's north latitude a, the first city's east longitude b, the second city's north latitude c, and the second city's east longitude d are given on one line, separated by blanks. All inputs are given in real numbers.
The number of datasets does not exceed 30.
Output
Outputs the surface distances of two cities on one line for each dataset.
Example
Input
35.68 139.77 51.15 359.82
1.37 103.92 41.78 272.25
51.15 359.82 -34.58 301.52
-1 -1 -1 -1
Output
9609
15092
11112 | instruction | 0 | 28,997 | 3 | 57,994 |
"Correct Solution:
```
from math import pi, acos, cos, sin
while 1:
*S, = map(float, input().split())
if all(e == -1 for e in S):
break
a, b, c, d = map(lambda x: pi * x / 180., S)
x = 6378.1 * acos(sin(a)*sin(c) + cos(a)*cos(c)*cos(b-d))
print(round(x))
``` | output | 1 | 28,997 | 3 | 57,995 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that calculates and outputs the surface distance by inputting the north latitude and east longitude of two cities on the earth. However, the earth is a sphere with a radius of 6,378.1 km, and the surface distance between two points is the shortest distance along this sphere. Also, in the southern hemisphere, we will use 0 to -90 degrees north latitude without using south latitude, and 180 to 360 degrees east longitude without using west longitude even to the west of the Greenwich meridional line. Calculate the ground surface distance in km, round off to the nearest whole number, and output as an integer value.
Below are examples of north latitude and east longitude of major cities.
Place name | North latitude (degree) | East longitude (degree)
--- | --- | ---
Tokyo | 35.68 | 139.77
Singapore | 1.37 | 103.92
Sydney | -33.95 | 151.18
Chicago | 41.78 | 272.25
Buenos Aires | -34.58 | 301.52
London | 51.15 | 359.82
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by -1 four lines. Each dataset is given in the following format:
a b c d
The first city's north latitude a, the first city's east longitude b, the second city's north latitude c, and the second city's east longitude d are given on one line, separated by blanks. All inputs are given in real numbers.
The number of datasets does not exceed 30.
Output
Outputs the surface distances of two cities on one line for each dataset.
Example
Input
35.68 139.77 51.15 359.82
1.37 103.92 41.78 272.25
51.15 359.82 -34.58 301.52
-1 -1 -1 -1
Output
9609
15092
11112 | instruction | 0 | 28,998 | 3 | 57,996 |
"Correct Solution:
```
import math
while 1:
a, b, c, d = map(float, input().split())
if a == -1:
break
a = (a / 360) * 2 * math.pi
b = (b / 360) * 2 * math.pi
c = (c / 360) * 2 * math.pi
d = (d / 360) * 2 * math.pi
x1 = math.cos(b) * math.cos(a)
y1 = math.sin(b) * math.cos(a)
z1 = math.sin(a)
x2 = math.cos(d) * math.cos(c)
y2 = math.sin(d) * math.cos(c)
z2 = math.sin(c)
angle = math.acos(x1*x2 + y1*y2 + z1*z2)
print(round(6378.1 * angle))
``` | output | 1 | 28,998 | 3 | 57,997 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that calculates and outputs the surface distance by inputting the north latitude and east longitude of two cities on the earth. However, the earth is a sphere with a radius of 6,378.1 km, and the surface distance between two points is the shortest distance along this sphere. Also, in the southern hemisphere, we will use 0 to -90 degrees north latitude without using south latitude, and 180 to 360 degrees east longitude without using west longitude even to the west of the Greenwich meridional line. Calculate the ground surface distance in km, round off to the nearest whole number, and output as an integer value.
Below are examples of north latitude and east longitude of major cities.
Place name | North latitude (degree) | East longitude (degree)
--- | --- | ---
Tokyo | 35.68 | 139.77
Singapore | 1.37 | 103.92
Sydney | -33.95 | 151.18
Chicago | 41.78 | 272.25
Buenos Aires | -34.58 | 301.52
London | 51.15 | 359.82
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by -1 four lines. Each dataset is given in the following format:
a b c d
The first city's north latitude a, the first city's east longitude b, the second city's north latitude c, and the second city's east longitude d are given on one line, separated by blanks. All inputs are given in real numbers.
The number of datasets does not exceed 30.
Output
Outputs the surface distances of two cities on one line for each dataset.
Example
Input
35.68 139.77 51.15 359.82
1.37 103.92 41.78 272.25
51.15 359.82 -34.58 301.52
-1 -1 -1 -1
Output
9609
15092
11112 | instruction | 0 | 29,000 | 3 | 58,000 |
"Correct Solution:
```
from math import acos,sin,cos,radians
while 1:
a,b,c,d=map(float,input().split())
if a==b==c==d==-1:break
a,c=radians(a),radians(c)
print(int(6378.1*acos(sin(a)*sin(c) + cos(a)*cos(c)*cos(radians(d)-radians(b)))+0.5))
``` | output | 1 | 29,000 | 3 | 58,001 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that calculates and outputs the surface distance by inputting the north latitude and east longitude of two cities on the earth. However, the earth is a sphere with a radius of 6,378.1 km, and the surface distance between two points is the shortest distance along this sphere. Also, in the southern hemisphere, we will use 0 to -90 degrees north latitude without using south latitude, and 180 to 360 degrees east longitude without using west longitude even to the west of the Greenwich meridional line. Calculate the ground surface distance in km, round off to the nearest whole number, and output as an integer value.
Below are examples of north latitude and east longitude of major cities.
Place name | North latitude (degree) | East longitude (degree)
--- | --- | ---
Tokyo | 35.68 | 139.77
Singapore | 1.37 | 103.92
Sydney | -33.95 | 151.18
Chicago | 41.78 | 272.25
Buenos Aires | -34.58 | 301.52
London | 51.15 | 359.82
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by -1 four lines. Each dataset is given in the following format:
a b c d
The first city's north latitude a, the first city's east longitude b, the second city's north latitude c, and the second city's east longitude d are given on one line, separated by blanks. All inputs are given in real numbers.
The number of datasets does not exceed 30.
Output
Outputs the surface distances of two cities on one line for each dataset.
Example
Input
35.68 139.77 51.15 359.82
1.37 103.92 41.78 272.25
51.15 359.82 -34.58 301.52
-1 -1 -1 -1
Output
9609
15092
11112 | instruction | 0 | 29,001 | 3 | 58,002 |
"Correct Solution:
```
import math
r = 6378.1
def getRadian(degree):
return degree * math.pi / 180
while(1):
a,b,c,d = (float(x) for x in input().split())
if a == -1 and b == -1 and c == -1 and d == -1:
break
cos = math.cos(getRadian(a)) * math.cos(getRadian(c)) * math.cos(getRadian(b) - getRadian(d)) + math.sin(getRadian(a)) * math.sin(getRadian(c))
dist = r * math.acos(cos)
print(format(dist, '.0f'))
``` | output | 1 | 29,001 | 3 | 58,003 |
Provide a correct Python 3 solution for this coding contest problem.
Problem G Rendezvous on a Tetrahedron
One day, you found two worms $P$ and $Q$ crawling on the surface of a regular tetrahedron with four vertices $A$, $B$, $C$ and $D$. Both worms started from the vertex $A$, went straight ahead, and stopped crawling after a while.
When a worm reached one of the edges of the tetrahedron, it moved on to the adjacent face and kept going without changing the angle to the crossed edge (Figure G.1).
Write a program which tells whether or not $P$ and $Q$ were on the same face of the tetrahedron when they stopped crawling.
You may assume that each of the worms is a point without length, area, or volume.
<image>
Figure G.1. Crossing an edge
Incidentally, lengths of the two trails the worms left on the tetrahedron were exact integral multiples of the unit length. Here, the unit length is the edge length of the tetrahedron. Each trail is more than 0:001 unit distant from any vertices, except for its start point and its neighborhood. This means that worms have crossed at least one edge. Both worms stopped at positions more than 0:001 unit distant from any of the edges.
The initial crawling direction of a worm is specified by two items: the edge $XY$ which is the first edge the worm encountered after its start, and the angle $d$ between the edge $AX$ and the direction of the worm, in degrees.
<image>
Figure G.2. Trails of the worms corresponding to Sample Input 1
Figure G.2 shows the case of Sample Input 1. In this case, $P$ went over the edge $CD$ and stopped on the face opposite to the vertex $A$, while $Q$ went over the edge $DB$ and also stopped on the same face.
Input
The input consists of a single test case, formatted as follows.
$X_PY_P$ $d_P$ $l_P$
$X_QY_Q$ $d_Q$ $l_Q$
$X_WY_W$ ($W = P,Q$) is the first edge the worm $W$ crossed after its start. $X_WY_W$ is one of BC, CD or DB.
An integer $d_W$ ($1 \leq d_W \leq 59$) is the angle in degrees between edge $AX_W$ and the initial direction of the worm $W$ on the face $\triangle AX_WY_W$.
An integer $l_W$ ($1 \leq l_W \leq 20$) is the length of the trail of worm $W$ left on the surface, in unit lengths.
Output
Output YES when and only when the two worms stopped on the same face of the tetrahedron. Otherwise, output NO.
Sample Input 1
CD 30 1
DB 30 1
Sample Output 1
YES
Sample Input 2
BC 1 1
DB 59 1
Sample Output 2
YES
Sample Input 3
BC 29 20
BC 32 20
Sample Output 3
NO
Example
Input
CD 30 1
DB 30 1
Output
YES | instruction | 0 | 29,038 | 3 | 58,076 |
"Correct Solution:
```
from math import cos, sin, pi, sqrt
B = ["BC", "CD", "DB"]
XY0, d0, l0, XY1, d1, l1 = open(0).read().split()
d0, l0, d1, l1 = map(int, [d0, l0, d1, l1])
def calc(XY, d, l):
angle = B.index(XY) * 60 + d
x = l * cos(pi*angle/180)
y = l * sin(pi*angle/180)
x = x + y/sqrt(3)
y = y * 2/sqrt(3)
x = x%2; y = y%2
A = [["AC", "BD"], ["DB", "CA"]][int(x)][int(y)]
return A[x%1>y%1]
print("YES"*(calc(XY0, d0, l0)==calc(XY1, d1, l1))or"NO")
``` | output | 1 | 29,038 | 3 | 58,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem G Rendezvous on a Tetrahedron
One day, you found two worms $P$ and $Q$ crawling on the surface of a regular tetrahedron with four vertices $A$, $B$, $C$ and $D$. Both worms started from the vertex $A$, went straight ahead, and stopped crawling after a while.
When a worm reached one of the edges of the tetrahedron, it moved on to the adjacent face and kept going without changing the angle to the crossed edge (Figure G.1).
Write a program which tells whether or not $P$ and $Q$ were on the same face of the tetrahedron when they stopped crawling.
You may assume that each of the worms is a point without length, area, or volume.
<image>
Figure G.1. Crossing an edge
Incidentally, lengths of the two trails the worms left on the tetrahedron were exact integral multiples of the unit length. Here, the unit length is the edge length of the tetrahedron. Each trail is more than 0:001 unit distant from any vertices, except for its start point and its neighborhood. This means that worms have crossed at least one edge. Both worms stopped at positions more than 0:001 unit distant from any of the edges.
The initial crawling direction of a worm is specified by two items: the edge $XY$ which is the first edge the worm encountered after its start, and the angle $d$ between the edge $AX$ and the direction of the worm, in degrees.
<image>
Figure G.2. Trails of the worms corresponding to Sample Input 1
Figure G.2 shows the case of Sample Input 1. In this case, $P$ went over the edge $CD$ and stopped on the face opposite to the vertex $A$, while $Q$ went over the edge $DB$ and also stopped on the same face.
Input
The input consists of a single test case, formatted as follows.
$X_PY_P$ $d_P$ $l_P$
$X_QY_Q$ $d_Q$ $l_Q$
$X_WY_W$ ($W = P,Q$) is the first edge the worm $W$ crossed after its start. $X_WY_W$ is one of BC, CD or DB.
An integer $d_W$ ($1 \leq d_W \leq 59$) is the angle in degrees between edge $AX_W$ and the initial direction of the worm $W$ on the face $\triangle AX_WY_W$.
An integer $l_W$ ($1 \leq l_W \leq 20$) is the length of the trail of worm $W$ left on the surface, in unit lengths.
Output
Output YES when and only when the two worms stopped on the same face of the tetrahedron. Otherwise, output NO.
Sample Input 1
CD 30 1
DB 30 1
Sample Output 1
YES
Sample Input 2
BC 1 1
DB 59 1
Sample Output 2
YES
Sample Input 3
BC 29 20
BC 32 20
Sample Output 3
NO
Example
Input
CD 30 1
DB 30 1
Output
YES
Submitted Solution:
```
from math import cos, sin, pi, sqrt
B = ["BC", "CD", "DB"]
XY0, d0, l0, XY1, d1, l1 = open(0).read().split()
d0, l0, d1, l1 = map(int, [d0, l0, d1, l1])
def calc(XY, d, l):
angle = B.index(XY) * 60 + d
x = l * cos(pi*angle/180)
y = l * sin(pi*angle/180)
y = sqrt(3)*(x + 2*y)/3
x = x - x//2*2
y = y - y//2*2
A = [["AC", "BD"], ["DB", "CA"]][int(x)][int(y)]
return A[x-x//1>y-y//1]
print("YES"*(calc(XY0, d0, l0)==calc(XY1, d1, l1))or"NO")
``` | instruction | 0 | 29,039 | 3 | 58,078 |
No | output | 1 | 29,039 | 3 | 58,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a far away galaxy there are n inhabited planets, numbered with numbers from 1 to n. They are located at large distances from each other, that's why the communication between them was very difficult until on the planet number 1 a hyperdrive was invented. As soon as this significant event took place, n - 1 spaceships were built on the planet number 1, and those ships were sent to other planets to inform about the revolutionary invention.
Paradoxical thought it may be, but the hyperspace is represented as simple three-dimensional Euclidean space. The inhabited planets may be considered fixed points in it, and no two points coincide and no three points lie on the same straight line. The movement of a ship with a hyperdrive between two planets is performed along a straight line at the constant speed, the same for all the ships. That's why the distance in the hyperspace are measured in hyperyears (a ship with a hyperdrive covers a distance of s hyperyears in s years).
When the ship reaches an inhabited planet, the inhabitants of the planet dissemble it, make n - 2 identical to it ships with a hyperdrive and send them to other n - 2 planets (except for the one from which the ship arrived). The time to make a new ship compared to the time in which they move from one planet to another is so small that it can be disregarded. New ships are absolutely identical to the ones sent initially: they move at the same constant speed along a straight line trajectory and, having reached a planet, perform the very same mission, i.e. are dissembled to build new n - 2 ships and send them to all the planets except for the one from which the ship arrived. Thus, the process of spreading the important news around the galaxy continues.
However the hyperdrive creators hurried to spread the news about their invention so much that they didn't study completely what goes on when two ships collide in the hyperspace. If two moving ships find themselves at one point, they provoke an explosion of colossal power, leading to the destruction of the galaxy!
Your task is to find the time the galaxy will continue to exist from the moment of the ships' launch from the first planet.
Input
The first line contains a number n (3 β€ n β€ 5000) β the number of inhabited planets in the galaxy. The next n lines contain integer coordinates of the planets in format "xi yi zi" ( - 104 β€ xi, yi, zi β€ 104).
Output
Print the single number β the solution to the task with an absolute or relative error not exceeding 10 - 6.
Examples
Input
4
0 0 0
0 0 1
0 1 0
1 0 0
Output
1.7071067812
Submitted Solution:
```
n = int(input())
points = []
minim = 9999999
for _ in range(n):
points.append([int(i) for i in input().split()])
matrix = []
for i in range(n):
matrix.append([])
for j in range(i):
matrix[i].append( (points[i][0]-points[j][0])**2 + (points[i][1]-points[j][1])**2 + (points[i][2]-points[j][2])**2)
for i in range(1,n):
for j in range(i+1,n):
if matrix[i][0] + matrix[j][0] + matrix[j][i] < minim:
minim = matrix[i][0]**0.5 + matrix[j][0]**0.5 + matrix[j][i]**0.5
#print(matrix[i][0], matrix[j][0], matrix[j][i])
print(minim/2)
``` | instruction | 0 | 29,507 | 3 | 59,014 |
No | output | 1 | 29,507 | 3 | 59,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a far away galaxy there are n inhabited planets, numbered with numbers from 1 to n. They are located at large distances from each other, that's why the communication between them was very difficult until on the planet number 1 a hyperdrive was invented. As soon as this significant event took place, n - 1 spaceships were built on the planet number 1, and those ships were sent to other planets to inform about the revolutionary invention.
Paradoxical thought it may be, but the hyperspace is represented as simple three-dimensional Euclidean space. The inhabited planets may be considered fixed points in it, and no two points coincide and no three points lie on the same straight line. The movement of a ship with a hyperdrive between two planets is performed along a straight line at the constant speed, the same for all the ships. That's why the distance in the hyperspace are measured in hyperyears (a ship with a hyperdrive covers a distance of s hyperyears in s years).
When the ship reaches an inhabited planet, the inhabitants of the planet dissemble it, make n - 2 identical to it ships with a hyperdrive and send them to other n - 2 planets (except for the one from which the ship arrived). The time to make a new ship compared to the time in which they move from one planet to another is so small that it can be disregarded. New ships are absolutely identical to the ones sent initially: they move at the same constant speed along a straight line trajectory and, having reached a planet, perform the very same mission, i.e. are dissembled to build new n - 2 ships and send them to all the planets except for the one from which the ship arrived. Thus, the process of spreading the important news around the galaxy continues.
However the hyperdrive creators hurried to spread the news about their invention so much that they didn't study completely what goes on when two ships collide in the hyperspace. If two moving ships find themselves at one point, they provoke an explosion of colossal power, leading to the destruction of the galaxy!
Your task is to find the time the galaxy will continue to exist from the moment of the ships' launch from the first planet.
Input
The first line contains a number n (3 β€ n β€ 5000) β the number of inhabited planets in the galaxy. The next n lines contain integer coordinates of the planets in format "xi yi zi" ( - 104 β€ xi, yi, zi β€ 104).
Output
Print the single number β the solution to the task with an absolute or relative error not exceeding 10 - 6.
Examples
Input
4
0 0 0
0 0 1
0 1 0
1 0 0
Output
1.7071067812
Submitted Solution:
```
from sys import stdin
from collections import defaultdict
import heapq
import math
from functools import reduce
def get_distance(p1, p2):
return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2 + (p1[2] - p2[2]) ** 2 )
n = int(stdin.buffer.readline())
coord = dict()
dist = dict()
for i in range(n):
coord[i] = list(map(int, stdin.buffer.readline().split()))
for i in range(n):
for g in range(n):
if i != g:
dist[(i, g)] = get_distance(coord[i], coord[g])
mn = 10000000000
for c, d in dist.items():
for i in range(n):
if i != c[0] and i != c[1]:
per = d + dist[(c[0], i)] + dist[(c[1], i)]
if per < mn:
mn = per
print (mn / 2)
``` | instruction | 0 | 29,508 | 3 | 59,016 |
No | output | 1 | 29,508 | 3 | 59,017 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,835 | 3 | 59,670 |
"Correct Solution:
```
def solve():
_,*l=map(int,open(0).read().split())
print("YNeos"[any((t+x+y)%2+(t<x+y)for t,x,y in zip(*[iter(l)]*3))::2])
if __name__=="__main__":
solve()
``` | output | 1 | 29,835 | 3 | 59,671 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,836 | 3 | 59,672 |
"Correct Solution:
```
n = int(input())
count = 0
for i in range(n):
t,x,y = map(int,input().split())
if (x + y <= t and t % 2 == (x + y) % 2):
continue
else:
print("No")
exit()
print("Yes")
``` | output | 1 | 29,836 | 3 | 59,673 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,837 | 3 | 59,674 |
"Correct Solution:
```
N = int(input())
flag = True
for i in range(N):
t,x,y = map(int, input().split())
if x+y>t or t%2 !=(x+y)%2:
flag=False
break
print("Yes" if flag else "No")
``` | output | 1 | 29,837 | 3 | 59,675 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,838 | 3 | 59,676 |
"Correct Solution:
```
n = int(input())
for _ in range(1, n+1):
t, x, y = map(int, input().split())
# x+yγ―ζ―η§γγ¨γ«εΏ
γεΆε₯γε
₯γζΏγγγγ¨γγ£γγγͺγγ£γ«ι’γγθγζΉγιθ¦
if (x + y) > t or (x + y + t) % 2:
print("No")
exit()
print("Yes")
``` | output | 1 | 29,838 | 3 | 59,677 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,839 | 3 | 59,678 |
"Correct Solution:
```
N = int(input())
ans = "Yes"
i = 0
while i < N:
t,x,y = [int(num) for num in input().split()]
if x+y <= t and (t-x-y)%2 == 0:
i += 1
else:
ans = "No"
break
print(ans)
``` | output | 1 | 29,839 | 3 | 59,679 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,840 | 3 | 59,680 |
"Correct Solution:
```
n = int(input())
a = []
for i in range(n):
a.append(list(map(int, input().split())))
for i in a:
if i[0] < i[1] + i[2] or sum(i) % 2:
print("No")
exit()
print("Yes")
``` | output | 1 | 29,840 | 3 | 59,681 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,841 | 3 | 59,682 |
"Correct Solution:
```
n=int(input())
tt,xx,yy=0,0,0
ans=0
for i in range(n):
t,x,y=map(int,input().split())
if (x-xx+y-yy)%2!=(t-tt)%2:
ans=1
if x-xx+y-yy>t-tt:
ans=1
tt,xx,yy=t,x,y
print("YNeos"[ans::2])
``` | output | 1 | 29,841 | 3 | 59,683 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No | instruction | 0 | 29,842 | 3 | 59,684 |
"Correct Solution:
```
n = int(input())
for _ in range(n):
t, x, y = map(int, input().split())
if t < x + y or (x + y + t) % 2:
print('No')
exit()
print('Yes')
``` | output | 1 | 29,842 | 3 | 59,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
n = int(input())
for i in range(n):
t, x, y = map(int, input().split())
if t<(x+y) or t%2!=(x+y)%2:
print('No')
exit()
print('Yes')
``` | instruction | 0 | 29,843 | 3 | 59,686 |
Yes | output | 1 | 29,843 | 3 | 59,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
N=int(input())
TXY=[list(map(int,input().split(' '))) for i in range(N)]
t,x,y=0,0,0
for i,j,k in TXY:
chk=(i-t-(abs(x-j)+abs(y+k)))
if chk<0 or chk%2!=0:
print('No')
exit()
print('Yes')
``` | instruction | 0 | 29,844 | 3 | 59,688 |
Yes | output | 1 | 29,844 | 3 | 59,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
n=int(input())
T,X,Y=0,0,0
a='Yes'
for i in range(n):
t,x,y=map(int,input().split())
if abs(x-X)+abs(y-Y)>t-T or t%2!=(x+y)%2:
a='No'
break
T,X,Y=t,x,y
print(a)
``` | instruction | 0 | 29,845 | 3 | 59,690 |
Yes | output | 1 | 29,845 | 3 | 59,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
n=int(input())
for i in range(n):
t,x,y=map(int,input().split())
if x+y>t or (x+y+t)%2!=0:
print("No")
exit()
print("Yes")
#γγεγγγ
``` | instruction | 0 | 29,846 | 3 | 59,692 |
Yes | output | 1 | 29,846 | 3 | 59,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
N = int(input())
s = [[0,0,0]]*(N+1)
t = [0]*(N+1)
x = [0]*(N+1)
y = [0]*(N+1)
for i in range(1,N+1):
s[i] = input().split()
t[i] = int(s[i][0])
x[i] = int(s[i][1])
y[i] = int(s[i][2])
k = 0
for i in range(N):
T = t[i+1]-t[i]
p = 0
if T%2 == 0:
for u in range((T/2)+1):
for l in range(-2*u,2*u+1):
if x[i]+l == x[i+1] and y[i]+2*u - max(l,-l) == y[i+1]:
w = l
k = k + 1
break
elif x[i]+l == x[i+1] and y[i]-2*u + max(l,-l) == y[i+1]:
w = l
k = k + 1
break
else:
p = p + 1
if (x[i]+w == x[i+1] and y[i]+2*u - max(w,-w) == y[i+1]) or (x[i]+w == x[i+1] and y[i]-2*u + max(w,-w) == y[i+1]):
break
if p == ((T/2)+1)(T+1):
print('No')
break
else:
for u in range(int((T+1)/2)):
for l in range(-2*u-1,2*u+2):
if x[i]+l == x[i+1] and y[i]+2*u+1 - max(l,-l) == y[i+1]:
w = l
k = k + 1
break
elif x[i]+l == x[i+1] and y[i]-2*u-1 + max(l,-l) == y[i+1]:
w = l
k = k + 1
break
else:
w = float('inf')
p = p + 1
if (x[i]+w == x[i+1] and y[i]+2*u+1 - max(w,-w) == y[i+1]) or (x[i]+w == x[i+1] and y[i]-2*u-1 + max(w,-w) == y[i+1]):
break
if p == ((T**2)+(3*T)+2)/2:
print('No')
break
if k == N:
print('Yes')
``` | instruction | 0 | 29,847 | 3 | 59,694 |
No | output | 1 | 29,847 | 3 | 59,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
n = int(input())
t = [0] * n
x = [0] * n
y = [0] * n
for i in range(n):
t[i], x[i], y[i] = map(int, input().split())
x_defo = 0
y_defo = 0
t_defo = 0
result = 0
for i in range(n):
dt = t[i] - t_defo
it = abs(x[i]-x_defo) + abs(y[i]-y_defo)
if it > dt:
result = 1
break
if it %2 != dt %2:
result = 1
break
if result ==0:
print("Yes")
else:
print("No")
``` | instruction | 0 | 29,848 | 3 | 59,696 |
No | output | 1 | 29,848 | 3 | 59,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
N=int(input())
TXY=[list(map(int,input().split(' '))) for i in range(N)]
t,x,y=0,0,0
for i,j,k in TXY:
if i-t!=abs(x-j)+abs(y+k):
print('No')
exit()
print('Yes')
``` | instruction | 0 | 29,849 | 3 | 59,698 |
No | output | 1 | 29,849 | 3 | 59,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.
If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints
* 1 β€ N β€ 10^5
* 0 β€ x_i β€ 10^5
* 0 β€ y_i β€ 10^5
* 1 β€ t_i β€ 10^5
* t_i < t_{i+1} (1 β€ i β€ N-1)
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N
Output
If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
Examples
Input
2
3 1 2
6 1 1
Output
Yes
Input
1
2 100 100
Output
No
Input
2
5 1 1
100 1 1
Output
No
Submitted Solution:
```
N = int(input())
xy=[]
try :
while True:
t = input().split()
t = list(map(int,t))
xy.append(t)
except EOFError:
pass
loc = [0,0]
time = 0
for i in range(N):
a = xy[i]
time = a[0]-time
dis = abs(loc[0]-a[1])+abs(loc[1]-a[2])
if (time-dis)<0 :
print("No")
break
elif time%2 == dis%2:
loc = [a[1],a[2]]
else :
print("No")
break
else :
print("Yes")
``` | instruction | 0 | 29,850 | 3 | 59,700 |
No | output | 1 | 29,850 | 3 | 59,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Seen from above, there is a grid-like square shaped like Figure 1. The presence or absence of "walls" on each side of this grid is represented by a sequence of 0s and 1s. Create a program that stands at point A, puts your right hand on the wall, keeps walking in the direction of the arrow, and outputs the route to return to point A again.
<image>
---
Figure 1
---
Input
The input consists of 9 lines and is given in the following format, with 1 being the presence of a wall and 0 being the absence of a wall, as shown in Figure 2 below.
The first line is a character string that indicates the presence or absence of the top horizontal line wall as 0 and 1 from the left.
The second line is a character string that indicates the presence or absence of the vertical line wall below it with 0 and 1 from the left.
The third line is a character string that indicates the presence or absence of the wall of the second horizontal line from the top by 0 and 1 from the left.
...
The 9th line is a character string representing the presence or absence of the bottom horizontal line wall with 0 and 1 from the left.
<image>
---
Figure 2 (Thick line shows where the wall is) (corresponding numbers)
However, as shown by the thick line in Fig. 1, it is assumed that there is always a wall for one section to the right of point A. That is, the first character on the first line is always 1.
Output
"Advance one section to the left of the figure" is "L", "Advance one section to the right of the figure" is "R", "Advance one section to the top of the figure" is "U", "Figure" "Advance one block downward" is represented by "D", and "L", "R", "U", and "D" are output in the order of advance.
Example
Input
1111
00001
0110
01011
0010
01111
0010
01001
0111
Output
RRRRDDDDLLLUUURRDDLURULLDDDRRRUUUULLLL
Submitted Solution:
```
import sys
n = [input() for i in range(9)]
path = [[0 for i in range(5)] for j in range(5)]
for i, v in enumerate([a[1] for a in enumerate(n) if a[0] % 2 == 0]):
for j in range(4):
if v[j] == '1':
path[i][j] += 1
path[i][j+1] += 2
for i, v in enumerate([a[1] for a in enumerate(n) if a[0] % 2 != 0]):
for j in range(5):
if v[j] == '1':
path[i][j] += 4
path[i+1][j] += 8
dur = {'R':(1, 0, 1),
'L':(2, 0, -1),
'U':(8, -1, 0),
'D':(4, 1, 0)}
dur_next = {'R':('U','R','D'),
'L':('D','L','U'),
'U':('L','U','R'),
'D':('R','D','L')}
def walk():
global cx, cy
cx = dur[d][2] + cx
cy = dur[d][1] + cy
def next_D():
global cx,cy,d,dur
for nd in dur_next[d]:
if path[cy][cx] & dur[nd][0]:
d = nd
break
cx = cy = 0
d = 'R'
log = []
while 1:
log.append(d)
walk()
if cx == cy == 0:
break
next_D()
print(''.join(log))
``` | instruction | 0 | 29,911 | 3 | 59,822 |
No | output | 1 | 29,911 | 3 | 59,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland β is a huge country with diverse geography. One of the most famous natural attractions of Berland is the "Median mountain range". This mountain range is n mountain peaks, located on one straight line and numbered in order of 1 to n. The height of the i-th mountain top is a_i.
"Median mountain range" is famous for the so called alignment of mountain peaks happening to it every day. At the moment of alignment simultaneously for each mountain from 2 to n - 1 its height becomes equal to the median height among it and two neighboring mountains. Formally, if before the alignment the heights were equal b_i, then after the alignment new heights a_i are as follows: a_1 = b_1, a_n = b_n and for all i from 2 to n - 1 a_i = median(b_{i-1}, b_i, b_{i+1}). The median of three integers is the second largest number among them. For example, median(5,1,2) = 2, and median(4,2,4) = 4.
Recently, Berland scientists have proved that whatever are the current heights of the mountains, the alignment process will stabilize sooner or later, i.e. at some point the altitude of the mountains won't changing after the alignment any more. The government of Berland wants to understand how soon it will happen, i.e. to find the value of c β how many alignments will occur, which will change the height of at least one mountain. Also, the government of Berland needs to determine the heights of the mountains after c alignments, that is, find out what heights of the mountains stay forever. Help scientists solve this important problem!
Input
The first line contains integers n (1 β€ n β€ 500 000) β the number of mountains.
The second line contains integers a_1, a_2, a_3, β¦, a_n (1 β€ a_i β€ 10^9) β current heights of the mountains.
Output
In the first line print c β the number of alignments, which change the height of at least one mountain.
In the second line print n integers β the final heights of the mountains after c alignments.
Examples
Input
5
1 2 1 2 1
Output
2
1 1 1 1 1
Input
6
1 3 2 5 4 6
Output
1
1 2 3 4 5 6
Input
6
1 1 2 2 1 1
Output
0
1 1 2 2 1 1
Note
In the first example, the heights of the mountains at index 1 and 5 never change. Since the median of 1, 2, 1 is 1, the second and the fourth mountains will have height 1 after the first alignment, and since the median of 2, 1, 2 is 2, the third mountain will have height 2 after the first alignment. This way, after one alignment the heights are 1, 1, 2, 1, 1. After the second alignment the heights change into 1, 1, 1, 1, 1 and never change from now on, so there are only 2 alignments changing the mountain heights.
In the third examples the alignment doesn't change any mountain height, so the number of alignments changing any height is 0.
Submitted Solution:
```
n=int(input())
a=list(map(int,input().split()))
t=[0 for i in range(n) ]
k=0
def rawn(a,n):
t[0]=a[0]
t[n-1]=a[n-1]
for i in range(1,n-1):
l=[a[i-1],a[i],a[i+1]]
l=sorted(l)
t[i]=l[1]
return t
last=rawn(a,n)
while last!=a:
k += 1
last=a
a=rawn(last,n)
print(k)
t=str()
last= " ".join(map(str,last))
print(last)
``` | instruction | 0 | 30,225 | 3 | 60,450 |
No | output | 1 | 30,225 | 3 | 60,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland β is a huge country with diverse geography. One of the most famous natural attractions of Berland is the "Median mountain range". This mountain range is n mountain peaks, located on one straight line and numbered in order of 1 to n. The height of the i-th mountain top is a_i.
"Median mountain range" is famous for the so called alignment of mountain peaks happening to it every day. At the moment of alignment simultaneously for each mountain from 2 to n - 1 its height becomes equal to the median height among it and two neighboring mountains. Formally, if before the alignment the heights were equal b_i, then after the alignment new heights a_i are as follows: a_1 = b_1, a_n = b_n and for all i from 2 to n - 1 a_i = median(b_{i-1}, b_i, b_{i+1}). The median of three integers is the second largest number among them. For example, median(5,1,2) = 2, and median(4,2,4) = 4.
Recently, Berland scientists have proved that whatever are the current heights of the mountains, the alignment process will stabilize sooner or later, i.e. at some point the altitude of the mountains won't changing after the alignment any more. The government of Berland wants to understand how soon it will happen, i.e. to find the value of c β how many alignments will occur, which will change the height of at least one mountain. Also, the government of Berland needs to determine the heights of the mountains after c alignments, that is, find out what heights of the mountains stay forever. Help scientists solve this important problem!
Input
The first line contains integers n (1 β€ n β€ 500 000) β the number of mountains.
The second line contains integers a_1, a_2, a_3, β¦, a_n (1 β€ a_i β€ 10^9) β current heights of the mountains.
Output
In the first line print c β the number of alignments, which change the height of at least one mountain.
In the second line print n integers β the final heights of the mountains after c alignments.
Examples
Input
5
1 2 1 2 1
Output
2
1 1 1 1 1
Input
6
1 3 2 5 4 6
Output
1
1 2 3 4 5 6
Input
6
1 1 2 2 1 1
Output
0
1 1 2 2 1 1
Note
In the first example, the heights of the mountains at index 1 and 5 never change. Since the median of 1, 2, 1 is 1, the second and the fourth mountains will have height 1 after the first alignment, and since the median of 2, 1, 2 is 2, the third mountain will have height 2 after the first alignment. This way, after one alignment the heights are 1, 1, 2, 1, 1. After the second alignment the heights change into 1, 1, 1, 1, 1 and never change from now on, so there are only 2 alignments changing the mountain heights.
In the third examples the alignment doesn't change any mountain height, so the number of alignments changing any height is 0.
Submitted Solution:
```
n = int(input().strip())
arr = list(map(int,input().strip().split()))
arr2 = [0]*n
changes = True
counter = 0
while changes:
changes = False
for i in range(1,n-1):
temp = [arr[i-1],arr[i],arr[i+1]]
temp.sort()
temp = temp[1]
if temp != arr[i]:
changes = True
arr2[i] = temp
arr2[0] = arr[0]
arr2[n-1] = arr[n-1]
arr = arr2
if changes:
counter+=1
print(counter)
print(*arr)
``` | instruction | 0 | 30,226 | 3 | 60,452 |
No | output | 1 | 30,226 | 3 | 60,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland β is a huge country with diverse geography. One of the most famous natural attractions of Berland is the "Median mountain range". This mountain range is n mountain peaks, located on one straight line and numbered in order of 1 to n. The height of the i-th mountain top is a_i.
"Median mountain range" is famous for the so called alignment of mountain peaks happening to it every day. At the moment of alignment simultaneously for each mountain from 2 to n - 1 its height becomes equal to the median height among it and two neighboring mountains. Formally, if before the alignment the heights were equal b_i, then after the alignment new heights a_i are as follows: a_1 = b_1, a_n = b_n and for all i from 2 to n - 1 a_i = median(b_{i-1}, b_i, b_{i+1}). The median of three integers is the second largest number among them. For example, median(5,1,2) = 2, and median(4,2,4) = 4.
Recently, Berland scientists have proved that whatever are the current heights of the mountains, the alignment process will stabilize sooner or later, i.e. at some point the altitude of the mountains won't changing after the alignment any more. The government of Berland wants to understand how soon it will happen, i.e. to find the value of c β how many alignments will occur, which will change the height of at least one mountain. Also, the government of Berland needs to determine the heights of the mountains after c alignments, that is, find out what heights of the mountains stay forever. Help scientists solve this important problem!
Input
The first line contains integers n (1 β€ n β€ 500 000) β the number of mountains.
The second line contains integers a_1, a_2, a_3, β¦, a_n (1 β€ a_i β€ 10^9) β current heights of the mountains.
Output
In the first line print c β the number of alignments, which change the height of at least one mountain.
In the second line print n integers β the final heights of the mountains after c alignments.
Examples
Input
5
1 2 1 2 1
Output
2
1 1 1 1 1
Input
6
1 3 2 5 4 6
Output
1
1 2 3 4 5 6
Input
6
1 1 2 2 1 1
Output
0
1 1 2 2 1 1
Note
In the first example, the heights of the mountains at index 1 and 5 never change. Since the median of 1, 2, 1 is 1, the second and the fourth mountains will have height 1 after the first alignment, and since the median of 2, 1, 2 is 2, the third mountain will have height 2 after the first alignment. This way, after one alignment the heights are 1, 1, 2, 1, 1. After the second alignment the heights change into 1, 1, 1, 1, 1 and never change from now on, so there are only 2 alignments changing the mountain heights.
In the third examples the alignment doesn't change any mountain height, so the number of alignments changing any height is 0.
Submitted Solution:
```
# https://codeforces.com/problemset/problem/1322/E
n = int(input().strip())
arr = list(map(int,input().strip().split()))
arr2 = [0]*n
changes = True
counter = 0
while changes:
changes = False
for i in range(1,n-1):
temp = [arr[i-1],arr[i],arr[i+1]]
temp.sort()
temp = temp[1]
if temp != arr[i]:
changes = True
arr2[i] = temp
arr2[0] = arr[0]
arr2[n-1] = arr[n-1]
arr = arr2
if changes:
counter+=1
print(counter)
print(*arr)
``` | instruction | 0 | 30,227 | 3 | 60,454 |
No | output | 1 | 30,227 | 3 | 60,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland β is a huge country with diverse geography. One of the most famous natural attractions of Berland is the "Median mountain range". This mountain range is n mountain peaks, located on one straight line and numbered in order of 1 to n. The height of the i-th mountain top is a_i.
"Median mountain range" is famous for the so called alignment of mountain peaks happening to it every day. At the moment of alignment simultaneously for each mountain from 2 to n - 1 its height becomes equal to the median height among it and two neighboring mountains. Formally, if before the alignment the heights were equal b_i, then after the alignment new heights a_i are as follows: a_1 = b_1, a_n = b_n and for all i from 2 to n - 1 a_i = median(b_{i-1}, b_i, b_{i+1}). The median of three integers is the second largest number among them. For example, median(5,1,2) = 2, and median(4,2,4) = 4.
Recently, Berland scientists have proved that whatever are the current heights of the mountains, the alignment process will stabilize sooner or later, i.e. at some point the altitude of the mountains won't changing after the alignment any more. The government of Berland wants to understand how soon it will happen, i.e. to find the value of c β how many alignments will occur, which will change the height of at least one mountain. Also, the government of Berland needs to determine the heights of the mountains after c alignments, that is, find out what heights of the mountains stay forever. Help scientists solve this important problem!
Input
The first line contains integers n (1 β€ n β€ 500 000) β the number of mountains.
The second line contains integers a_1, a_2, a_3, β¦, a_n (1 β€ a_i β€ 10^9) β current heights of the mountains.
Output
In the first line print c β the number of alignments, which change the height of at least one mountain.
In the second line print n integers β the final heights of the mountains after c alignments.
Examples
Input
5
1 2 1 2 1
Output
2
1 1 1 1 1
Input
6
1 3 2 5 4 6
Output
1
1 2 3 4 5 6
Input
6
1 1 2 2 1 1
Output
0
1 1 2 2 1 1
Note
In the first example, the heights of the mountains at index 1 and 5 never change. Since the median of 1, 2, 1 is 1, the second and the fourth mountains will have height 1 after the first alignment, and since the median of 2, 1, 2 is 2, the third mountain will have height 2 after the first alignment. This way, after one alignment the heights are 1, 1, 2, 1, 1. After the second alignment the heights change into 1, 1, 1, 1, 1 and never change from now on, so there are only 2 alignments changing the mountain heights.
In the third examples the alignment doesn't change any mountain height, so the number of alignments changing any height is 0.
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split(" ")))
b = a.copy()
def median(arr):
return sorted(arr)[1]
c = 0
while(True):
for i in range(1, len(a)-1):
a[i] = median([b[i-1],b[i], b[i+1]])
if(a == b):
break
c += 1
# print(b)
print(c)
print(" ".join(map(str, a)))
b = a.copy()
``` | instruction | 0 | 30,228 | 3 | 60,456 |
No | output | 1 | 30,228 | 3 | 60,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,281 | 3 | 60,562 |
Tags: implementation
Correct Solution:
```
def check(x1 , y1, x2, y2, d):
return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) <= d*d
xa, ya, xb, yb = map(int,input().split())
if xa > xb : xa, xb = xb, xa
if ya > yb : ya, yb = yb, ya
n = int(input())
r = []
i = 0
while i < n:
r.append(list(map(int,input().split())))
i+=1;
d = {}
for i in r:
if abs(i[1]-ya) <= i[2]:
for j in range(i[0]-i[2], i[0]+i[2] + 1, 1):
if xa <= j <= xb and check(i[0], i[1], j, ya, i[2]):
d[str(j)+'*'+str(ya)] = '1'
if abs(i[1]-yb) <= i[2]:
for j in range(i[0]-i[2], i[0]+i[2]+1, 1):
if xa <= j <= xb and check(i[0], i[1], j, yb, i[2]):
d[str(j)+'*'+str(yb)] = '1'
if abs(i[0]-xa) <= i[2]:
for j in range(i[1]-i[2], i[1]+i[2]+1, 1):
if ya <= j <= yb and check(i[0], i[1], xa, j, i[2]):
d[str(xa)+'*'+str(j)] = '1'
if abs(i[0]-xb) <= i[2]:
for j in range(i[1]-i[2], i[1]+i[2]+1, 1):
if ya <= j <= yb and check(i[0], i[1], xb, j, i[2]):
d[str(xb)+'*'+str(j)] = '1'
print((xb - xa + yb - ya)*2 - len(d))
``` | output | 1 | 30,281 | 3 | 60,563 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,282 | 3 | 60,564 |
Tags: implementation
Correct Solution:
```
import sys
def eucledian_dis(c, c1):
x1, y1 = c[0], c[1]
x, y = c1[0], c1[1]
r = c1[2]
if ((x - x1)**2 + (y - y1)**2)**(0.5) <= r:
return True
return False
xa, ya, xb, yb = map(int, sys.stdin.readline().strip().split())
lis = []
for i in range(min(ya, yb), max(yb, ya) + 1):
#if [xa, i] not in lis:
lis.append([xa, i])
#if [xb, i] not in lis:
lis.append([xb, i])
for i in range(min(xa, xb) + 1, max(xb, xa) ):
#if [i, ya] not in lis:
lis.append([i, ya])
#if [i, yb] not in lis:
lis.append([i, yb])
n = int(input())
new_lis = []
while n:
n -= 1
xi, yi, r = map(int, sys.stdin.readline().strip().split())
new_lis.append([xi, yi, r])
count = 0
for i in lis:
flag = False
for j in new_lis:
if eucledian_dis(i, j):
flag = True
break
if not flag:
count += 1
#print(lis)
print(count)
``` | output | 1 | 30,282 | 3 | 60,565 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,283 | 3 | 60,566 |
Tags: implementation
Correct Solution:
```
from collections import deque
x1, y1, x2, y2 = map(int, input().split())
n = int(input())
x = [None]*n
y = [None]*n
r = [None]*n
taken = {}
for i in range(n):
x[i], y[i], r[i] = map(int, input().split())
if x1 > x2:
x1, x2 = x2, x1
if y1 > y2:
y1, y2 = y2, y1
def dist2(x1, y1, x2, y2):
return pow( (x1 - x2), 2) + pow( (y1 - y2), 2)
def ok(xx, yy):
for i in range(n):
if dist2(xx, yy, x[i], y[i]) <= r[i] * r[i]:
return 1
return 0
ans = 0
for i in range(y1, y2+1):
if ok(x1, i):
ans += 1
if ok(x2, i):
ans += 1
for i in range(x1 + 1, x2):
if ok(i, y1):
ans += 1
if ok(i, y2):
ans += 1
print(2*(x2 - x1 + y2 - y1) - ans)
``` | output | 1 | 30,283 | 3 | 60,567 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,284 | 3 | 60,568 |
Tags: implementation
Correct Solution:
```
import math
def dist(a, b, c, d):
return math.sqrt((a - c) ** 2 + (b - d) ** 2)
class CodeforcesTask144BSolution:
def __init__(self):
self.result = ''
self.x_y_x_y = []
self.n = 0
self.radiators = []
def read_input(self):
self.x_y_x_y = [int(x) for x in input().split(" ")]
self.n = int(input())
for x in range(self.n):
self.radiators.append([int(y) for y in input().split(" ")])
def process_task(self):
generals = []
self.x_y_x_y[0], self.x_y_x_y[2] = min(self.x_y_x_y[0], self.x_y_x_y[2]), max(self.x_y_x_y[0], self.x_y_x_y[2])
self.x_y_x_y[1], self.x_y_x_y[3] = min(self.x_y_x_y[1], self.x_y_x_y[3]), max(self.x_y_x_y[1], self.x_y_x_y[3])
for x in range(self.x_y_x_y[0], self.x_y_x_y[2] + 1):
generals.append((x, self.x_y_x_y[1]))
generals.append((x, self.x_y_x_y[3]))
for y in range(self.x_y_x_y[1] + 1, self.x_y_x_y[3]):
generals.append((self.x_y_x_y[0], y))
generals.append((self.x_y_x_y[2], y))
for radiator in self.radiators:
ngen = []
if generals:
while generals:
checking = generals.pop(-1)
if dist(radiator[0], radiator[1], *checking) > radiator[2]:
ngen.append(checking)
generals = ngen
else:
break
self.result = str(len(generals))
def get_result(self):
return self.result
if __name__ == "__main__":
Solution = CodeforcesTask144BSolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())
``` | output | 1 | 30,284 | 3 | 60,569 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,285 | 3 | 60,570 |
Tags: implementation
Correct Solution:
```
xa, ya, xb, yb = [int(i) for i in input().split()]
l = []
cnt = (abs(xa-xb)+1) *2 + (abs(ya-yb)-1)*2
x1, x2, y1, y2 = min(xa, xb), max(xa, xb), min(ya, yb), max(ya, yb)
for i in range(x1, x2+1):
for j in range(y1, y2+1):
if i == x1 or i == x2 or j ==y1 or y2 == j:
l.append([i, j])
rad = []
t = int(input())
for i in range(t):
x, y, r = list(map(int, input().split()))
rad.append([x, y, r])
i, j = len(l)-1, len(rad)-1
while i >= 0:
x = l[i][0] - rad[j][0]
y = l[i][1] - rad[j][1]
if x ** 2 + y ** 2 <= rad[j][2] ** 2:
cnt -= 1
i -= 1
j = len(rad)-1
else:
if j >= 0:
j -= 1
else:
i-=1
j = len(rad)-1
print(cnt)
``` | output | 1 | 30,285 | 3 | 60,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,286 | 3 | 60,572 |
Tags: implementation
Correct Solution:
```
def f(i, t, Y, c):
arr, res = [(t,t)], 0
for x, y, r in c:
d = r - (y-Y)**2
if d < 0:
continue
d = int(d**.5)
arr.append((x-d, x+d+1))
for a, b in sorted(arr):
if i < a and i < t:
res += a - i
if i < b:
i = b
return res
xa, ya, xb, yb = map(int, input().split())
if xa > xb: xa, xb = xb, xa
if ya > yb: ya, yb = yb, ya
n = int(input())
arr = [map(int, input().split()) for _ in range(n)]
arr1 = [(x, y, r*r) for x, y, r in arr]
arr2 = [(y, x, r) for x, y, r in arr1]
res1 = f(xa, xb+1, ya, arr1)
res2 = f(xa, xb+1, yb, arr1)
res3 = f(ya+1, yb, xa, arr2)
res4 = f(ya+1, yb, xb, arr2)
print(res1 + res2 + res3 + res4)
``` | output | 1 | 30,286 | 3 | 60,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,287 | 3 | 60,574 |
Tags: implementation
Correct Solution:
```
a,b,c,d=map(int,input().split())
if a>c:a,c=c,a
if b>d:b,d=d,b
z=[tuple(map(int,input().split())) for _ in " "*int(input())]
ans=0
for i in range(a,c+1):
for x,y,r in z:
if (i-x)**2+(y-b)**2<=r**2:break
else:ans+=1
for i in range(b+1,d):
for x,y,r in z:
if (c-x)**2+(i-y)**2<=r**2:break
else:ans+=1
for i in range(a,c+1):
for x,y,r in z:
if (i-x)**2+(y-d)**2<=r**2:break
else:ans+=1
for i in range(b+1,d):
for x,y,r in z:
if (a-x)**2+(i-y)**2<=r**2:break
else:ans+=1
print(ans)
``` | output | 1 | 30,287 | 3 | 60,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range. | instruction | 0 | 30,288 | 3 | 60,576 |
Tags: implementation
Correct Solution:
```
xa, ya, xb, yb = map(int, input().split())
s, t = 0, [tuple(map(int, input().split())) for i in range(int(input()))]
if xa > xb: xa, xb = xb, xa
if ya > yb: ya, yb = yb, ya
for y in [ya, yb]:
p = [(u, v, r) for u, v, r in t if abs(v - y) <= r]
for x in range(xa, xb + 1):
for u, v, r in p:
if abs(x - u) <= r and (x - u) ** 2 + (y - v) ** 2 <= r ** 2:
s += 1
break
for x in [xa, xb]:
p = [(u, v, r) for u, v, r in t if abs(u - x) <= r]
for y in range(ya + 1, yb):
for u, v, r in p:
if abs(y - v) <= r and (x - u) ** 2 + (y - v) ** 2 <= r ** 2:
s += 1
break
print(2 * (xb - xa + yb - ya) - s)
``` | output | 1 | 30,288 | 3 | 60,577 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range.
Submitted Solution:
```
def dis(a,b,c,d):
xx=(a-c)*(a-c)
yy=(d-b)*(d-b)
return xx+yy
x1,y1,x2,y2=map(int,input().split())
n=int(input())
x=[]
y=[]
r=[]
for i in range(n):
xx,yy,rr=map(int,input().split())
x.append(xx)
y.append(yy)
r.append(rr)
ans=0
for i in range(min(x1,x2),max(x1,x2)+1):
a=True
b=True
for j in range(len(x)):
if dis(i,y1,x[j],y[j])<=(r[j]*r[j]):
a=False
break
for j in range(len(x)):
if dis(i,y2,x[j],y[j])<=(r[j]*r[j]):
b=False
break
if a:
ans+=1
if b:
ans+=1
for i in range(min(y1,y2)+1,max(y1,y2)):
a=True
b=True
for j in range(len(x)):
if dis(x1,i,x[j],y[j])<=(r[j]*r[j]):
a=False
break
for j in range(len(x)):
if dis(x2,i,x[j],y[j])<=(r[j]*r[j]):
b=False
break
if a:
ans+=1
if b:
ans+=1
print(ans)
``` | instruction | 0 | 30,289 | 3 | 60,578 |
Yes | output | 1 | 30,289 | 3 | 60,579 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.
Some points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri β the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is <image>
Each general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.
The generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.
Input
The first input line contains coordinates of two opposite table corners xa, ya, xb, yb (xa β xb, ya β yb). The second line contains integer n β the number of radiators (1 β€ n β€ 103). Then n lines contain the heaters' coordinates as "xi yi ri", the numbers are separated by spaces. All input data numbers are integers. The absolute value of all coordinates does not exceed 1000, 1 β€ ri β€ 1000. Several radiators can be located at the same point.
Output
Print the only number β the number of blankets you should bring.
Examples
Input
2 5 4 2
3
3 1 2
5 3 1
1 3 2
Output
4
Input
5 2 6 3
2
6 2 2
6 5 3
Output
0
Note
In the first sample the generals are sitting at points: (2, 2), (2, 3), (2, 4), (2, 5), (3, 2), (3, 5), (4, 2), (4, 3), (4, 4), (4, 5). Among them, 4 generals are located outside the heating range. They are the generals at points: (2, 5), (3, 5), (4, 4), (4, 5).
In the second sample the generals are sitting at points: (5, 2), (5, 3), (6, 2), (6, 3). All of them are located inside the heating range.
Submitted Solution:
```
import sys, math
def ints_input():
return [int(i) for i in sys.stdin.readline().strip("\n").split(" ")]
def print_list(arr):
sys.stdout.writelines(str(x)+" " for x in arr)
sys.stdout.write("\n")
def fast_input(type=str):
return type(sys.stdin.readline().strip("\n"))
x1, y1, x2, y2 = ints_input()
xa = min(x1, x2)
xb = max(x1, x2)
ya = min(y1, y2)
yb = max(y1, y2)
n = fast_input(int)
r = []
for i in range(n):
r.append(tuple(ints_input()))
ans = 0
for i in range(xa, xb + 1):
for j in range(ya, yb+1):
if xa < i < xb and ya < j < yb:
continue
if all(math.sqrt((i - k[0])**2+(j - k[1])**2) > k[2] for k in r):
ans += 1
print(ans)
``` | instruction | 0 | 30,290 | 3 | 60,580 |
Yes | output | 1 | 30,290 | 3 | 60,581 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.