message
stringlengths 2
16.2k
| message_type
stringclasses 2
values | message_id
int64 0
1
| conversation_id
int64 575
109k
| cluster
float64 16
16
| __index_level_0__
int64 1.15k
217k
|
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
N, K = map(int, input().split())
X = list(map(int, input().split()))
ans_ar = []
for i in range(N-K+1):
ans_ar.append(min(abs(X[i]), abs(X[i+K-1])) + (X[i+K-1] - X[i]))
print(min(ans_ar))
```
|
instruction
| 0
| 106,857
| 16
| 213,714
|
Yes
|
output
| 1
| 106,857
| 16
| 213,715
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
N,K=map(int,input().split())
L=list(map(int,input().split()))
ans=1000000010
for i in range(N-K+1):
ans=min(ans,(min(abs(L[i]),abs(L[i+K-1]))+L[i+K-1]-L[i]))
print(ans)
```
|
instruction
| 0
| 106,858
| 16
| 213,716
|
Yes
|
output
| 1
| 106,858
| 16
| 213,717
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
n,k,*a=map(int,open(0).read().split())
print(min(r-l+min(abs(r),abs(l))for l,r in zip(a,a[k-1:])))
```
|
instruction
| 0
| 106,859
| 16
| 213,718
|
Yes
|
output
| 1
| 106,859
| 16
| 213,719
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
n, k, *a = map(int, open(0).read().split())
m = INF = float("inf")
for i in range(n - k + 1):
l, r = a[i], a[i + k - 1]
c = abs(r-l)
m = min(m, min(abs(l) + c, abs(r) + c))
print(m)
```
|
instruction
| 0
| 106,860
| 16
| 213,720
|
Yes
|
output
| 1
| 106,860
| 16
| 213,721
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
import numpy as np
n, k = map(int, input().split())
lst = list(map(int, input().split()))
#array = np.array(lst)
#po_array = array[array>=0]
#ne_array = abs(array[array<0])
#ne_array.sort()
po_array = sorted([x for x in lst if x >= 0])
ne_array = sorted([abs(x) for x in lst if x < 0])
if len(po_array) >= len(ne_array):
long_array = po_array
short_array = ne_array
else:
long_array = ne_array
short_array = po_array
if len(short_array) > k:
min_len = k
else:
min_len = len(short_array)
if min_len == 0:
print(long_array[k-1])
else:
min_dist = 10**10
for i in range(min_len):
if i == k-1:
dist = short_array[i]
else:
dist = min(short_array[i]*2 + long_array[k-i-2], short_array[i] + long_array[k-i-2]*2)
if min_dist > dist:
min_dist = dist
if len(long_array) >= k:
if min_dist > long_array[k-1]:
min_dist = long_array[k-1]
print(min_dist)
```
|
instruction
| 0
| 106,861
| 16
| 213,722
|
No
|
output
| 1
| 106,861
| 16
| 213,723
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
import numpy as np
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
n = len(x)
if 0 in x:
x.remove(0)
k = k - 1
if len(x) == 0:
print(0)
else:
scores = []
xx = np.array(x)
a = xx >= 0
pos = sum(a)
neg = n - pos
pos_ind = a
try:
b = np.where(a)[0][0]
except:
b = 0
if pos >= k:
scores.append(np.sum(xx[pos_ind][k-1]))
# print(scores)
for i in range(min([pos,k])):
if b + i - k + 1 < 0:
break
score = xx[b + i] * 2 - xx[b + i - k + 1]
scores.append(score)
# print(scores)
xx = np.array(x)
xx = - xx
xx = xx[::-1]
a = xx >= 0
pos = sum(a)
neg = n - pos
pos_ind = a
try:
b = np.where(a)[0][0]
except:
b = 0
if pos >= k:
scores.append(np.sum(xx[pos_ind][k-1]))
# print(scores)
for i in range(min([pos,k])):
if b + i - k + 1 < 0:
break
score = xx[b + i] * 2 - xx[b + i - k + 1]
scores.append(score)
# print(scores)
print(np.min(scores))
```
|
instruction
| 0
| 106,862
| 16
| 213,724
|
No
|
output
| 1
| 106,862
| 16
| 213,725
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
N, K = map(int, input().split())
x = list(map(int, input().split()))
dist = []
for i in range(N-K+1):
a = 0
tmp = x[i:i+K]
mini, maxi = tmp[0], tmp[-1]
if (mini >= 0 and maxi >= 0):
a = maxi
elif (mini < 0 and maxi < 0):
a = abs(mixi)
if mini < 0 and maxi >= 0:
a = abs(mixi) + maxi + min(abs(mixi), maxi)
dist.append(a)
print(min(dist))
```
|
instruction
| 0
| 106,863
| 16
| 213,726
|
No
|
output
| 1
| 106,863
| 16
| 213,727
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
Submitted Solution:
```
#coding:utf-8
# n, k = 5, 3
# ls = [-30,-10,10,20,50]
# n,k = 3,2
# ls=[10,20,30]
# n,k = 1,1
# ls = [0]
#n,k=8,5
#ls=[-9,-7,-4,-3,1,2,3,4]
first = -1
for i,point in enumerate(ls):
if point >= 0:
first = i
break
size=k+1
ans = []
for i in range(size):
if first-size+i+1>=0 and first+i-1< len(ls):
temp = [0,ls[first-size+i+1],ls[first+i-1]]
temp = [abs(min(temp)),abs(max(temp))]
ans.append((2*min(temp)+max(temp)))
print (min(ans))
```
|
instruction
| 0
| 106,864
| 16
| 213,728
|
No
|
output
| 1
| 106,864
| 16
| 213,729
|
Provide a correct Python 3 solution for this coding contest problem.
There is a grid with H rows and W columns.
The square at the i-th row and j-th column contains a string S_{i,j} of length 5.
The rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from `A` through the W-th letter of the alphabet.
<image>
Exactly one of the squares in the grid contains the string `snuke`. Find this square and report its location.
For example, the square at the 6-th row and 8-th column should be reported as `H6`.
Constraints
* 1≦H, W≦26
* The length of S_{i,j} is 5.
* S_{i,j} consists of lowercase English letters (`a`-`z`).
* Exactly one of the given strings is equal to `snuke`.
Input
The input is given from Standard Input in the following format:
H W
S_{1,1} S_{1,2} ... S_{1,W}
S_{2,1} S_{2,2} ... S_{2,W}
:
S_{H,1} S_{H,2} ... S_{H,W}
Output
Print the labels of the row and the column of the square containing the string `snuke`, with no space inbetween.
Examples
Input
15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
Output
H6
Input
1 1
snuke
Output
A1
|
instruction
| 0
| 106,913
| 16
| 213,826
|
"Correct Solution:
```
h,w=map(int,input().split())
for i in range(h):
s=list(input().split())
for j in range(w):
if s[j]=="snuke":
print(chr(j+65),i+1,sep="")
```
|
output
| 1
| 106,913
| 16
| 213,827
|
Provide a correct Python 3 solution for this coding contest problem.
There is a grid with H rows and W columns.
The square at the i-th row and j-th column contains a string S_{i,j} of length 5.
The rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from `A` through the W-th letter of the alphabet.
<image>
Exactly one of the squares in the grid contains the string `snuke`. Find this square and report its location.
For example, the square at the 6-th row and 8-th column should be reported as `H6`.
Constraints
* 1≦H, W≦26
* The length of S_{i,j} is 5.
* S_{i,j} consists of lowercase English letters (`a`-`z`).
* Exactly one of the given strings is equal to `snuke`.
Input
The input is given from Standard Input in the following format:
H W
S_{1,1} S_{1,2} ... S_{1,W}
S_{2,1} S_{2,2} ... S_{2,W}
:
S_{H,1} S_{H,2} ... S_{H,W}
Output
Print the labels of the row and the column of the square containing the string `snuke`, with no space inbetween.
Examples
Input
15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
Output
H6
Input
1 1
snuke
Output
A1
|
instruction
| 0
| 106,915
| 16
| 213,830
|
"Correct Solution:
```
H, W = map(int, input().split())
S = [list(input().split()) for _ in range(H)]
for i in range(H):
for j in range(W):
if S[i][j] == 'snuke':
i += 1
j += 65
print(chr(j), i, sep='')
break
```
|
output
| 1
| 106,915
| 16
| 213,831
|
Provide a correct Python 3 solution for this coding contest problem.
There is a grid with H rows and W columns.
The square at the i-th row and j-th column contains a string S_{i,j} of length 5.
The rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from `A` through the W-th letter of the alphabet.
<image>
Exactly one of the squares in the grid contains the string `snuke`. Find this square and report its location.
For example, the square at the 6-th row and 8-th column should be reported as `H6`.
Constraints
* 1≦H, W≦26
* The length of S_{i,j} is 5.
* S_{i,j} consists of lowercase English letters (`a`-`z`).
* Exactly one of the given strings is equal to `snuke`.
Input
The input is given from Standard Input in the following format:
H W
S_{1,1} S_{1,2} ... S_{1,W}
S_{2,1} S_{2,2} ... S_{2,W}
:
S_{H,1} S_{H,2} ... S_{H,W}
Output
Print the labels of the row and the column of the square containing the string `snuke`, with no space inbetween.
Examples
Input
15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
Output
H6
Input
1 1
snuke
Output
A1
|
instruction
| 0
| 106,918
| 16
| 213,836
|
"Correct Solution:
```
H,W=map(int,input().split())
for i in range(H):
s=list(input().split())
for j in range(W):
if s[j]=="snuke":
print(chr(ord("A")+j)+str(i+1))
```
|
output
| 1
| 106,918
| 16
| 213,837
|
Provide a correct Python 3 solution for this coding contest problem.
There is a grid with H rows and W columns.
The square at the i-th row and j-th column contains a string S_{i,j} of length 5.
The rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from `A` through the W-th letter of the alphabet.
<image>
Exactly one of the squares in the grid contains the string `snuke`. Find this square and report its location.
For example, the square at the 6-th row and 8-th column should be reported as `H6`.
Constraints
* 1≦H, W≦26
* The length of S_{i,j} is 5.
* S_{i,j} consists of lowercase English letters (`a`-`z`).
* Exactly one of the given strings is equal to `snuke`.
Input
The input is given from Standard Input in the following format:
H W
S_{1,1} S_{1,2} ... S_{1,W}
S_{2,1} S_{2,2} ... S_{2,W}
:
S_{H,1} S_{H,2} ... S_{H,W}
Output
Print the labels of the row and the column of the square containing the string `snuke`, with no space inbetween.
Examples
Input
15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
Output
H6
Input
1 1
snuke
Output
A1
|
instruction
| 0
| 106,919
| 16
| 213,838
|
"Correct Solution:
```
h,w = map(int,input().split())
l = [list(map(str,input().split())) for i in range(h)]
m = [chr(i) for i in range(ord('A'),ord('Z'))]
for i in range(h):
for j in range(w):
if l[i][j] == 'snuke':
print(m[j] + str(i + 1))
break
```
|
output
| 1
| 106,919
| 16
| 213,839
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke Festival 2017 will be held in a tree with N vertices numbered 1,2, ...,N. The i-th edge connects Vertex a_i and b_i, and has joyfulness c_i.
The staff is Snuke and N-1 black cats. Snuke will set up the headquarters in some vertex, and from there he will deploy a cat to each of the other N-1 vertices.
For each vertex, calculate the niceness when the headquarters are set up in that vertex. The niceness when the headquarters are set up in Vertex i is calculated as follows:
* Let X=0.
* For each integer j between 1 and N (inclusive) except i, do the following:
* Add c to X, where c is the smallest joyfulness of an edge on the path from Vertex i to Vertex j.
* The niceness is the final value of X.
Constraints
* 1 \leq N \leq 10^{5}
* 1 \leq a_i,b_i \leq N
* 1 \leq c_i \leq 10^{9}
* The given graph is a tree.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 b_1 c_1
:
a_{N-1} b_{N-1} c_{N-1}
Output
Print N lines. The i-th line must contain the niceness when the headquarters are set up in Vertex i.
Examples
Input
3
1 2 10
2 3 20
Output
20
30
30
Input
15
6 3 2
13 3 1
1 13 2
7 1 2
8 1 1
2 8 2
2 12 2
5 2 2
2 11 2
10 2 2
10 9 1
9 14 2
4 14 1
11 15 2
Output
16
20
15
14
20
15
16
20
15
20
20
20
16
15
20
Input
19
19 14 48
11 19 23
17 14 30
7 11 15
2 19 15
2 18 21
19 10 43
12 11 25
3 11 4
5 19 50
4 11 19
9 12 29
14 13 3
14 6 12
14 15 14
5 1 6
8 18 13
7 16 14
Output
103
237
71
263
370
193
231
207
299
358
295
299
54
368
220
220
319
237
370
|
instruction
| 0
| 108,507
| 16
| 217,014
|
"Correct Solution:
```
import sys
from operator import itemgetter
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
class UnionFind:
def __init__(self, N):
self.root = list(range(N + 1))
def __getitem__(self, x):
root = self.root
while root[x] != x:
root[x] = root[root[x]]
x = root[x]
return x
def merge(self, x, y):
x = self[x]
y = self[y]
if x == y:
return
# 番号の大きい頂点を根にする
if x < y:
x, y = y, x
self.root[y] = x
N = int(readline())
m = map(int, read().split())
ABC = sorted(zip(m, m, m), key=itemgetter(2), reverse=True)
uf = UnionFind(N + N)
parent = [0] * (N + N)
value = [0] * (N + N)
for n, (a, b, c) in enumerate(ABC, N + 1):
ra = uf[a]
rb = uf[b]
parent[ra] = n
parent[rb] = n
value[n] = c
uf.merge(ra, n)
uf.merge(rb, n)
size = [0] + [1] * N + [0] * (N - 1)
for n in range(N + N):
p = parent[n]
size[p] += size[n]
for n in range(N + N):
p = parent[n]
value[n] = 0
if not p:
continue
value[n] = value[p] * (size[p] - size[n])
for n in range(N + N - 2, 0, -1):
p = parent[n]
value[n] += value[p]
print('\n'.join(map(str, value[1:N + 1])))
```
|
output
| 1
| 108,507
| 16
| 217,015
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke Festival 2017 will be held in a tree with N vertices numbered 1,2, ...,N. The i-th edge connects Vertex a_i and b_i, and has joyfulness c_i.
The staff is Snuke and N-1 black cats. Snuke will set up the headquarters in some vertex, and from there he will deploy a cat to each of the other N-1 vertices.
For each vertex, calculate the niceness when the headquarters are set up in that vertex. The niceness when the headquarters are set up in Vertex i is calculated as follows:
* Let X=0.
* For each integer j between 1 and N (inclusive) except i, do the following:
* Add c to X, where c is the smallest joyfulness of an edge on the path from Vertex i to Vertex j.
* The niceness is the final value of X.
Constraints
* 1 \leq N \leq 10^{5}
* 1 \leq a_i,b_i \leq N
* 1 \leq c_i \leq 10^{9}
* The given graph is a tree.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 b_1 c_1
:
a_{N-1} b_{N-1} c_{N-1}
Output
Print N lines. The i-th line must contain the niceness when the headquarters are set up in Vertex i.
Examples
Input
3
1 2 10
2 3 20
Output
20
30
30
Input
15
6 3 2
13 3 1
1 13 2
7 1 2
8 1 1
2 8 2
2 12 2
5 2 2
2 11 2
10 2 2
10 9 1
9 14 2
4 14 1
11 15 2
Output
16
20
15
14
20
15
16
20
15
20
20
20
16
15
20
Input
19
19 14 48
11 19 23
17 14 30
7 11 15
2 19 15
2 18 21
19 10 43
12 11 25
3 11 4
5 19 50
4 11 19
9 12 29
14 13 3
14 6 12
14 15 14
5 1 6
8 18 13
7 16 14
Output
103
237
71
263
370
193
231
207
299
358
295
299
54
368
220
220
319
237
370
Submitted Solution:
```
import sys
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b, c = map(int, input().split())
G[a-1].append((b-1, c))
G[b-1].append((a-1, c))
memo = {}
def dfs(u, p, co):
if (u, p, co) in memo:
return memo[u, p, co]
res = co
for v, c in G[u]:
if v == p:
continue
res += dfs(v, u, min(co, c))
memo[u, p, co] = res
return res
for i in range(N):
INF = 10**18
print(dfs(i, -1, INF) - INF)
```
|
instruction
| 0
| 108,508
| 16
| 217,016
|
No
|
output
| 1
| 108,508
| 16
| 217,017
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke Festival 2017 will be held in a tree with N vertices numbered 1,2, ...,N. The i-th edge connects Vertex a_i and b_i, and has joyfulness c_i.
The staff is Snuke and N-1 black cats. Snuke will set up the headquarters in some vertex, and from there he will deploy a cat to each of the other N-1 vertices.
For each vertex, calculate the niceness when the headquarters are set up in that vertex. The niceness when the headquarters are set up in Vertex i is calculated as follows:
* Let X=0.
* For each integer j between 1 and N (inclusive) except i, do the following:
* Add c to X, where c is the smallest joyfulness of an edge on the path from Vertex i to Vertex j.
* The niceness is the final value of X.
Constraints
* 1 \leq N \leq 10^{5}
* 1 \leq a_i,b_i \leq N
* 1 \leq c_i \leq 10^{9}
* The given graph is a tree.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 b_1 c_1
:
a_{N-1} b_{N-1} c_{N-1}
Output
Print N lines. The i-th line must contain the niceness when the headquarters are set up in Vertex i.
Examples
Input
3
1 2 10
2 3 20
Output
20
30
30
Input
15
6 3 2
13 3 1
1 13 2
7 1 2
8 1 1
2 8 2
2 12 2
5 2 2
2 11 2
10 2 2
10 9 1
9 14 2
4 14 1
11 15 2
Output
16
20
15
14
20
15
16
20
15
20
20
20
16
15
20
Input
19
19 14 48
11 19 23
17 14 30
7 11 15
2 19 15
2 18 21
19 10 43
12 11 25
3 11 4
5 19 50
4 11 19
9 12 29
14 13 3
14 6 12
14 15 14
5 1 6
8 18 13
7 16 14
Output
103
237
71
263
370
193
231
207
299
358
295
299
54
368
220
220
319
237
370
Submitted Solution:
```
import sys
def solve():
n = int(sys.stdin.readline())
adj = [[] for i in range(n + 1)]
dp = [dict() for i in range(n + 1)]
cnt = [dict() for i in range(n + 1)]
for i in range(n - 1):
ai, bi, ci = map(int, sys.stdin.readline().split())
if ci > 2:
return
adj[ai].append((bi, ci))
adj[bi].append((ai, ci))
def cnt_node(v, p):
if p in cnt[v]:
return cnt[v][p]
cnt[v][p] = 1
for (u, c) in adj[v]:
if u == p:
continue
cnt[v][p] += cnt_node(u, v)
return cnt[v][p]
def dfs(v, p):
if p in dp[v]:
return dp[v][p]
dp[v][p] = 0
for (u, c) in adj[v]:
if u == p:
continue
if c == 1:
dp[v][p] += cnt_node(u, v)
else:
dp[v][p] += dfs(u, v) + 2
return dp[v][p]
for i in range(1, n + 1):
# print(dp)
# print(cnt)
ans = dfs(i, -1)
print(ans)
if __name__ == '__main__':
solve()
```
|
instruction
| 0
| 108,509
| 16
| 217,018
|
No
|
output
| 1
| 108,509
| 16
| 217,019
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke Festival 2017 will be held in a tree with N vertices numbered 1,2, ...,N. The i-th edge connects Vertex a_i and b_i, and has joyfulness c_i.
The staff is Snuke and N-1 black cats. Snuke will set up the headquarters in some vertex, and from there he will deploy a cat to each of the other N-1 vertices.
For each vertex, calculate the niceness when the headquarters are set up in that vertex. The niceness when the headquarters are set up in Vertex i is calculated as follows:
* Let X=0.
* For each integer j between 1 and N (inclusive) except i, do the following:
* Add c to X, where c is the smallest joyfulness of an edge on the path from Vertex i to Vertex j.
* The niceness is the final value of X.
Constraints
* 1 \leq N \leq 10^{5}
* 1 \leq a_i,b_i \leq N
* 1 \leq c_i \leq 10^{9}
* The given graph is a tree.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 b_1 c_1
:
a_{N-1} b_{N-1} c_{N-1}
Output
Print N lines. The i-th line must contain the niceness when the headquarters are set up in Vertex i.
Examples
Input
3
1 2 10
2 3 20
Output
20
30
30
Input
15
6 3 2
13 3 1
1 13 2
7 1 2
8 1 1
2 8 2
2 12 2
5 2 2
2 11 2
10 2 2
10 9 1
9 14 2
4 14 1
11 15 2
Output
16
20
15
14
20
15
16
20
15
20
20
20
16
15
20
Input
19
19 14 48
11 19 23
17 14 30
7 11 15
2 19 15
2 18 21
19 10 43
12 11 25
3 11 4
5 19 50
4 11 19
9 12 29
14 13 3
14 6 12
14 15 14
5 1 6
8 18 13
7 16 14
Output
103
237
71
263
370
193
231
207
299
358
295
299
54
368
220
220
319
237
370
Submitted Solution:
```
N = int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b, c = map(int, input().split())
G[a-1].append((b-1, c))
G[b-1].append((a-1, c))
memo = {}
def dfs(u, p, co):
if (u, p, co) in memo:
return memo[u, p, co]
res = co
for v, c in G[u]:
if v == p:
continue
res += dfs(v, u, min(co, c))
memo[u, p, co] = res
return res
for i in range(N):
INF = 10**18
print(dfs(i, -1, INF) - INF)
```
|
instruction
| 0
| 108,510
| 16
| 217,020
|
No
|
output
| 1
| 108,510
| 16
| 217,021
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke Festival 2017 will be held in a tree with N vertices numbered 1,2, ...,N. The i-th edge connects Vertex a_i and b_i, and has joyfulness c_i.
The staff is Snuke and N-1 black cats. Snuke will set up the headquarters in some vertex, and from there he will deploy a cat to each of the other N-1 vertices.
For each vertex, calculate the niceness when the headquarters are set up in that vertex. The niceness when the headquarters are set up in Vertex i is calculated as follows:
* Let X=0.
* For each integer j between 1 and N (inclusive) except i, do the following:
* Add c to X, where c is the smallest joyfulness of an edge on the path from Vertex i to Vertex j.
* The niceness is the final value of X.
Constraints
* 1 \leq N \leq 10^{5}
* 1 \leq a_i,b_i \leq N
* 1 \leq c_i \leq 10^{9}
* The given graph is a tree.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 b_1 c_1
:
a_{N-1} b_{N-1} c_{N-1}
Output
Print N lines. The i-th line must contain the niceness when the headquarters are set up in Vertex i.
Examples
Input
3
1 2 10
2 3 20
Output
20
30
30
Input
15
6 3 2
13 3 1
1 13 2
7 1 2
8 1 1
2 8 2
2 12 2
5 2 2
2 11 2
10 2 2
10 9 1
9 14 2
4 14 1
11 15 2
Output
16
20
15
14
20
15
16
20
15
20
20
20
16
15
20
Input
19
19 14 48
11 19 23
17 14 30
7 11 15
2 19 15
2 18 21
19 10 43
12 11 25
3 11 4
5 19 50
4 11 19
9 12 29
14 13 3
14 6 12
14 15 14
5 1 6
8 18 13
7 16 14
Output
103
237
71
263
370
193
231
207
299
358
295
299
54
368
220
220
319
237
370
Submitted Solution:
```
import sys
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for i in range(N)]
mc = 100
for i in range(N-1):
a, b, c = map(int, input().split())
G[a-1].append((b-1, c))
G[b-1].append((a-1, c))
mc = min(c, mc)
if N <= 1000:
memo = {}
def dfs(u, p, co):
if (u, p, co) in memo:
return memo[u, p, co]
res = co
for v, c in G[u]:
if v == p:
continue
res += dfs(v, u, min(co, c))
memo[u, p, co] = res
return res
for i in range(N):
INF = 10**18
print(dfs(i, -1, INF) - INF)
elif mc <= 2:
used = [0]*N
gu = 0
g = [-1]
def dfs(u, p):
used[i] = gu
res = 1
for v, c in G[v]:
if c == 2:
res += dfs(v, u)
return res
for i in range(N):
if not used[i]:
gu += 1
nn = dfs(i, -1)
g.append(nn)
else:
nn = g[used[i]]
print(N + nn)
else:
exit(1)
```
|
instruction
| 0
| 108,511
| 16
| 217,022
|
No
|
output
| 1
| 108,511
| 16
| 217,023
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.