id
stringlengths 6
117
| description
stringlengths 29
13k
| code
stringlengths 9
465k
| language
class label 4
classes | test_samples
sequence | source
class label 5
classes |
|---|---|---|---|---|---|
1421_D. Hexagons_37900 | Lindsey Buckingham told Stevie Nicks ["Go your own way"](https://www.youtube.com/watch?v=6ul-cZyuYq4). Nicks is now sad and wants to go away as quickly as possible, but she lives in a 2D hexagonal world.
Consider a hexagonal tiling of the plane as on the picture below.
<image>
Nicks wishes to go from the cell marked (0, 0) to a certain cell given by the coordinates. She may go from a hexagon to any of its six neighbors you want, but there is a cost associated with each of them. The costs depend only on the direction in which you travel. Going from (0, 0) to (1, 1) will take the exact same cost as going from (-2, -1) to (-1, 0). The costs are given in the input in the order c_1, c_2, c_3, c_4, c_5, c_6 as in the picture below.
<image>
Print the smallest cost of a path from the origin which has coordinates (0, 0) to the given cell.
Input
Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^{4}). Description of the test cases follows.
The first line of each test case contains two integers x and y (-10^{9} ≤ x, y ≤ 10^{9}) representing the coordinates of the target hexagon.
The second line of each test case contains six integers c_1, c_2, c_3, c_4, c_5, c_6 (1 ≤ c_1, c_2, c_3, c_4, c_5, c_6 ≤ 10^{9}) representing the six costs of the making one step in a particular direction (refer to the picture above to see which edge is for each value).
Output
For each testcase output the smallest cost of a path from the origin to the given cell.
Example
Input
2
-3 1
1 3 5 7 9 11
1000000000 1000000000
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
18
1000000000000000000
Note
The picture below shows the solution for the first sample. The cost 18 is reached by taking c_3 3 times and c_2 once, amounting to 5+5+5+3=18.
<image> | import sys
input=sys.stdin.buffer.readline #FOR READING PURE INTEGER INPUTS (space separation ok)
#import sys
#input=lambda: sys.stdin.readline().rstrip("\r\n") #FOR READING STRING/TEXT INPUTS.
def oneLineArrayPrint(arr):
print(' '.join([str(x) for x in arr]))
def multiLineArrayPrint(arr):
print('\n'.join([str(x) for x in arr]))
def multiLineArrayOfArraysPrint(arr):
print('\n'.join([' '.join([str(x) for x in y]) for y in arr]))
import heapq,collections
def getSurroundings(i,j,currCost):
return [(i+1,j+1,currCost+c1),
(i,j+1,currCost+c2),
(i-1,j,currCost+c3),
(i-1,j-1,currCost+c4),
(i,j-1,currCost+c5),
(i+1,j,currCost+c6)]
allAns=[]
t=int(input())
for _ in range(t):
x,y=[int(z) for z in input().split()]
c1,c2,c3,c4,c5,c6=[int(z) for z in input().split()]
minDist=collections.defaultdict(lambda:-1) #{(x,y):minDist}
queue=[(0,(0,0))] #(cost,(i,j))
coverCnts=0
while coverCnts<6: #Dijkstra
cost,(i,j)=heapq.heappop(queue)
if minDist[(i,j)]==-1:
minDist[(i,j)]=cost
if (i,j) in {(1,1),(0,1),(-1,0),(-1,-1),(0,-1),(1,0)}:
coverCnts+=1
for iNext,jNext,costNext in getSurroundings(i,j,cost):
if minDist[(iNext,jNext)]==-1 and abs(iNext)<=3 and abs(jNext)<=3: #search space of i and j need not exceed 3
heapq.heappush(queue,(costNext,(iNext,jNext)))
c1,c2,c3,c4,c5,c6=[minDist[(1,1)],minDist[(0,1)],minDist[(-1,0)],
minDist[(-1,-1)],minDist[(0,-1)],minDist[(1,0)]]
#try to get to x,y using a combination of 2 out of 3 axes:
#axis1:y=0 (x only)
#axis2:x=0(y only)
#axis3:x-y=0(x and y)
ans=float('inf')
#axes 1 and 3
t=y
s=x-t
ans2=0
if t>=0:ans2+=c1*abs(t)
else:ans2+=c4*abs(t)
if s>=0:ans2+=c6*abs(s)
else:ans2+=c3*abs(s)
ans=min(ans,ans2)
#axes 1 and 2
s=x
t=y
ans2=0
if s>=0:ans2+=c6*abs(s)
else:ans2+=c3*abs(s)
if t>=0:ans2+=c2*abs(t)
else:ans2+=c5*abs(t)
ans=min(ans,ans2)
#axes 2 and 3
t=x
s=y-t
ans2=0
if s>=0:ans2+=c2*abs(s)
else:ans2+=c5*abs(s)
if t>=0:ans2+=c1*abs(t)
else:ans2+=c4*abs(t)
ans=min(ans,ans2)
allAns.append(ans)
multiLineArrayPrint(allAns)
| 3Python3
| {
"input": [
"2\n-3 1\n1 3 5 7 9 11\n1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n",
"1\n-1000000000 -1000000000\n10000 20000 30000 40000 50000 60000\n",
"1\n0 0\n1 2 3 4 5 6\n",
"1\n-1000000000 -1000000000\n10000 20000 30000 40000 81069 60000\n",
"1\n-1 0\n1 2 3 4 5 6\n",
"2\n-3 1\n1 3 5 7 9 11\n1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"1\n-1 0\n1 2 6 4 5 6\n",
"2\n-3 0\n1 3 5 7 9 11\n1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"1\n-1 0\n1 2 4 4 5 6\n",
"2\n-3 0\n1 3 5 7 9 11\n1000000000 1000000001\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"2\n-3 0\n1 3 5 1 9 11\n1000000000 1000000001\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"1\n-1000000000 -1000000000\n11001 26694 30000 64355 150105 60000\n",
"2\n-3 0\n1 3 5 1 9 2\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-467245163 -1000000000\n11001 26694 30000 64355 150105 60000\n",
"1\n-1 0\n1 0 3 0 11 6\n",
"2\n-1 0\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-467245163 -1000000000\n11001 26694 8969 64355 150105 28865\n",
"2\n-1 1\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-587542488 -1000000000\n10001 26694 8969 64355 150105 28865\n",
"2\n-1 1\n1 5 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-587542488 -1563720223\n10001 26694 8969 64355 150105 28865\n",
"2\n-1 1\n1 5 0 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-587542488 -1563720223\n10001 47206 8969 64355 150105 29973\n",
"2\n-1 1\n1 5 0 1 18 3\n1000000000 1010000001\n1000000000 1001000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-267045550 -1563720223\n10001 47206 8969 64355 150105 29973\n",
"1\n0 -1\n2 0 0 0 10 11\n",
"2\n-1 1\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-267045550 -1563720223\n10001 89515 8969 64355 53530 29973\n",
"1\n-267045550 -1159646004\n10001 89515 8969 64355 53530 29973\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1100000001 1000000000\n",
"1\n-267045550 -1159646004\n10000 89515 15678 102403 53530 29973\n",
"1\n-267045550 -1159646004\n10000 89515 6903 102403 53530 29973\n",
"1\n0 -1\n4 1 1 1 5 10\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n-267045550 -1159646004\n10000 89515 6903 102403 76333 29973\n",
"2\n-2 2\n2 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n-267045550 -1159646004\n10000 89515 6903 102403 98822 29973\n",
"2\n-2 2\n4 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 98822 29973\n",
"2\n-2 2\n4 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 33593 29973\n",
"1\n0 -4\n4 2 1 2 5 10\n",
"2\n-2 2\n3 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 7183 29973\n",
"2\n-2 2\n3 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"2\n-4 2\n3 5 0 1 23 3\n1010000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 100948 4533 102403 7183 75514\n",
"1\n-267045550 -1415424985\n10000 100948 4533 102403 7183 75514\n",
"1\n-1000000000 -1000000000\n10000 20000 30000 40000 161306 60000\n",
"1\n-1000000000 -1000000000\n10000 26694 30000 40000 161306 60000\n",
"1\n-1000000000 -1000000000\n10001 26694 30000 40000 161306 60000\n",
"1\n-1 0\n1 2 4 4 7 6\n",
"1\n-1000000000 -1000000000\n10001 26694 30000 40000 150105 60000\n",
"1\n-1 0\n1 4 4 4 7 6\n",
"2\n-3 0\n1 3 5 1 9 11\n1000000000 1000000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-1000000000 -1000000000\n11001 26694 30000 40000 150105 60000\n",
"1\n-1 0\n1 4 4 4 11 6\n",
"2\n-3 0\n1 3 5 1 9 2\n1000000000 1000000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-1 0\n1 0 4 4 11 6\n",
"1\n-1 0\n1 0 3 4 11 6\n",
"2\n-3 0\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-467245163 -1000000000\n11001 26694 8969 64355 150105 60000\n",
"1\n0 0\n1 0 3 0 11 6\n",
"1\n-467245163 -1000000000\n10001 26694 8969 64355 150105 28865\n",
"1\n0 -1\n1 0 3 0 11 6\n",
"2\n-1 1\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-1 -1\n1 0 3 0 11 6\n",
"1\n0 -1\n1 0 3 0 9 6\n",
"1\n-587542488 -1563720223\n10001 47206 8969 64355 150105 28865\n",
"1\n0 -1\n1 0 3 0 10 6\n",
"2\n-1 1\n1 5 0 1 18 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n0 -1\n2 0 3 0 10 6\n",
"1\n0 -1\n2 0 0 0 10 6\n",
"2\n-1 1\n1 5 0 1 27 3\n1000000000 1010000001\n1000000000 1001000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-267045550 -1563720223\n10001 89515 8969 64355 150105 29973\n",
"1\n0 -1\n2 0 0 1 10 11\n",
"2\n-1 1\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1100000001 1000000000\n",
"1\n0 -1\n2 1 0 1 10 11\n",
"2\n-2 1\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1100000001 1000000000\n",
"1\n-267045550 -1159646004\n10001 89515 8969 102403 53530 29973\n",
"1\n0 -1\n4 1 0 1 10 11\n",
"1\n-267045550 -1159646004\n10000 89515 8969 102403 53530 29973\n",
"1\n0 -1\n4 1 0 1 10 10\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1000000001 1000000000\n",
"1\n0 -1\n4 1 1 1 10 10\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n0 -1\n4 2 1 1 5 10\n",
"1\n0 -1\n4 2 1 2 5 10\n",
"1\n0 -2\n4 2 1 2 5 10\n",
"1\n0 -4\n4 2 1 2 5 14\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 7183 41796\n",
"1\n0 -1\n4 2 1 2 5 14\n",
"2\n-2 2\n3 5 0 1 23 3\n1000000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 100948 6903 102403 7183 41796\n",
"1\n0 -1\n7 2 1 2 5 14\n",
"2\n-4 2\n3 5 0 1 23 3\n1000000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 100948 6903 102403 7183 75514\n",
"1\n0 -1\n7 2 1 2 0 14\n",
"1\n0 -1\n7 2 2 2 0 14\n",
"2\n-4 2\n3 5 0 1 23 4\n1010000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n0 -1\n1 2 2 2 0 14\n",
"2\n-4 2\n3 5 0 1 23 1\n1010000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -1415424985\n00000 100948 4533 102403 7183 75514\n"
],
"output": [
"18\n1000000000000000000\n",
"40000000000000\n",
"0\n",
"40000000000000\n",
"3\n",
"18\n1000000000000000000\n",
"6\n",
"15\n1000000000000000000\n",
"4\n",
"15\n1000000001000000000\n",
"12\n1000000001000000000\n",
"64355000000000\n",
"12\n1010000001000000000\n",
"96320290220000\n",
"0\n",
"4\n1010000001000000000\n",
"79732968370005\n",
"7\n1010000001000000000\n",
"76260586083880\n",
"10\n1010000001000000000\n",
"128810585271940\n",
"1\n1010000001000000000\n",
"129892190202320\n",
"1\n1010010001001000000\n",
"139498444924994\n",
"10\n",
"1\n1000000001001000000\n",
"86101075075140\n",
"64470982132070\n",
"2\n1000000001001000000\n",
"66262590727020\n",
"63919266025770\n",
"5\n",
"2\n1000000000\n",
"90362673854982\n",
"4\n1000000000\n",
"115554827521838\n",
"8\n1000000000\n",
"86404713598006\n",
"8\n1000000010\n",
"30890276354114\n",
"20\n",
"6\n1000000010\n",
"8054340386434\n",
"6\n1001000000\n",
"6\n9999999000000000\n",
"7421442432934\n",
"11377515145405\n",
"40000000000000\n",
"40000000000000\n",
"40000000000000\n",
"4\n",
"40000000000000\n",
"4\n",
"12\n1000000001000000000\n",
"40000000000000\n",
"4\n",
"12\n1000000001000000000\n",
"4\n",
"3\n",
"12\n1010000001000000000\n",
"96320290220000\n",
"0\n",
"79732968370005\n",
"6\n",
"7\n1010000001000000000\n",
"0\n",
"6\n",
"128810585271940\n",
"6\n",
"1\n1010000001000000000\n",
"6\n",
"6\n",
"1\n1010010001001000000\n",
"139498444924994\n",
"10\n",
"1\n1000000001001000000\n",
"10\n",
"1\n1000000001001000000\n",
"64470982132070\n",
"10\n",
"64470982132070\n",
"10\n",
"2\n1000000001001000000\n",
"10\n",
"2\n1000000001001000000\n",
"5\n",
"5\n",
"10\n",
"20\n",
"8054340386434\n",
"5\n",
"6\n1001000000\n",
"8054340386434\n",
"5\n",
"6\n1001000000\n",
"8054340386434\n",
"0\n",
"0\n",
"6\n9999999000000000\n",
"0\n",
"6\n9999999000000000\n",
"11377515145405\n"
]
} | 2CODEFORCES
|
1421_D. Hexagons_37901 | Lindsey Buckingham told Stevie Nicks ["Go your own way"](https://www.youtube.com/watch?v=6ul-cZyuYq4). Nicks is now sad and wants to go away as quickly as possible, but she lives in a 2D hexagonal world.
Consider a hexagonal tiling of the plane as on the picture below.
<image>
Nicks wishes to go from the cell marked (0, 0) to a certain cell given by the coordinates. She may go from a hexagon to any of its six neighbors you want, but there is a cost associated with each of them. The costs depend only on the direction in which you travel. Going from (0, 0) to (1, 1) will take the exact same cost as going from (-2, -1) to (-1, 0). The costs are given in the input in the order c_1, c_2, c_3, c_4, c_5, c_6 as in the picture below.
<image>
Print the smallest cost of a path from the origin which has coordinates (0, 0) to the given cell.
Input
Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^{4}). Description of the test cases follows.
The first line of each test case contains two integers x and y (-10^{9} ≤ x, y ≤ 10^{9}) representing the coordinates of the target hexagon.
The second line of each test case contains six integers c_1, c_2, c_3, c_4, c_5, c_6 (1 ≤ c_1, c_2, c_3, c_4, c_5, c_6 ≤ 10^{9}) representing the six costs of the making one step in a particular direction (refer to the picture above to see which edge is for each value).
Output
For each testcase output the smallest cost of a path from the origin to the given cell.
Example
Input
2
-3 1
1 3 5 7 9 11
1000000000 1000000000
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
18
1000000000000000000
Note
The picture below shows the solution for the first sample. The cost 18 is reached by taking c_3 3 times and c_2 once, amounting to 5+5+5+3=18.
<image> | import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.StringTokenizer;
import java.util.stream.Collectors;
public class A {
void solve() {
long y = in.nextInt();
long x = in.nextInt();
long dUp = in.nextInt();
long right = in.nextInt();
long down = in.nextInt();
long dDown = in.nextInt();
long left = in.nextInt();
long up = in.nextInt();
long cost = 0;
if (x >= 0 && y >= 0) {
if (dUp <= up + right) {
long tmp = Math.min(x, y);
cost += dUp * tmp;
x -= tmp;
y -= tmp;
}
cost += x * Math.min(right, dUp + down);
cost += y * Math.min(up, dUp + left);
} else if (x >= 0 && y <= 0) {
y = -y;
cost += x * Math.min(right, dUp + down);
cost += y * Math.min(down, dDown + right);
} else if (x <= 0 && y <= 0) {
x = -x;
y = -y;
if (dDown <= down + left) {
long tmp = Math.min(x, y);
cost += tmp * dDown;
x -= tmp;
y -= tmp;
}
cost += x * Math.min(left, dDown + up);
cost += y * Math.min(down, dDown + right);
} else if (x <= 0 && y >= 0) {
x = -x;
cost += x * Math.min(left, dDown + up);
cost += y * Math.min(up, dUp + left);
} else {
throw new RuntimeException();
}
out.println(cost);
}
static final boolean MULTI_TEST = true;
// --------------------------------------------------------------------------------------------------------------
// --------------------------------------------------HELPER------------------------------------------------------
// --------------------------------------------------------------------------------------------------------------
void run() {
if (MULTI_TEST) {
int t = in.nextInt();
for (int i = 0; i < t; i++) {
solve();
}
} else {
solve();
}
}
// --------------------ALGORITHM-------------------------
static int MOD = 1000000007;
public void sort(int[] arr) {
List<Integer> tmp = Arrays.stream(arr).boxed().sorted().collect(Collectors.toList());
for (int i = 0; i < arr.length; i++) {
arr[i] = tmp.get(i);
}
}
public void sortRev(int[] arr) {
List<Integer> tmp = Arrays.stream(arr).boxed().sorted(Comparator.comparing((Integer x) -> x).reversed())
.collect(Collectors.toList());
for (int i = 0; i < arr.length; i++) {
arr[i] = tmp.get(i);
}
}
// --------------------SCANNER-------------------------
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner(String fileName) {
if (fileName != null) {
try {
br = new BufferedReader(new FileReader(fileName));
} catch (FileNotFoundException e) {
throw new RuntimeException(e);
}
} else {
br = new BufferedReader(new InputStreamReader(System.in));
}
}
String next() {
while (st == null || !st.hasMoreElements()) {
st = new StringTokenizer(nextLine());
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int[] nextInts(int n) {
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = nextInt();
}
return arr;
}
boolean[] nextLineBools() {
String line = nextLine();
int n = line.length();
boolean[] booleans = new boolean[n];
for (int i = 0; i < n; i++) {
booleans[i] = line.charAt(i) == '1';
}
return booleans;
}
long nextLong() {
return Long.parseLong(next());
}
public long[] nextLongs(int n) {
long[] arr = new long[n];
for (int i = 0; i < n; i++) {
arr[i] = nextLong();
}
return arr;
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
try {
String line = br.readLine();
if (line == null) {
throw new RuntimeException("empty line");
}
return line;
} catch (IOException e) {
throw new RuntimeException(e);
}
}
}
// --------------------WRITER-------------------------
public static class MyWriter extends PrintWriter {
public static MyWriter of(String fileName) {
if (fileName != null) {
try {
return new MyWriter(new FileWriter(fileName));
} catch (IOException e) {
throw new RuntimeException(e);
}
} else {
return new MyWriter(new BufferedOutputStream(System.out));
}
}
public MyWriter(FileWriter fileWriter) {
super(fileWriter);
}
public MyWriter(OutputStream out) {
super(out);
}
void println(int[] arr) {
String line = Arrays.stream(arr).mapToObj(String::valueOf).collect(Collectors.joining(" "));
println(line);
}
}
// -----------------------BENCHMARK-------------------------
public static class Benchmark {
long time;
public void reset() {
time = System.currentTimeMillis();
}
public long calc() {
long curTime = System.currentTimeMillis();
long tmp = curTime - time;
time = curTime;
return tmp;
}
}
// --------------------MAIN-------------------------
public MyScanner in;
public MyWriter out;
public Benchmark bm;
/**
* add `-Xss256m` to increase stack size
*/
public static void main(String[] args) {
boolean local = args.length > 0;
String input = local ? "a/a.in" : null;
A m = new A();
m.in = new MyScanner(input);
m.out = MyWriter.of(null);
m.bm = new Benchmark();
m.run();
m.out.close();
}
}
| 4JAVA
| {
"input": [
"2\n-3 1\n1 3 5 7 9 11\n1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n",
"1\n-1000000000 -1000000000\n10000 20000 30000 40000 50000 60000\n",
"1\n0 0\n1 2 3 4 5 6\n",
"1\n-1000000000 -1000000000\n10000 20000 30000 40000 81069 60000\n",
"1\n-1 0\n1 2 3 4 5 6\n",
"2\n-3 1\n1 3 5 7 9 11\n1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"1\n-1 0\n1 2 6 4 5 6\n",
"2\n-3 0\n1 3 5 7 9 11\n1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"1\n-1 0\n1 2 4 4 5 6\n",
"2\n-3 0\n1 3 5 7 9 11\n1000000000 1000000001\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"2\n-3 0\n1 3 5 1 9 11\n1000000000 1000000001\n1000000000 1000000000 1000000000 1000000000 1100000000 1000000000\n",
"1\n-1000000000 -1000000000\n11001 26694 30000 64355 150105 60000\n",
"2\n-3 0\n1 3 5 1 9 2\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-467245163 -1000000000\n11001 26694 30000 64355 150105 60000\n",
"1\n-1 0\n1 0 3 0 11 6\n",
"2\n-1 0\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-467245163 -1000000000\n11001 26694 8969 64355 150105 28865\n",
"2\n-1 1\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-587542488 -1000000000\n10001 26694 8969 64355 150105 28865\n",
"2\n-1 1\n1 5 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-587542488 -1563720223\n10001 26694 8969 64355 150105 28865\n",
"2\n-1 1\n1 5 0 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-587542488 -1563720223\n10001 47206 8969 64355 150105 29973\n",
"2\n-1 1\n1 5 0 1 18 3\n1000000000 1010000001\n1000000000 1001000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-267045550 -1563720223\n10001 47206 8969 64355 150105 29973\n",
"1\n0 -1\n2 0 0 0 10 11\n",
"2\n-1 1\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-267045550 -1563720223\n10001 89515 8969 64355 53530 29973\n",
"1\n-267045550 -1159646004\n10001 89515 8969 64355 53530 29973\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1100000001 1000000000\n",
"1\n-267045550 -1159646004\n10000 89515 15678 102403 53530 29973\n",
"1\n-267045550 -1159646004\n10000 89515 6903 102403 53530 29973\n",
"1\n0 -1\n4 1 1 1 5 10\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n-267045550 -1159646004\n10000 89515 6903 102403 76333 29973\n",
"2\n-2 2\n2 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n-267045550 -1159646004\n10000 89515 6903 102403 98822 29973\n",
"2\n-2 2\n4 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 98822 29973\n",
"2\n-2 2\n4 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 33593 29973\n",
"1\n0 -4\n4 2 1 2 5 10\n",
"2\n-2 2\n3 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1000000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 7183 29973\n",
"2\n-2 2\n3 5 0 1 27 3\n1000000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"2\n-4 2\n3 5 0 1 23 3\n1010000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 100948 4533 102403 7183 75514\n",
"1\n-267045550 -1415424985\n10000 100948 4533 102403 7183 75514\n",
"1\n-1000000000 -1000000000\n10000 20000 30000 40000 161306 60000\n",
"1\n-1000000000 -1000000000\n10000 26694 30000 40000 161306 60000\n",
"1\n-1000000000 -1000000000\n10001 26694 30000 40000 161306 60000\n",
"1\n-1 0\n1 2 4 4 7 6\n",
"1\n-1000000000 -1000000000\n10001 26694 30000 40000 150105 60000\n",
"1\n-1 0\n1 4 4 4 7 6\n",
"2\n-3 0\n1 3 5 1 9 11\n1000000000 1000000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-1000000000 -1000000000\n11001 26694 30000 40000 150105 60000\n",
"1\n-1 0\n1 4 4 4 11 6\n",
"2\n-3 0\n1 3 5 1 9 2\n1000000000 1000000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-1 0\n1 0 4 4 11 6\n",
"1\n-1 0\n1 0 3 4 11 6\n",
"2\n-3 0\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000000 1000000000\n",
"1\n-467245163 -1000000000\n11001 26694 8969 64355 150105 60000\n",
"1\n0 0\n1 0 3 0 11 6\n",
"1\n-467245163 -1000000000\n10001 26694 8969 64355 150105 28865\n",
"1\n0 -1\n1 0 3 0 11 6\n",
"2\n-1 1\n1 3 5 1 9 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-1 -1\n1 0 3 0 11 6\n",
"1\n0 -1\n1 0 3 0 9 6\n",
"1\n-587542488 -1563720223\n10001 47206 8969 64355 150105 28865\n",
"1\n0 -1\n1 0 3 0 10 6\n",
"2\n-1 1\n1 5 0 1 18 3\n1000000000 1010000001\n1000000000 1000000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n0 -1\n2 0 3 0 10 6\n",
"1\n0 -1\n2 0 0 0 10 6\n",
"2\n-1 1\n1 5 0 1 27 3\n1000000000 1010000001\n1000000000 1001000000 1000000000 1001000000 1100000001 1000000000\n",
"1\n-267045550 -1563720223\n10001 89515 8969 64355 150105 29973\n",
"1\n0 -1\n2 0 0 1 10 11\n",
"2\n-1 1\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1100000001 1000000000\n",
"1\n0 -1\n2 1 0 1 10 11\n",
"2\n-2 1\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1100000001 1000000000\n",
"1\n-267045550 -1159646004\n10001 89515 8969 102403 53530 29973\n",
"1\n0 -1\n4 1 0 1 10 11\n",
"1\n-267045550 -1159646004\n10000 89515 8969 102403 53530 29973\n",
"1\n0 -1\n4 1 0 1 10 10\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000000 1000000001 1000000000\n",
"1\n0 -1\n4 1 1 1 10 10\n",
"2\n-2 2\n1 5 0 1 27 3\n1000000000 1000000001\n1000000000 1001000000 1000000000 0001000100 1000000001 1000000000\n",
"1\n0 -1\n4 2 1 1 5 10\n",
"1\n0 -1\n4 2 1 2 5 10\n",
"1\n0 -2\n4 2 1 2 5 10\n",
"1\n0 -4\n4 2 1 2 5 14\n",
"1\n-267045550 -864670048\n10000 89515 6903 102403 7183 41796\n",
"1\n0 -1\n4 2 1 2 5 14\n",
"2\n-2 2\n3 5 0 1 23 3\n1000000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 100948 6903 102403 7183 41796\n",
"1\n0 -1\n7 2 1 2 5 14\n",
"2\n-4 2\n3 5 0 1 23 3\n1000000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -864670048\n10000 100948 6903 102403 7183 75514\n",
"1\n0 -1\n7 2 1 2 0 14\n",
"1\n0 -1\n7 2 2 2 0 14\n",
"2\n-4 2\n3 5 0 1 23 4\n1010000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n0 -1\n1 2 2 2 0 14\n",
"2\n-4 2\n3 5 0 1 23 1\n1010000000 1000000001\n0000000000 1001000000 1001000010 0001000100 1000000001 1000000000\n",
"1\n-267045550 -1415424985\n00000 100948 4533 102403 7183 75514\n"
],
"output": [
"18\n1000000000000000000\n",
"40000000000000\n",
"0\n",
"40000000000000\n",
"3\n",
"18\n1000000000000000000\n",
"6\n",
"15\n1000000000000000000\n",
"4\n",
"15\n1000000001000000000\n",
"12\n1000000001000000000\n",
"64355000000000\n",
"12\n1010000001000000000\n",
"96320290220000\n",
"0\n",
"4\n1010000001000000000\n",
"79732968370005\n",
"7\n1010000001000000000\n",
"76260586083880\n",
"10\n1010000001000000000\n",
"128810585271940\n",
"1\n1010000001000000000\n",
"129892190202320\n",
"1\n1010010001001000000\n",
"139498444924994\n",
"10\n",
"1\n1000000001001000000\n",
"86101075075140\n",
"64470982132070\n",
"2\n1000000001001000000\n",
"66262590727020\n",
"63919266025770\n",
"5\n",
"2\n1000000000\n",
"90362673854982\n",
"4\n1000000000\n",
"115554827521838\n",
"8\n1000000000\n",
"86404713598006\n",
"8\n1000000010\n",
"30890276354114\n",
"20\n",
"6\n1000000010\n",
"8054340386434\n",
"6\n1001000000\n",
"6\n9999999000000000\n",
"7421442432934\n",
"11377515145405\n",
"40000000000000\n",
"40000000000000\n",
"40000000000000\n",
"4\n",
"40000000000000\n",
"4\n",
"12\n1000000001000000000\n",
"40000000000000\n",
"4\n",
"12\n1000000001000000000\n",
"4\n",
"3\n",
"12\n1010000001000000000\n",
"96320290220000\n",
"0\n",
"79732968370005\n",
"6\n",
"7\n1010000001000000000\n",
"0\n",
"6\n",
"128810585271940\n",
"6\n",
"1\n1010000001000000000\n",
"6\n",
"6\n",
"1\n1010010001001000000\n",
"139498444924994\n",
"10\n",
"1\n1000000001001000000\n",
"10\n",
"1\n1000000001001000000\n",
"64470982132070\n",
"10\n",
"64470982132070\n",
"10\n",
"2\n1000000001001000000\n",
"10\n",
"2\n1000000001001000000\n",
"5\n",
"5\n",
"10\n",
"20\n",
"8054340386434\n",
"5\n",
"6\n1001000000\n",
"8054340386434\n",
"5\n",
"6\n1001000000\n",
"8054340386434\n",
"0\n",
"0\n",
"6\n9999999000000000\n",
"0\n",
"6\n9999999000000000\n",
"11377515145405\n"
]
} | 2CODEFORCES
|
143_C. Help Farmer_37902 | Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored A·B·C hay blocks and stored them in a barn as a rectangular parallelepiped A layers high. Each layer had B rows and each row had C blocks.
At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (A - 1) × (B - 2) × (C - 2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1 × 1 × 1 blocks and scattered them around the barn. After the theft Sam counted n hay blocks in the barn but he forgot numbers A, B и C.
Given number n, find the minimally possible and maximally possible number of stolen hay blocks.
Input
The only line contains integer n from the problem's statement (1 ≤ n ≤ 109).
Output
Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves.
Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Examples
Input
4
Output
28 41
Input
7
Output
47 65
Input
12
Output
48 105
Note
Let's consider the first sample test. If initially Sam has a parallelepiped consisting of 32 = 2 × 4 × 4 hay blocks in his barn, then after the theft the barn has 4 = (2 - 1) × (4 - 2) × (4 - 2) hay blocks left. Thus, the thieves could have stolen 32 - 4 = 28 hay blocks. If Sam initially had a parallelepiped consisting of 45 = 5 × 3 × 3 hay blocks in his barn, then after the theft the barn has 4 = (5 - 1) × (3 - 2) × (3 - 2) hay blocks left. Thus, the thieves could have stolen 45 - 4 = 41 hay blocks. No other variants of the blocks' initial arrangement (that leave Sam with exactly 4 blocks after the theft) can permit the thieves to steal less than 28 or more than 41 blocks. | from math import sqrt
n = input()
Min, Max = 999999999999999999L, -1
#i = 1
#while i * i <= n:
for i in range(1, int(sqrt(n)) + 1):
if n % i == 0:
n1 = n / i
a = i + 1
# j = 1
# while j * j <= n1:
for j in range(1, int(sqrt(n1)) + 1):
if n1 % j == 0:
b = j + 2
c = n1 / j + 2
tmp = a * b * c - n
Min = min(tmp,Min)
Max = max(tmp,Max)
j += 1
a = n1 + 1
# j = 1
# while j * j <= i:
for j in range(1, int(sqrt(i)) + 1):
if i % j == 0:
b = j + 2
c = i / j + 2
tmp = a * b * c - n
Min = min(tmp,Min)
Max = max(tmp,Max)
# j += 1
# i += 1
print Min, Max
| 1Python2
| {
"input": [
"7\n",
"4\n",
"12\n",
"573308928\n",
"311933803\n",
"778377600\n",
"15\n",
"99264891\n",
"864864000\n",
"905969664\n",
"14\n",
"999905161\n",
"206898748\n",
"999999937\n",
"534879507\n",
"332393619\n",
"1026\n",
"999999991\n",
"856079286\n",
"884822400\n",
"791683200\n",
"748\n",
"62497\n",
"679477248\n",
"509607936\n",
"985944960\n",
"999999883\n",
"50480\n",
"999999997\n",
"453012754\n",
"972972000\n",
"470860680\n",
"20\n",
"882161280\n",
"7661860\n",
"999999929\n",
"628464178\n",
"8\n",
"999999996\n",
"7033800\n",
"7834243\n",
"999893227\n",
"999893387\n",
"422114561\n",
"936354996\n",
"89054701\n",
"999999999\n",
"931170240\n",
"299999771\n",
"605404800\n",
"989903\n",
"735134400\n",
"257259713\n",
"659274082\n",
"958557600\n",
"980179200\n",
"1\n",
"999999998\n",
"1985\n",
"536870912\n",
"1000000000\n",
"631243141\n",
"994593600\n",
"4472\n",
"999999992\n",
"951350400\n",
"18\n",
"821620800\n",
"45134118\n",
"935625600\n",
"999999797\n",
"348\n",
"908\n",
"999999995\n",
"999942949\n",
"535074941\n",
"999999994\n",
"9\n",
"16\n",
"999999893\n",
"615716902\n",
"908107200\n",
"999999993\n",
"859963392\n",
"790620\n",
"6\n",
"805306368\n",
"603979776\n",
"918918000\n",
"646055\n",
"96\n",
"54\n",
"999996583\n",
"764411904\n",
"286736327\n",
"20845\n",
"127039320\n",
"644972544\n",
"231136953\n",
"857656800\n",
"473739780\n",
"386434518\n",
"767634756\n",
"137646973\n",
"1052526828\n",
"1240019539\n",
"19\n",
"451626580\n",
"108997281\n",
"1987385827\n",
"800699826\n",
"332652395\n",
"1277\n",
"951362021\n",
"125376244\n",
"1207747990\n",
"522591371\n",
"660\n",
"20393\n",
"484808642\n",
"936934265\n",
"723257066\n",
"69609096\n",
"48310\n",
"1008478742\n",
"823472136\n",
"1108857276\n",
"156466785\n",
"21\n",
"357797575\n",
"13813574\n",
"1286843196\n",
"323230029\n",
"2\n",
"729829367\n",
"8855293\n",
"10876514\n",
"175996592\n",
"126339008\n",
"520858583\n",
"481688857\n",
"114398423\n",
"1584508652\n",
"587438701\n",
"564631972\n",
"393993\n",
"85067083\n",
"25941699\n",
"1192528556\n",
"173789239\n",
"1600010311\n",
"3\n",
"1856589245\n",
"3710\n",
"753796158\n",
"1100000000\n",
"162056461\n",
"1266738028\n",
"3281\n"
],
"output": [
"47 65\n",
"28 41\n",
"48 105\n",
"3301020 4586471433\n",
"1559669027 2495470433\n",
"4036708 6227020809\n",
"55 129\n",
"15587889 794119137\n",
"4331048 6918912009\n",
"4529412 7247757321\n",
"58 121\n",
"1000161721 7999241297\n",
"1683461 1655189993\n",
"4999999697 7999999505\n",
"253364145 4279036065\n",
"10714371 2659148961\n",
"591 8217\n",
"1059701759 7999999937\n",
"196667409 6848634297\n",
"4396766 7078579209\n",
"4082888 6333465609\n",
"487 5993\n",
"312497 499985\n",
"3693060 5435817993\n",
"3045276 4076863497\n",
"4725040 7887559689\n",
"4999999427 7999999073\n",
"17884 403849\n",
"15309947 7999999985\n",
"2844347 3624102041\n",
"4685478 7783776009\n",
"129486993 3766885449\n",
"64 169\n",
"4388720 7057290249\n",
"546725 61294889\n",
"4999999657 7999999441\n",
"3574502 5027713433\n",
"40 73\n",
"1000000044 7999999977\n",
"210976 56270409\n",
"8302235 62673953\n",
"1000183267 7999145825\n",
"1000724227 7999147105\n",
"78417139 3376916497\n",
"40069269 7490839977\n",
"445273517 712437617\n",
"52392027 8000000001\n",
"4548514 7449361929\n",
"1499998867 2399998177\n",
"3414952 4843238409\n",
"1082167 7919233\n",
"3886608 5881075209\n",
"2122207 2058077713\n",
"1977822262 5274192665\n",
"4637398 7668460809\n",
"4707050 7841433609\n",
"17 17\n",
"504345691 7999999993\n",
"3601 15889\n",
"3151876 4294967305\n",
"4770064 8000000009\n",
"634644469 5049945137\n",
"4752650 7956748809\n",
"1603 35785\n",
"129518035 7999999945\n",
"4614600 7610803209\n",
"57 153\n",
"4185636 6572966409\n",
"19223945 361072953\n",
"4563150 7485004809\n",
"4999998997 7999998385\n",
"396 2793\n",
"1840 7273\n",
"4924975 7999999969\n",
"1000368197 7999543601\n",
"647722381 4280599537\n",
"928571477 7999999961\n",
"41 81\n",
"56 137\n",
"4999999477 7999999153\n",
"10508698 4925735225\n",
"4474050 7264857609\n",
"490196227 7999999953\n",
"4320292 6879707145\n",
"316416 6324969\n",
"34 57\n",
"4201476 6442450953\n",
"3414276 4831838217\n",
"4511288 7351344009\n",
"140995 5168449\n",
"144 777\n",
"106 441\n",
"1022096687 7999972673\n",
"3988228 6115295241\n",
"290355727 2293890625\n",
"8873 166769\n",
"1209066 1016314569\n",
"3573148 5159780361\n",
"539319577 1849095633\n",
"4307008 6861254409\n",
"189496080 3789918249\n",
"68939625 3091476153\n",
"4193532 6141078057\n",
"1358243 1101175793\n",
"186862297 8420214633\n",
"5736161 9920156321\n",
"107 161\n",
"71310340 3613012649\n",
"2401917 871978257\n",
"3123034907 15899086625\n",
"133950807 6405598617\n",
"77775943 2661219169\n",
"6397 10225\n",
"956392069 7610896177\n",
"4976407 1003009961\n",
"1328522831 9661983929\n",
"54340489 4180730977\n",
"432 5289\n",
"101977 163153\n",
"242602273 3878469145\n",
"7416007 7495474129\n",
"671595901 5786056537\n",
"1622041 556872777\n",
"53183 386489\n",
"574598623 8067829945\n",
"167744844 6587777097\n",
"25662744 8870858217\n",
"13675215 1251734289\n",
"69 177\n",
"14864455 2862380609\n",
"7003831 110508601\n",
"1286843244 10294745577\n",
"754203421 2585840241\n",
"22 25\n",
"3649146847 5838634945\n",
"9523837 70842353\n",
"8404657 87012121\n",
"3622042 1407972745\n",
"1249102 1010712073\n",
"35915251 4166868673\n",
"56629693 3853510865\n",
"11885455 915187393\n",
"7516783 12676069225\n",
"3503099 4699509617\n",
"8177213 4517055785\n",
"481587 3151953\n",
"85351555 680536673\n",
"422131 207533601\n",
"21536104 9540228457\n",
"14098811 1390313921\n",
"1936854671 12800082497\n",
"27 33\n",
"1007862841 14852713969\n",
"1570 29689\n",
"9769623 6030369273\n",
"5086564 8800000009\n",
"12420941 1296451697\n",
"319177207 10133904233\n",
"4129 26257\n"
]
} | 2CODEFORCES
|
143_C. Help Farmer_37903 | Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored A·B·C hay blocks and stored them in a barn as a rectangular parallelepiped A layers high. Each layer had B rows and each row had C blocks.
At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (A - 1) × (B - 2) × (C - 2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1 × 1 × 1 blocks and scattered them around the barn. After the theft Sam counted n hay blocks in the barn but he forgot numbers A, B и C.
Given number n, find the minimally possible and maximally possible number of stolen hay blocks.
Input
The only line contains integer n from the problem's statement (1 ≤ n ≤ 109).
Output
Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves.
Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Examples
Input
4
Output
28 41
Input
7
Output
47 65
Input
12
Output
48 105
Note
Let's consider the first sample test. If initially Sam has a parallelepiped consisting of 32 = 2 × 4 × 4 hay blocks in his barn, then after the theft the barn has 4 = (2 - 1) × (4 - 2) × (4 - 2) hay blocks left. Thus, the thieves could have stolen 32 - 4 = 28 hay blocks. If Sam initially had a parallelepiped consisting of 45 = 5 × 3 × 3 hay blocks in his barn, then after the theft the barn has 4 = (5 - 1) × (3 - 2) × (3 - 2) hay blocks left. Thus, the thieves could have stolen 45 - 4 = 41 hay blocks. No other variants of the blocks' initial arrangement (that leave Sam with exactly 4 blocks after the theft) can permit the thieves to steal less than 28 or more than 41 blocks. | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
inline long long lin() {
long long x;
scanf("%I64d", &x);
return x;
}
long long n, a, b;
int main() {
n = lin();
a = 1ll * 1e18;
b = 1ll * -1e18;
for (long long p = 1; p <= 35000; p++) {
if (p > n) continue;
if (n % p == 0) {
long long aa = p, bb = n / p;
for (long long q = 1; q * q <= bb; q++) {
if (bb % q == 0) {
long long x = q, y = bb / q;
a = min(a, (aa + 1ll) * (x + 2ll) * (y + 2ll));
b = max(b, (aa + 1ll) * (x + 2ll) * (y + 2ll));
}
}
for (long long q = 1; q * q <= aa; q++) {
if (aa % q == 0) {
long long x = q, y = aa / q;
a = min(a, (bb + 1ll) * (x + 2ll) * (y + 2ll));
b = max(b, (bb + 1ll) * (x + 2ll) * (y + 2ll));
}
}
}
}
cout << a - n << " " << b - n << '\n';
}
| 2C++
| {
"input": [
"7\n",
"4\n",
"12\n",
"573308928\n",
"311933803\n",
"778377600\n",
"15\n",
"99264891\n",
"864864000\n",
"905969664\n",
"14\n",
"999905161\n",
"206898748\n",
"999999937\n",
"534879507\n",
"332393619\n",
"1026\n",
"999999991\n",
"856079286\n",
"884822400\n",
"791683200\n",
"748\n",
"62497\n",
"679477248\n",
"509607936\n",
"985944960\n",
"999999883\n",
"50480\n",
"999999997\n",
"453012754\n",
"972972000\n",
"470860680\n",
"20\n",
"882161280\n",
"7661860\n",
"999999929\n",
"628464178\n",
"8\n",
"999999996\n",
"7033800\n",
"7834243\n",
"999893227\n",
"999893387\n",
"422114561\n",
"936354996\n",
"89054701\n",
"999999999\n",
"931170240\n",
"299999771\n",
"605404800\n",
"989903\n",
"735134400\n",
"257259713\n",
"659274082\n",
"958557600\n",
"980179200\n",
"1\n",
"999999998\n",
"1985\n",
"536870912\n",
"1000000000\n",
"631243141\n",
"994593600\n",
"4472\n",
"999999992\n",
"951350400\n",
"18\n",
"821620800\n",
"45134118\n",
"935625600\n",
"999999797\n",
"348\n",
"908\n",
"999999995\n",
"999942949\n",
"535074941\n",
"999999994\n",
"9\n",
"16\n",
"999999893\n",
"615716902\n",
"908107200\n",
"999999993\n",
"859963392\n",
"790620\n",
"6\n",
"805306368\n",
"603979776\n",
"918918000\n",
"646055\n",
"96\n",
"54\n",
"999996583\n",
"764411904\n",
"286736327\n",
"20845\n",
"127039320\n",
"644972544\n",
"231136953\n",
"857656800\n",
"473739780\n",
"386434518\n",
"767634756\n",
"137646973\n",
"1052526828\n",
"1240019539\n",
"19\n",
"451626580\n",
"108997281\n",
"1987385827\n",
"800699826\n",
"332652395\n",
"1277\n",
"951362021\n",
"125376244\n",
"1207747990\n",
"522591371\n",
"660\n",
"20393\n",
"484808642\n",
"936934265\n",
"723257066\n",
"69609096\n",
"48310\n",
"1008478742\n",
"823472136\n",
"1108857276\n",
"156466785\n",
"21\n",
"357797575\n",
"13813574\n",
"1286843196\n",
"323230029\n",
"2\n",
"729829367\n",
"8855293\n",
"10876514\n",
"175996592\n",
"126339008\n",
"520858583\n",
"481688857\n",
"114398423\n",
"1584508652\n",
"587438701\n",
"564631972\n",
"393993\n",
"85067083\n",
"25941699\n",
"1192528556\n",
"173789239\n",
"1600010311\n",
"3\n",
"1856589245\n",
"3710\n",
"753796158\n",
"1100000000\n",
"162056461\n",
"1266738028\n",
"3281\n"
],
"output": [
"47 65\n",
"28 41\n",
"48 105\n",
"3301020 4586471433\n",
"1559669027 2495470433\n",
"4036708 6227020809\n",
"55 129\n",
"15587889 794119137\n",
"4331048 6918912009\n",
"4529412 7247757321\n",
"58 121\n",
"1000161721 7999241297\n",
"1683461 1655189993\n",
"4999999697 7999999505\n",
"253364145 4279036065\n",
"10714371 2659148961\n",
"591 8217\n",
"1059701759 7999999937\n",
"196667409 6848634297\n",
"4396766 7078579209\n",
"4082888 6333465609\n",
"487 5993\n",
"312497 499985\n",
"3693060 5435817993\n",
"3045276 4076863497\n",
"4725040 7887559689\n",
"4999999427 7999999073\n",
"17884 403849\n",
"15309947 7999999985\n",
"2844347 3624102041\n",
"4685478 7783776009\n",
"129486993 3766885449\n",
"64 169\n",
"4388720 7057290249\n",
"546725 61294889\n",
"4999999657 7999999441\n",
"3574502 5027713433\n",
"40 73\n",
"1000000044 7999999977\n",
"210976 56270409\n",
"8302235 62673953\n",
"1000183267 7999145825\n",
"1000724227 7999147105\n",
"78417139 3376916497\n",
"40069269 7490839977\n",
"445273517 712437617\n",
"52392027 8000000001\n",
"4548514 7449361929\n",
"1499998867 2399998177\n",
"3414952 4843238409\n",
"1082167 7919233\n",
"3886608 5881075209\n",
"2122207 2058077713\n",
"1977822262 5274192665\n",
"4637398 7668460809\n",
"4707050 7841433609\n",
"17 17\n",
"504345691 7999999993\n",
"3601 15889\n",
"3151876 4294967305\n",
"4770064 8000000009\n",
"634644469 5049945137\n",
"4752650 7956748809\n",
"1603 35785\n",
"129518035 7999999945\n",
"4614600 7610803209\n",
"57 153\n",
"4185636 6572966409\n",
"19223945 361072953\n",
"4563150 7485004809\n",
"4999998997 7999998385\n",
"396 2793\n",
"1840 7273\n",
"4924975 7999999969\n",
"1000368197 7999543601\n",
"647722381 4280599537\n",
"928571477 7999999961\n",
"41 81\n",
"56 137\n",
"4999999477 7999999153\n",
"10508698 4925735225\n",
"4474050 7264857609\n",
"490196227 7999999953\n",
"4320292 6879707145\n",
"316416 6324969\n",
"34 57\n",
"4201476 6442450953\n",
"3414276 4831838217\n",
"4511288 7351344009\n",
"140995 5168449\n",
"144 777\n",
"106 441\n",
"1022096687 7999972673\n",
"3988228 6115295241\n",
"290355727 2293890625\n",
"8873 166769\n",
"1209066 1016314569\n",
"3573148 5159780361\n",
"539319577 1849095633\n",
"4307008 6861254409\n",
"189496080 3789918249\n",
"68939625 3091476153\n",
"4193532 6141078057\n",
"1358243 1101175793\n",
"186862297 8420214633\n",
"5736161 9920156321\n",
"107 161\n",
"71310340 3613012649\n",
"2401917 871978257\n",
"3123034907 15899086625\n",
"133950807 6405598617\n",
"77775943 2661219169\n",
"6397 10225\n",
"956392069 7610896177\n",
"4976407 1003009961\n",
"1328522831 9661983929\n",
"54340489 4180730977\n",
"432 5289\n",
"101977 163153\n",
"242602273 3878469145\n",
"7416007 7495474129\n",
"671595901 5786056537\n",
"1622041 556872777\n",
"53183 386489\n",
"574598623 8067829945\n",
"167744844 6587777097\n",
"25662744 8870858217\n",
"13675215 1251734289\n",
"69 177\n",
"14864455 2862380609\n",
"7003831 110508601\n",
"1286843244 10294745577\n",
"754203421 2585840241\n",
"22 25\n",
"3649146847 5838634945\n",
"9523837 70842353\n",
"8404657 87012121\n",
"3622042 1407972745\n",
"1249102 1010712073\n",
"35915251 4166868673\n",
"56629693 3853510865\n",
"11885455 915187393\n",
"7516783 12676069225\n",
"3503099 4699509617\n",
"8177213 4517055785\n",
"481587 3151953\n",
"85351555 680536673\n",
"422131 207533601\n",
"21536104 9540228457\n",
"14098811 1390313921\n",
"1936854671 12800082497\n",
"27 33\n",
"1007862841 14852713969\n",
"1570 29689\n",
"9769623 6030369273\n",
"5086564 8800000009\n",
"12420941 1296451697\n",
"319177207 10133904233\n",
"4129 26257\n"
]
} | 2CODEFORCES
|
143_C. Help Farmer_37904 | Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored A·B·C hay blocks and stored them in a barn as a rectangular parallelepiped A layers high. Each layer had B rows and each row had C blocks.
At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (A - 1) × (B - 2) × (C - 2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1 × 1 × 1 blocks and scattered them around the barn. After the theft Sam counted n hay blocks in the barn but he forgot numbers A, B и C.
Given number n, find the minimally possible and maximally possible number of stolen hay blocks.
Input
The only line contains integer n from the problem's statement (1 ≤ n ≤ 109).
Output
Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves.
Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Examples
Input
4
Output
28 41
Input
7
Output
47 65
Input
12
Output
48 105
Note
Let's consider the first sample test. If initially Sam has a parallelepiped consisting of 32 = 2 × 4 × 4 hay blocks in his barn, then after the theft the barn has 4 = (2 - 1) × (4 - 2) × (4 - 2) hay blocks left. Thus, the thieves could have stolen 32 - 4 = 28 hay blocks. If Sam initially had a parallelepiped consisting of 45 = 5 × 3 × 3 hay blocks in his barn, then after the theft the barn has 4 = (5 - 1) × (3 - 2) × (3 - 2) hay blocks left. Thus, the thieves could have stolen 45 - 4 = 41 hay blocks. No other variants of the blocks' initial arrangement (that leave Sam with exactly 4 blocks after the theft) can permit the thieves to steal less than 28 or more than 41 blocks. | from math import sqrt
p, n = [], int(input())
def f(x, y): return (x + 2) * (y + 2) + (2 * (x + y + 2) * n) // (x * y)
for x in range(2, int(sqrt(n)) + 1):
if n % x == 0: p.append(x)
p += [n // x for x in reversed(p)]
p.append(n)
u = v = f(1, 1)
for m in p:
for x in range(1, int(sqrt(m)) + 1):
if m % x == 0: u = min(u, f(x, m // x))
print(u, v)
# Made By Mostafa_Khaled | 3Python3
| {
"input": [
"7\n",
"4\n",
"12\n",
"573308928\n",
"311933803\n",
"778377600\n",
"15\n",
"99264891\n",
"864864000\n",
"905969664\n",
"14\n",
"999905161\n",
"206898748\n",
"999999937\n",
"534879507\n",
"332393619\n",
"1026\n",
"999999991\n",
"856079286\n",
"884822400\n",
"791683200\n",
"748\n",
"62497\n",
"679477248\n",
"509607936\n",
"985944960\n",
"999999883\n",
"50480\n",
"999999997\n",
"453012754\n",
"972972000\n",
"470860680\n",
"20\n",
"882161280\n",
"7661860\n",
"999999929\n",
"628464178\n",
"8\n",
"999999996\n",
"7033800\n",
"7834243\n",
"999893227\n",
"999893387\n",
"422114561\n",
"936354996\n",
"89054701\n",
"999999999\n",
"931170240\n",
"299999771\n",
"605404800\n",
"989903\n",
"735134400\n",
"257259713\n",
"659274082\n",
"958557600\n",
"980179200\n",
"1\n",
"999999998\n",
"1985\n",
"536870912\n",
"1000000000\n",
"631243141\n",
"994593600\n",
"4472\n",
"999999992\n",
"951350400\n",
"18\n",
"821620800\n",
"45134118\n",
"935625600\n",
"999999797\n",
"348\n",
"908\n",
"999999995\n",
"999942949\n",
"535074941\n",
"999999994\n",
"9\n",
"16\n",
"999999893\n",
"615716902\n",
"908107200\n",
"999999993\n",
"859963392\n",
"790620\n",
"6\n",
"805306368\n",
"603979776\n",
"918918000\n",
"646055\n",
"96\n",
"54\n",
"999996583\n",
"764411904\n",
"286736327\n",
"20845\n",
"127039320\n",
"644972544\n",
"231136953\n",
"857656800\n",
"473739780\n",
"386434518\n",
"767634756\n",
"137646973\n",
"1052526828\n",
"1240019539\n",
"19\n",
"451626580\n",
"108997281\n",
"1987385827\n",
"800699826\n",
"332652395\n",
"1277\n",
"951362021\n",
"125376244\n",
"1207747990\n",
"522591371\n",
"660\n",
"20393\n",
"484808642\n",
"936934265\n",
"723257066\n",
"69609096\n",
"48310\n",
"1008478742\n",
"823472136\n",
"1108857276\n",
"156466785\n",
"21\n",
"357797575\n",
"13813574\n",
"1286843196\n",
"323230029\n",
"2\n",
"729829367\n",
"8855293\n",
"10876514\n",
"175996592\n",
"126339008\n",
"520858583\n",
"481688857\n",
"114398423\n",
"1584508652\n",
"587438701\n",
"564631972\n",
"393993\n",
"85067083\n",
"25941699\n",
"1192528556\n",
"173789239\n",
"1600010311\n",
"3\n",
"1856589245\n",
"3710\n",
"753796158\n",
"1100000000\n",
"162056461\n",
"1266738028\n",
"3281\n"
],
"output": [
"47 65\n",
"28 41\n",
"48 105\n",
"3301020 4586471433\n",
"1559669027 2495470433\n",
"4036708 6227020809\n",
"55 129\n",
"15587889 794119137\n",
"4331048 6918912009\n",
"4529412 7247757321\n",
"58 121\n",
"1000161721 7999241297\n",
"1683461 1655189993\n",
"4999999697 7999999505\n",
"253364145 4279036065\n",
"10714371 2659148961\n",
"591 8217\n",
"1059701759 7999999937\n",
"196667409 6848634297\n",
"4396766 7078579209\n",
"4082888 6333465609\n",
"487 5993\n",
"312497 499985\n",
"3693060 5435817993\n",
"3045276 4076863497\n",
"4725040 7887559689\n",
"4999999427 7999999073\n",
"17884 403849\n",
"15309947 7999999985\n",
"2844347 3624102041\n",
"4685478 7783776009\n",
"129486993 3766885449\n",
"64 169\n",
"4388720 7057290249\n",
"546725 61294889\n",
"4999999657 7999999441\n",
"3574502 5027713433\n",
"40 73\n",
"1000000044 7999999977\n",
"210976 56270409\n",
"8302235 62673953\n",
"1000183267 7999145825\n",
"1000724227 7999147105\n",
"78417139 3376916497\n",
"40069269 7490839977\n",
"445273517 712437617\n",
"52392027 8000000001\n",
"4548514 7449361929\n",
"1499998867 2399998177\n",
"3414952 4843238409\n",
"1082167 7919233\n",
"3886608 5881075209\n",
"2122207 2058077713\n",
"1977822262 5274192665\n",
"4637398 7668460809\n",
"4707050 7841433609\n",
"17 17\n",
"504345691 7999999993\n",
"3601 15889\n",
"3151876 4294967305\n",
"4770064 8000000009\n",
"634644469 5049945137\n",
"4752650 7956748809\n",
"1603 35785\n",
"129518035 7999999945\n",
"4614600 7610803209\n",
"57 153\n",
"4185636 6572966409\n",
"19223945 361072953\n",
"4563150 7485004809\n",
"4999998997 7999998385\n",
"396 2793\n",
"1840 7273\n",
"4924975 7999999969\n",
"1000368197 7999543601\n",
"647722381 4280599537\n",
"928571477 7999999961\n",
"41 81\n",
"56 137\n",
"4999999477 7999999153\n",
"10508698 4925735225\n",
"4474050 7264857609\n",
"490196227 7999999953\n",
"4320292 6879707145\n",
"316416 6324969\n",
"34 57\n",
"4201476 6442450953\n",
"3414276 4831838217\n",
"4511288 7351344009\n",
"140995 5168449\n",
"144 777\n",
"106 441\n",
"1022096687 7999972673\n",
"3988228 6115295241\n",
"290355727 2293890625\n",
"8873 166769\n",
"1209066 1016314569\n",
"3573148 5159780361\n",
"539319577 1849095633\n",
"4307008 6861254409\n",
"189496080 3789918249\n",
"68939625 3091476153\n",
"4193532 6141078057\n",
"1358243 1101175793\n",
"186862297 8420214633\n",
"5736161 9920156321\n",
"107 161\n",
"71310340 3613012649\n",
"2401917 871978257\n",
"3123034907 15899086625\n",
"133950807 6405598617\n",
"77775943 2661219169\n",
"6397 10225\n",
"956392069 7610896177\n",
"4976407 1003009961\n",
"1328522831 9661983929\n",
"54340489 4180730977\n",
"432 5289\n",
"101977 163153\n",
"242602273 3878469145\n",
"7416007 7495474129\n",
"671595901 5786056537\n",
"1622041 556872777\n",
"53183 386489\n",
"574598623 8067829945\n",
"167744844 6587777097\n",
"25662744 8870858217\n",
"13675215 1251734289\n",
"69 177\n",
"14864455 2862380609\n",
"7003831 110508601\n",
"1286843244 10294745577\n",
"754203421 2585840241\n",
"22 25\n",
"3649146847 5838634945\n",
"9523837 70842353\n",
"8404657 87012121\n",
"3622042 1407972745\n",
"1249102 1010712073\n",
"35915251 4166868673\n",
"56629693 3853510865\n",
"11885455 915187393\n",
"7516783 12676069225\n",
"3503099 4699509617\n",
"8177213 4517055785\n",
"481587 3151953\n",
"85351555 680536673\n",
"422131 207533601\n",
"21536104 9540228457\n",
"14098811 1390313921\n",
"1936854671 12800082497\n",
"27 33\n",
"1007862841 14852713969\n",
"1570 29689\n",
"9769623 6030369273\n",
"5086564 8800000009\n",
"12420941 1296451697\n",
"319177207 10133904233\n",
"4129 26257\n"
]
} | 2CODEFORCES
|
143_C. Help Farmer_37905 | Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored A·B·C hay blocks and stored them in a barn as a rectangular parallelepiped A layers high. Each layer had B rows and each row had C blocks.
At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (A - 1) × (B - 2) × (C - 2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1 × 1 × 1 blocks and scattered them around the barn. After the theft Sam counted n hay blocks in the barn but he forgot numbers A, B и C.
Given number n, find the minimally possible and maximally possible number of stolen hay blocks.
Input
The only line contains integer n from the problem's statement (1 ≤ n ≤ 109).
Output
Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves.
Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Examples
Input
4
Output
28 41
Input
7
Output
47 65
Input
12
Output
48 105
Note
Let's consider the first sample test. If initially Sam has a parallelepiped consisting of 32 = 2 × 4 × 4 hay blocks in his barn, then after the theft the barn has 4 = (2 - 1) × (4 - 2) × (4 - 2) hay blocks left. Thus, the thieves could have stolen 32 - 4 = 28 hay blocks. If Sam initially had a parallelepiped consisting of 45 = 5 × 3 × 3 hay blocks in his barn, then after the theft the barn has 4 = (5 - 1) × (3 - 2) × (3 - 2) hay blocks left. Thus, the thieves could have stolen 45 - 4 = 41 hay blocks. No other variants of the blocks' initial arrangement (that leave Sam with exactly 4 blocks after the theft) can permit the thieves to steal less than 28 or more than 41 blocks. | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Toni Rajkovski
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastReader in = new FastReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
TaskC solver = new TaskC();
solver.solve(1, in, out);
out.close();
}
static class TaskC {
public void solve(int testNumber, FastReader in, PrintWriter out) {
long n = in.nextLong();
List<Long> divisors = new ArrayList<>();
for (long b = 1; b * b <= n; b++)
if (n % b == 0) {
divisors.add(b);
divisors.add(n / b);
}
long min = Long.MAX_VALUE, max = 0;
for (int i = 0; i < divisors.size(); i++) {
long b = divisors.get(i);
for (int j = i; j < divisors.size(); j++) {
long c = divisors.get(j);
if (n % (b * c) == 0) {
long a = n / (b * c);
long res = (a + 1) * (b + 2) * (c + 2) - n;
min = Math.min(min, res);
max = Math.max(max, res);
} else if (b * c > n) break;
}
}
out.println(min + " " + max);
}
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new
InputStreamReader(System.in));
}
public FastReader(InputStream is) {
br = new BufferedReader(new
InputStreamReader(is));
}
public String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
public long nextLong() {
return Long.parseLong(next());
}
}
}
| 4JAVA
| {
"input": [
"7\n",
"4\n",
"12\n",
"573308928\n",
"311933803\n",
"778377600\n",
"15\n",
"99264891\n",
"864864000\n",
"905969664\n",
"14\n",
"999905161\n",
"206898748\n",
"999999937\n",
"534879507\n",
"332393619\n",
"1026\n",
"999999991\n",
"856079286\n",
"884822400\n",
"791683200\n",
"748\n",
"62497\n",
"679477248\n",
"509607936\n",
"985944960\n",
"999999883\n",
"50480\n",
"999999997\n",
"453012754\n",
"972972000\n",
"470860680\n",
"20\n",
"882161280\n",
"7661860\n",
"999999929\n",
"628464178\n",
"8\n",
"999999996\n",
"7033800\n",
"7834243\n",
"999893227\n",
"999893387\n",
"422114561\n",
"936354996\n",
"89054701\n",
"999999999\n",
"931170240\n",
"299999771\n",
"605404800\n",
"989903\n",
"735134400\n",
"257259713\n",
"659274082\n",
"958557600\n",
"980179200\n",
"1\n",
"999999998\n",
"1985\n",
"536870912\n",
"1000000000\n",
"631243141\n",
"994593600\n",
"4472\n",
"999999992\n",
"951350400\n",
"18\n",
"821620800\n",
"45134118\n",
"935625600\n",
"999999797\n",
"348\n",
"908\n",
"999999995\n",
"999942949\n",
"535074941\n",
"999999994\n",
"9\n",
"16\n",
"999999893\n",
"615716902\n",
"908107200\n",
"999999993\n",
"859963392\n",
"790620\n",
"6\n",
"805306368\n",
"603979776\n",
"918918000\n",
"646055\n",
"96\n",
"54\n",
"999996583\n",
"764411904\n",
"286736327\n",
"20845\n",
"127039320\n",
"644972544\n",
"231136953\n",
"857656800\n",
"473739780\n",
"386434518\n",
"767634756\n",
"137646973\n",
"1052526828\n",
"1240019539\n",
"19\n",
"451626580\n",
"108997281\n",
"1987385827\n",
"800699826\n",
"332652395\n",
"1277\n",
"951362021\n",
"125376244\n",
"1207747990\n",
"522591371\n",
"660\n",
"20393\n",
"484808642\n",
"936934265\n",
"723257066\n",
"69609096\n",
"48310\n",
"1008478742\n",
"823472136\n",
"1108857276\n",
"156466785\n",
"21\n",
"357797575\n",
"13813574\n",
"1286843196\n",
"323230029\n",
"2\n",
"729829367\n",
"8855293\n",
"10876514\n",
"175996592\n",
"126339008\n",
"520858583\n",
"481688857\n",
"114398423\n",
"1584508652\n",
"587438701\n",
"564631972\n",
"393993\n",
"85067083\n",
"25941699\n",
"1192528556\n",
"173789239\n",
"1600010311\n",
"3\n",
"1856589245\n",
"3710\n",
"753796158\n",
"1100000000\n",
"162056461\n",
"1266738028\n",
"3281\n"
],
"output": [
"47 65\n",
"28 41\n",
"48 105\n",
"3301020 4586471433\n",
"1559669027 2495470433\n",
"4036708 6227020809\n",
"55 129\n",
"15587889 794119137\n",
"4331048 6918912009\n",
"4529412 7247757321\n",
"58 121\n",
"1000161721 7999241297\n",
"1683461 1655189993\n",
"4999999697 7999999505\n",
"253364145 4279036065\n",
"10714371 2659148961\n",
"591 8217\n",
"1059701759 7999999937\n",
"196667409 6848634297\n",
"4396766 7078579209\n",
"4082888 6333465609\n",
"487 5993\n",
"312497 499985\n",
"3693060 5435817993\n",
"3045276 4076863497\n",
"4725040 7887559689\n",
"4999999427 7999999073\n",
"17884 403849\n",
"15309947 7999999985\n",
"2844347 3624102041\n",
"4685478 7783776009\n",
"129486993 3766885449\n",
"64 169\n",
"4388720 7057290249\n",
"546725 61294889\n",
"4999999657 7999999441\n",
"3574502 5027713433\n",
"40 73\n",
"1000000044 7999999977\n",
"210976 56270409\n",
"8302235 62673953\n",
"1000183267 7999145825\n",
"1000724227 7999147105\n",
"78417139 3376916497\n",
"40069269 7490839977\n",
"445273517 712437617\n",
"52392027 8000000001\n",
"4548514 7449361929\n",
"1499998867 2399998177\n",
"3414952 4843238409\n",
"1082167 7919233\n",
"3886608 5881075209\n",
"2122207 2058077713\n",
"1977822262 5274192665\n",
"4637398 7668460809\n",
"4707050 7841433609\n",
"17 17\n",
"504345691 7999999993\n",
"3601 15889\n",
"3151876 4294967305\n",
"4770064 8000000009\n",
"634644469 5049945137\n",
"4752650 7956748809\n",
"1603 35785\n",
"129518035 7999999945\n",
"4614600 7610803209\n",
"57 153\n",
"4185636 6572966409\n",
"19223945 361072953\n",
"4563150 7485004809\n",
"4999998997 7999998385\n",
"396 2793\n",
"1840 7273\n",
"4924975 7999999969\n",
"1000368197 7999543601\n",
"647722381 4280599537\n",
"928571477 7999999961\n",
"41 81\n",
"56 137\n",
"4999999477 7999999153\n",
"10508698 4925735225\n",
"4474050 7264857609\n",
"490196227 7999999953\n",
"4320292 6879707145\n",
"316416 6324969\n",
"34 57\n",
"4201476 6442450953\n",
"3414276 4831838217\n",
"4511288 7351344009\n",
"140995 5168449\n",
"144 777\n",
"106 441\n",
"1022096687 7999972673\n",
"3988228 6115295241\n",
"290355727 2293890625\n",
"8873 166769\n",
"1209066 1016314569\n",
"3573148 5159780361\n",
"539319577 1849095633\n",
"4307008 6861254409\n",
"189496080 3789918249\n",
"68939625 3091476153\n",
"4193532 6141078057\n",
"1358243 1101175793\n",
"186862297 8420214633\n",
"5736161 9920156321\n",
"107 161\n",
"71310340 3613012649\n",
"2401917 871978257\n",
"3123034907 15899086625\n",
"133950807 6405598617\n",
"77775943 2661219169\n",
"6397 10225\n",
"956392069 7610896177\n",
"4976407 1003009961\n",
"1328522831 9661983929\n",
"54340489 4180730977\n",
"432 5289\n",
"101977 163153\n",
"242602273 3878469145\n",
"7416007 7495474129\n",
"671595901 5786056537\n",
"1622041 556872777\n",
"53183 386489\n",
"574598623 8067829945\n",
"167744844 6587777097\n",
"25662744 8870858217\n",
"13675215 1251734289\n",
"69 177\n",
"14864455 2862380609\n",
"7003831 110508601\n",
"1286843244 10294745577\n",
"754203421 2585840241\n",
"22 25\n",
"3649146847 5838634945\n",
"9523837 70842353\n",
"8404657 87012121\n",
"3622042 1407972745\n",
"1249102 1010712073\n",
"35915251 4166868673\n",
"56629693 3853510865\n",
"11885455 915187393\n",
"7516783 12676069225\n",
"3503099 4699509617\n",
"8177213 4517055785\n",
"481587 3151953\n",
"85351555 680536673\n",
"422131 207533601\n",
"21536104 9540228457\n",
"14098811 1390313921\n",
"1936854671 12800082497\n",
"27 33\n",
"1007862841 14852713969\n",
"1570 29689\n",
"9769623 6030369273\n",
"5086564 8800000009\n",
"12420941 1296451697\n",
"319177207 10133904233\n",
"4129 26257\n"
]
} | 2CODEFORCES
|
1466_H. Finding satisfactory solutions_37906 | Getting so far in this contest is not an easy feat. By solving all the previous problems, you have impressed the gods greatly. Thus, they decided to spare you the story for this problem and grant a formal statement instead.
Consider n agents. Each one of them initially has exactly one item, i-th agent has the item number i. We are interested in reassignments of these items among the agents. An assignment is valid iff each item is assigned to exactly one agent, and each agent is assigned exactly one item.
Each agent has a preference over the items, which can be described by a permutation p of items sorted from the most to the least desirable. In other words, the agent prefers item i to item j iff i appears earlier in the permutation p. A preference profile is a list of n permutations of length n each, such that i-th permutation describes preferences of the i-th agent.
It is possible that some of the agents are not happy with the assignment of items. A set of dissatisfied agents may choose not to cooperate with other agents. In such a case, they would exchange the items they possess initially (i-th item belongs to i-th agent) only between themselves. Agents from this group don't care about the satisfaction of agents outside of it. However, they need to exchange their items in such a way that will make at least one of them happier, and none of them less happy (in comparison to the given assignment).
Formally, consider a valid assignment of items — A. Let A(i) denote the item assigned to i-th agent. Also, consider a subset of agents. Let S be the set of their indices. We will say this subset of agents is dissatisfied iff there exists a valid assignment B(i) such that:
* For each i ∈ S, B(i) ∈ S.
* No agent i ∈ S prefers A(i) to B(i) (no agent from the S is less happy).
* At least one agent i ∈ S prefers B(i) to A(i) (at least one agent from the S is happier).
An assignment is optimal if no subset of the agents is dissatisfied. Note that the empty subset cannot be dissatisfied. It can be proven that for each preference profile, there is precisely one optimal assignment.
Example: Consider 3 agents with the following preference profile:
1. [2, 1, 3]
2. [1, 2, 3]
3. [1, 3, 2]
And such an assignment:
* First agent gets item 2
* Second agent gets item 3.
* Third agent gets item 1.
See that the set of agents \{1, 2\} is dissatisfied, because they can reassign their (initial) items in the following way:
* First agent gets item 2.
* Second agent gets item 1.
* Third agent gets item 3.
This reassignment will make the second agent happier and make no difference to the first agent. As a result, the third agent got an item that is worse for him, but this does not prevent the set \{1,2\} from being dissatisfied (he is not in this set).
The following assignment would be optimal:
* First agent gets item 2.
* Second agent gets item 1.
* Third agent gets item 3.
Given an assignment A, calculate the number of distinct preference profiles for which assignment A is optimal. As the answer can be huge, output it modulo 10^9+7.
Two preference profiles are different iff they assign different preference permutations to any agent.
Input
In the first line of input there is an integer n (1 ≤ n ≤ 40). The next line contains n space separated integers, a permutation of numbers from 1 to n. The i-th number denotes the item assigned to agent i in the optimal assignment.
Output
In a single line output one non-negative integer, the number of preference profiles for which the assignment of items given in the input is optimal modulo 10^9+7.
Examples
Input
2
2 1
Output
1
Input
3
1 2 3
Output
98
Input
4
2 1 3 4
Output
27408
Note
Assignment from the first test case is optimal only for the following preference profile:
2, 1
1, 2
If any agent wants his initial item the most and is given another item, he would form a dissatisfied set. Hence the allocation is not optimal for any other preference profile. | #include <bits/stdc++.h>
using namespace std;
const int maxn = 41, P = 1000000007;
int n, p[maxn], base[maxn], f[5100];
int fact[maxn], C[maxn][maxn], pw[maxn][maxn], vis[maxn];
vector<int> len, cnt, sub[5100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]), p[i]--;
}
auto init = [&]() {
vector<int> V;
for (int i = 0; i < n; i++) if (!vis[i]) {
int len = 0;
for (int j = i; !vis[j]; j = p[j]) vis[j] = 1, len++;
V.push_back(len);
}
sort(V.begin(), V.end());
for (int i = 0, j; i < V.size(); i = j) {
for (j = i; j < V.size() && V[i] == V[j]; j++);
len.push_back(V[i]), cnt.push_back(j - i);
}
for (int i = base[0] = 1; i <= len.size(); i++) {
base[i] = base[i - 1] * (cnt[i - 1] + 1);
}
for (int i = fact[0] = C[0][0] = 1; i <= n; i++) {
fact[i] = 1LL * i * fact[i - 1] % P;
for (int j = C[i][0] = 1; j <= i; j++) {
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % P;
}
}
for (int S = 0; S < base[len.size()]; S++) {
function<void(int, int)> dfs = [&](int pos, int T) {
if (pos == len.size()) {
if (T) sub[S].push_back(T); return;
}
for (int i = 0; i <= S / base[pos] % (cnt[pos] + 1); i++) {
dfs(pos + 1, T + i * base[pos]);
}
};
dfs(0, 0);
}
};
auto solve = [&]() {
for (int i = 0; i < n; i++) {
pw[i][0] = 1;
for (int j = 0; j <= i; j++) {
pw[i][1] = (pw[i][1] + 1LL * C[i][j] * fact[j] % P * fact[n - j - 1]) % P;
}
for (int j = 2; j <= n; j++) {
pw[i][j] = 1LL * pw[i][j - 1] * pw[i][1] % P;
}
}
for (int S = f[0] = 1; S < base[len.size()]; S++) {
for (int T : sub[S]) {
int s1 = 0, s2 = 0, s3 = 0;
int coef = 1;
for (int i = 0; i < len.size(); i++) {
int x = S / base[i] % (cnt[i] + 1);
int y = T / base[i] % (cnt[i] + 1);
s1 += len[i] * y, s2 += len[i] * (x - y), s3 += y;
coef = 1LL * coef * C[x][y] % P;
}
if (!(s3 & 1)) coef = P - coef;
f[S] = (f[S] + 1LL * pw[s2][s1] * f[S - T] % P * coef) % P;
}
}
};
init(), solve();
printf("%d\n", f[base[len.size()] - 1]);
return 0;
} | 2C++
| {
"input": [
"4\n2 1 3 4\n",
"2\n2 1\n",
"3\n1 2 3\n",
"37\n12 2 25 23 10 24 28 5 33 19 17 32 13 36 26 16 21 22 8 31 11 18 4 6 37 14 27 15 29 30 20 9 1 34 35 7 3\n",
"6\n1 2 6 3 4 5\n",
"37\n7 2 15 6 25 19 17 23 31 30 32 36 29 21 37 16 9 1 4 20 13 8 22 34 5 10 27 28 14 12 18 11 33 24 35 26 3\n",
"40\n28 34 27 12 5 38 32 7 22 4 39 16 23 40 10 31 11 30 37 17 15 24 21 3 18 33 9 6 25 19 13 14 2 29 36 1 26 20 35 8\n",
"40\n1 22 28 8 35 3 33 25 19 24 32 2 31 20 27 13 5 11 37 12 7 39 6 40 16 26 23 14 29 30 38 36 21 10 4 34 9 15 17 18\n",
"6\n6 5 4 3 1 2\n",
"37\n7 28 19 1 5 23 4 8 10 18 15 13 6 14 16 11 30 22 3 26 21 24 29 9 12 2 27 20 25 17 31 32 35 34 33 36 37\n",
"40\n29 31 25 6 39 21 1 40 12 14 17 30 38 26 13 7 15 37 5 35 23 34 28 36 19 20 11 9 24 4 3 2 10 33 22 8 27 18 32 16\n",
"40\n11 40 16 31 5 37 27 6 32 24 23 36 29 14 15 22 12 4 28 39 2 7 35 10 3 25 26 19 1 20 34 38 8 30 13 33 17 9 18 21\n",
"5\n4 1 5 3 2\n",
"4\n3 2 1 4\n",
"40\n12 10 11 16 1 33 36 8 21 23 26 5 20 39 32 34 18 28 30 35 25 14 2 38 9 3 6 17 7 40 15 31 27 4 13 29 24 37 22 19\n",
"5\n1 5 2 4 3\n",
"3\n3 1 2\n",
"3\n1 3 2\n",
"1\n1\n",
"6\n2 1 4 3 6 5\n",
"5\n3 2 1 5 4\n",
"6\n6 3 5 2 1 4\n",
"40\n3 2 30 19 31 38 26 25 27 18 35 14 37 6 39 16 17 24 34 22 21 7 15 32 36 20 12 11 13 28 40 9 4 8 33 1 29 10 23 5\n",
"5\n2 1 4 5 3\n",
"2\n1 2\n",
"40\n3 18 37 35 29 7 17 5 27 32 20 8 38 4 31 39 15 11 36 28 12 34 19 40 16 9 22 2 21 14 6 1 30 26 33 24 10 25 13 23\n",
"6\n1 5 3 4 2 6\n",
"40\n38 12 15 3 4 40 35 9 33 26 14 1 7 25 22 6 20 17 2 36 10 39 23 34 5 8 27 28 21 16 29 32 37 13 24 19 31 18 11 30\n",
"40\n12 28 8 26 31 9 7 3 33 13 32 11 15 16 35 4 17 38 19 5 21 22 23 25 34 14 27 2 1 30 36 29 6 24 39 20 10 18 37 40\n",
"4\n1 2 3 4\n",
"40\n1 10 2 21 17 7 23 20 38 3 11 16 32 14 39 12 5 25 19 30 35 36 26 9 24 6 27 28 29 22 31 13 33 18 4 8 37 34 15 40\n",
"40\n20 37 25 26 22 14 28 15 21 27 38 9 10 29 2 40 12 5 6 7 11 19 16 4 32 39 18 23 24 33 17 13 1 8 34 35 30 36 31 3\n",
"6\n3 2 1 5 4 6\n",
"5\n1 2 3 4 5\n",
"6\n6 2 3 1 5 4\n",
"40\n1 21 3 15 22 13 7 19 29 10 35 12 4 18 6 24 17 14 8 28 2 27 39 23 5 26 32 37 9 11 36 25 33 38 30 16 20 40 31 34\n",
"28\n19 2 8 3 13 5 6 10 18 4 22 26 7 14 15 12 21 28 1 20 11 25 9 24 16 17 27 23\n",
"40\n18 37 31 10 28 12 34 27 29 16 4 6 13 30 20 11 14 32 40 3 26 22 36 39 25 21 2 9 24 1 17 35 19 7 38 23 8 33 5 15\n",
"6\n2 1 4 6 5 3\n",
"40\n29 32 38 28 25 14 22 3 23 8 2 5 18 9 35 33 21 13 10 20 11 16 6 31 39 26 30 4 1 40 34 17 36 37 15 27 24 19 12 7\n",
"38\n2 1 32 13 25 18 23 30 11 35 9 29 4 26 31 21 24 6 22 33 16 19 7 17 5 14 28 27 12 8 15 3 20 36 10 34 38 37\n",
"40\n10 22 3 30 1 21 34 4 6 8 35 14 13 16 15 28 26 18 19 20 9 12 25 24 32 23 27 38 29 5 31 17 7 39 11 40 37 33 2 36\n",
"28\n15 25 5 8 7 12 3 28 22 14 19 21 24 16 10 9 27 13 23 20 17 1 11 26 6 4 2 18\n",
"28\n10 22 28 4 5 7 8 16 14 13 1 9 11 26 12 25 3 18 2 19 6 20 23 15 27 21 24 17\n",
"6\n4 5 3 2 6 1\n",
"40\n11 26 23 40 29 12 10 13 33 7 38 19 8 15 37 1 9 30 39 20 21 27 3 32 25 2 34 6 5 28 18 36 22 17 31 4 16 35 14 24\n",
"14\n13 5 9 3 4 14 1 7 12 10 11 2 8 6\n",
"40\n16 35 4 7 31 6 24 8 13 10 29 20 33 14 17 15 32 5 39 2 21 25 12 11 3 26 23 38 22 34 18 19 27 37 1 28 30 36 9 40\n",
"6\n5 3 4 2 6 1\n",
"5\n3 2 4 5 1\n",
"5\n1 2 5 4 3\n",
"36\n12 25 15 27 4 9 14 20 8 30 32 34 11 26 36 17 31 29 22 23 28 24 35 5 10 33 19 2 7 21 1 3 18 16 6 13\n",
"40\n5 8 38 6 29 33 40 37 15 16 7 24 13 39 32 1 20 14 17 11 22 4 12 9 21 18 28 2 3 30 31 23 25 34 27 26 35 10 36 19\n",
"36\n17 36 34 18 13 19 1 32 28 30 7 33 16 25 4 22 9 15 31 6 24 2 14 35 12 26 23 11 5 21 20 27 8 3 10 29\n",
"28\n11 18 3 1 2 6 21 14 16 15 23 27 19 25 10 9 17 8 28 13 4 5 7 24 20 22 12 26\n",
"40\n16 40 14 7 15 19 35 10 39 33 27 29 5 1 31 9 37 38 21 12 34 24 22 3 32 20 2 11 4 23 25 26 17 8 30 18 36 28 6 13\n",
"38\n36 35 9 21 7 18 37 23 31 20 34 15 13 10 5 27 30 26 25 38 14 4 12 3 11 8 24 28 1 2 32 22 29 6 19 16 17 33\n",
"40\n19 39 11 35 32 20 21 8 34 13 30 12 9 24 27 31 40 18 15 3 17 23 33 36 6 7 16 28 14 25 1 29 38 2 22 5 26 4 10 37\n",
"40\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40\n",
"40\n20 13 11 9 37 2 29 1 16 10 6 33 21 40 5 25 24 36 34 14 3 17 39 30 27 28 23 8 7 22 18 38 12 19 26 31 32 15 4 35\n",
"4\n2 1 4 3\n",
"4\n1 4 2 3\n",
"40\n31 17 29 11 2 9 27 18 26 22 24 20 13 19 34 33 32 35 25 40 12 1 16 4 37 21 10 39 8 28 7 36 3 15 23 38 14 30 5 6\n",
"28\n27 18 9 3 15 10 8 5 28 23 25 14 7 1 12 11 6 21 22 17 13 4 24 2 20 16 19 26\n",
"39\n13 30 15 38 18 5 3 24 7 25 31 6 21 2 10 26 36 4 35 29 11 37 33 28 16 22 19 20 14 1 8 17 9 23 39 12 34 27 32\n",
"4\n3 4 2 1\n",
"40\n10 6 21 25 26 4 11 37 24 1 7 12 3 14 36 16 15 18 19 27 33 22 23 32 31 5 20 17 29 28 2 9 13 39 30 35 40 38 34 8\n",
"28\n25 16 5 13 17 28 24 8 1 3 7 12 22 10 15 21 23 9 19 14 18 20 27 11 2 6 26 4\n",
"37\n5 2 33 13 11 25 7 23 32 10 36 9 27 19 4 18 35 3 29 20 34 37 8 26 6 1 15 28 14 30 16 12 31 21 17 24 22\n",
"14\n8 2 12 1 9 14 10 7 13 4 11 5 6 3\n",
"28\n7 23 20 8 5 15 19 4 9 10 11 27 13 18 14 1 6 28 12 3 17 25 2 24 22 26 16 21\n",
"14\n9 5 7 8 3 4 12 1 2 13 14 11 6 10\n",
"40\n26 14 8 4 5 6 23 29 31 10 11 3 9 2 27 22 17 18 1 20 12 13 25 40 37 30 35 16 38 19 33 32 36 34 15 28 7 24 39 21\n",
"6\n1 2 3 4 5 6\n",
"3\n3 2 1\n",
"3\n2 3 1\n",
"3\n2 1 3\n"
],
"output": [
"\n27408\n",
"\n1\n",
"\n98\n",
"71934792\n",
"574356387\n",
"265421783\n",
"530070867\n",
"869516344\n",
"415726972\n",
"138002586\n",
"599298292\n",
"213977822\n",
"7962624\n",
"27408\n",
"33026854\n",
"249571584\n",
"8\n",
"34\n",
"1\n",
"838321323\n",
"318040704\n",
"983979105\n",
"995349791\n",
"78667776\n",
"3\n",
"453630946\n",
"521197626\n",
"155510146\n",
"800341971\n",
"76656\n",
"791664201\n",
"112091327\n",
"438344128\n",
"535249010\n",
"713322691\n",
"280548662\n",
"742395366\n",
"887529037\n",
"721808187\n",
"280457164\n",
"578571076\n",
"686336367\n",
"862188346\n",
"852812830\n",
"3550360\n",
"605429229\n",
"819353730\n",
"704243067\n",
"759686477\n",
"51290496\n",
"928273536\n",
"951350414\n",
"856618292\n",
"394751753\n",
"610142731\n",
"112091327\n",
"531708085\n",
"988559258\n",
"741439269\n",
"567343674\n",
"9072\n",
"6960\n",
"540900899\n",
"792305224\n",
"653878024\n",
"1296\n",
"247377231\n",
"171092452\n",
"773039288\n",
"767947061\n",
"885030067\n",
"386706281\n",
"872371538\n",
"176938370\n",
"34\n",
"8\n",
"34\n"
]
} | 2CODEFORCES
|
1491_B. Minimal Cost_37907 | There is a graph of n rows and 10^6 + 2 columns, where rows are numbered from 1 to n and columns from 0 to 10^6 + 1:
<image>
Let's denote the node in the row i and column j by (i, j).
Initially for each i the i-th row has exactly one obstacle — at node (i, a_i). You want to move some obstacles so that you can reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph (you can't pass through obstacles). Moving one obstacle to an adjacent by edge free node costs u or v coins, as below:
* If there is an obstacle in the node (i, j), you can use u coins to move it to (i-1, j) or (i+1, j), if such node exists and if there is no obstacle in that node currently.
* If there is an obstacle in the node (i, j), you can use v coins to move it to (i, j-1) or (i, j+1), if such node exists and if there is no obstacle in that node currently.
* Note that you can't move obstacles outside the grid. For example, you can't move an obstacle from (1,1) to (0,1).
Refer to the picture above for a better understanding.
Now you need to calculate the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
The first line of each test case contains three integers n, u and v (2 ≤ n ≤ 100, 1 ≤ u, v ≤ 10^9) — the number of rows in the graph and the numbers of coins needed to move vertically and horizontally respectively.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6) — where a_i represents that the obstacle in the i-th row is in node (i, a_i).
It's guaranteed that the sum of n over all test cases doesn't exceed 2 ⋅ 10^4.
Output
For each test case, output a single integer — the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
It can be shown that under the constraints of the problem there is always a way to make such a trip possible.
Example
Input
3
2 3 4
2 2
2 3 4
3 2
2 4 3
3 2
Output
7
3
3
Note
In the first sample, two obstacles are at (1, 2) and (2,2). You can move the obstacle on (2, 2) to (2, 3), then to (1, 3). The total cost is u+v = 7 coins.
<image>
In the second sample, two obstacles are at (1, 3) and (2,2). You can move the obstacle on (1, 3) to (2, 3). The cost is u = 3 coins.
<image> | from __future__ import division
from sys import stdin, stdout
from collections import *
rstr = lambda: stdin.readline().strip()
rstrs = lambda: [str(x) for x in stdin.readline().split()]
rstr_2d = lambda n: [rstr() for _ in range(n)]
rint = lambda: int(stdin.readline())
rints = lambda: [int(x) for x in stdin.readline().split()]
rint_2d = lambda n: [rint() for _ in range(n)]
rints_2d = lambda n: [rints() for _ in range(n)]
pr = lambda args, sep: stdout.write(sep.join(map(str, args)) + '\n')
ceil1, out = lambda a, b: (a + b - 1) // b, []
for _ in range(int(input())):
n, u, v = rints()
a, ans = rints(), min(u + v, v * 2)
for i in range(1, n):
if abs(a[i] - a[i - 1]) >= 2:
ans = 0
break
else:
for i in range(1, n):
if abs(a[i] - a[i - 1]) == 1:
ans = min(u, v)
break
out.append(ans)
pr(out, '\n')
| 1Python2
| {
"input": [
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"1\n2 4 2\n999999 1000000\n",
"1\n2 1000000000 1\n999999 1000000\n",
"1\n3 1000000000 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 999999\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000000\n",
"1\n2 1000000000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000000\n",
"1\n2 2 1\n1 1000000\n",
"1\n2 100 1\n999999 1000000\n",
"1\n4 100 1\n999999 1000000 1000000 1000000\n",
"1\n2 1000 1\n999999 1000000\n",
"1\n3 100 1\n1000000 1000000 1000000\n",
"1\n2 100 2\n1000000 1000000\n",
"1\n2 100 1\n1000000 1000000\n",
"1\n2 50 5\n999999 999999\n",
"1\n2 4 2\n999999 1010000\n",
"1\n2 1000000000 2\n999999 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 101 1\n999999 1000000\n",
"3\n2 1 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 1000100000 4\n999999 1000000\n",
"1\n2 1100110000 8\n999999 1000000\n",
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 4\n3 2\n",
"1\n2 100 -1\n1000000 1000000\n",
"1\n2 1000000100 3\n999999 1000000\n",
"3\n2 1 4\n2 4\n2 3 3\n3 2\n2 4 3\n3 2\n",
"3\n2 1 3\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n3 1000000000 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000100\n",
"1\n4 100 1\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n162069 1000000\n",
"1\n3 100 0\n1000000 1000000 1000000\n",
"1\n2 100 0\n1000000 1000000\n",
"1\n2 50 5\n999999 584713\n",
"1\n2 6 2\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000000\n",
"1\n3 1000000010 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1000100\n",
"1\n2 101 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 1\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000000\n",
"1\n2 110 0\n1000000 1000000\n",
"1\n2 50 5\n530153 584713\n",
"3\n2 1 4\n2 2\n2 3 4\n3 4\n2 4 3\n3 2\n",
"1\n2 9 2\n999999 1010000\n",
"1\n3 1000000010 1\n1000000 1000010 1000010\n",
"1\n2 1100001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1100100\n",
"1\n2 101 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n2111 1000000\n",
"1\n3 100 0\n0010000 1000000 1000000\n",
"1\n2 110 0\n1000000 0000000\n",
"1\n2 50 5\n530153 82051\n",
"1\n2 9 2\n999999 1010001\n",
"1\n2 1100100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000000 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 1100000\n",
"1\n2 0 1\n1001000 1100100\n",
"1\n2 111 2\n999999 1000010\n",
"1\n4 100 0\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 1000000\n",
"1\n2 50 7\n530153 82051\n",
"1\n2 9 0\n999999 1010001\n",
"1\n2 1100110000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 1100100\n",
"1\n4 100 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 114195\n",
"1\n2 9 0\n619885 1010001\n",
"1\n2 0 1\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000100 1000000\n",
"1\n3 100 1\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 138080\n",
"1\n2 9 1\n619885 1010001\n",
"1\n2 1100110000 0\n999999 1000000\n",
"1\n2 0 0\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 1\n0010010 1100100 1000000\n",
"1\n2 50 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 1000000\n",
"1\n2 0 1\n0001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 112242\n",
"1\n2 0 1\n0001100 1000101\n",
"1\n4 100 0\n58970 1001010 1000010 1000000\n",
"1\n2 70 7\n136401 112242\n",
"1\n4 100 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n136401 50048\n",
"1\n4 100 0\n58970 1001010 1000010 1010001\n",
"1\n4 100 0\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1000010 1010001\n",
"1\n4 100 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010101\n",
"1\n4 110 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011101\n",
"1\n4 010 0\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n2881 1001001 1000011 1011101\n",
"1\n2 4 2\n999999 1000001\n",
"1\n2 1000000000 1\n189502 1000000\n",
"1\n3 1000000001 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001000\n",
"1\n2 2 1\n1000000 1001000\n",
"1\n2 0 1\n1 1000000\n",
"1\n2 100 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000000 1000000 1000010\n",
"1\n2 1000 1\n1880182 1000000\n",
"1\n3 100 1\n1000000 1000000 1001000\n",
"1\n2 50 5\n1568372 999999\n",
"1\n2 1000000100 2\n999999 1000000\n",
"1\n3 1000000100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 0\n100 1000000\n",
"1\n2 1000001000 1\n1000100 1000000\n",
"1\n2 001 1\n999999 1000000\n",
"1\n2 1000 1\n162069 1010000\n",
"1\n3 100 0\n1010000 1000000 1000000\n",
"1\n2 50 7\n999999 584713\n",
"3\n2 1 4\n2 2\n2 3 3\n3 2\n2 4 3\n3 2\n",
"1\n2 6 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000010\n",
"1\n3 1000000010 1\n1000000 1001000 1000010\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n2 2 1\n1001000 1000101\n",
"1\n3 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 0\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000010\n",
"1\n2 110 0\n1010000 0000000\n",
"1\n2 50 5\n598705 584713\n",
"3\n2 1 4\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n2 9 3\n999999 1010000\n",
"1\n2 1001100000 4\n999999 1000000\n",
"1\n3 1000000010 1\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000000\n",
"1\n2 2 1\n1001100 1100100\n",
"1\n2 100 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 0000000\n",
"1\n2 1000 1\n2111 1100000\n",
"1\n2 110 0\n1000001 0000000\n",
"1\n2 50 5\n530153 135808\n",
"1\n2 16 2\n999999 1010001\n",
"1\n2 1101100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000001 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 0100000\n",
"1\n2 0 0\n1001000 1100100\n",
"1\n4 100 1\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 0000000\n",
"1\n2 58 7\n530153 82051\n",
"1\n2 1100010000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 0100100\n",
"1\n4 110 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1100100 1000000\n",
"1\n2 50 7\n261990 114195\n",
"1\n2 1100110000 8\n1918077 1000000\n",
"1\n2 0 1\n1001000 1000100\n",
"1\n2 50 7\n530153 35266\n",
"1\n2 14 1\n619885 1010001\n",
"1\n2 0 0\n1001100 1000110\n",
"1\n4 101 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1101100 1000000\n",
"1\n2 49 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 0000000\n",
"1\n4 100 0\n28560 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 173819\n",
"1\n2 0 1\n0001110 1000100\n",
"1\n4 100 1\n58970 1001010 1000010 1000000\n",
"1\n2 70 6\n136401 112242\n",
"1\n4 000 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n271444 50048\n",
"1\n4 100 0\n58970 1001010 1000110 1010001\n",
"1\n4 110 0\n58970 1001000 1000010 1010001\n",
"1\n4 110 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1100010 1010001\n",
"1\n4 000 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000110 1010001\n",
"1\n4 110 1\n5381 1001001 1000011 1010001\n",
"1\n4 110 0\n3577 1001001 1000011 1010101\n",
"1\n4 111 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011111\n",
"1\n4 010 0\n3577 1001001 1010011 1011101\n",
"1\n4 110 0\n2881 1001001 1010011 1011101\n",
"1\n2 6 2\n999999 1000001\n",
"1\n2 1100000000 1\n189502 1000000\n",
"4\n2 3 1\n999999 1000001\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1001000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001100\n",
"1\n2 0 1\n1000000 1001000\n",
"1\n4 100 1\n999999 1000100 1000000 1000010\n",
"1\n2 1000 1\n1880182 0000000\n",
"1\n3 101 1\n1000000 1000000 1001000\n",
"1\n2 7 5\n1568372 999999\n",
"1\n3 1000001100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 5 0\n100 1000000\n",
"1\n2 1000001010 1\n1000100 1000000\n",
"1\n2 001 1\n513487 1000000\n",
"1\n2 1000 1\n323664 1010000\n",
"1\n3 101 0\n1010000 1000000 1000000\n",
"1\n2 0 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 0000010\n",
"1\n3 1000000010 1\n1000000 1010000 1000010\n",
"4\n2 3 1\n285716 1000010\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n3 000 1\n999999 1000011 1000000 1000000\n",
"1\n3 100 0\n0000100 1000000 1000010\n",
"1\n2 111 0\n1010000 0000000\n",
"1\n2 9 3\n551980 1010000\n",
"1\n3 1000000010 0\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000001\n"
],
"output": [
"\n7\n3\n3\n",
"2\n",
"1\n",
"2\n",
"1\n2\n1\n0\n",
"2\n",
"2\n",
"2\n",
"0\n",
"1\n",
"1\n",
"1\n",
"2\n",
"4\n",
"2\n",
"10\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"1\n",
"5\n3\n3\n",
"0\n2\n0\n0\n",
"4\n",
"8\n",
"7\n3\n4\n",
"-2\n",
"3\n",
"0\n3\n3\n",
"4\n3\n3\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
1491_B. Minimal Cost_37908 | There is a graph of n rows and 10^6 + 2 columns, where rows are numbered from 1 to n and columns from 0 to 10^6 + 1:
<image>
Let's denote the node in the row i and column j by (i, j).
Initially for each i the i-th row has exactly one obstacle — at node (i, a_i). You want to move some obstacles so that you can reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph (you can't pass through obstacles). Moving one obstacle to an adjacent by edge free node costs u or v coins, as below:
* If there is an obstacle in the node (i, j), you can use u coins to move it to (i-1, j) or (i+1, j), if such node exists and if there is no obstacle in that node currently.
* If there is an obstacle in the node (i, j), you can use v coins to move it to (i, j-1) or (i, j+1), if such node exists and if there is no obstacle in that node currently.
* Note that you can't move obstacles outside the grid. For example, you can't move an obstacle from (1,1) to (0,1).
Refer to the picture above for a better understanding.
Now you need to calculate the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
The first line of each test case contains three integers n, u and v (2 ≤ n ≤ 100, 1 ≤ u, v ≤ 10^9) — the number of rows in the graph and the numbers of coins needed to move vertically and horizontally respectively.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6) — where a_i represents that the obstacle in the i-th row is in node (i, a_i).
It's guaranteed that the sum of n over all test cases doesn't exceed 2 ⋅ 10^4.
Output
For each test case, output a single integer — the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
It can be shown that under the constraints of the problem there is always a way to make such a trip possible.
Example
Input
3
2 3 4
2 2
2 3 4
3 2
2 4 3
3 2
Output
7
3
3
Note
In the first sample, two obstacles are at (1, 2) and (2,2). You can move the obstacle on (2, 2) to (2, 3), then to (1, 3). The total cost is u+v = 7 coins.
<image>
In the second sample, two obstacles are at (1, 3) and (2,2). You can move the obstacle on (1, 3) to (2, 3). The cost is u = 3 coins.
<image> | #include<bits/stdc++.h>
using namespace std;
void problem_solver() {
int n, u, v;
cin >> n >> u >> v;
vector<int> a(n);
bool t1 = false, t2 = false, t3 = false;
for(int i=0; i<n; i++) cin >> a[i];
for(int i=0; i<n-1; i++) {
if(abs(a[i] - a[i+1]) > 1) {
cout << 0;
return;
}
if(a[i] - a[i+1] == 0) t1 = true;
if(abs(a[i] - a[i+1]) == 1) t2 = true;
}
int cost = INT_MAX;
if(t1) {
cost = 2 * v;
cost = min(cost, u + v);
}
if(t2) {
cost = min(cost, min(u, v));
}
cout << cost;
}
int main() {
int tt;
cin >> tt;
for(int t=1; t<=tt; t++) {
problem_solver();
cout << "\n";
}
}
| 2C++
| {
"input": [
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"1\n2 4 2\n999999 1000000\n",
"1\n2 1000000000 1\n999999 1000000\n",
"1\n3 1000000000 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 999999\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000000\n",
"1\n2 1000000000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000000\n",
"1\n2 2 1\n1 1000000\n",
"1\n2 100 1\n999999 1000000\n",
"1\n4 100 1\n999999 1000000 1000000 1000000\n",
"1\n2 1000 1\n999999 1000000\n",
"1\n3 100 1\n1000000 1000000 1000000\n",
"1\n2 100 2\n1000000 1000000\n",
"1\n2 100 1\n1000000 1000000\n",
"1\n2 50 5\n999999 999999\n",
"1\n2 4 2\n999999 1010000\n",
"1\n2 1000000000 2\n999999 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 101 1\n999999 1000000\n",
"3\n2 1 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 1000100000 4\n999999 1000000\n",
"1\n2 1100110000 8\n999999 1000000\n",
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 4\n3 2\n",
"1\n2 100 -1\n1000000 1000000\n",
"1\n2 1000000100 3\n999999 1000000\n",
"3\n2 1 4\n2 4\n2 3 3\n3 2\n2 4 3\n3 2\n",
"3\n2 1 3\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n3 1000000000 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000100\n",
"1\n4 100 1\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n162069 1000000\n",
"1\n3 100 0\n1000000 1000000 1000000\n",
"1\n2 100 0\n1000000 1000000\n",
"1\n2 50 5\n999999 584713\n",
"1\n2 6 2\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000000\n",
"1\n3 1000000010 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1000100\n",
"1\n2 101 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 1\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000000\n",
"1\n2 110 0\n1000000 1000000\n",
"1\n2 50 5\n530153 584713\n",
"3\n2 1 4\n2 2\n2 3 4\n3 4\n2 4 3\n3 2\n",
"1\n2 9 2\n999999 1010000\n",
"1\n3 1000000010 1\n1000000 1000010 1000010\n",
"1\n2 1100001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1100100\n",
"1\n2 101 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n2111 1000000\n",
"1\n3 100 0\n0010000 1000000 1000000\n",
"1\n2 110 0\n1000000 0000000\n",
"1\n2 50 5\n530153 82051\n",
"1\n2 9 2\n999999 1010001\n",
"1\n2 1100100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000000 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 1100000\n",
"1\n2 0 1\n1001000 1100100\n",
"1\n2 111 2\n999999 1000010\n",
"1\n4 100 0\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 1000000\n",
"1\n2 50 7\n530153 82051\n",
"1\n2 9 0\n999999 1010001\n",
"1\n2 1100110000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 1100100\n",
"1\n4 100 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 114195\n",
"1\n2 9 0\n619885 1010001\n",
"1\n2 0 1\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000100 1000000\n",
"1\n3 100 1\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 138080\n",
"1\n2 9 1\n619885 1010001\n",
"1\n2 1100110000 0\n999999 1000000\n",
"1\n2 0 0\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 1\n0010010 1100100 1000000\n",
"1\n2 50 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 1000000\n",
"1\n2 0 1\n0001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 112242\n",
"1\n2 0 1\n0001100 1000101\n",
"1\n4 100 0\n58970 1001010 1000010 1000000\n",
"1\n2 70 7\n136401 112242\n",
"1\n4 100 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n136401 50048\n",
"1\n4 100 0\n58970 1001010 1000010 1010001\n",
"1\n4 100 0\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1000010 1010001\n",
"1\n4 100 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010101\n",
"1\n4 110 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011101\n",
"1\n4 010 0\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n2881 1001001 1000011 1011101\n",
"1\n2 4 2\n999999 1000001\n",
"1\n2 1000000000 1\n189502 1000000\n",
"1\n3 1000000001 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001000\n",
"1\n2 2 1\n1000000 1001000\n",
"1\n2 0 1\n1 1000000\n",
"1\n2 100 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000000 1000000 1000010\n",
"1\n2 1000 1\n1880182 1000000\n",
"1\n3 100 1\n1000000 1000000 1001000\n",
"1\n2 50 5\n1568372 999999\n",
"1\n2 1000000100 2\n999999 1000000\n",
"1\n3 1000000100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 0\n100 1000000\n",
"1\n2 1000001000 1\n1000100 1000000\n",
"1\n2 001 1\n999999 1000000\n",
"1\n2 1000 1\n162069 1010000\n",
"1\n3 100 0\n1010000 1000000 1000000\n",
"1\n2 50 7\n999999 584713\n",
"3\n2 1 4\n2 2\n2 3 3\n3 2\n2 4 3\n3 2\n",
"1\n2 6 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000010\n",
"1\n3 1000000010 1\n1000000 1001000 1000010\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n2 2 1\n1001000 1000101\n",
"1\n3 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 0\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000010\n",
"1\n2 110 0\n1010000 0000000\n",
"1\n2 50 5\n598705 584713\n",
"3\n2 1 4\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n2 9 3\n999999 1010000\n",
"1\n2 1001100000 4\n999999 1000000\n",
"1\n3 1000000010 1\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000000\n",
"1\n2 2 1\n1001100 1100100\n",
"1\n2 100 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 0000000\n",
"1\n2 1000 1\n2111 1100000\n",
"1\n2 110 0\n1000001 0000000\n",
"1\n2 50 5\n530153 135808\n",
"1\n2 16 2\n999999 1010001\n",
"1\n2 1101100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000001 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 0100000\n",
"1\n2 0 0\n1001000 1100100\n",
"1\n4 100 1\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 0000000\n",
"1\n2 58 7\n530153 82051\n",
"1\n2 1100010000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 0100100\n",
"1\n4 110 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1100100 1000000\n",
"1\n2 50 7\n261990 114195\n",
"1\n2 1100110000 8\n1918077 1000000\n",
"1\n2 0 1\n1001000 1000100\n",
"1\n2 50 7\n530153 35266\n",
"1\n2 14 1\n619885 1010001\n",
"1\n2 0 0\n1001100 1000110\n",
"1\n4 101 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1101100 1000000\n",
"1\n2 49 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 0000000\n",
"1\n4 100 0\n28560 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 173819\n",
"1\n2 0 1\n0001110 1000100\n",
"1\n4 100 1\n58970 1001010 1000010 1000000\n",
"1\n2 70 6\n136401 112242\n",
"1\n4 000 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n271444 50048\n",
"1\n4 100 0\n58970 1001010 1000110 1010001\n",
"1\n4 110 0\n58970 1001000 1000010 1010001\n",
"1\n4 110 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1100010 1010001\n",
"1\n4 000 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000110 1010001\n",
"1\n4 110 1\n5381 1001001 1000011 1010001\n",
"1\n4 110 0\n3577 1001001 1000011 1010101\n",
"1\n4 111 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011111\n",
"1\n4 010 0\n3577 1001001 1010011 1011101\n",
"1\n4 110 0\n2881 1001001 1010011 1011101\n",
"1\n2 6 2\n999999 1000001\n",
"1\n2 1100000000 1\n189502 1000000\n",
"4\n2 3 1\n999999 1000001\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1001000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001100\n",
"1\n2 0 1\n1000000 1001000\n",
"1\n4 100 1\n999999 1000100 1000000 1000010\n",
"1\n2 1000 1\n1880182 0000000\n",
"1\n3 101 1\n1000000 1000000 1001000\n",
"1\n2 7 5\n1568372 999999\n",
"1\n3 1000001100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 5 0\n100 1000000\n",
"1\n2 1000001010 1\n1000100 1000000\n",
"1\n2 001 1\n513487 1000000\n",
"1\n2 1000 1\n323664 1010000\n",
"1\n3 101 0\n1010000 1000000 1000000\n",
"1\n2 0 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 0000010\n",
"1\n3 1000000010 1\n1000000 1010000 1000010\n",
"4\n2 3 1\n285716 1000010\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n3 000 1\n999999 1000011 1000000 1000000\n",
"1\n3 100 0\n0000100 1000000 1000010\n",
"1\n2 111 0\n1010000 0000000\n",
"1\n2 9 3\n551980 1010000\n",
"1\n3 1000000010 0\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000001\n"
],
"output": [
"\n7\n3\n3\n",
"2\n",
"1\n",
"2\n",
"1\n2\n1\n0\n",
"2\n",
"2\n",
"2\n",
"0\n",
"1\n",
"1\n",
"1\n",
"2\n",
"4\n",
"2\n",
"10\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"1\n",
"5\n3\n3\n",
"0\n2\n0\n0\n",
"4\n",
"8\n",
"7\n3\n4\n",
"-2\n",
"3\n",
"0\n3\n3\n",
"4\n3\n3\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
1491_B. Minimal Cost_37909 | There is a graph of n rows and 10^6 + 2 columns, where rows are numbered from 1 to n and columns from 0 to 10^6 + 1:
<image>
Let's denote the node in the row i and column j by (i, j).
Initially for each i the i-th row has exactly one obstacle — at node (i, a_i). You want to move some obstacles so that you can reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph (you can't pass through obstacles). Moving one obstacle to an adjacent by edge free node costs u or v coins, as below:
* If there is an obstacle in the node (i, j), you can use u coins to move it to (i-1, j) or (i+1, j), if such node exists and if there is no obstacle in that node currently.
* If there is an obstacle in the node (i, j), you can use v coins to move it to (i, j-1) or (i, j+1), if such node exists and if there is no obstacle in that node currently.
* Note that you can't move obstacles outside the grid. For example, you can't move an obstacle from (1,1) to (0,1).
Refer to the picture above for a better understanding.
Now you need to calculate the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
The first line of each test case contains three integers n, u and v (2 ≤ n ≤ 100, 1 ≤ u, v ≤ 10^9) — the number of rows in the graph and the numbers of coins needed to move vertically and horizontally respectively.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6) — where a_i represents that the obstacle in the i-th row is in node (i, a_i).
It's guaranteed that the sum of n over all test cases doesn't exceed 2 ⋅ 10^4.
Output
For each test case, output a single integer — the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
It can be shown that under the constraints of the problem there is always a way to make such a trip possible.
Example
Input
3
2 3 4
2 2
2 3 4
3 2
2 4 3
3 2
Output
7
3
3
Note
In the first sample, two obstacles are at (1, 2) and (2,2). You can move the obstacle on (2, 2) to (2, 3), then to (1, 3). The total cost is u+v = 7 coins.
<image>
In the second sample, two obstacles are at (1, 3) and (2,2). You can move the obstacle on (1, 3) to (2, 3). The cost is u = 3 coins.
<image> |
t=int(input())
while t:
n,v,h=map(int,input().split())
a=list(map(int,input().split()))
diff=0
for i in range(1,n):
diff=max(abs(a[i]-a[i-1]),diff)
if diff>=2:
print(0)
elif diff==1:
print(min(v,h))
elif diff==0:
print(min(h+h,v+h))
t=t-1
| 3Python3
| {
"input": [
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"1\n2 4 2\n999999 1000000\n",
"1\n2 1000000000 1\n999999 1000000\n",
"1\n3 1000000000 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 999999\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000000\n",
"1\n2 1000000000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000000\n",
"1\n2 2 1\n1 1000000\n",
"1\n2 100 1\n999999 1000000\n",
"1\n4 100 1\n999999 1000000 1000000 1000000\n",
"1\n2 1000 1\n999999 1000000\n",
"1\n3 100 1\n1000000 1000000 1000000\n",
"1\n2 100 2\n1000000 1000000\n",
"1\n2 100 1\n1000000 1000000\n",
"1\n2 50 5\n999999 999999\n",
"1\n2 4 2\n999999 1010000\n",
"1\n2 1000000000 2\n999999 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 101 1\n999999 1000000\n",
"3\n2 1 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 1000100000 4\n999999 1000000\n",
"1\n2 1100110000 8\n999999 1000000\n",
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 4\n3 2\n",
"1\n2 100 -1\n1000000 1000000\n",
"1\n2 1000000100 3\n999999 1000000\n",
"3\n2 1 4\n2 4\n2 3 3\n3 2\n2 4 3\n3 2\n",
"3\n2 1 3\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n3 1000000000 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000100\n",
"1\n4 100 1\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n162069 1000000\n",
"1\n3 100 0\n1000000 1000000 1000000\n",
"1\n2 100 0\n1000000 1000000\n",
"1\n2 50 5\n999999 584713\n",
"1\n2 6 2\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000000\n",
"1\n3 1000000010 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1000100\n",
"1\n2 101 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 1\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000000\n",
"1\n2 110 0\n1000000 1000000\n",
"1\n2 50 5\n530153 584713\n",
"3\n2 1 4\n2 2\n2 3 4\n3 4\n2 4 3\n3 2\n",
"1\n2 9 2\n999999 1010000\n",
"1\n3 1000000010 1\n1000000 1000010 1000010\n",
"1\n2 1100001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1100100\n",
"1\n2 101 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n2111 1000000\n",
"1\n3 100 0\n0010000 1000000 1000000\n",
"1\n2 110 0\n1000000 0000000\n",
"1\n2 50 5\n530153 82051\n",
"1\n2 9 2\n999999 1010001\n",
"1\n2 1100100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000000 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 1100000\n",
"1\n2 0 1\n1001000 1100100\n",
"1\n2 111 2\n999999 1000010\n",
"1\n4 100 0\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 1000000\n",
"1\n2 50 7\n530153 82051\n",
"1\n2 9 0\n999999 1010001\n",
"1\n2 1100110000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 1100100\n",
"1\n4 100 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 114195\n",
"1\n2 9 0\n619885 1010001\n",
"1\n2 0 1\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000100 1000000\n",
"1\n3 100 1\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 138080\n",
"1\n2 9 1\n619885 1010001\n",
"1\n2 1100110000 0\n999999 1000000\n",
"1\n2 0 0\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 1\n0010010 1100100 1000000\n",
"1\n2 50 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 1000000\n",
"1\n2 0 1\n0001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 112242\n",
"1\n2 0 1\n0001100 1000101\n",
"1\n4 100 0\n58970 1001010 1000010 1000000\n",
"1\n2 70 7\n136401 112242\n",
"1\n4 100 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n136401 50048\n",
"1\n4 100 0\n58970 1001010 1000010 1010001\n",
"1\n4 100 0\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1000010 1010001\n",
"1\n4 100 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010101\n",
"1\n4 110 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011101\n",
"1\n4 010 0\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n2881 1001001 1000011 1011101\n",
"1\n2 4 2\n999999 1000001\n",
"1\n2 1000000000 1\n189502 1000000\n",
"1\n3 1000000001 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001000\n",
"1\n2 2 1\n1000000 1001000\n",
"1\n2 0 1\n1 1000000\n",
"1\n2 100 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000000 1000000 1000010\n",
"1\n2 1000 1\n1880182 1000000\n",
"1\n3 100 1\n1000000 1000000 1001000\n",
"1\n2 50 5\n1568372 999999\n",
"1\n2 1000000100 2\n999999 1000000\n",
"1\n3 1000000100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 0\n100 1000000\n",
"1\n2 1000001000 1\n1000100 1000000\n",
"1\n2 001 1\n999999 1000000\n",
"1\n2 1000 1\n162069 1010000\n",
"1\n3 100 0\n1010000 1000000 1000000\n",
"1\n2 50 7\n999999 584713\n",
"3\n2 1 4\n2 2\n2 3 3\n3 2\n2 4 3\n3 2\n",
"1\n2 6 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000010\n",
"1\n3 1000000010 1\n1000000 1001000 1000010\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n2 2 1\n1001000 1000101\n",
"1\n3 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 0\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000010\n",
"1\n2 110 0\n1010000 0000000\n",
"1\n2 50 5\n598705 584713\n",
"3\n2 1 4\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n2 9 3\n999999 1010000\n",
"1\n2 1001100000 4\n999999 1000000\n",
"1\n3 1000000010 1\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000000\n",
"1\n2 2 1\n1001100 1100100\n",
"1\n2 100 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 0000000\n",
"1\n2 1000 1\n2111 1100000\n",
"1\n2 110 0\n1000001 0000000\n",
"1\n2 50 5\n530153 135808\n",
"1\n2 16 2\n999999 1010001\n",
"1\n2 1101100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000001 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 0100000\n",
"1\n2 0 0\n1001000 1100100\n",
"1\n4 100 1\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 0000000\n",
"1\n2 58 7\n530153 82051\n",
"1\n2 1100010000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 0100100\n",
"1\n4 110 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1100100 1000000\n",
"1\n2 50 7\n261990 114195\n",
"1\n2 1100110000 8\n1918077 1000000\n",
"1\n2 0 1\n1001000 1000100\n",
"1\n2 50 7\n530153 35266\n",
"1\n2 14 1\n619885 1010001\n",
"1\n2 0 0\n1001100 1000110\n",
"1\n4 101 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1101100 1000000\n",
"1\n2 49 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 0000000\n",
"1\n4 100 0\n28560 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 173819\n",
"1\n2 0 1\n0001110 1000100\n",
"1\n4 100 1\n58970 1001010 1000010 1000000\n",
"1\n2 70 6\n136401 112242\n",
"1\n4 000 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n271444 50048\n",
"1\n4 100 0\n58970 1001010 1000110 1010001\n",
"1\n4 110 0\n58970 1001000 1000010 1010001\n",
"1\n4 110 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1100010 1010001\n",
"1\n4 000 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000110 1010001\n",
"1\n4 110 1\n5381 1001001 1000011 1010001\n",
"1\n4 110 0\n3577 1001001 1000011 1010101\n",
"1\n4 111 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011111\n",
"1\n4 010 0\n3577 1001001 1010011 1011101\n",
"1\n4 110 0\n2881 1001001 1010011 1011101\n",
"1\n2 6 2\n999999 1000001\n",
"1\n2 1100000000 1\n189502 1000000\n",
"4\n2 3 1\n999999 1000001\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1001000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001100\n",
"1\n2 0 1\n1000000 1001000\n",
"1\n4 100 1\n999999 1000100 1000000 1000010\n",
"1\n2 1000 1\n1880182 0000000\n",
"1\n3 101 1\n1000000 1000000 1001000\n",
"1\n2 7 5\n1568372 999999\n",
"1\n3 1000001100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 5 0\n100 1000000\n",
"1\n2 1000001010 1\n1000100 1000000\n",
"1\n2 001 1\n513487 1000000\n",
"1\n2 1000 1\n323664 1010000\n",
"1\n3 101 0\n1010000 1000000 1000000\n",
"1\n2 0 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 0000010\n",
"1\n3 1000000010 1\n1000000 1010000 1000010\n",
"4\n2 3 1\n285716 1000010\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n3 000 1\n999999 1000011 1000000 1000000\n",
"1\n3 100 0\n0000100 1000000 1000010\n",
"1\n2 111 0\n1010000 0000000\n",
"1\n2 9 3\n551980 1010000\n",
"1\n3 1000000010 0\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000001\n"
],
"output": [
"\n7\n3\n3\n",
"2\n",
"1\n",
"2\n",
"1\n2\n1\n0\n",
"2\n",
"2\n",
"2\n",
"0\n",
"1\n",
"1\n",
"1\n",
"2\n",
"4\n",
"2\n",
"10\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"1\n",
"5\n3\n3\n",
"0\n2\n0\n0\n",
"4\n",
"8\n",
"7\n3\n4\n",
"-2\n",
"3\n",
"0\n3\n3\n",
"4\n3\n3\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
1491_B. Minimal Cost_37910 | There is a graph of n rows and 10^6 + 2 columns, where rows are numbered from 1 to n and columns from 0 to 10^6 + 1:
<image>
Let's denote the node in the row i and column j by (i, j).
Initially for each i the i-th row has exactly one obstacle — at node (i, a_i). You want to move some obstacles so that you can reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph (you can't pass through obstacles). Moving one obstacle to an adjacent by edge free node costs u or v coins, as below:
* If there is an obstacle in the node (i, j), you can use u coins to move it to (i-1, j) or (i+1, j), if such node exists and if there is no obstacle in that node currently.
* If there is an obstacle in the node (i, j), you can use v coins to move it to (i, j-1) or (i, j+1), if such node exists and if there is no obstacle in that node currently.
* Note that you can't move obstacles outside the grid. For example, you can't move an obstacle from (1,1) to (0,1).
Refer to the picture above for a better understanding.
Now you need to calculate the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
The first line of each test case contains three integers n, u and v (2 ≤ n ≤ 100, 1 ≤ u, v ≤ 10^9) — the number of rows in the graph and the numbers of coins needed to move vertically and horizontally respectively.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6) — where a_i represents that the obstacle in the i-th row is in node (i, a_i).
It's guaranteed that the sum of n over all test cases doesn't exceed 2 ⋅ 10^4.
Output
For each test case, output a single integer — the minimal number of coins you need to spend to be able to reach node (n, 10^6+1) from node (1, 0) by moving through edges of this graph without passing through obstacles.
It can be shown that under the constraints of the problem there is always a way to make such a trip possible.
Example
Input
3
2 3 4
2 2
2 3 4
3 2
2 4 3
3 2
Output
7
3
3
Note
In the first sample, two obstacles are at (1, 2) and (2,2). You can move the obstacle on (2, 2) to (2, 3), then to (1, 3). The total cost is u+v = 7 coins.
<image>
In the second sample, two obstacles are at (1, 3) and (2,2). You can move the obstacle on (1, 3) to (2, 3). The cost is u = 3 coins.
<image> | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int q = sc.nextInt();
while((q--)!=0) {
int n = sc.nextInt();
int u = sc.nextInt();
int v = sc.nextInt();
String s=sc.nextLine();
String[] a = sc.nextLine().split(" ");
int z=Integer.parseInt(a[0]);
int w=0;
for(int i=1;i<a.length;i++) {
int d=Integer.parseInt(a[i]);
w=Math.max(Math.abs(z-d), w);
z=d;
}
if(w==0) {
if(v<u)System.out.println(2*v);
else System.out.println(u+v);
}else if(w==1) {
System.out.println(Math.min(v, u));
}else {
System.out.println("0");
}
}
}
}
| 4JAVA
| {
"input": [
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"1\n2 4 2\n999999 1000000\n",
"1\n2 1000000000 1\n999999 1000000\n",
"1\n3 1000000000 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 999999\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000000\n",
"1\n2 1000000000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000000\n",
"1\n2 2 1\n1 1000000\n",
"1\n2 100 1\n999999 1000000\n",
"1\n4 100 1\n999999 1000000 1000000 1000000\n",
"1\n2 1000 1\n999999 1000000\n",
"1\n3 100 1\n1000000 1000000 1000000\n",
"1\n2 100 2\n1000000 1000000\n",
"1\n2 100 1\n1000000 1000000\n",
"1\n2 50 5\n999999 999999\n",
"1\n2 4 2\n999999 1010000\n",
"1\n2 1000000000 2\n999999 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 101 1\n999999 1000000\n",
"3\n2 1 4\n2 2\n2 3 4\n3 2\n2 4 3\n3 2\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 1\n100 1000000\n",
"1\n2 1000100000 4\n999999 1000000\n",
"1\n2 1100110000 8\n999999 1000000\n",
"3\n2 3 4\n2 2\n2 3 4\n3 2\n2 4 4\n3 2\n",
"1\n2 100 -1\n1000000 1000000\n",
"1\n2 1000000100 3\n999999 1000000\n",
"3\n2 1 4\n2 4\n2 3 3\n3 2\n2 4 3\n3 2\n",
"3\n2 1 3\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n3 1000000000 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 1\n1000000 1000000\n",
"1\n2 2 1\n1000000 1000100\n",
"1\n4 100 1\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n162069 1000000\n",
"1\n3 100 0\n1000000 1000000 1000000\n",
"1\n2 100 0\n1000000 1000000\n",
"1\n2 50 5\n999999 584713\n",
"1\n2 6 2\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000000\n",
"1\n3 1000000010 1\n1000000 1000000 1000010\n",
"1\n2 1000001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1000100\n",
"1\n2 101 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 1\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000000\n",
"1\n2 110 0\n1000000 1000000\n",
"1\n2 50 5\n530153 584713\n",
"3\n2 1 4\n2 2\n2 3 4\n3 4\n2 4 3\n3 2\n",
"1\n2 9 2\n999999 1010000\n",
"1\n3 1000000010 1\n1000000 1000010 1000010\n",
"1\n2 1100001000 0\n1000000 1000000\n",
"1\n2 2 1\n1001000 1100100\n",
"1\n2 101 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 1000000\n",
"1\n2 1000 1\n2111 1000000\n",
"1\n3 100 0\n0010000 1000000 1000000\n",
"1\n2 110 0\n1000000 0000000\n",
"1\n2 50 5\n530153 82051\n",
"1\n2 9 2\n999999 1010001\n",
"1\n2 1100100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000000 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 1100000\n",
"1\n2 0 1\n1001000 1100100\n",
"1\n2 111 2\n999999 1000010\n",
"1\n4 100 0\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 1000000\n",
"1\n2 50 7\n530153 82051\n",
"1\n2 9 0\n999999 1010001\n",
"1\n2 1100110000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 1100100\n",
"1\n4 100 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 114195\n",
"1\n2 9 0\n619885 1010001\n",
"1\n2 0 1\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000100 1000000\n",
"1\n3 100 1\n0010010 1000100 1000000\n",
"1\n2 50 7\n530153 138080\n",
"1\n2 9 1\n619885 1010001\n",
"1\n2 1100110000 0\n999999 1000000\n",
"1\n2 0 0\n1001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 1\n0010010 1100100 1000000\n",
"1\n2 50 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 1000000\n",
"1\n2 0 1\n0001100 1000100\n",
"1\n4 100 0\n58970 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 112242\n",
"1\n2 0 1\n0001100 1000101\n",
"1\n4 100 0\n58970 1001010 1000010 1000000\n",
"1\n2 70 7\n136401 112242\n",
"1\n4 100 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n136401 50048\n",
"1\n4 100 0\n58970 1001010 1000010 1010001\n",
"1\n4 100 0\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1000010 1010001\n",
"1\n4 100 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010001\n",
"1\n4 110 1\n3577 1001001 1000011 1010101\n",
"1\n4 110 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011101\n",
"1\n4 010 0\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n2881 1001001 1000011 1011101\n",
"1\n2 4 2\n999999 1000001\n",
"1\n2 1000000000 1\n189502 1000000\n",
"1\n3 1000000001 1\n1000000 1000000 1000000\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1000000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001000\n",
"1\n2 2 1\n1000000 1001000\n",
"1\n2 0 1\n1 1000000\n",
"1\n2 100 1\n999999 1000010\n",
"1\n4 100 1\n999999 1000000 1000000 1000010\n",
"1\n2 1000 1\n1880182 1000000\n",
"1\n3 100 1\n1000000 1000000 1001000\n",
"1\n2 50 5\n1568372 999999\n",
"1\n2 1000000100 2\n999999 1000000\n",
"1\n3 1000000100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 3 0\n100 1000000\n",
"1\n2 1000001000 1\n1000100 1000000\n",
"1\n2 001 1\n999999 1000000\n",
"1\n2 1000 1\n162069 1010000\n",
"1\n3 100 0\n1010000 1000000 1000000\n",
"1\n2 50 7\n999999 584713\n",
"3\n2 1 4\n2 2\n2 3 3\n3 2\n2 4 3\n3 2\n",
"1\n2 6 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 1000010\n",
"1\n3 1000000010 1\n1000000 1001000 1000010\n",
"4\n2 3 1\n285716 1000000\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n2 2 1\n1001000 1000101\n",
"1\n3 100 1\n999999 1000011 1000000 1000000\n",
"1\n2 1001 0\n162069 1000000\n",
"1\n3 100 0\n0000000 1000000 1000010\n",
"1\n2 110 0\n1010000 0000000\n",
"1\n2 50 5\n598705 584713\n",
"3\n2 1 4\n2 2\n2 3 6\n3 4\n2 4 3\n3 2\n",
"1\n2 9 3\n999999 1010000\n",
"1\n2 1001100000 4\n999999 1000000\n",
"1\n3 1000000010 1\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000000\n",
"1\n2 2 1\n1001100 1100100\n",
"1\n2 100 2\n999999 1000010\n",
"1\n4 100 0\n999999 1000010 1000000 0000000\n",
"1\n2 1000 1\n2111 1100000\n",
"1\n2 110 0\n1000001 0000000\n",
"1\n2 50 5\n530153 135808\n",
"1\n2 16 2\n999999 1010001\n",
"1\n2 1101100000 4\n999999 1000000\n",
"1\n3 1100000010 1\n1000001 1000000 1000010\n",
"1\n2 1100001000 0\n1000000 0100000\n",
"1\n2 0 0\n1001000 1100100\n",
"1\n4 100 1\n38624 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1000000 0000000\n",
"1\n2 58 7\n530153 82051\n",
"1\n2 1100010000 4\n999999 1000000\n",
"1\n2 0 1\n1001100 0100100\n",
"1\n4 110 0\n38624 1000010 1000100 1000000\n",
"1\n3 100 0\n0010010 1100100 1000000\n",
"1\n2 50 7\n261990 114195\n",
"1\n2 1100110000 8\n1918077 1000000\n",
"1\n2 0 1\n1001000 1000100\n",
"1\n2 50 7\n530153 35266\n",
"1\n2 14 1\n619885 1010001\n",
"1\n2 0 0\n1001100 1000110\n",
"1\n4 101 0\n58970 1000010 1000000 1000000\n",
"1\n3 100 0\n0010010 1101100 1000000\n",
"1\n2 49 7\n530153 112242\n",
"1\n2 1100110000 0\n543399 0000000\n",
"1\n4 100 0\n28560 1000010 1000010 1000000\n",
"1\n2 50 7\n136401 173819\n",
"1\n2 0 1\n0001110 1000100\n",
"1\n4 100 1\n58970 1001010 1000010 1000000\n",
"1\n2 70 6\n136401 112242\n",
"1\n4 000 0\n58970 1001010 1000010 1010000\n",
"1\n2 70 7\n271444 50048\n",
"1\n4 100 0\n58970 1001010 1000110 1010001\n",
"1\n4 110 0\n58970 1001000 1000010 1010001\n",
"1\n4 110 1\n58970 1001000 1000010 1010001\n",
"1\n4 100 1\n58970 1001001 1100010 1010001\n",
"1\n4 000 1\n3577 1001001 1000010 1010001\n",
"1\n4 110 1\n3577 1001001 1000110 1010001\n",
"1\n4 110 1\n5381 1001001 1000011 1010001\n",
"1\n4 110 0\n3577 1001001 1000011 1010101\n",
"1\n4 111 1\n3577 1001001 1000011 1011101\n",
"1\n4 110 0\n3577 1001001 1000011 1011111\n",
"1\n4 010 0\n3577 1001001 1010011 1011101\n",
"1\n4 110 0\n2881 1001001 1010011 1011101\n",
"1\n2 6 2\n999999 1000001\n",
"1\n2 1100000000 1\n189502 1000000\n",
"4\n2 3 1\n999999 1000001\n2 3 2\n999999 1000000\n2 3 1\n1000000 700300\n2 3 1\n100 1000000\n",
"1\n3 1 1\n1001000 1000000 1000100\n",
"1\n2 1000000000 1\n1000000 1001100\n",
"1\n2 0 1\n1000000 1001000\n",
"1\n4 100 1\n999999 1000100 1000000 1000010\n",
"1\n2 1000 1\n1880182 0000000\n",
"1\n3 101 1\n1000000 1000000 1001000\n",
"1\n2 7 5\n1568372 999999\n",
"1\n3 1000001100 1\n1000000 1000000 1000010\n",
"4\n2 3 1\n999999 1000000\n2 3 2\n999999 1000000\n2 3 1\n1000000 1584412\n2 5 0\n100 1000000\n",
"1\n2 1000001010 1\n1000100 1000000\n",
"1\n2 001 1\n513487 1000000\n",
"1\n2 1000 1\n323664 1010000\n",
"1\n3 101 0\n1010000 1000000 1000000\n",
"1\n2 0 4\n999999 1010000\n",
"1\n2 1000100000 2\n999999 0000010\n",
"1\n3 1000000010 1\n1000000 1010000 1000010\n",
"4\n2 3 1\n285716 1000010\n2 3 2\n999999 1000000\n2 3 1\n1010000 1584412\n2 3 1\n100 1000000\n",
"1\n3 000 1\n999999 1000011 1000000 1000000\n",
"1\n3 100 0\n0000100 1000000 1000010\n",
"1\n2 111 0\n1010000 0000000\n",
"1\n2 9 3\n551980 1010000\n",
"1\n3 1000000010 0\n1000001 1000010 1000010\n",
"1\n2 1100001000 0\n1000100 1000001\n"
],
"output": [
"\n7\n3\n3\n",
"2\n",
"1\n",
"2\n",
"1\n2\n1\n0\n",
"2\n",
"2\n",
"2\n",
"0\n",
"1\n",
"1\n",
"1\n",
"2\n",
"4\n",
"2\n",
"10\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"1\n",
"5\n3\n3\n",
"0\n2\n0\n0\n",
"4\n",
"8\n",
"7\n3\n4\n",
"-2\n",
"3\n",
"0\n3\n3\n",
"4\n3\n3\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"2\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"5\n3\n3\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"4\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n2\n0\n0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
1513_E. Cost Equilibrium_37911 | An array is called beautiful if all the elements in the array are equal.
You can transform an array using the following steps any number of times:
1. Choose two indices i and j (1 ≤ i,j ≤ n), and an integer x (1 ≤ x ≤ a_i). Let i be the source index and j be the sink index.
2. Decrease the i-th element by x, and increase the j-th element by x. The resulting values at i-th and j-th index are a_i-x and a_j+x respectively.
3. The cost of this operation is x ⋅ |j-i| .
4. Now the i-th index can no longer be the sink and the j-th index can no longer be the source.
The total cost of a transformation is the sum of all the costs in step 3.
For example, array [0, 2, 3, 3] can be transformed into a beautiful array [2, 2, 2, 2] with total cost 1 ⋅ |1-3| + 1 ⋅ |1-4| = 5.
An array is called balanced, if it can be transformed into a beautiful array, and the cost of such transformation is uniquely defined. In other words, the minimum cost of transformation into a beautiful array equals the maximum cost.
You are given an array a_1, a_2, …, a_n of length n, consisting of non-negative integers. Your task is to find the number of balanced arrays which are permutations of the given array. Two arrays are considered different, if elements at some position differ. Since the answer can be large, output it modulo 10^9 + 7.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the size of the array.
The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 10^9).
Output
Output a single integer — the number of balanced permutations modulo 10^9+7.
Examples
Input
3
1 2 3
Output
6
Input
4
0 4 0 4
Output
2
Input
5
0 11 12 13 14
Output
120
Note
In the first example, [1, 2, 3] is a valid permutation as we can consider the index with value 3 as the source and index with value 1 as the sink. Thus, after conversion we get a beautiful array [2, 2, 2], and the total cost would be 2. We can show that this is the only transformation of this array that leads to a beautiful array. Similarly, we can check for other permutations too.
In the second example, [0, 0, 4, 4] and [4, 4, 0, 0] are balanced permutations.
In the third example, all permutations are balanced. | #!/usr/bin/env python
# https://github.com/cheran-senthil/PyRival
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
from collections import defaultdict
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def main():
fact = [1, 1] + [0] * 10 ** 5
mod = 10 ** 9 + 7
def mult(x, y, m):
return ((x % m) * (y % m)) % m
def pow(x, y, m):
if y == 1:
return x
if y == 0:
return 1
p = pow(x, y // 2, m)
ret = mult(p, p, m)
if y & 1:
return mult(ret, x, m)
else:
return ret
def inv(a, p):
return pow(a, p - 2, p)
def div(x, y, m):
return mult(x, inv(y, m), m)
def ncr(n, r, m):
if n < r:
return 0
if r == 0:
return 1
return (fact[n] * inv(fact[r], m) % m * inv(fact[n - r], m) % m) % m
for i in range(2, 10 ** 5 + 1):
fact[i] = mult(fact[i - 1], i, mod)
N = int(input())
vec = list(map(int, input().split()))
freq = defaultdict(int)
s = 0
for n in vec:
freq[n] += 1
s += n
if s % N:
print(0)
else:
best = s // N
src = snk = 0
for n in vec:
if n > best:
src += 1
elif n < best:
snk += 1
if src <= 1 or snk <= 1:
ans = fact[N]
den = 1
for _, f in freq.items():
den = mult(den, fact[f], mod)
ans = div(ans, den, mod)
print(ans)
else:
src_perm = fact[src]
den = 1
for n, f in freq.items():
if n < best:
den = mult(den, fact[f], mod)
src_perm = div(src_perm, den, mod)
snk_perm = fact[snk]
den = 1
for n, f in freq.items():
if n > best:
den = mult(den, fact[f], mod)
snk_perm = div(snk_perm, den, mod)
fill = ncr(N, src + snk, mod)
ans = mult(2, mult(src_perm, mult(snk_perm, fill, mod), mod), mod)
print(ans)
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
| 1Python2
| {
"input": [
"5\n0 11 12 13 14\n",
"3\n1 2 3\n",
"4\n0 4 0 4\n",
"1\n100000\n",
"3\n0 0 3\n",
"1\n100010\n",
"5\n0 11 1 13 14\n",
"5\n0 12 1 13 14\n",
"3\n0 3 3\n",
"3\n0 1 2\n",
"4\n2 1 0 1\n",
"4\n0 6 0 6\n",
"4\n4 0 0 0\n",
"5\n1 3 0 13 48\n",
"5\n0 1 3 3 13\n",
"3\n0 2 3\n",
"4\n0 6 0 4\n",
"1\n000010\n",
"4\n0 6 1 4\n",
"1\n010010\n",
"5\n0 12 2 13 14\n",
"3\n1 3 3\n",
"4\n-1 6 1 4\n",
"1\n010011\n",
"5\n0 20 2 13 14\n",
"3\n0 3 1\n",
"4\n-1 6 0 4\n",
"1\n010110\n",
"5\n0 20 2 13 11\n",
"3\n0 3 2\n",
"4\n1 6 0 4\n",
"1\n010000\n",
"5\n0 23 2 13 11\n",
"4\n1 1 0 4\n",
"1\n010001\n",
"5\n0 10 2 13 11\n",
"3\n0 1 1\n",
"4\n1 1 0 1\n",
"1\n110000\n",
"5\n1 10 2 13 11\n",
"3\n0 0 1\n",
"1\n110010\n",
"5\n1 10 2 13 13\n",
"3\n0 0 2\n",
"4\n2 2 0 1\n",
"1\n111010\n",
"5\n1 10 2 13 26\n",
"4\n4 2 0 1\n",
"1\n111011\n",
"5\n1 18 2 13 26\n",
"4\n3 2 0 1\n",
"1\n011011\n",
"5\n1 25 2 13 26\n",
"4\n3 1 0 1\n",
"1\n011001\n",
"5\n1 25 2 23 26\n",
"4\n3 0 0 1\n",
"1\n001001\n",
"5\n1 25 2 17 26\n",
"4\n3 0 -1 1\n",
"1\n011101\n",
"5\n2 25 2 17 26\n",
"1\n010101\n",
"5\n2 25 2 17 48\n",
"1\n000101\n",
"5\n0 25 2 17 48\n",
"1\n000111\n",
"5\n0 25 2 34 48\n",
"1\n100111\n",
"5\n0 6 2 34 48\n",
"1\n100011\n",
"5\n0 6 2 17 48\n",
"1\n110111\n",
"5\n0 6 2 17 37\n",
"1\n110011\n",
"5\n0 6 2 17 16\n",
"1\n011111\n",
"5\n0 6 1 17 16\n",
"1\n010111\n",
"5\n0 6 1 27 16\n",
"1\n110101\n",
"5\n0 0 1 27 16\n",
"1\n100101\n",
"5\n0 1 1 27 16\n",
"1\n101101\n",
"5\n0 1 1 5 16\n",
"1\n001101\n",
"5\n0 1 1 5 9\n",
"1\n001111\n",
"5\n0 1 1 5 17\n",
"1\n101111\n",
"5\n0 1 1 4 17\n",
"1\n001110\n",
"5\n-1 1 1 4 17\n",
"1\n001100\n",
"5\n-1 2 1 4 17\n",
"1\n011110\n",
"5\n-2 2 1 4 17\n",
"1\n011010\n",
"5\n-2 2 1 4 3\n",
"1\n000110\n",
"5\n-2 2 1 2 3\n",
"1\n000001\n",
"5\n-2 2 2 2 3\n",
"1\n000000\n",
"1\n100001\n",
"1\n110001\n",
"1\n101110\n",
"1\n111101\n",
"1\n111001\n",
"1\n111111\n",
"1\n001011\n",
"1\n001000\n",
"1\n001010\n",
"1\n000100\n",
"1\n010100\n",
"1\n011100\n",
"1\n100100\n",
"1\n101010\n",
"1\n101000\n",
"1\n111000\n",
"1\n101100\n",
"1\n111100\n",
"1\n110100\n",
"1\n101001\n",
"1\n111110\n",
"1\n101011\n",
"1\n011000\n",
"1\n000011\n",
"1\n100110\n",
"1\n110110\n",
"3\n1 0 3\n",
"5\n0 11 14 13 14\n",
"3\n1 4 3\n",
"4\n0 4 0 6\n",
"5\n0 11 1 25 14\n",
"3\n0 2 4\n",
"4\n0 2 1 4\n",
"5\n0 0 1 13 14\n",
"3\n1 3 4\n",
"4\n0 9 1 4\n",
"5\n0 12 2 5 14\n",
"3\n2 3 3\n",
"4\n-1 6 1 1\n",
"5\n-1 20 2 13 14\n",
"3\n0 2 1\n",
"4\n-1 7 0 4\n",
"5\n0 33 2 13 11\n",
"3\n0 3 0\n",
"4\n1 12 0 4\n",
"5\n0 4 2 13 11\n",
"3\n0 2 2\n",
"4\n1 0 0 4\n",
"5\n0 10 2 17 11\n",
"3\n0 1 3\n",
"4\n0 1 0 1\n",
"5\n1 10 2 13 15\n",
"4\n1 2 0 1\n",
"5\n1 3 2 13 13\n",
"3\n-1 0 2\n",
"4\n2 2 0 2\n",
"5\n1 3 2 13 26\n",
"4\n4 2 -1 1\n",
"5\n2 18 2 13 26\n",
"4\n3 2 -1 1\n",
"5\n1 33 2 13 26\n",
"4\n1 1 0 0\n",
"5\n1 25 2 23 38\n",
"4\n6 0 0 1\n",
"5\n1 0 2 17 26\n",
"4\n3 0 0 2\n",
"5\n2 25 4 17 26\n",
"5\n2 25 2 17 71\n",
"5\n0 25 2 17 70\n",
"5\n1 25 2 34 48\n",
"5\n0 6 2 17 8\n",
"5\n0 2 2 17 37\n",
"5\n0 11 2 17 16\n",
"5\n0 0 1 17 16\n",
"5\n0 6 1 41 16\n",
"5\n0 0 0 27 16\n",
"5\n0 1 1 12 16\n",
"5\n0 1 1 5 22\n",
"5\n0 1 0 5 9\n",
"5\n0 1 0 5 17\n",
"5\n0 1 1 3 17\n",
"5\n-1 1 1 3 17\n",
"5\n-4 2 1 4 3\n",
"5\n-2 2 1 2 0\n",
"5\n-2 2 2 3 3\n",
"3\n1 1 3\n",
"5\n0 11 14 13 5\n",
"3\n0 4 3\n",
"5\n0 11 1 25 13\n",
"3\n0 1 4\n",
"4\n1 2 1 4\n",
"5\n0 0 1 13 22\n",
"3\n2 3 4\n",
"4\n0 9 0 4\n",
"5\n0 12 2 5 10\n",
"3\n2 3 2\n",
"4\n-1 6 1 0\n",
"5\n-1 9 2 13 14\n",
"3\n0 0 0\n",
"4\n-1 4 0 4\n"
],
"output": [
"\n120",
"\n6",
"\n2",
"1",
"3",
"1\n",
"0\n",
"24\n",
"3\n",
"6\n",
"12\n",
"2\n",
"4\n",
"120\n",
"60\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"24\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"12\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"12\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"3\n",
"0\n",
"24\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"12\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1513_E. Cost Equilibrium_37912 | An array is called beautiful if all the elements in the array are equal.
You can transform an array using the following steps any number of times:
1. Choose two indices i and j (1 ≤ i,j ≤ n), and an integer x (1 ≤ x ≤ a_i). Let i be the source index and j be the sink index.
2. Decrease the i-th element by x, and increase the j-th element by x. The resulting values at i-th and j-th index are a_i-x and a_j+x respectively.
3. The cost of this operation is x ⋅ |j-i| .
4. Now the i-th index can no longer be the sink and the j-th index can no longer be the source.
The total cost of a transformation is the sum of all the costs in step 3.
For example, array [0, 2, 3, 3] can be transformed into a beautiful array [2, 2, 2, 2] with total cost 1 ⋅ |1-3| + 1 ⋅ |1-4| = 5.
An array is called balanced, if it can be transformed into a beautiful array, and the cost of such transformation is uniquely defined. In other words, the minimum cost of transformation into a beautiful array equals the maximum cost.
You are given an array a_1, a_2, …, a_n of length n, consisting of non-negative integers. Your task is to find the number of balanced arrays which are permutations of the given array. Two arrays are considered different, if elements at some position differ. Since the answer can be large, output it modulo 10^9 + 7.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the size of the array.
The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 10^9).
Output
Output a single integer — the number of balanced permutations modulo 10^9+7.
Examples
Input
3
1 2 3
Output
6
Input
4
0 4 0 4
Output
2
Input
5
0 11 12 13 14
Output
120
Note
In the first example, [1, 2, 3] is a valid permutation as we can consider the index with value 3 as the source and index with value 1 as the sink. Thus, after conversion we get a beautiful array [2, 2, 2], and the total cost would be 2. We can show that this is the only transformation of this array that leads to a beautiful array. Similarly, we can check for other permutations too.
In the second example, [0, 0, 4, 4] and [4, 4, 0, 0] are balanced permutations.
In the third example, all permutations are balanced. | #include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
using namespace std;
#define ll long long
#define pb(x) push_back(x)
#ifdef _OLIMPOLOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 1337
#endif
void debug_out() { cout << "\n";}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) { cout << " " << A; debug_out(B...); }
int test = 1;
#define out(x) {cout << x << "\n";return;}
#define all(N) N.begin(),N.end()
#define allr(N) N.rbegin(),N.rend()
template<typename T1>
void pr(vector<T1> V, int add = 0, int start = -1, int end = -1) {
if (start < 0) start = 0;
if (end < 0) end = V.size() - 1;
for (int i = start; i <= end; i++) {
cout << V[i] + add << ((i == end) ? "\n" : " ");
}
}
template<typename T1>
T1 chmin(T1 &x, const T1 v) { return x = min(x,v); }
template<typename T1>
T1 chmax(T1 &x, const T1 v) { return x = max(x,v); }
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define repsr(i, s, n) for (int i = n-1; i >= s; i--)
#define PI pair<int,int>
template<typename T1>
T1 gcd(const T1 &a, const T1 &b) {
if (a == 0 || b == 0) return a + b;
return gcd(b, a %b);
}
//-------------------------- ^ DONT TOUCH ^-----------------------------------------------------------------
#define MAX 100001
#define MOD 1000000007ll
ll f[MAX];
ll n, s;
long long power(long long x, long long n) {
long long p = x;
long long s = 1;
while (n > 0) {
if (n & 1) s = (s * p) % MOD;
p = (p * p) % MOD;
n /= 2;
}
return s;
}
ll val(vector<ll> V) {
sort(all(V));
ll a = f[V.size()];
for(int i = 0 ; i < V.size(); i++) {
int c = 1;
while(i + 1 < V.size() && V[i+1] == V[i]) {
c++;
i++;
}
if (c > 1) a *= power(f[c], MOD-2);
a %= MOD;
}
return a;
}
void solve() {
cin >> n;
vector<ll> N(n);
s = 0;
rep(i,n) {
cin >> N[i];
s += N[i];
}
if (s % n != 0) out(0);
s/=n;
vector<ll> L, H;
int c = 0;
ll a = 1;
rep(i,n) {
N[i] -= s;
if (N[i] > 0) {
H.push_back(N[i]);
}
if (N[i] < 0) {
L.push_back(-N[i]);
}
if (N[i] == 0) {
a *= n;
a %= MOD;
c++;
}
}
a = f[n];
a *= power(f[c], MOD-2);
a %= MOD;
a *= power(f[n-c], MOD-2);
a %= MOD;
n-=c;
ll l = val(L);
ll h = val(H);
int sl = L.size();
int sh = H.size();
ll s = 0;
ll r = (l * h) % MOD;
if(sl + sh == 0)out(a);
if (sl == 1 || sh == 1) {
out(val(N));
}
s = (2*r) % MOD;
s = ((s % MOD) + MOD) % MOD;
debug(l,h);
out((a * s) % MOD);
}
int main() {
f[0] = 1;
reps(i,1,MAX) f[i] = (f[i-1] * (ll)i) % MOD;
ios_base::sync_with_stdio(0);cin.tie(0);
//cin >> test;
rep(testCase, test) {
#ifdef _OLIMPOLOCAL
cout << "Case #" << testCase + 1 << "\n";
#endif
solve();
}
return 0;
} | 2C++
| {
"input": [
"5\n0 11 12 13 14\n",
"3\n1 2 3\n",
"4\n0 4 0 4\n",
"1\n100000\n",
"3\n0 0 3\n",
"1\n100010\n",
"5\n0 11 1 13 14\n",
"5\n0 12 1 13 14\n",
"3\n0 3 3\n",
"3\n0 1 2\n",
"4\n2 1 0 1\n",
"4\n0 6 0 6\n",
"4\n4 0 0 0\n",
"5\n1 3 0 13 48\n",
"5\n0 1 3 3 13\n",
"3\n0 2 3\n",
"4\n0 6 0 4\n",
"1\n000010\n",
"4\n0 6 1 4\n",
"1\n010010\n",
"5\n0 12 2 13 14\n",
"3\n1 3 3\n",
"4\n-1 6 1 4\n",
"1\n010011\n",
"5\n0 20 2 13 14\n",
"3\n0 3 1\n",
"4\n-1 6 0 4\n",
"1\n010110\n",
"5\n0 20 2 13 11\n",
"3\n0 3 2\n",
"4\n1 6 0 4\n",
"1\n010000\n",
"5\n0 23 2 13 11\n",
"4\n1 1 0 4\n",
"1\n010001\n",
"5\n0 10 2 13 11\n",
"3\n0 1 1\n",
"4\n1 1 0 1\n",
"1\n110000\n",
"5\n1 10 2 13 11\n",
"3\n0 0 1\n",
"1\n110010\n",
"5\n1 10 2 13 13\n",
"3\n0 0 2\n",
"4\n2 2 0 1\n",
"1\n111010\n",
"5\n1 10 2 13 26\n",
"4\n4 2 0 1\n",
"1\n111011\n",
"5\n1 18 2 13 26\n",
"4\n3 2 0 1\n",
"1\n011011\n",
"5\n1 25 2 13 26\n",
"4\n3 1 0 1\n",
"1\n011001\n",
"5\n1 25 2 23 26\n",
"4\n3 0 0 1\n",
"1\n001001\n",
"5\n1 25 2 17 26\n",
"4\n3 0 -1 1\n",
"1\n011101\n",
"5\n2 25 2 17 26\n",
"1\n010101\n",
"5\n2 25 2 17 48\n",
"1\n000101\n",
"5\n0 25 2 17 48\n",
"1\n000111\n",
"5\n0 25 2 34 48\n",
"1\n100111\n",
"5\n0 6 2 34 48\n",
"1\n100011\n",
"5\n0 6 2 17 48\n",
"1\n110111\n",
"5\n0 6 2 17 37\n",
"1\n110011\n",
"5\n0 6 2 17 16\n",
"1\n011111\n",
"5\n0 6 1 17 16\n",
"1\n010111\n",
"5\n0 6 1 27 16\n",
"1\n110101\n",
"5\n0 0 1 27 16\n",
"1\n100101\n",
"5\n0 1 1 27 16\n",
"1\n101101\n",
"5\n0 1 1 5 16\n",
"1\n001101\n",
"5\n0 1 1 5 9\n",
"1\n001111\n",
"5\n0 1 1 5 17\n",
"1\n101111\n",
"5\n0 1 1 4 17\n",
"1\n001110\n",
"5\n-1 1 1 4 17\n",
"1\n001100\n",
"5\n-1 2 1 4 17\n",
"1\n011110\n",
"5\n-2 2 1 4 17\n",
"1\n011010\n",
"5\n-2 2 1 4 3\n",
"1\n000110\n",
"5\n-2 2 1 2 3\n",
"1\n000001\n",
"5\n-2 2 2 2 3\n",
"1\n000000\n",
"1\n100001\n",
"1\n110001\n",
"1\n101110\n",
"1\n111101\n",
"1\n111001\n",
"1\n111111\n",
"1\n001011\n",
"1\n001000\n",
"1\n001010\n",
"1\n000100\n",
"1\n010100\n",
"1\n011100\n",
"1\n100100\n",
"1\n101010\n",
"1\n101000\n",
"1\n111000\n",
"1\n101100\n",
"1\n111100\n",
"1\n110100\n",
"1\n101001\n",
"1\n111110\n",
"1\n101011\n",
"1\n011000\n",
"1\n000011\n",
"1\n100110\n",
"1\n110110\n",
"3\n1 0 3\n",
"5\n0 11 14 13 14\n",
"3\n1 4 3\n",
"4\n0 4 0 6\n",
"5\n0 11 1 25 14\n",
"3\n0 2 4\n",
"4\n0 2 1 4\n",
"5\n0 0 1 13 14\n",
"3\n1 3 4\n",
"4\n0 9 1 4\n",
"5\n0 12 2 5 14\n",
"3\n2 3 3\n",
"4\n-1 6 1 1\n",
"5\n-1 20 2 13 14\n",
"3\n0 2 1\n",
"4\n-1 7 0 4\n",
"5\n0 33 2 13 11\n",
"3\n0 3 0\n",
"4\n1 12 0 4\n",
"5\n0 4 2 13 11\n",
"3\n0 2 2\n",
"4\n1 0 0 4\n",
"5\n0 10 2 17 11\n",
"3\n0 1 3\n",
"4\n0 1 0 1\n",
"5\n1 10 2 13 15\n",
"4\n1 2 0 1\n",
"5\n1 3 2 13 13\n",
"3\n-1 0 2\n",
"4\n2 2 0 2\n",
"5\n1 3 2 13 26\n",
"4\n4 2 -1 1\n",
"5\n2 18 2 13 26\n",
"4\n3 2 -1 1\n",
"5\n1 33 2 13 26\n",
"4\n1 1 0 0\n",
"5\n1 25 2 23 38\n",
"4\n6 0 0 1\n",
"5\n1 0 2 17 26\n",
"4\n3 0 0 2\n",
"5\n2 25 4 17 26\n",
"5\n2 25 2 17 71\n",
"5\n0 25 2 17 70\n",
"5\n1 25 2 34 48\n",
"5\n0 6 2 17 8\n",
"5\n0 2 2 17 37\n",
"5\n0 11 2 17 16\n",
"5\n0 0 1 17 16\n",
"5\n0 6 1 41 16\n",
"5\n0 0 0 27 16\n",
"5\n0 1 1 12 16\n",
"5\n0 1 1 5 22\n",
"5\n0 1 0 5 9\n",
"5\n0 1 0 5 17\n",
"5\n0 1 1 3 17\n",
"5\n-1 1 1 3 17\n",
"5\n-4 2 1 4 3\n",
"5\n-2 2 1 2 0\n",
"5\n-2 2 2 3 3\n",
"3\n1 1 3\n",
"5\n0 11 14 13 5\n",
"3\n0 4 3\n",
"5\n0 11 1 25 13\n",
"3\n0 1 4\n",
"4\n1 2 1 4\n",
"5\n0 0 1 13 22\n",
"3\n2 3 4\n",
"4\n0 9 0 4\n",
"5\n0 12 2 5 10\n",
"3\n2 3 2\n",
"4\n-1 6 1 0\n",
"5\n-1 9 2 13 14\n",
"3\n0 0 0\n",
"4\n-1 4 0 4\n"
],
"output": [
"\n120",
"\n6",
"\n2",
"1",
"3",
"1\n",
"0\n",
"24\n",
"3\n",
"6\n",
"12\n",
"2\n",
"4\n",
"120\n",
"60\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"24\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"12\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"12\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"3\n",
"0\n",
"24\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"12\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1513_E. Cost Equilibrium_37913 | An array is called beautiful if all the elements in the array are equal.
You can transform an array using the following steps any number of times:
1. Choose two indices i and j (1 ≤ i,j ≤ n), and an integer x (1 ≤ x ≤ a_i). Let i be the source index and j be the sink index.
2. Decrease the i-th element by x, and increase the j-th element by x. The resulting values at i-th and j-th index are a_i-x and a_j+x respectively.
3. The cost of this operation is x ⋅ |j-i| .
4. Now the i-th index can no longer be the sink and the j-th index can no longer be the source.
The total cost of a transformation is the sum of all the costs in step 3.
For example, array [0, 2, 3, 3] can be transformed into a beautiful array [2, 2, 2, 2] with total cost 1 ⋅ |1-3| + 1 ⋅ |1-4| = 5.
An array is called balanced, if it can be transformed into a beautiful array, and the cost of such transformation is uniquely defined. In other words, the minimum cost of transformation into a beautiful array equals the maximum cost.
You are given an array a_1, a_2, …, a_n of length n, consisting of non-negative integers. Your task is to find the number of balanced arrays which are permutations of the given array. Two arrays are considered different, if elements at some position differ. Since the answer can be large, output it modulo 10^9 + 7.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the size of the array.
The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 10^9).
Output
Output a single integer — the number of balanced permutations modulo 10^9+7.
Examples
Input
3
1 2 3
Output
6
Input
4
0 4 0 4
Output
2
Input
5
0 11 12 13 14
Output
120
Note
In the first example, [1, 2, 3] is a valid permutation as we can consider the index with value 3 as the source and index with value 1 as the sink. Thus, after conversion we get a beautiful array [2, 2, 2], and the total cost would be 2. We can show that this is the only transformation of this array that leads to a beautiful array. Similarly, we can check for other permutations too.
In the second example, [0, 0, 4, 4] and [4, 4, 0, 0] are balanced permutations.
In the third example, all permutations are balanced. | n=int(input());a=*map(int,input().split()),;s=sum(a)
if s%n:print(0);exit(0)
M=10**9+7;s//=n;f=[1]*(n+1);b=[0]*3;d=dict()
for i in range(2,n+1):f[i]=f[i-1]*i%M
for x in a:
b[(x>s)-(x<s)]+=1
try:d[x]+=1
except:d[x]=1
k=1
for x in d.values():k*=f[x]
k=f[n]*pow(k,M-2,M)
print([k%M,f[b[1]]*f[b[-1]]*2*pow(f[n-b[0]],M-2,M)*k%M][b[1]>1and b[-1]>1]) | 3Python3
| {
"input": [
"5\n0 11 12 13 14\n",
"3\n1 2 3\n",
"4\n0 4 0 4\n",
"1\n100000\n",
"3\n0 0 3\n",
"1\n100010\n",
"5\n0 11 1 13 14\n",
"5\n0 12 1 13 14\n",
"3\n0 3 3\n",
"3\n0 1 2\n",
"4\n2 1 0 1\n",
"4\n0 6 0 6\n",
"4\n4 0 0 0\n",
"5\n1 3 0 13 48\n",
"5\n0 1 3 3 13\n",
"3\n0 2 3\n",
"4\n0 6 0 4\n",
"1\n000010\n",
"4\n0 6 1 4\n",
"1\n010010\n",
"5\n0 12 2 13 14\n",
"3\n1 3 3\n",
"4\n-1 6 1 4\n",
"1\n010011\n",
"5\n0 20 2 13 14\n",
"3\n0 3 1\n",
"4\n-1 6 0 4\n",
"1\n010110\n",
"5\n0 20 2 13 11\n",
"3\n0 3 2\n",
"4\n1 6 0 4\n",
"1\n010000\n",
"5\n0 23 2 13 11\n",
"4\n1 1 0 4\n",
"1\n010001\n",
"5\n0 10 2 13 11\n",
"3\n0 1 1\n",
"4\n1 1 0 1\n",
"1\n110000\n",
"5\n1 10 2 13 11\n",
"3\n0 0 1\n",
"1\n110010\n",
"5\n1 10 2 13 13\n",
"3\n0 0 2\n",
"4\n2 2 0 1\n",
"1\n111010\n",
"5\n1 10 2 13 26\n",
"4\n4 2 0 1\n",
"1\n111011\n",
"5\n1 18 2 13 26\n",
"4\n3 2 0 1\n",
"1\n011011\n",
"5\n1 25 2 13 26\n",
"4\n3 1 0 1\n",
"1\n011001\n",
"5\n1 25 2 23 26\n",
"4\n3 0 0 1\n",
"1\n001001\n",
"5\n1 25 2 17 26\n",
"4\n3 0 -1 1\n",
"1\n011101\n",
"5\n2 25 2 17 26\n",
"1\n010101\n",
"5\n2 25 2 17 48\n",
"1\n000101\n",
"5\n0 25 2 17 48\n",
"1\n000111\n",
"5\n0 25 2 34 48\n",
"1\n100111\n",
"5\n0 6 2 34 48\n",
"1\n100011\n",
"5\n0 6 2 17 48\n",
"1\n110111\n",
"5\n0 6 2 17 37\n",
"1\n110011\n",
"5\n0 6 2 17 16\n",
"1\n011111\n",
"5\n0 6 1 17 16\n",
"1\n010111\n",
"5\n0 6 1 27 16\n",
"1\n110101\n",
"5\n0 0 1 27 16\n",
"1\n100101\n",
"5\n0 1 1 27 16\n",
"1\n101101\n",
"5\n0 1 1 5 16\n",
"1\n001101\n",
"5\n0 1 1 5 9\n",
"1\n001111\n",
"5\n0 1 1 5 17\n",
"1\n101111\n",
"5\n0 1 1 4 17\n",
"1\n001110\n",
"5\n-1 1 1 4 17\n",
"1\n001100\n",
"5\n-1 2 1 4 17\n",
"1\n011110\n",
"5\n-2 2 1 4 17\n",
"1\n011010\n",
"5\n-2 2 1 4 3\n",
"1\n000110\n",
"5\n-2 2 1 2 3\n",
"1\n000001\n",
"5\n-2 2 2 2 3\n",
"1\n000000\n",
"1\n100001\n",
"1\n110001\n",
"1\n101110\n",
"1\n111101\n",
"1\n111001\n",
"1\n111111\n",
"1\n001011\n",
"1\n001000\n",
"1\n001010\n",
"1\n000100\n",
"1\n010100\n",
"1\n011100\n",
"1\n100100\n",
"1\n101010\n",
"1\n101000\n",
"1\n111000\n",
"1\n101100\n",
"1\n111100\n",
"1\n110100\n",
"1\n101001\n",
"1\n111110\n",
"1\n101011\n",
"1\n011000\n",
"1\n000011\n",
"1\n100110\n",
"1\n110110\n",
"3\n1 0 3\n",
"5\n0 11 14 13 14\n",
"3\n1 4 3\n",
"4\n0 4 0 6\n",
"5\n0 11 1 25 14\n",
"3\n0 2 4\n",
"4\n0 2 1 4\n",
"5\n0 0 1 13 14\n",
"3\n1 3 4\n",
"4\n0 9 1 4\n",
"5\n0 12 2 5 14\n",
"3\n2 3 3\n",
"4\n-1 6 1 1\n",
"5\n-1 20 2 13 14\n",
"3\n0 2 1\n",
"4\n-1 7 0 4\n",
"5\n0 33 2 13 11\n",
"3\n0 3 0\n",
"4\n1 12 0 4\n",
"5\n0 4 2 13 11\n",
"3\n0 2 2\n",
"4\n1 0 0 4\n",
"5\n0 10 2 17 11\n",
"3\n0 1 3\n",
"4\n0 1 0 1\n",
"5\n1 10 2 13 15\n",
"4\n1 2 0 1\n",
"5\n1 3 2 13 13\n",
"3\n-1 0 2\n",
"4\n2 2 0 2\n",
"5\n1 3 2 13 26\n",
"4\n4 2 -1 1\n",
"5\n2 18 2 13 26\n",
"4\n3 2 -1 1\n",
"5\n1 33 2 13 26\n",
"4\n1 1 0 0\n",
"5\n1 25 2 23 38\n",
"4\n6 0 0 1\n",
"5\n1 0 2 17 26\n",
"4\n3 0 0 2\n",
"5\n2 25 4 17 26\n",
"5\n2 25 2 17 71\n",
"5\n0 25 2 17 70\n",
"5\n1 25 2 34 48\n",
"5\n0 6 2 17 8\n",
"5\n0 2 2 17 37\n",
"5\n0 11 2 17 16\n",
"5\n0 0 1 17 16\n",
"5\n0 6 1 41 16\n",
"5\n0 0 0 27 16\n",
"5\n0 1 1 12 16\n",
"5\n0 1 1 5 22\n",
"5\n0 1 0 5 9\n",
"5\n0 1 0 5 17\n",
"5\n0 1 1 3 17\n",
"5\n-1 1 1 3 17\n",
"5\n-4 2 1 4 3\n",
"5\n-2 2 1 2 0\n",
"5\n-2 2 2 3 3\n",
"3\n1 1 3\n",
"5\n0 11 14 13 5\n",
"3\n0 4 3\n",
"5\n0 11 1 25 13\n",
"3\n0 1 4\n",
"4\n1 2 1 4\n",
"5\n0 0 1 13 22\n",
"3\n2 3 4\n",
"4\n0 9 0 4\n",
"5\n0 12 2 5 10\n",
"3\n2 3 2\n",
"4\n-1 6 1 0\n",
"5\n-1 9 2 13 14\n",
"3\n0 0 0\n",
"4\n-1 4 0 4\n"
],
"output": [
"\n120",
"\n6",
"\n2",
"1",
"3",
"1\n",
"0\n",
"24\n",
"3\n",
"6\n",
"12\n",
"2\n",
"4\n",
"120\n",
"60\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"24\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"12\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"12\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"3\n",
"0\n",
"24\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"12\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1513_E. Cost Equilibrium_37914 | An array is called beautiful if all the elements in the array are equal.
You can transform an array using the following steps any number of times:
1. Choose two indices i and j (1 ≤ i,j ≤ n), and an integer x (1 ≤ x ≤ a_i). Let i be the source index and j be the sink index.
2. Decrease the i-th element by x, and increase the j-th element by x. The resulting values at i-th and j-th index are a_i-x and a_j+x respectively.
3. The cost of this operation is x ⋅ |j-i| .
4. Now the i-th index can no longer be the sink and the j-th index can no longer be the source.
The total cost of a transformation is the sum of all the costs in step 3.
For example, array [0, 2, 3, 3] can be transformed into a beautiful array [2, 2, 2, 2] with total cost 1 ⋅ |1-3| + 1 ⋅ |1-4| = 5.
An array is called balanced, if it can be transformed into a beautiful array, and the cost of such transformation is uniquely defined. In other words, the minimum cost of transformation into a beautiful array equals the maximum cost.
You are given an array a_1, a_2, …, a_n of length n, consisting of non-negative integers. Your task is to find the number of balanced arrays which are permutations of the given array. Two arrays are considered different, if elements at some position differ. Since the answer can be large, output it modulo 10^9 + 7.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the size of the array.
The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 10^9).
Output
Output a single integer — the number of balanced permutations modulo 10^9+7.
Examples
Input
3
1 2 3
Output
6
Input
4
0 4 0 4
Output
2
Input
5
0 11 12 13 14
Output
120
Note
In the first example, [1, 2, 3] is a valid permutation as we can consider the index with value 3 as the source and index with value 1 as the sink. Thus, after conversion we get a beautiful array [2, 2, 2], and the total cost would be 2. We can show that this is the only transformation of this array that leads to a beautiful array. Similarly, we can check for other permutations too.
In the second example, [0, 0, 4, 4] and [4, 4, 0, 0] are balanced permutations.
In the third example, all permutations are balanced. | import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Map.Entry;
import java.util.Random;
import java.util.TreeSet;
public final class CF_714_D2_E
{
static boolean verb=true;
static void log(Object X){if (verb) System.err.println(X);}
static void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+" ");System.err.println("");}}
static void log(int[] X){if (verb) {for (int U:X) System.err.print(U+" ");System.err.println("");}}
static void logWln(int[] X){if (verb) {for (int U:X) System.err.print(U+" ");}}
static void log(int[] X,int L){if (verb) {for (int i=0;i<L;i++) System.err.print(X[i]+" ");System.err.println("");}}
static void log(long[] X){if (verb) {for (long U:X) System.err.print(U+" ");System.err.println("");}}
static void logWln(Object X){if (verb) System.err.print(X);}
static void info(Object o){ System.out.println(o);}
static void output(Object o){outputWln(""+o+"\n"); }
static void outputFlush(Object o){try {out.write(""+ o+"\n");out.flush();} catch (Exception e) {}}
static void outputWln(Object o){try {out.write(""+ o);} catch (Exception e) {}}
static void logBin(int[] tm) {for (int x:tm) logWln(bin(8,x)+" ");log("");}
static String bin(int L,int x) {
String s=Integer.toBinaryString(x);
while (s.length()<L) s="0"+s;
return s;
}
static long powerMod(long b,long e,long m){
long x=1;
while (e>0) {
if (e%2==1)
x=(b*x)%m;
b=(b*b)%m;
e=e/2;
}
return x;
}
static long mod=1000000007;
// Global vars
static BufferedWriter out;
static InputReader reader;
static void process() throws Exception {
//log(Integer.toBinaryString(200001).length());
out = new BufferedWriter(new OutputStreamWriter(System.out));
reader = new InputReader(System.in);
//log("done");
//test();
int NX=100001;
log("computing");
long[] fact=new long[NX];
fact[0]=1;
long[] invFact=new long[NX];
invFact[0]=1;
for (int i=1;i<NX;i++) {
fact[i]=fact[i-1]*i;
if (fact[i]>=mod)
fact[i]%=mod;
invFact[i]=powerMod(fact[i],mod-2,mod);
}
log("done");
int n=reader.readInt();
int[] a=new int[n];
long sum=0;
for (int i=0;i<n;i++) {
a[i]=reader.readInt();
sum+=a[i];
}
log("sum:"+sum);
long ans=0;
// need to take care of special case where locnt==1 or hicnt==1
//
if (sum%n==0) {
long med=sum/n;
log("med:"+med);
Arrays.parallelSort(a);
int prev=-1;
int cn=0;
ArrayList<Integer> lonb=new ArrayList<Integer>();
ArrayList<Integer> hinb=new ArrayList<Integer>();
int locnt=0;
int hicnt=0;
for (int i=0;i<n;i++) {
//log("i:"+a[i]);
if (a[i]==prev) {
cn++;
} else {
if (prev!=-1) {
if (prev<med) {
lonb.add(cn);
locnt+=cn;
} else if (prev>med) {
hinb.add(cn);
hicnt+=cn;
}
}
prev=a[i];
cn=1;
}
if (i==n-1) {
if (a[i]>med) {
hinb.add(cn);
hicnt+=cn;
}
}
}
long big=fact[hicnt];
for (int x:hinb) {
big*=invFact[x];
if (big>=mod)
big%=mod;
}
log("big:"+big);
long small=fact[locnt];
for (int x:lonb) {
small*=invFact[x];
if (small>=mod)
small%=mod;
}
log("small:"+small);
int medcnt=n-hicnt-locnt;
if (medcnt==n) {
ans=1;
} else
if (locnt==1 ||hicnt==1) {
// can put anywhere
log("special case");
ans=fact[n];
for (int x:lonb) {
ans*=invFact[x];
if (ans>=mod)
ans%=mod;
}
for (int x:hinb) {
ans*=invFact[x];
if (ans>=mod)
ans%=mod;
}
ans*=invFact[medcnt];
ans%=mod;
} else {
ans=big;
ans*=small;
ans%=mod;
ans*=2;
ans%=mod;
if (medcnt>0) {
ans*=fact[n];
ans%=mod;
ans*=invFact[medcnt];
ans%=mod;
ans*=invFact[n-medcnt];
ans%=mod;
}
// we insert small in some position in big
// there are hicnt+1 position
}
}
output(ans);
try {
out.close();
} catch (Exception Ex) {
}
}
public static void main(String[] args) throws Exception {
process();
}
static final class InputReader {
private final InputStream stream;
private final byte[] buf = new byte[1024];
private int curChar;
private int numChars;
public InputReader(InputStream stream) {
this.stream = stream;
}
private int read() throws IOException {
if (curChar >= numChars) {
curChar = 0;
numChars = stream.read(buf);
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public final String readString() throws IOException {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.append((char) c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public final String readString(int L) throws IOException {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder(L);
do {
res.append((char) c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public final int readInt() throws IOException {
int c = read();
boolean neg = false;
while (isSpaceChar(c)) {
c = read();
}
char d = (char) c;
// log("d:"+d);
if (d == '-') {
neg = true;
c = read();
}
int res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
// log("res:"+res);
if (neg)
return -res;
return res;
}
public final long readLong() throws IOException {
int c = read();
boolean neg = false;
while (isSpaceChar(c)) {
c = read();
}
char d = (char) c;
// log("d:"+d);
if (d == '-') {
neg = true;
c = read();
}
long res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
// log("res:"+res);
if (neg)
return -res;
return res;
}
private boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
}
} | 4JAVA
| {
"input": [
"5\n0 11 12 13 14\n",
"3\n1 2 3\n",
"4\n0 4 0 4\n",
"1\n100000\n",
"3\n0 0 3\n",
"1\n100010\n",
"5\n0 11 1 13 14\n",
"5\n0 12 1 13 14\n",
"3\n0 3 3\n",
"3\n0 1 2\n",
"4\n2 1 0 1\n",
"4\n0 6 0 6\n",
"4\n4 0 0 0\n",
"5\n1 3 0 13 48\n",
"5\n0 1 3 3 13\n",
"3\n0 2 3\n",
"4\n0 6 0 4\n",
"1\n000010\n",
"4\n0 6 1 4\n",
"1\n010010\n",
"5\n0 12 2 13 14\n",
"3\n1 3 3\n",
"4\n-1 6 1 4\n",
"1\n010011\n",
"5\n0 20 2 13 14\n",
"3\n0 3 1\n",
"4\n-1 6 0 4\n",
"1\n010110\n",
"5\n0 20 2 13 11\n",
"3\n0 3 2\n",
"4\n1 6 0 4\n",
"1\n010000\n",
"5\n0 23 2 13 11\n",
"4\n1 1 0 4\n",
"1\n010001\n",
"5\n0 10 2 13 11\n",
"3\n0 1 1\n",
"4\n1 1 0 1\n",
"1\n110000\n",
"5\n1 10 2 13 11\n",
"3\n0 0 1\n",
"1\n110010\n",
"5\n1 10 2 13 13\n",
"3\n0 0 2\n",
"4\n2 2 0 1\n",
"1\n111010\n",
"5\n1 10 2 13 26\n",
"4\n4 2 0 1\n",
"1\n111011\n",
"5\n1 18 2 13 26\n",
"4\n3 2 0 1\n",
"1\n011011\n",
"5\n1 25 2 13 26\n",
"4\n3 1 0 1\n",
"1\n011001\n",
"5\n1 25 2 23 26\n",
"4\n3 0 0 1\n",
"1\n001001\n",
"5\n1 25 2 17 26\n",
"4\n3 0 -1 1\n",
"1\n011101\n",
"5\n2 25 2 17 26\n",
"1\n010101\n",
"5\n2 25 2 17 48\n",
"1\n000101\n",
"5\n0 25 2 17 48\n",
"1\n000111\n",
"5\n0 25 2 34 48\n",
"1\n100111\n",
"5\n0 6 2 34 48\n",
"1\n100011\n",
"5\n0 6 2 17 48\n",
"1\n110111\n",
"5\n0 6 2 17 37\n",
"1\n110011\n",
"5\n0 6 2 17 16\n",
"1\n011111\n",
"5\n0 6 1 17 16\n",
"1\n010111\n",
"5\n0 6 1 27 16\n",
"1\n110101\n",
"5\n0 0 1 27 16\n",
"1\n100101\n",
"5\n0 1 1 27 16\n",
"1\n101101\n",
"5\n0 1 1 5 16\n",
"1\n001101\n",
"5\n0 1 1 5 9\n",
"1\n001111\n",
"5\n0 1 1 5 17\n",
"1\n101111\n",
"5\n0 1 1 4 17\n",
"1\n001110\n",
"5\n-1 1 1 4 17\n",
"1\n001100\n",
"5\n-1 2 1 4 17\n",
"1\n011110\n",
"5\n-2 2 1 4 17\n",
"1\n011010\n",
"5\n-2 2 1 4 3\n",
"1\n000110\n",
"5\n-2 2 1 2 3\n",
"1\n000001\n",
"5\n-2 2 2 2 3\n",
"1\n000000\n",
"1\n100001\n",
"1\n110001\n",
"1\n101110\n",
"1\n111101\n",
"1\n111001\n",
"1\n111111\n",
"1\n001011\n",
"1\n001000\n",
"1\n001010\n",
"1\n000100\n",
"1\n010100\n",
"1\n011100\n",
"1\n100100\n",
"1\n101010\n",
"1\n101000\n",
"1\n111000\n",
"1\n101100\n",
"1\n111100\n",
"1\n110100\n",
"1\n101001\n",
"1\n111110\n",
"1\n101011\n",
"1\n011000\n",
"1\n000011\n",
"1\n100110\n",
"1\n110110\n",
"3\n1 0 3\n",
"5\n0 11 14 13 14\n",
"3\n1 4 3\n",
"4\n0 4 0 6\n",
"5\n0 11 1 25 14\n",
"3\n0 2 4\n",
"4\n0 2 1 4\n",
"5\n0 0 1 13 14\n",
"3\n1 3 4\n",
"4\n0 9 1 4\n",
"5\n0 12 2 5 14\n",
"3\n2 3 3\n",
"4\n-1 6 1 1\n",
"5\n-1 20 2 13 14\n",
"3\n0 2 1\n",
"4\n-1 7 0 4\n",
"5\n0 33 2 13 11\n",
"3\n0 3 0\n",
"4\n1 12 0 4\n",
"5\n0 4 2 13 11\n",
"3\n0 2 2\n",
"4\n1 0 0 4\n",
"5\n0 10 2 17 11\n",
"3\n0 1 3\n",
"4\n0 1 0 1\n",
"5\n1 10 2 13 15\n",
"4\n1 2 0 1\n",
"5\n1 3 2 13 13\n",
"3\n-1 0 2\n",
"4\n2 2 0 2\n",
"5\n1 3 2 13 26\n",
"4\n4 2 -1 1\n",
"5\n2 18 2 13 26\n",
"4\n3 2 -1 1\n",
"5\n1 33 2 13 26\n",
"4\n1 1 0 0\n",
"5\n1 25 2 23 38\n",
"4\n6 0 0 1\n",
"5\n1 0 2 17 26\n",
"4\n3 0 0 2\n",
"5\n2 25 4 17 26\n",
"5\n2 25 2 17 71\n",
"5\n0 25 2 17 70\n",
"5\n1 25 2 34 48\n",
"5\n0 6 2 17 8\n",
"5\n0 2 2 17 37\n",
"5\n0 11 2 17 16\n",
"5\n0 0 1 17 16\n",
"5\n0 6 1 41 16\n",
"5\n0 0 0 27 16\n",
"5\n0 1 1 12 16\n",
"5\n0 1 1 5 22\n",
"5\n0 1 0 5 9\n",
"5\n0 1 0 5 17\n",
"5\n0 1 1 3 17\n",
"5\n-1 1 1 3 17\n",
"5\n-4 2 1 4 3\n",
"5\n-2 2 1 2 0\n",
"5\n-2 2 2 3 3\n",
"3\n1 1 3\n",
"5\n0 11 14 13 5\n",
"3\n0 4 3\n",
"5\n0 11 1 25 13\n",
"3\n0 1 4\n",
"4\n1 2 1 4\n",
"5\n0 0 1 13 22\n",
"3\n2 3 4\n",
"4\n0 9 0 4\n",
"5\n0 12 2 5 10\n",
"3\n2 3 2\n",
"4\n-1 6 1 0\n",
"5\n-1 9 2 13 14\n",
"3\n0 0 0\n",
"4\n-1 4 0 4\n"
],
"output": [
"\n120",
"\n6",
"\n2",
"1",
"3",
"1\n",
"0\n",
"24\n",
"3\n",
"6\n",
"12\n",
"2\n",
"4\n",
"120\n",
"60\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"24\n",
"0\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"12\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"24\n",
"1\n",
"24\n",
"1\n",
"0\n",
"1\n",
"12\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"6\n",
"0\n",
"0\n",
"3\n",
"0\n",
"24\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"12\n",
"0\n",
"12\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"24\n",
"0\n",
"12\n",
"0\n",
"6\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1540_D. Inverse Inversions_37915 | You were playing with permutation p of length n, but you lost it in Blair, Alabama!
Luckily, you remember some information about the permutation. More specifically, you remember an array b of length n, where b_i is the number of indices j such that j < i and p_j > p_i.
You have the array b, and you want to find the permutation p. However, your memory isn't perfect, and you constantly change the values of b as you learn more. For the next q seconds, one of the following things happen:
1. 1 i x — you realize that b_i is equal to x;
2. 2 i — you need to find the value of p_i. If there's more than one answer, print any. It can be proven that there's always at least one possible answer under the constraints of the problem.
Answer the queries, so you can remember the array!
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5) — the size of permutation.
The second line contains n integers b_1, b_2 …, b_n (0 ≤ b_i < i) — your initial memory of the array b.
The third line contains a single integer q (1 ≤ q ≤ 10^5) — the number of queries.
The next q lines contain the queries, each with one of the following formats:
* 1 i x (0 ≤ x < i ≤ n), representing a query of type 1.
* 2 i (1 ≤ i ≤ n), representing a query of type 2.
It is guaranteed that there's at least one query of type 2.
Output
For each query of type 2, print one integer — the answer to the query.
Examples
Input
3
0 0 0
7
2 1
2 2
2 3
1 2 1
2 1
2 2
2 3
Output
1
2
3
2
1
3
Input
5
0 1 2 3 4
15
2 1
2 2
1 2 1
2 2
2 3
2 5
1 3 0
1 4 0
2 3
2 4
2 5
1 4 1
2 3
2 4
2 5
Output
5
4
4
3
1
4
5
1
5
4
1
Note
For the first sample, there's initially only one possible permutation that satisfies the constraints: [1, 2, 3], as it must have 0 inversions.
After the query of type 1, the array b is [0, 1, 0]. The only permutation p that produces this array is [2, 1, 3]. With this permutation, b_2 is equal to 1 as p_1 > p_2. | #include <bits/stdc++.h>
#ifdef ALGO
#include "el_psy_congroo.hpp"
#else
#define DUMP(...) 1145141919810
#define CHECK(...) (__VA_ARGS__)
#endif
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::istream& reader = std::cin;
const int BIT = 10;
int n;
reader >> n;
std::vector<std::vector<int>> vec(BIT, std::vector<int>(n));
for (int i = 0; i < n; ++i) {
reader >> vec[0][i];
}
auto update = [&](int level, int l) -> void {
CHECK(level > 0);
int r = std::min(n, l + (1 << level)); // [l, r)
int mid = std::min(n, l + (1 << (level - 1)));
const auto& prev = vec[level - 1];
auto& cur = vec[level];
for (int i = l, j = mid, k = l, offset = 0; k < r; ++k) {
if (i == mid || (j < r && prev[i] >= prev[j] - offset)) {
cur[k] = prev[j++] - offset;
} else {
cur[k] = prev[i++];
++offset;
}
}
};
for (int level = 1; level < BIT; ++level) {
for (int i = 0; i < n; i += (1 << level)) {
update(level, i);
}
}
int q;
reader >> q;
while (q--) {
int op, i;
reader >> op >> i; --i;
if (op == 1) {
int x;
reader >> x;
vec[0][i] = x;
for (int level = 1; level < BIT; ++level) {
if (i >> (level - 1) & 1)
i -= 1 << (level - 1);
update(level, i);
}
} else {
int v = vec[0][i];
++i;
while (i < n) {
int level = std::min(BIT - 1, __builtin_ctz(i));
v += std::upper_bound(vec[level].begin() + i, vec[level].begin() + std::min(n, i + (1 << level)), v)
- vec[level].begin() - i;
i += 1 << level;
}
printf("%d\n", n - v);
}
}
}
| 2C++
| {
"input": [
"3\n0 0 0\n7\n2 1\n2 2\n2 3\n1 2 1\n2 1\n2 2\n2 3\n",
"5\n0 1 2 3 4\n15\n2 1\n2 2\n1 2 1\n2 2\n2 3\n2 5\n1 3 0\n1 4 0\n2 3\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"5\n0 0 2 3 0\n10\n2 1\n2 5\n2 2\n1 1 0\n2 5\n1 2 0\n1 3 1\n2 3\n2 3\n2 4\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"5\n0 0 2 2 3\n10\n2 2\n2 3\n2 1\n1 4 2\n2 5\n2 3\n2 5\n2 2\n2 5\n1 4 1\n",
"5\n0 0 2 1 0\n10\n2 1\n1 2 1\n1 5 3\n2 3\n2 2\n2 4\n1 2 1\n2 4\n1 3 2\n2 3\n",
"1\n0\n1\n2 1\n",
"10\n0 1 2 2 1 1 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"3\n0 0 0\n7\n2 1\n2 2\n2 3\n1 2 1\n2 1\n2 3\n2 3\n",
"3\n0 0 0\n7\n2 1\n2 2\n2 3\n1 2 1\n2 2\n2 3\n2 3\n",
"5\n0 0 2 3 0\n10\n2 1\n2 5\n2 2\n1 1 0\n2 5\n1 2 0\n1 2 1\n2 3\n2 3\n2 4\n",
"10\n0 1 2 2 2 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"5\n0 1 2 3 4\n15\n2 1\n1 2\n1 2 1\n2 2\n2 3\n2 5\n1 3 0\n1 4 0\n2 3\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 8\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"3\n0 0 0\n3\n2 1\n2 2\n2 3\n2 2 1\n2 1\n2 3\n2 3\n",
"3\n0 0 0\n7\n2 1\n2 2\n2 3\n1 2 0\n2 1\n2 2\n2 3\n",
"5\n0 1 2 3 4\n15\n2 1\n2 2\n1 2 1\n2 2\n2 3\n2 5\n1 3 0\n1 4 0\n2 5\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 1\n1 9 1\n1 3 1\n",
"5\n0 0 2 3 1\n10\n2 1\n2 5\n2 2\n1 1 0\n2 5\n1 2 0\n1 2 1\n2 3\n2 3\n2 4\n",
"5\n0 1 2 3 4\n15\n2 1\n1 2\n1 2 2\n2 2\n2 3\n2 5\n1 3 0\n1 4 0\n2 3\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 8\n1 6 2\n1 7 3\n1 6 4\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"3\n0 1 0\n3\n2 1\n2 2\n2 3\n2 2 1\n2 1\n2 3\n2 3\n",
"3\n0 0 0\n7\n2 1\n2 2\n2 3\n1 2 0\n2 1\n2 2\n2 1\n",
"5\n0 0 2 3 1\n2\n2 1\n2 5\n2 2\n1 1 0\n2 5\n1 2 0\n1 2 1\n2 3\n2 3\n2 4\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 7\n1 6 2\n1 7 3\n1 6 4\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"10\n0 1 2 2 2 1 0 4 7 9\n10\n2 1\n2 5\n1 6 3\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"10\n0 1 2 2 2 0 0 3 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n2 3 1\n",
"3\n0 0 0\n7\n2 1\n2 2\n2 2\n1 2 0\n2 1\n2 2\n2 1\n",
"10\n0 1 2 2 1 1 1 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n0 9 1\n1 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 7\n1 6 2\n1 7 2\n1 6 4\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 7\n1 6 2\n1 7 3\n1 4 0\n2 9\n1 8 7\n2 1\n1 9 1\n1 3 1\n",
"5\n0 0 2 3 1\n2\n2 1\n2 3\n2 2\n1 1 0\n2 5\n2 2 0\n1 2 1\n2 5\n2 3\n2 4\n",
"5\n0 0 2 3 0\n9\n2 1\n2 5\n2 2\n1 1 0\n2 5\n1 2 0\n1 3 1\n2 3\n2 3\n2 4\n",
"5\n0 0 2 1 0\n10\n2 1\n1 2 1\n1 5 3\n2 3\n2 2\n2 4\n1 2 1\n2 1\n1 3 2\n2 3\n",
"10\n0 1 2 2 1 1 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n2 3 0\n",
"10\n0 1 2 0 2 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 2 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 1\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"3\n0 0 0\n7\n2 1\n2 1\n2 3\n2 2 1\n2 1\n2 3\n2 3\n",
"3\n0 0 1\n7\n2 1\n2 2\n2 3\n1 2 0\n2 1\n2 2\n2 3\n",
"5\n0 0 2 3 4\n15\n2 1\n2 2\n1 2 1\n2 2\n2 3\n2 5\n1 3 0\n1 4 0\n2 5\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 2 1 1 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 2\n2 2\n1 9 1\n1 3 0\n",
"5\n0 0 2 3 1\n10\n2 1\n2 5\n2 2\n1 1 0\n2 5\n1 2 0\n1 2 1\n2 3\n2 1\n2 4\n",
"10\n0 1 2 2 2 0 0 0 7 9\n10\n2 1\n2 5\n1 6 3\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"3\n0 1 0\n3\n2 1\n2 2\n2 1\n2 2 1\n2 1\n2 3\n2 3\n",
"10\n0 1 2 2 2 1 0 4 7 9\n10\n2 1\n2 5\n1 6 3\n1 7 3\n1 9 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"10\n0 1 2 2 2 0 0 3 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 1\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n2 3 1\n",
"3\n0 0 0\n7\n2 1\n2 2\n2 2\n1 2 1\n2 1\n2 2\n2 1\n",
"10\n0 1 2 2 2 0 0 3 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 6\n2 2\n1 9 3\n2 3 1\n",
"5\n0 1 2 3 1\n2\n2 1\n2 5\n2 2\n1 1 0\n2 5\n2 2 0\n1 2 1\n2 5\n2 3\n2 4\n",
"10\n0 0 2 2 1 2 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 1\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 2\n2 8\n1 3 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"10\n0 1 2 2 1 1 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 8\n1 8 2\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 8\n1 6 2\n1 7 6\n1 6 4\n2 9\n1 8 7\n2 2\n1 9 1\n2 3 1\n",
"10\n0 1 2 2 2 1 0 4 7 9\n1\n2 1\n2 5\n1 6 3\n1 7 3\n1 9 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"5\n0 0 2 3 1\n3\n2 1\n2 3\n2 2\n1 1 0\n2 5\n2 2 0\n1 2 1\n2 2\n2 3\n2 4\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 2\n2 8\n1 3 2\n1 7 3\n1 6 3\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"10\n0 1 0 2 1 1 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 8\n1 8 2\n2 2\n1 9 1\n1 3 0\n",
"3\n0 1 1\n3\n2 1\n2 2\n2 1\n2 2 1\n2 1\n2 4\n2 3\n",
"10\n0 0 2 2 1 2 0 4 7 9\n10\n2 1\n2 5\n1 10 0\n1 7 1\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 0 2 1 1 0 4 7 9\n8\n2 1\n2 10\n1 6 2\n1 7 3\n1 6 2\n2 8\n1 8 2\n2 2\n1 9 1\n1 3 0\n",
"10\n0 0 2 2 1 2 0 4 7 9\n10\n2 1\n2 3\n1 10 0\n1 7 1\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 0 2 1 1 0 4 7 9\n8\n2 1\n2 4\n1 6 2\n1 7 3\n1 6 2\n2 8\n1 8 2\n2 2\n2 9 1\n1 3 0\n",
"5\n0 0 0 3 1\n2\n2 1\n2 5\n2 2\n0 1 0\n0 4\n2 1 0\n3 2 2\n2 3\n4 6\n2 4\n",
"5\n0 0 0 3 0\n2\n2 1\n2 5\n2 2\n0 1 0\n0 4\n2 1 0\n3 2 2\n2 3\n4 6\n2 4\n",
"5\n0 0 2 2 3\n10\n2 2\n2 3\n2 2\n1 4 2\n2 5\n2 3\n2 5\n2 2\n2 5\n1 4 1\n",
"5\n0 1 2 1 4\n15\n2 1\n2 2\n1 2 1\n2 2\n2 3\n2 5\n1 3 0\n1 4 0\n2 3\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 6\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"5\n0 1 2 3 4\n15\n2 1\n2 2\n1 2 1\n2 1\n2 3\n2 5\n1 3 0\n1 4 0\n2 5\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 2 1 1 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 5 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 3 2 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 10\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"3\n0 0 0\n7\n2 1\n2 1\n2 3\n1 2 0\n2 1\n2 2\n2 1\n",
"10\n0 1 2 2 1 1 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 3\n2 9\n1 8 7\n2 2\n0 9 1\n1 3 0\n",
"10\n0 1 2 2 2 0 0 3 6 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n2 3 1\n",
"10\n0 0 2 2 1 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 4 0\n2 9\n1 8 7\n2 1\n1 9 1\n1 3 1\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 10\n1 6 2\n1 7 2\n1 6 4\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"10\n0 1 2 2 1 1 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 0\n2 2\n1 9 1\n2 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 1\n1 3 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"5\n0 0 2 3 4\n15\n2 1\n2 2\n1 2 1\n2 4\n2 3\n2 5\n1 3 0\n1 4 0\n2 5\n2 4\n2 5\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 3 2 0 0 4 7 9\n10\n2 1\n2 5\n1 5 2\n1 7 0\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 1 1 4 7 9\n8\n2 2\n2 5\n1 3 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n0 9 1\n1 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 2\n2 8\n1 5 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"10\n0 1 2 2 1 1 0 4 7 4\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 8\n1 8 2\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 8\n1 6 2\n1 7 6\n1 6 4\n2 9\n1 8 7\n2 2\n1 3 1\n2 3 1\n",
"10\n0 0 2 2 1 2 0 4 7 9\n10\n2 1\n2 5\n1 10 0\n1 9 1\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"3\n0 0 1\n3\n2 1\n2 2\n2 1\n2 4 1\n2 1\n2 4\n2 3\n",
"10\n0 1 0 2 1 1 0 4 7 9\n8\n2 1\n2 4\n1 6 2\n1 9 3\n1 6 2\n2 8\n1 8 2\n2 2\n2 9 1\n1 3 0\n",
"5\n0 0 0 3 0\n1\n2 1\n2 5\n2 2\n0 1 0\n1 4\n2 1 0\n3 2 2\n2 3\n2 6\n3 4\n",
"5\n0 0 0 1 0\n2\n2 1\n2 5\n2 2\n0 1 0\n1 4\n0 1 0\n3 2 2\n2 3\n2 6\n3 4\n",
"5\n0 1 2 1 4\n15\n2 1\n2 2\n1 2 1\n2 2\n2 3\n2 5\n1 3 0\n1 4 0\n2 3\n2 4\n2 2\n1 4 1\n2 3\n2 4\n2 5\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 2\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 6\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"3\n0 1 0\n3\n2 2\n2 2\n2 3\n2 2 2\n2 1\n2 3\n2 3\n",
"10\n0 1 2 2 1 1 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 4\n1 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 1 0 4 7 9\n10\n2 1\n2 8\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n2 3 2\n",
"5\n0 0 1 3 1\n3\n2 1\n2 3\n2 2\n1 1 1\n2 5\n2 2 0\n1 2 1\n2 2\n2 3\n2 4\n",
"10\n0 1 2 2 2 0 0 4 7 9\n1\n2 1\n2 5\n1 6 1\n2 7 3\n1 9 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 2\n2 5\n1 10 2\n1 7 3\n1 6 2\n2 6\n1 8 7\n2 2\n1 9 1\n1 3 1\n",
"10\n0 1 2 2 1 0 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 1 1 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 1\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"3\n0 0 0\n7\n2 1\n2 2\n2 3\n2 2 1\n2 1\n2 3\n2 3\n",
"10\n0 1 2 2 2 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"10\n0 1 2 2 2 0 0 3 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"10\n0 1 2 2 1 1 0 4 7 9\n8\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 3 2 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 1\n1 3 0\n",
"10\n0 1 2 2 2 0 0 4 7 9\n10\n2 1\n2 5\n1 6 3\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 0\n",
"10\n0 1 2 2 2 0 0 3 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 6 2\n2 9\n1 8 7\n2 2\n1 9 2\n1 3 1\n",
"10\n0 1 2 2 1 0 0 4 7 9\n10\n2 1\n2 5\n1 6 2\n1 7 3\n1 4 2\n2 9\n1 8 7\n2 1\n1 9 1\n1 3 1\n"
],
"output": [
"1 2 3 2 1 3 \n",
"5 4 4 3 1 4 5 1 5 4 1 \n",
"3 5 4 5 3 3 1 \n",
"8 7 3 6 \n",
"5 1 4 2 1 2 5 2 \n",
"2 1 3 4 4 1 \n",
"1 \n",
"9\n7\n3\n6\n",
"8\n7\n3\n6\n",
"1\n2\n3\n2\n3\n3\n",
"1\n2\n3\n1\n3\n3\n",
"3\n5\n4\n5\n2\n2\n1\n",
"8\n5\n3\n9\n",
"5\n5\n4\n3\n1\n4\n5\n1\n5\n4\n1\n",
"8\n6\n3\n6\n",
"1\n2\n3\n",
"1\n2\n3\n1\n2\n3\n",
"5\n4\n4\n3\n1\n1\n5\n1\n5\n4\n1\n",
"8\n7\n3\n10\n",
"3\n4\n5\n4\n2\n2\n1\n",
"5\n4\n4\n3\n1\n4\n5\n1\n5\n4\n1\n",
"8\n6\n3\n8\n",
"2\n1\n3\n",
"1\n2\n3\n1\n2\n1\n",
"3\n4\n",
"8\n10\n3\n8\n",
"9\n5\n3\n9\n",
"8\n5\n3\n9\n3\n",
"1\n2\n2\n1\n2\n1\n",
"10\n7\n3\n6\n",
"8\n10\n3\n7\n",
"8\n10\n3\n6\n",
"3\n2\n",
"3\n5\n4\n5\n3\n3\n",
"2\n1\n3\n4\n5\n1\n",
"9\n7\n3\n6\n3\n",
"7\n5\n3\n5\n",
"9\n8\n3\n6\n",
"1\n1\n3\n2\n3\n3\n",
"1\n3\n2\n1\n3\n2\n",
"4\n5\n4\n3\n1\n1\n5\n1\n5\n4\n1\n",
"9\n7\n3\n5\n",
"3\n4\n5\n4\n2\n5\n1\n",
"7\n5\n3\n9\n",
"2\n1\n2\n",
"9\n5\n8\n9\n",
"8\n5\n3\n8\n3\n",
"1\n2\n2\n2\n1\n2\n",
"8\n5\n3\n9\n2\n",
"5\n4\n",
"5\n8\n3\n10\n",
"5\n6\n3\n6\n",
"9\n7\n6\n5\n",
"8\n6\n3\n8\n4\n",
"9\n",
"3\n2\n5\n",
"5\n6\n3\n8\n",
"5\n7\n6\n2\n",
"3\n1\n3\n",
"5\n8\n2\n9\n",
"5\n1\n6\n2\n",
"5\n2\n2\n9\n",
"5\n4\n6\n2\n",
"2\n4\n",
"2\n5\n",
"5\n1\n5\n2\n1\n2\n5\n2\n",
"5\n3\n3\n2\n1\n4\n5\n1\n5\n4\n1\n",
"8\n7\n8\n6\n",
"5\n4\n5\n3\n1\n1\n5\n1\n5\n4\n1\n",
"9\n7\n3\n9\n",
"8\n5\n1\n9\n",
"1\n1\n3\n1\n2\n1\n",
"9\n7\n3\n8\n",
"8\n5\n4\n9\n3\n",
"5\n7\n3\n5\n",
"8\n1\n3\n7\n",
"9\n7\n3\n5\n2\n",
"8\n8\n3\n6\n",
"4\n5\n2\n3\n1\n1\n5\n1\n5\n4\n1\n",
"8\n5\n3\n8\n",
"5\n7\n3\n6\n",
"5\n6\n3\n9\n",
"9\n7\n5\n4\n",
"8\n6\n3\n8\n8\n",
"5\n8\n8\n7\n",
"1\n3\n1\n",
"5\n4\n5\n2\n",
"2\n",
"1\n5\n",
"5\n3\n3\n2\n1\n4\n5\n2\n5\n4\n1\n",
"5\n7\n8\n6\n",
"1\n1\n3\n",
"9\n7\n3\n",
"9\n6\n3\n6\n3\n",
"2\n3\n5\n",
"8\n",
"5\n7\n7\n5\n",
"8\n7\n3\n6\n",
"9\n7\n3\n6\n",
"1\n2\n3\n2\n3\n3\n",
"8\n5\n3\n9\n",
"8\n5\n3\n9\n",
"9\n7\n3\n6\n",
"8\n5\n3\n9\n",
"8\n5\n3\n9\n",
"8\n5\n3\n9\n",
"8\n7\n3\n10\n"
]
} | 2CODEFORCES
|
168_C. Wizards and Trolleybuses_37916 | In some country live wizards. They love to ride trolleybuses.
A city in this country has a trolleybus depot with n trolleybuses. Every day the trolleybuses leave the depot, one by one and go to the final station. The final station is at a distance of d meters from the depot. We know for the i-th trolleybus that it leaves at the moment of time ti seconds, can go at a speed of no greater than vi meters per second, and accelerate with an acceleration no greater than a meters per second squared. A trolleybus can decelerate as quickly as you want (magic!). It can change its acceleration as fast as you want, as well. Note that the maximum acceleration is the same for all trolleys.
Despite the magic the trolleys are still powered by an electric circuit and cannot overtake each other (the wires are to blame, of course). If a trolleybus catches up with another one, they go together one right after the other until they arrive at the final station. Also, the drivers are driving so as to arrive at the final station as quickly as possible.
You, as head of the trolleybuses' fans' club, are to determine for each trolley the minimum time by which it can reach the final station. At the time of arrival at the destination station the trolleybus does not necessarily have zero speed. When a trolley is leaving the depot, its speed is considered equal to zero. From the point of view of physics, the trolleybuses can be considered as material points, and also we should ignore the impact on the speed of a trolley bus by everything, except for the acceleration and deceleration provided by the engine.
Input
The first input line contains three space-separated integers n, a, d (1 ≤ n ≤ 105, 1 ≤ a, d ≤ 106) — the number of trolleybuses, their maximum acceleration and the distance from the depot to the final station, correspondingly.
Next n lines contain pairs of integers ti vi (0 ≤ t1 < t2... < tn - 1 < tn ≤ 106, 1 ≤ vi ≤ 106) — the time when the i-th trolleybus leaves the depot and its maximum speed, correspondingly. The numbers in the lines are separated by spaces.
Output
For each trolleybus print a single line the time it arrives to the final station. Print the times for the trolleybuses in the order in which the trolleybuses are given in the input. The answer will be accepted if the absolute or relative error doesn't exceed 10 - 4.
Examples
Input
3 10 10000
0 10
5 11
1000 1
Output
1000.5000000000
1000.5000000000
11000.0500000000
Input
1 2 26
28 29
Output
33.0990195136
Note
In the first sample the second trolleybus will catch up with the first one, that will happen at distance 510.5 meters from the depot. The trolleybuses will go the remaining 9489.5 meters together at speed 10 meters per second. As a result, both trolleybuses will arrive to the final station by the moment of time 1000.5 seconds. The third trolleybus will not catch up with them. It will arrive to the final station by the moment of time 11000.05 seconds. | import math
t = 0.0
n, a, d = map(int, raw_input().split())
for i in xrange(n):
ti, v = map(float, raw_input().split())
t1 = (v / a + (d - v * v / (2 * a)) / v) if d > v * v / (2 * a) else math.sqrt(2 * float(d) / a)
t = max(t1 + ti, t)
print(t)
| 1Python2
| {
"input": [
"3 10 10000\n0 10\n5 11\n1000 1\n",
"1 2 26\n28 29\n",
"1 2 7\n20 13\n",
"8 4 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n20 24\n30 2\n",
"4 5 14\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n19 2\n",
"1 1 1\n0 1000000\n",
"1 100000 363166\n560443 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 6\n",
"3 6 6\n2 10\n14 19\n18 14\n",
"1 1 722397\n556297 454495\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000000\n0 1000000\n",
"7 8 3\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 124232 477338\n899117 898233\n",
"1 2 7\n25 13\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n29 24\n30 2\n",
"4 5 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n21 2\n",
"1 1 1\n0 1000100\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"7 8 2\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n899117 898233\n",
"3 10 10000\n0 15\n5 11\n1000 1\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"4 6 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 0\n13 1\n18 12\n21 2\n",
"1 1 1\n1 1000100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n728048 898233\n",
"3 6 19\n12 3\n29 22\n30 3\n",
"4 6 39\n11 1\n16 20\n17 15\n21 7\n",
"7 8 2\n1 2\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 898233\n",
"3 8 19\n12 3\n29 22\n30 3\n",
"1 1 2\n1 1000101\n",
"7 8 2\n1 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 81784\n",
"3 8 19\n5 3\n29 22\n30 3\n",
"1 1 3\n1 1000101\n",
"1 246051 398840\n412126 81784\n",
"1 1 4\n1 1000101\n",
"1 1 4\n2 1000101\n",
"1 1 6\n2 1000101\n",
"3 6 19\n12 3\n20 24\n30 4\n",
"4 5 14\n11 1\n16 20\n17 20\n21 7\n",
"3 3 3\n6 1\n18 12\n19 2\n",
"1 100000 363166\n92269 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 10\n",
"3 6 6\n2 10\n14 12\n18 14\n",
"8 7 21\n2 11\n3 4\n4 3\n10 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000100\n0 1000000\n",
"1 124232 952506\n899117 898233\n",
"3 10 10010\n0 10\n5 11\n1000 1\n",
"1 2 5\n28 29\n",
"1 2 1\n25 13\n",
"3 3 3\n13 1\n18 12\n21 1\n",
"8 7 21\n2 15\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"1 246051 147274\n899117 898233\n",
"8 6 12\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"3 6 35\n12 3\n29 22\n30 2\n",
"1 246051 477338\n141435 898233\n",
"1 2 1\n1 1000101\n",
"3 8 19\n4 3\n29 22\n30 3\n",
"7 8 2\n0 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n94006 81784\n",
"1 1 4\n0 1000101\n",
"1 1 7\n2 1010101\n",
"3 6 19\n12 3\n29 22\n30 2\n",
"1 1 1\n1 1000101\n",
"1 1 6\n2 1010101\n",
"8 6 13\n0 13\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"4 5 22\n11 1\n16 20\n17 15\n21 11\n",
"1 1 1\n1 1010100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 23\n18 7\n21 17\n23 21\n",
"7 8 2\n1 2\n5 26\n7 6\n10 7\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 797295\n",
"1 1 4\n2 1000111\n",
"1 1 0\n2 1000101\n"
],
"output": [
"1000.500000000\n1000.500000000\n11000.050000000\n",
"33.099019514\n",
"22.645751311\n",
"2.549509757\n8.549509757\n12.549509757\n14.225000000\n14.549509757\n22.549509757\n23.625000000\n24.549509757\n",
"18.583333333\n22.516611478\n39.666666667\n",
"25.100000000\n25.100000000\n25.100000000\n25.100000000\n",
"16.166666667\n19.414213562\n20.833333333\n",
"1.414213562\n",
"560445.695054730\n",
"4.285714286\n4.511857892\n5.642857143\n13.071428571\n13.071428571\n13.071428571\n13.511857892\n18.285714286\n18.511857892\n21.761904762\n",
"3.414213562\n15.414213562\n19.414213562\n",
"557498.995840259\n",
"4.694805195\n8.535714286\n11.214285714\n11.449489743\n17.976190476\n20.557142857\n24.449579832\n26.814285714\n",
"1.500000000\n",
"2.187500000\n5.866025404\n8.187500000\n10.866025404\n18.866025404\n21.866025404\n23.866025404\n",
"899119.772115135\n",
"27.64575131106459\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"16.166666666666668\n19.414213562373096\n22.833333333333336\n",
"1.4142135623730951\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"1.8541666666666667\n5.707106781186548\n7.854166666666667\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"899118.9697696209\n",
"667.4166666666666\n914.6409090909092\n11000.050000000001\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n34.083333333333336\n34.083333333333336\n",
"33.083333333333336\n33.083333333333336\n33.083333333333336\n33.083333333333336\n",
"13.0\n18.0\n21.0\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.9697696209\n",
"18.583333333333332\n31.516611478423584\n36.583333333333336\n",
"50.08333333333333\n50.08333333333333\n50.08333333333333\n50.08333333333333\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"18.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.0\n",
"1.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728053.0429416959\n",
"11.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.449489742783178\n",
"412131.04294169584\n",
"3.8284271247461903\n",
"4.82842712474619\n",
"5.464101615137754\n",
"18.583333333333332\n22.516611478423584\n35.083333333333336\n",
"25.1\n25.1\n25.1\n25.1\n",
"9.166666666666666\n19.414213562373096\n20.833333333333336\n",
"92271.69505473043\n",
"4.285714285714286\n4.511857892036909\n5.642857142857143\n13.071428571428573\n13.071428571428573\n13.071428571428573\n13.51185789203691\n18.28571428571429\n18.511857892036907\n21.514285714285712\n",
"3.414213562373095\n15.414213562373096\n19.414213562373096\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n12.449489742783179\n17.976190476190474\n20.557142857142857\n24.449579831932773\n26.814285714285713\n",
"1.5001\n",
"899120.9159047487\n",
"1001.5\n1001.5\n11010.050000000001\n",
"30.23606797749979\n",
"26.0\n",
"16.166666666666668\n19.414213562373096\n24.166666666666664\n",
"4.471428571428571\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"899118.0941212976\n",
"2.0\n8.0\n12.0\n13.816666666666666\n14.0\n22.0\n33.083333333333336\n33.083333333333336\n",
"23.916666666666664\n32.41565025531987\n47.666666666666664\n",
"141436.96976962086\n",
"2.0\n",
"10.520833333333332\n31.179449471770337\n36.520833333333336\n",
"0.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"94011.04294169587\n",
"2.8284271247461903\n",
"5.741657386773941\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"2.414213562373095\n",
"5.464101615137754\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"4.82842712474619\n",
"2.0\n"
]
} | 2CODEFORCES
|
168_C. Wizards and Trolleybuses_37917 | In some country live wizards. They love to ride trolleybuses.
A city in this country has a trolleybus depot with n trolleybuses. Every day the trolleybuses leave the depot, one by one and go to the final station. The final station is at a distance of d meters from the depot. We know for the i-th trolleybus that it leaves at the moment of time ti seconds, can go at a speed of no greater than vi meters per second, and accelerate with an acceleration no greater than a meters per second squared. A trolleybus can decelerate as quickly as you want (magic!). It can change its acceleration as fast as you want, as well. Note that the maximum acceleration is the same for all trolleys.
Despite the magic the trolleys are still powered by an electric circuit and cannot overtake each other (the wires are to blame, of course). If a trolleybus catches up with another one, they go together one right after the other until they arrive at the final station. Also, the drivers are driving so as to arrive at the final station as quickly as possible.
You, as head of the trolleybuses' fans' club, are to determine for each trolley the minimum time by which it can reach the final station. At the time of arrival at the destination station the trolleybus does not necessarily have zero speed. When a trolley is leaving the depot, its speed is considered equal to zero. From the point of view of physics, the trolleybuses can be considered as material points, and also we should ignore the impact on the speed of a trolley bus by everything, except for the acceleration and deceleration provided by the engine.
Input
The first input line contains three space-separated integers n, a, d (1 ≤ n ≤ 105, 1 ≤ a, d ≤ 106) — the number of trolleybuses, their maximum acceleration and the distance from the depot to the final station, correspondingly.
Next n lines contain pairs of integers ti vi (0 ≤ t1 < t2... < tn - 1 < tn ≤ 106, 1 ≤ vi ≤ 106) — the time when the i-th trolleybus leaves the depot and its maximum speed, correspondingly. The numbers in the lines are separated by spaces.
Output
For each trolleybus print a single line the time it arrives to the final station. Print the times for the trolleybuses in the order in which the trolleybuses are given in the input. The answer will be accepted if the absolute or relative error doesn't exceed 10 - 4.
Examples
Input
3 10 10000
0 10
5 11
1000 1
Output
1000.5000000000
1000.5000000000
11000.0500000000
Input
1 2 26
28 29
Output
33.0990195136
Note
In the first sample the second trolleybus will catch up with the first one, that will happen at distance 510.5 meters from the depot. The trolleybuses will go the remaining 9489.5 meters together at speed 10 meters per second. As a result, both trolleybuses will arrive to the final station by the moment of time 1000.5 seconds. The third trolleybus will not catch up with them. It will arrive to the final station by the moment of time 11000.05 seconds. | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, a, d;
int t[100005], v[100005];
double ans[100005];
int main() {
cin.tie(0);
cin >> n >> a >> d;
for (int i = 1; i <= n; i++) cin >> t[i] >> v[i];
ans[0] = 0;
for (int i = 1; i <= n; i++) {
double tt = 1.0 * v[i] / a;
double dd = 0.5 * a * tt * tt, res = -1;
if (dd < d) {
res = tt + (d - dd) / v[i];
} else {
res = sqrt(2.0 * d / a);
}
ans[i] = res + t[i];
ans[i] = max(ans[i], ans[i - 1]);
cout << fixed << setprecision(10) << ans[i] << endl;
}
return 0;
}
| 2C++
| {
"input": [
"3 10 10000\n0 10\n5 11\n1000 1\n",
"1 2 26\n28 29\n",
"1 2 7\n20 13\n",
"8 4 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n20 24\n30 2\n",
"4 5 14\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n19 2\n",
"1 1 1\n0 1000000\n",
"1 100000 363166\n560443 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 6\n",
"3 6 6\n2 10\n14 19\n18 14\n",
"1 1 722397\n556297 454495\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000000\n0 1000000\n",
"7 8 3\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 124232 477338\n899117 898233\n",
"1 2 7\n25 13\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n29 24\n30 2\n",
"4 5 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n21 2\n",
"1 1 1\n0 1000100\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"7 8 2\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n899117 898233\n",
"3 10 10000\n0 15\n5 11\n1000 1\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"4 6 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 0\n13 1\n18 12\n21 2\n",
"1 1 1\n1 1000100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n728048 898233\n",
"3 6 19\n12 3\n29 22\n30 3\n",
"4 6 39\n11 1\n16 20\n17 15\n21 7\n",
"7 8 2\n1 2\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 898233\n",
"3 8 19\n12 3\n29 22\n30 3\n",
"1 1 2\n1 1000101\n",
"7 8 2\n1 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 81784\n",
"3 8 19\n5 3\n29 22\n30 3\n",
"1 1 3\n1 1000101\n",
"1 246051 398840\n412126 81784\n",
"1 1 4\n1 1000101\n",
"1 1 4\n2 1000101\n",
"1 1 6\n2 1000101\n",
"3 6 19\n12 3\n20 24\n30 4\n",
"4 5 14\n11 1\n16 20\n17 20\n21 7\n",
"3 3 3\n6 1\n18 12\n19 2\n",
"1 100000 363166\n92269 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 10\n",
"3 6 6\n2 10\n14 12\n18 14\n",
"8 7 21\n2 11\n3 4\n4 3\n10 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000100\n0 1000000\n",
"1 124232 952506\n899117 898233\n",
"3 10 10010\n0 10\n5 11\n1000 1\n",
"1 2 5\n28 29\n",
"1 2 1\n25 13\n",
"3 3 3\n13 1\n18 12\n21 1\n",
"8 7 21\n2 15\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"1 246051 147274\n899117 898233\n",
"8 6 12\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"3 6 35\n12 3\n29 22\n30 2\n",
"1 246051 477338\n141435 898233\n",
"1 2 1\n1 1000101\n",
"3 8 19\n4 3\n29 22\n30 3\n",
"7 8 2\n0 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n94006 81784\n",
"1 1 4\n0 1000101\n",
"1 1 7\n2 1010101\n",
"3 6 19\n12 3\n29 22\n30 2\n",
"1 1 1\n1 1000101\n",
"1 1 6\n2 1010101\n",
"8 6 13\n0 13\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"4 5 22\n11 1\n16 20\n17 15\n21 11\n",
"1 1 1\n1 1010100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 23\n18 7\n21 17\n23 21\n",
"7 8 2\n1 2\n5 26\n7 6\n10 7\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 797295\n",
"1 1 4\n2 1000111\n",
"1 1 0\n2 1000101\n"
],
"output": [
"1000.500000000\n1000.500000000\n11000.050000000\n",
"33.099019514\n",
"22.645751311\n",
"2.549509757\n8.549509757\n12.549509757\n14.225000000\n14.549509757\n22.549509757\n23.625000000\n24.549509757\n",
"18.583333333\n22.516611478\n39.666666667\n",
"25.100000000\n25.100000000\n25.100000000\n25.100000000\n",
"16.166666667\n19.414213562\n20.833333333\n",
"1.414213562\n",
"560445.695054730\n",
"4.285714286\n4.511857892\n5.642857143\n13.071428571\n13.071428571\n13.071428571\n13.511857892\n18.285714286\n18.511857892\n21.761904762\n",
"3.414213562\n15.414213562\n19.414213562\n",
"557498.995840259\n",
"4.694805195\n8.535714286\n11.214285714\n11.449489743\n17.976190476\n20.557142857\n24.449579832\n26.814285714\n",
"1.500000000\n",
"2.187500000\n5.866025404\n8.187500000\n10.866025404\n18.866025404\n21.866025404\n23.866025404\n",
"899119.772115135\n",
"27.64575131106459\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"16.166666666666668\n19.414213562373096\n22.833333333333336\n",
"1.4142135623730951\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"1.8541666666666667\n5.707106781186548\n7.854166666666667\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"899118.9697696209\n",
"667.4166666666666\n914.6409090909092\n11000.050000000001\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n34.083333333333336\n34.083333333333336\n",
"33.083333333333336\n33.083333333333336\n33.083333333333336\n33.083333333333336\n",
"13.0\n18.0\n21.0\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.9697696209\n",
"18.583333333333332\n31.516611478423584\n36.583333333333336\n",
"50.08333333333333\n50.08333333333333\n50.08333333333333\n50.08333333333333\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"18.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.0\n",
"1.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728053.0429416959\n",
"11.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.449489742783178\n",
"412131.04294169584\n",
"3.8284271247461903\n",
"4.82842712474619\n",
"5.464101615137754\n",
"18.583333333333332\n22.516611478423584\n35.083333333333336\n",
"25.1\n25.1\n25.1\n25.1\n",
"9.166666666666666\n19.414213562373096\n20.833333333333336\n",
"92271.69505473043\n",
"4.285714285714286\n4.511857892036909\n5.642857142857143\n13.071428571428573\n13.071428571428573\n13.071428571428573\n13.51185789203691\n18.28571428571429\n18.511857892036907\n21.514285714285712\n",
"3.414213562373095\n15.414213562373096\n19.414213562373096\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n12.449489742783179\n17.976190476190474\n20.557142857142857\n24.449579831932773\n26.814285714285713\n",
"1.5001\n",
"899120.9159047487\n",
"1001.5\n1001.5\n11010.050000000001\n",
"30.23606797749979\n",
"26.0\n",
"16.166666666666668\n19.414213562373096\n24.166666666666664\n",
"4.471428571428571\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"899118.0941212976\n",
"2.0\n8.0\n12.0\n13.816666666666666\n14.0\n22.0\n33.083333333333336\n33.083333333333336\n",
"23.916666666666664\n32.41565025531987\n47.666666666666664\n",
"141436.96976962086\n",
"2.0\n",
"10.520833333333332\n31.179449471770337\n36.520833333333336\n",
"0.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"94011.04294169587\n",
"2.8284271247461903\n",
"5.741657386773941\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"2.414213562373095\n",
"5.464101615137754\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"4.82842712474619\n",
"2.0\n"
]
} | 2CODEFORCES
|
168_C. Wizards and Trolleybuses_37918 | In some country live wizards. They love to ride trolleybuses.
A city in this country has a trolleybus depot with n trolleybuses. Every day the trolleybuses leave the depot, one by one and go to the final station. The final station is at a distance of d meters from the depot. We know for the i-th trolleybus that it leaves at the moment of time ti seconds, can go at a speed of no greater than vi meters per second, and accelerate with an acceleration no greater than a meters per second squared. A trolleybus can decelerate as quickly as you want (magic!). It can change its acceleration as fast as you want, as well. Note that the maximum acceleration is the same for all trolleys.
Despite the magic the trolleys are still powered by an electric circuit and cannot overtake each other (the wires are to blame, of course). If a trolleybus catches up with another one, they go together one right after the other until they arrive at the final station. Also, the drivers are driving so as to arrive at the final station as quickly as possible.
You, as head of the trolleybuses' fans' club, are to determine for each trolley the minimum time by which it can reach the final station. At the time of arrival at the destination station the trolleybus does not necessarily have zero speed. When a trolley is leaving the depot, its speed is considered equal to zero. From the point of view of physics, the trolleybuses can be considered as material points, and also we should ignore the impact on the speed of a trolley bus by everything, except for the acceleration and deceleration provided by the engine.
Input
The first input line contains three space-separated integers n, a, d (1 ≤ n ≤ 105, 1 ≤ a, d ≤ 106) — the number of trolleybuses, their maximum acceleration and the distance from the depot to the final station, correspondingly.
Next n lines contain pairs of integers ti vi (0 ≤ t1 < t2... < tn - 1 < tn ≤ 106, 1 ≤ vi ≤ 106) — the time when the i-th trolleybus leaves the depot and its maximum speed, correspondingly. The numbers in the lines are separated by spaces.
Output
For each trolleybus print a single line the time it arrives to the final station. Print the times for the trolleybuses in the order in which the trolleybuses are given in the input. The answer will be accepted if the absolute or relative error doesn't exceed 10 - 4.
Examples
Input
3 10 10000
0 10
5 11
1000 1
Output
1000.5000000000
1000.5000000000
11000.0500000000
Input
1 2 26
28 29
Output
33.0990195136
Note
In the first sample the second trolleybus will catch up with the first one, that will happen at distance 510.5 meters from the depot. The trolleybuses will go the remaining 9489.5 meters together at speed 10 meters per second. As a result, both trolleybuses will arrive to the final station by the moment of time 1000.5 seconds. The third trolleybus will not catch up with them. It will arrive to the final station by the moment of time 11000.05 seconds. | # written with help of passed solutions
from math import sqrt
n, a, d = map(int, input().split())
a = float(a)
ans = [0] * n
tm = 0
for i in range(n):
t, v = map(int, input().split())
acc_t = v / a
add_t = 0
if acc_t ** 2 * a > 2 * d:
add_t = sqrt(2 * d / a)
else:
add_t = acc_t + (d - acc_t ** 2 * a / 2) / v
tm = max(tm, t + add_t)
ans[i] = tm
print('\n'.join(map(str, ans)))
| 3Python3
| {
"input": [
"3 10 10000\n0 10\n5 11\n1000 1\n",
"1 2 26\n28 29\n",
"1 2 7\n20 13\n",
"8 4 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n20 24\n30 2\n",
"4 5 14\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n19 2\n",
"1 1 1\n0 1000000\n",
"1 100000 363166\n560443 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 6\n",
"3 6 6\n2 10\n14 19\n18 14\n",
"1 1 722397\n556297 454495\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000000\n0 1000000\n",
"7 8 3\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 124232 477338\n899117 898233\n",
"1 2 7\n25 13\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n29 24\n30 2\n",
"4 5 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n21 2\n",
"1 1 1\n0 1000100\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"7 8 2\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n899117 898233\n",
"3 10 10000\n0 15\n5 11\n1000 1\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"4 6 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 0\n13 1\n18 12\n21 2\n",
"1 1 1\n1 1000100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n728048 898233\n",
"3 6 19\n12 3\n29 22\n30 3\n",
"4 6 39\n11 1\n16 20\n17 15\n21 7\n",
"7 8 2\n1 2\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 898233\n",
"3 8 19\n12 3\n29 22\n30 3\n",
"1 1 2\n1 1000101\n",
"7 8 2\n1 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 81784\n",
"3 8 19\n5 3\n29 22\n30 3\n",
"1 1 3\n1 1000101\n",
"1 246051 398840\n412126 81784\n",
"1 1 4\n1 1000101\n",
"1 1 4\n2 1000101\n",
"1 1 6\n2 1000101\n",
"3 6 19\n12 3\n20 24\n30 4\n",
"4 5 14\n11 1\n16 20\n17 20\n21 7\n",
"3 3 3\n6 1\n18 12\n19 2\n",
"1 100000 363166\n92269 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 10\n",
"3 6 6\n2 10\n14 12\n18 14\n",
"8 7 21\n2 11\n3 4\n4 3\n10 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000100\n0 1000000\n",
"1 124232 952506\n899117 898233\n",
"3 10 10010\n0 10\n5 11\n1000 1\n",
"1 2 5\n28 29\n",
"1 2 1\n25 13\n",
"3 3 3\n13 1\n18 12\n21 1\n",
"8 7 21\n2 15\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"1 246051 147274\n899117 898233\n",
"8 6 12\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"3 6 35\n12 3\n29 22\n30 2\n",
"1 246051 477338\n141435 898233\n",
"1 2 1\n1 1000101\n",
"3 8 19\n4 3\n29 22\n30 3\n",
"7 8 2\n0 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n94006 81784\n",
"1 1 4\n0 1000101\n",
"1 1 7\n2 1010101\n",
"3 6 19\n12 3\n29 22\n30 2\n",
"1 1 1\n1 1000101\n",
"1 1 6\n2 1010101\n",
"8 6 13\n0 13\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"4 5 22\n11 1\n16 20\n17 15\n21 11\n",
"1 1 1\n1 1010100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 23\n18 7\n21 17\n23 21\n",
"7 8 2\n1 2\n5 26\n7 6\n10 7\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 797295\n",
"1 1 4\n2 1000111\n",
"1 1 0\n2 1000101\n"
],
"output": [
"1000.500000000\n1000.500000000\n11000.050000000\n",
"33.099019514\n",
"22.645751311\n",
"2.549509757\n8.549509757\n12.549509757\n14.225000000\n14.549509757\n22.549509757\n23.625000000\n24.549509757\n",
"18.583333333\n22.516611478\n39.666666667\n",
"25.100000000\n25.100000000\n25.100000000\n25.100000000\n",
"16.166666667\n19.414213562\n20.833333333\n",
"1.414213562\n",
"560445.695054730\n",
"4.285714286\n4.511857892\n5.642857143\n13.071428571\n13.071428571\n13.071428571\n13.511857892\n18.285714286\n18.511857892\n21.761904762\n",
"3.414213562\n15.414213562\n19.414213562\n",
"557498.995840259\n",
"4.694805195\n8.535714286\n11.214285714\n11.449489743\n17.976190476\n20.557142857\n24.449579832\n26.814285714\n",
"1.500000000\n",
"2.187500000\n5.866025404\n8.187500000\n10.866025404\n18.866025404\n21.866025404\n23.866025404\n",
"899119.772115135\n",
"27.64575131106459\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"16.166666666666668\n19.414213562373096\n22.833333333333336\n",
"1.4142135623730951\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"1.8541666666666667\n5.707106781186548\n7.854166666666667\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"899118.9697696209\n",
"667.4166666666666\n914.6409090909092\n11000.050000000001\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n34.083333333333336\n34.083333333333336\n",
"33.083333333333336\n33.083333333333336\n33.083333333333336\n33.083333333333336\n",
"13.0\n18.0\n21.0\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.9697696209\n",
"18.583333333333332\n31.516611478423584\n36.583333333333336\n",
"50.08333333333333\n50.08333333333333\n50.08333333333333\n50.08333333333333\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"18.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.0\n",
"1.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728053.0429416959\n",
"11.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.449489742783178\n",
"412131.04294169584\n",
"3.8284271247461903\n",
"4.82842712474619\n",
"5.464101615137754\n",
"18.583333333333332\n22.516611478423584\n35.083333333333336\n",
"25.1\n25.1\n25.1\n25.1\n",
"9.166666666666666\n19.414213562373096\n20.833333333333336\n",
"92271.69505473043\n",
"4.285714285714286\n4.511857892036909\n5.642857142857143\n13.071428571428573\n13.071428571428573\n13.071428571428573\n13.51185789203691\n18.28571428571429\n18.511857892036907\n21.514285714285712\n",
"3.414213562373095\n15.414213562373096\n19.414213562373096\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n12.449489742783179\n17.976190476190474\n20.557142857142857\n24.449579831932773\n26.814285714285713\n",
"1.5001\n",
"899120.9159047487\n",
"1001.5\n1001.5\n11010.050000000001\n",
"30.23606797749979\n",
"26.0\n",
"16.166666666666668\n19.414213562373096\n24.166666666666664\n",
"4.471428571428571\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"899118.0941212976\n",
"2.0\n8.0\n12.0\n13.816666666666666\n14.0\n22.0\n33.083333333333336\n33.083333333333336\n",
"23.916666666666664\n32.41565025531987\n47.666666666666664\n",
"141436.96976962086\n",
"2.0\n",
"10.520833333333332\n31.179449471770337\n36.520833333333336\n",
"0.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"94011.04294169587\n",
"2.8284271247461903\n",
"5.741657386773941\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"2.414213562373095\n",
"5.464101615137754\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"4.82842712474619\n",
"2.0\n"
]
} | 2CODEFORCES
|
168_C. Wizards and Trolleybuses_37919 | In some country live wizards. They love to ride trolleybuses.
A city in this country has a trolleybus depot with n trolleybuses. Every day the trolleybuses leave the depot, one by one and go to the final station. The final station is at a distance of d meters from the depot. We know for the i-th trolleybus that it leaves at the moment of time ti seconds, can go at a speed of no greater than vi meters per second, and accelerate with an acceleration no greater than a meters per second squared. A trolleybus can decelerate as quickly as you want (magic!). It can change its acceleration as fast as you want, as well. Note that the maximum acceleration is the same for all trolleys.
Despite the magic the trolleys are still powered by an electric circuit and cannot overtake each other (the wires are to blame, of course). If a trolleybus catches up with another one, they go together one right after the other until they arrive at the final station. Also, the drivers are driving so as to arrive at the final station as quickly as possible.
You, as head of the trolleybuses' fans' club, are to determine for each trolley the minimum time by which it can reach the final station. At the time of arrival at the destination station the trolleybus does not necessarily have zero speed. When a trolley is leaving the depot, its speed is considered equal to zero. From the point of view of physics, the trolleybuses can be considered as material points, and also we should ignore the impact on the speed of a trolley bus by everything, except for the acceleration and deceleration provided by the engine.
Input
The first input line contains three space-separated integers n, a, d (1 ≤ n ≤ 105, 1 ≤ a, d ≤ 106) — the number of trolleybuses, their maximum acceleration and the distance from the depot to the final station, correspondingly.
Next n lines contain pairs of integers ti vi (0 ≤ t1 < t2... < tn - 1 < tn ≤ 106, 1 ≤ vi ≤ 106) — the time when the i-th trolleybus leaves the depot and its maximum speed, correspondingly. The numbers in the lines are separated by spaces.
Output
For each trolleybus print a single line the time it arrives to the final station. Print the times for the trolleybuses in the order in which the trolleybuses are given in the input. The answer will be accepted if the absolute or relative error doesn't exceed 10 - 4.
Examples
Input
3 10 10000
0 10
5 11
1000 1
Output
1000.5000000000
1000.5000000000
11000.0500000000
Input
1 2 26
28 29
Output
33.0990195136
Note
In the first sample the second trolleybus will catch up with the first one, that will happen at distance 510.5 meters from the depot. The trolleybuses will go the remaining 9489.5 meters together at speed 10 meters per second. As a result, both trolleybuses will arrive to the final station by the moment of time 1000.5 seconds. The third trolleybus will not catch up with them. It will arrive to the final station by the moment of time 11000.05 seconds. | import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.TreeSet;
public final class CF_114_C{
static boolean verb=true;
static void log(Object X){if (verb) System.err.println(X);}
static void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+" ");System.err.println("");}}
static void log(int[] X){if (verb) {for (int U:X) System.err.print(U+" ");System.err.println("");}}
static void logWln(Object X){if (verb) System.err.print(X);}
static void info(Object o){ System.out.println(o);}
static void output(Object o){outputWln(""+o+"\n"); }
static void outputWln(Object o){try {out.write(""+ o);} catch (Exception e) {}}
static int MX=Integer.MAX_VALUE;
// Global vars
static BufferedWriter out;
static InputReader reader;
static void process() throws Exception {
out = new BufferedWriter(new OutputStreamWriter(System.out));
reader=new InputReader(System.in);
int n=reader.readInt();
double a=reader.readInt();
double d=reader.readInt();
double lastEndTime=0;
for (int i=0;i<n;i++){
double t=reader.readInt();
double v=reader.readInt();
double accelTime=v/a;
double accelDist=a*(accelTime*accelTime)*0.5;
double time=0;
if (accelDist>d){
time=Math.sqrt(2*d/a);
} else {
time=accelTime+(d-accelDist)/v;
}
double endTime=t+time;
endTime=Math.max(endTime,lastEndTime);
output(endTime);
lastEndTime=endTime;
}
try {
out.close();
}
catch (Exception e){}
}
public static void main(String[] args) throws Exception {
process();
}
static final class InputReader {
private final InputStream stream;
private final byte[] buf = new byte[1024];
private int curChar;
private int numChars;
public InputReader(InputStream stream) {
this.stream = stream;
}
private int read() throws IOException {
if (curChar >= numChars) {
curChar = 0;
numChars = stream.read(buf);
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public final String readString() throws IOException {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res=new StringBuilder();
do {
res.append((char)c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public final int readInt() throws IOException {
int c = read();
boolean neg=false;
while (isSpaceChar(c)) {
c = read();
}
char d=(char)c;
//log("d:"+d);
if (d=='-') {
neg=true;
c = read();
}
int res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
//log("res:"+res);
if (neg)
return -res;
return res;
}
public final long readLong() throws IOException {
int c = read();
boolean neg=false;
while (isSpaceChar(c)) {
c = read();
}
char d=(char)c;
//log("d:"+d);
if (d=='-') {
neg=true;
c = read();
}
long res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
//log("res:"+res);
if (neg)
return -res;
return res;
}
private boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
}
} | 4JAVA
| {
"input": [
"3 10 10000\n0 10\n5 11\n1000 1\n",
"1 2 26\n28 29\n",
"1 2 7\n20 13\n",
"8 4 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n20 24\n30 2\n",
"4 5 14\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n19 2\n",
"1 1 1\n0 1000000\n",
"1 100000 363166\n560443 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 6\n",
"3 6 6\n2 10\n14 19\n18 14\n",
"1 1 722397\n556297 454495\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000000\n0 1000000\n",
"7 8 3\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 124232 477338\n899117 898233\n",
"1 2 7\n25 13\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"3 6 19\n12 3\n29 24\n30 2\n",
"4 5 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 3\n13 1\n18 12\n21 2\n",
"1 1 1\n0 1000100\n",
"8 7 21\n2 11\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"7 8 2\n1 3\n5 26\n7 3\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n899117 898233\n",
"3 10 10000\n0 15\n5 11\n1000 1\n",
"8 6 13\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"4 6 22\n11 1\n16 20\n17 15\n21 7\n",
"3 3 0\n13 1\n18 12\n21 2\n",
"1 1 1\n1 1000100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 477338\n728048 898233\n",
"3 6 19\n12 3\n29 22\n30 3\n",
"4 6 39\n11 1\n16 20\n17 15\n21 7\n",
"7 8 2\n1 2\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 898233\n",
"3 8 19\n12 3\n29 22\n30 3\n",
"1 1 2\n1 1000101\n",
"7 8 2\n1 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 81784\n",
"3 8 19\n5 3\n29 22\n30 3\n",
"1 1 3\n1 1000101\n",
"1 246051 398840\n412126 81784\n",
"1 1 4\n1 1000101\n",
"1 1 4\n2 1000101\n",
"1 1 6\n2 1000101\n",
"3 6 19\n12 3\n20 24\n30 4\n",
"4 5 14\n11 1\n16 20\n17 20\n21 7\n",
"3 3 3\n6 1\n18 12\n19 2\n",
"1 100000 363166\n92269 753304\n",
"10 7 8\n2 4\n3 13\n4 7\n5 1\n9 16\n10 9\n12 18\n16 4\n17 16\n20 10\n",
"3 6 6\n2 10\n14 12\n18 14\n",
"8 7 21\n2 11\n3 4\n4 3\n10 23\n15 9\n16 5\n22 17\n24 10\n",
"1 1000000 1000100\n0 1000000\n",
"1 124232 952506\n899117 898233\n",
"3 10 10010\n0 10\n5 11\n1000 1\n",
"1 2 5\n28 29\n",
"1 2 1\n25 13\n",
"3 3 3\n13 1\n18 12\n21 1\n",
"8 7 21\n2 15\n3 4\n4 3\n9 23\n15 9\n16 3\n22 17\n24 10\n",
"1 246051 147274\n899117 898233\n",
"8 6 12\n0 18\n6 24\n10 25\n11 5\n12 18\n20 22\n21 1\n22 12\n",
"3 6 35\n12 3\n29 22\n30 2\n",
"1 246051 477338\n141435 898233\n",
"1 2 1\n1 1000101\n",
"3 8 19\n4 3\n29 22\n30 3\n",
"7 8 2\n0 4\n5 26\n7 6\n10 15\n18 7\n21 17\n23 21\n",
"1 246051 398840\n94006 81784\n",
"1 1 4\n0 1000101\n",
"1 1 7\n2 1010101\n",
"3 6 19\n12 3\n29 22\n30 2\n",
"1 1 1\n1 1000101\n",
"1 1 6\n2 1010101\n",
"8 6 13\n0 13\n6 24\n10 25\n11 5\n12 18\n20 22\n21 8\n22 12\n",
"4 5 22\n11 1\n16 20\n17 15\n21 11\n",
"1 1 1\n1 1010100\n",
"7 8 2\n1 3\n5 26\n7 6\n10 23\n18 7\n21 17\n23 21\n",
"7 8 2\n1 2\n5 26\n7 6\n10 7\n18 7\n21 17\n23 21\n",
"1 246051 398840\n728048 797295\n",
"1 1 4\n2 1000111\n",
"1 1 0\n2 1000101\n"
],
"output": [
"1000.500000000\n1000.500000000\n11000.050000000\n",
"33.099019514\n",
"22.645751311\n",
"2.549509757\n8.549509757\n12.549509757\n14.225000000\n14.549509757\n22.549509757\n23.625000000\n24.549509757\n",
"18.583333333\n22.516611478\n39.666666667\n",
"25.100000000\n25.100000000\n25.100000000\n25.100000000\n",
"16.166666667\n19.414213562\n20.833333333\n",
"1.414213562\n",
"560445.695054730\n",
"4.285714286\n4.511857892\n5.642857143\n13.071428571\n13.071428571\n13.071428571\n13.511857892\n18.285714286\n18.511857892\n21.761904762\n",
"3.414213562\n15.414213562\n19.414213562\n",
"557498.995840259\n",
"4.694805195\n8.535714286\n11.214285714\n11.449489743\n17.976190476\n20.557142857\n24.449579832\n26.814285714\n",
"1.500000000\n",
"2.187500000\n5.866025404\n8.187500000\n10.866025404\n18.866025404\n21.866025404\n23.866025404\n",
"899119.772115135\n",
"27.64575131106459\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"16.166666666666668\n19.414213562373096\n22.833333333333336\n",
"1.4142135623730951\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"1.8541666666666667\n5.707106781186548\n7.854166666666667\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"899118.9697696209\n",
"667.4166666666666\n914.6409090909092\n11000.050000000001\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n34.083333333333336\n34.083333333333336\n",
"33.083333333333336\n33.083333333333336\n33.083333333333336\n33.083333333333336\n",
"13.0\n18.0\n21.0\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.9697696209\n",
"18.583333333333332\n31.516611478423584\n36.583333333333336\n",
"50.08333333333333\n50.08333333333333\n50.08333333333333\n50.08333333333333\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"18.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.0\n",
"1.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728053.0429416959\n",
"11.520833333333332\n31.179449471770337\n36.520833333333336\n",
"3.449489742783178\n",
"412131.04294169584\n",
"3.8284271247461903\n",
"4.82842712474619\n",
"5.464101615137754\n",
"18.583333333333332\n22.516611478423584\n35.083333333333336\n",
"25.1\n25.1\n25.1\n25.1\n",
"9.166666666666666\n19.414213562373096\n20.833333333333336\n",
"92271.69505473043\n",
"4.285714285714286\n4.511857892036909\n5.642857142857143\n13.071428571428573\n13.071428571428573\n13.071428571428573\n13.51185789203691\n18.28571428571429\n18.511857892036907\n21.514285714285712\n",
"3.414213562373095\n15.414213562373096\n19.414213562373096\n",
"4.694805194805195\n8.535714285714285\n11.214285714285715\n12.449489742783179\n17.976190476190474\n20.557142857142857\n24.449579831932773\n26.814285714285713\n",
"1.5001\n",
"899120.9159047487\n",
"1001.5\n1001.5\n11010.050000000001\n",
"30.23606797749979\n",
"26.0\n",
"16.166666666666668\n19.414213562373096\n24.166666666666664\n",
"4.471428571428571\n8.535714285714285\n11.214285714285715\n11.449489742783179\n17.976190476190474\n23.21428571428571\n24.449579831932773\n26.814285714285713\n",
"899118.0941212976\n",
"2.0\n8.0\n12.0\n13.816666666666666\n14.0\n22.0\n33.083333333333336\n33.083333333333336\n",
"23.916666666666664\n32.41565025531987\n47.666666666666664\n",
"141436.96976962086\n",
"2.0\n",
"10.520833333333332\n31.179449471770337\n36.520833333333336\n",
"0.75\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"94011.04294169587\n",
"2.8284271247461903\n",
"5.741657386773941\n",
"18.583333333333332\n31.516611478423584\n39.666666666666664\n",
"2.414213562373095\n",
"5.464101615137754\n",
"2.0816659994661326\n8.081665999466132\n12.081665999466132\n14.016666666666667\n14.081665999466132\n22.081665999466132\n23.291666666666664\n24.083333333333332\n",
"33.099999999999994\n33.099999999999994\n33.099999999999994\n33.099999999999994\n",
"2.414213562373095\n",
"1.8541666666666667\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"2.125\n5.707106781186548\n7.707106781186548\n10.707106781186548\n18.707106781186546\n21.707106781186546\n23.707106781186546\n",
"728049.8005358976\n",
"4.82842712474619\n",
"2.0\n"
]
} | 2CODEFORCES
|
189_A. Cut Ribbon_37920 | Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:
* After the cutting each ribbon piece should have length a, b or c.
* After the cutting the number of ribbon pieces should be maximum.
Help Polycarpus and find the number of ribbon pieces after the required cutting.
Input
The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.
Output
Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.
Examples
Input
5 5 3 2
Output
2
Input
7 5 5 2
Output
2
Note
In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.
In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2. | [n, a, b, c] = map(int, raw_input().split())
z = sorted(list(set([a, b, c])))
maxs = {}
def stuff(x):
if x == 0: return 0
if x < z[0]: return -1
if x in maxs: return maxs[x]
if x % z[0] == 0:
y = x/z[0]
maxs[x] = y
return y
qq = max([stuff(x - z[i]) for i in xrange(1, len(z))])
if qq == -1:
maxs[x] = -1
return -1
else:
maxs[x] = 1 + qq
return 1 + qq
print stuff(n)
| 1Python2
| {
"input": [
"5 5 3 2\n",
"7 5 5 2\n",
"2 19 15 1\n",
"918 102 1327 1733\n",
"27 23 4 3\n",
"29 27 18 2\n",
"370 2 1 15\n",
"5 17 26 5\n",
"9 1 10 3\n",
"490 4 49 50\n",
"14 6 2 17\n",
"728 412 789 158\n",
"10 6 2 9\n",
"100 9 11 99\n",
"4 4 4 4\n",
"100 100 1 1\n",
"13 4 6 7\n",
"27 24 5 27\n",
"418 18 14 17\n",
"4 6 4 9\n",
"5 14 5 2\n",
"413 101 102 105\n",
"18 16 28 9\n",
"10 3 4 5\n",
"8 3 8 4\n",
"25 6 8 11\n",
"100 3 17 22\n",
"1 1 1 1\n",
"26 1 772 2683\n",
"17 3 4 10\n",
"2 2 9 6\n",
"734 12 6 2\n",
"29 12 7 10\n",
"60 33 20 9\n",
"595 2263 3625 1\n",
"53 10 11 23\n",
"5 1 3 3\n",
"6 2 4 1\n",
"100 23 15 50\n",
"3164 42 430 1309\n",
"3964 4 2916 176\n",
"3043 317 1141 2438\n",
"4000 33 7 3333\n",
"4000 5 2 2\n",
"3399 2035 2 3334\n",
"4000 2 3 4\n",
"4000 1 1 1\n",
"3455 244 3301 3\n",
"3999 2 2 3999\n",
"4000 500 1000 2000\n",
"2009 6 8 9\n",
"4000 1 2 3\n",
"2683 83 26 2709\n",
"3119 3515 1021 7\n",
"3999 2 2 3\n",
"4000 3 4 5\n",
"4000 3 3 5\n",
"3999 2 3 3\n",
"27 23 4 4\n",
"325 2 1 15\n",
"5 17 46 5\n",
"9 2 10 3\n",
"490 4 94 50\n",
"14 9 2 17\n",
"10 1 2 9\n",
"101 9 11 99\n",
"100 100 2 1\n",
"13 3 6 7\n",
"27 4 5 27\n",
"413 001 102 105\n",
"50 6 8 11\n",
"100 5 17 22\n",
"49 1 772 2683\n",
"17 3 4 16\n",
"734 9 6 2\n",
"29 12 7 2\n",
"3164 39 430 1309\n",
"4000 5 3 2\n",
"4000 1 1 2\n",
"3455 244 1248 3\n",
"2009 6 1 9\n",
"3610 1 2 3\n",
"2683 75 26 2709\n",
"3119 3515 261 7\n",
"3999 4 2 3\n",
"4000 3 4 9\n",
"4000 3 6 5\n",
"3999 2 1 3\n",
"490 5 94 50\n",
"17 3 1 10\n",
"29 12 1 2\n",
"1326 39 430 1309\n",
"586 244 1248 3\n",
"4000 3 8 9\n",
"490 9 94 50\n",
"29 27 26 2\n",
"4 3 4 4\n",
"4 10 4 9\n",
"18 6 28 9\n",
"10 3 7 5\n",
"13 3 8 4\n",
"4 2 9 6\n",
"60 33 20 11\n",
"4 1 3 3\n",
"1 2 4 1\n",
"4000 500 1000 1671\n",
"3 5 3 2\n",
"7 5 4 2\n",
"46 23 4 4\n",
"41 27 26 2\n",
"325 2 1 29\n",
"5 17 8 5\n",
"9 2 17 3\n",
"14 5 2 17\n",
"10 1 2 1\n",
"111 9 11 99\n",
"3 3 4 4\n",
"100 100 4 1\n",
"27 4 5 39\n",
"4 10 4 18\n",
"36 6 28 9\n",
"10 3 1 5\n",
"13 3 10 4\n",
"50 12 8 11\n",
"100 5 17 13\n",
"49 1 870 2683\n",
"734 9 8 2\n",
"60 33 8 11\n",
"4 1 1 3\n",
"1 2 5 1\n",
"4000 5 3 3\n",
"4000 1 1 3\n",
"2009 6 1 3\n",
"3610 1 2 1\n",
"2683 75 26 646\n",
"3119 2640 261 7\n",
"3999 3 1 3\n",
"6 5 3 2\n",
"7 5 4 3\n",
"41 27 31 2\n",
"325 3 1 29\n",
"5 17 8 1\n",
"9 2 20 3\n",
"14 3 2 17\n",
"101 9 11 149\n",
"27 4 5 68\n",
"36 6 52 9\n",
"10 3 1 6\n",
"50 12 14 11\n",
"100 5 16 13\n",
"49 1 1419 2683\n",
"7 3 1 10\n",
"734 9 11 2\n",
"3 12 1 2\n",
"60 33 8 20\n",
"4 1 1 5\n"
],
"output": [
"2\n",
"2\n",
"2\n",
"9\n",
"9\n",
"2\n",
"370\n",
"1\n",
"9\n",
"111\n",
"7\n",
"3\n",
"5\n",
"10\n",
"1\n",
"100\n",
"2\n",
"1\n",
"29\n",
"1\n",
"1\n",
"4\n",
"2\n",
"3\n",
"2\n",
"3\n",
"27\n",
"1\n",
"26\n",
"5\n",
"1\n",
"367\n",
"3\n",
"4\n",
"595\n",
"5\n",
"5\n",
"6\n",
"2\n",
"15\n",
"991\n",
"7\n",
"564\n",
"2000\n",
"683\n",
"2000\n",
"4000\n",
"991\n",
"1\n",
"8\n",
"334\n",
"4000\n",
"101\n",
"11\n",
"1999\n",
"1333\n",
"1332\n",
"1999\n",
"2\n",
"325\n",
"1\n",
"4\n",
"111\n",
"7\n",
"10\n",
"11\n",
"100\n",
"3\n",
"6\n",
"413\n",
"8\n",
"20\n",
"49\n",
"5\n",
"367\n",
"12\n",
"31\n",
"2000\n",
"4000\n",
"991\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"1999\n",
"1333\n",
"1332\n",
"3999\n",
"98\n",
"17\n",
"29\n",
"34\n",
"115\n",
"1330\n",
"45\n",
"2\n",
"1\n",
"1\n",
"3\n",
"2\n",
"4\n",
"2\n",
"3\n",
"4\n",
"1\n",
"8\n",
"1\n",
"2\n",
"2\n",
"8\n",
"325\n",
"1\n",
"4\n",
"7\n",
"10\n",
"11\n",
"1\n",
"100\n",
"6\n",
"1\n",
"6\n",
"10\n",
"4\n",
"5\n",
"20\n",
"49\n",
"367\n",
"6\n",
"4\n",
"1\n",
"1332\n",
"4000\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"3999\n",
"3\n",
"2\n",
"8\n",
"325\n",
"5\n",
"4\n",
"7\n",
"11\n",
"6\n",
"6\n",
"10\n",
"4\n",
"20\n",
"49\n",
"7\n",
"367\n",
"3\n",
"6\n",
"4\n"
]
} | 2CODEFORCES
|
189_A. Cut Ribbon_37921 | Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:
* After the cutting each ribbon piece should have length a, b or c.
* After the cutting the number of ribbon pieces should be maximum.
Help Polycarpus and find the number of ribbon pieces after the required cutting.
Input
The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.
Output
Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.
Examples
Input
5 5 3 2
Output
2
Input
7 5 5 2
Output
2
Note
In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.
In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2. | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, i;
cin >> n >> a >> b >> c;
int ans[n + 1];
for (i = 0; i <= n; i++) ans[i] = -52464164;
ans[0] = 0;
for (i = 1; i <= n; i++) {
if (i >= a) ans[i] = ans[i - a] + 1;
if (i >= b) {
ans[i] = max(ans[i], ans[i - b] + 1);
}
if (i >= c) {
ans[i] = max(ans[i], ans[i - c] + 1);
}
}
cout << max(0, ans[n]);
}
| 2C++
| {
"input": [
"5 5 3 2\n",
"7 5 5 2\n",
"2 19 15 1\n",
"918 102 1327 1733\n",
"27 23 4 3\n",
"29 27 18 2\n",
"370 2 1 15\n",
"5 17 26 5\n",
"9 1 10 3\n",
"490 4 49 50\n",
"14 6 2 17\n",
"728 412 789 158\n",
"10 6 2 9\n",
"100 9 11 99\n",
"4 4 4 4\n",
"100 100 1 1\n",
"13 4 6 7\n",
"27 24 5 27\n",
"418 18 14 17\n",
"4 6 4 9\n",
"5 14 5 2\n",
"413 101 102 105\n",
"18 16 28 9\n",
"10 3 4 5\n",
"8 3 8 4\n",
"25 6 8 11\n",
"100 3 17 22\n",
"1 1 1 1\n",
"26 1 772 2683\n",
"17 3 4 10\n",
"2 2 9 6\n",
"734 12 6 2\n",
"29 12 7 10\n",
"60 33 20 9\n",
"595 2263 3625 1\n",
"53 10 11 23\n",
"5 1 3 3\n",
"6 2 4 1\n",
"100 23 15 50\n",
"3164 42 430 1309\n",
"3964 4 2916 176\n",
"3043 317 1141 2438\n",
"4000 33 7 3333\n",
"4000 5 2 2\n",
"3399 2035 2 3334\n",
"4000 2 3 4\n",
"4000 1 1 1\n",
"3455 244 3301 3\n",
"3999 2 2 3999\n",
"4000 500 1000 2000\n",
"2009 6 8 9\n",
"4000 1 2 3\n",
"2683 83 26 2709\n",
"3119 3515 1021 7\n",
"3999 2 2 3\n",
"4000 3 4 5\n",
"4000 3 3 5\n",
"3999 2 3 3\n",
"27 23 4 4\n",
"325 2 1 15\n",
"5 17 46 5\n",
"9 2 10 3\n",
"490 4 94 50\n",
"14 9 2 17\n",
"10 1 2 9\n",
"101 9 11 99\n",
"100 100 2 1\n",
"13 3 6 7\n",
"27 4 5 27\n",
"413 001 102 105\n",
"50 6 8 11\n",
"100 5 17 22\n",
"49 1 772 2683\n",
"17 3 4 16\n",
"734 9 6 2\n",
"29 12 7 2\n",
"3164 39 430 1309\n",
"4000 5 3 2\n",
"4000 1 1 2\n",
"3455 244 1248 3\n",
"2009 6 1 9\n",
"3610 1 2 3\n",
"2683 75 26 2709\n",
"3119 3515 261 7\n",
"3999 4 2 3\n",
"4000 3 4 9\n",
"4000 3 6 5\n",
"3999 2 1 3\n",
"490 5 94 50\n",
"17 3 1 10\n",
"29 12 1 2\n",
"1326 39 430 1309\n",
"586 244 1248 3\n",
"4000 3 8 9\n",
"490 9 94 50\n",
"29 27 26 2\n",
"4 3 4 4\n",
"4 10 4 9\n",
"18 6 28 9\n",
"10 3 7 5\n",
"13 3 8 4\n",
"4 2 9 6\n",
"60 33 20 11\n",
"4 1 3 3\n",
"1 2 4 1\n",
"4000 500 1000 1671\n",
"3 5 3 2\n",
"7 5 4 2\n",
"46 23 4 4\n",
"41 27 26 2\n",
"325 2 1 29\n",
"5 17 8 5\n",
"9 2 17 3\n",
"14 5 2 17\n",
"10 1 2 1\n",
"111 9 11 99\n",
"3 3 4 4\n",
"100 100 4 1\n",
"27 4 5 39\n",
"4 10 4 18\n",
"36 6 28 9\n",
"10 3 1 5\n",
"13 3 10 4\n",
"50 12 8 11\n",
"100 5 17 13\n",
"49 1 870 2683\n",
"734 9 8 2\n",
"60 33 8 11\n",
"4 1 1 3\n",
"1 2 5 1\n",
"4000 5 3 3\n",
"4000 1 1 3\n",
"2009 6 1 3\n",
"3610 1 2 1\n",
"2683 75 26 646\n",
"3119 2640 261 7\n",
"3999 3 1 3\n",
"6 5 3 2\n",
"7 5 4 3\n",
"41 27 31 2\n",
"325 3 1 29\n",
"5 17 8 1\n",
"9 2 20 3\n",
"14 3 2 17\n",
"101 9 11 149\n",
"27 4 5 68\n",
"36 6 52 9\n",
"10 3 1 6\n",
"50 12 14 11\n",
"100 5 16 13\n",
"49 1 1419 2683\n",
"7 3 1 10\n",
"734 9 11 2\n",
"3 12 1 2\n",
"60 33 8 20\n",
"4 1 1 5\n"
],
"output": [
"2\n",
"2\n",
"2\n",
"9\n",
"9\n",
"2\n",
"370\n",
"1\n",
"9\n",
"111\n",
"7\n",
"3\n",
"5\n",
"10\n",
"1\n",
"100\n",
"2\n",
"1\n",
"29\n",
"1\n",
"1\n",
"4\n",
"2\n",
"3\n",
"2\n",
"3\n",
"27\n",
"1\n",
"26\n",
"5\n",
"1\n",
"367\n",
"3\n",
"4\n",
"595\n",
"5\n",
"5\n",
"6\n",
"2\n",
"15\n",
"991\n",
"7\n",
"564\n",
"2000\n",
"683\n",
"2000\n",
"4000\n",
"991\n",
"1\n",
"8\n",
"334\n",
"4000\n",
"101\n",
"11\n",
"1999\n",
"1333\n",
"1332\n",
"1999\n",
"2\n",
"325\n",
"1\n",
"4\n",
"111\n",
"7\n",
"10\n",
"11\n",
"100\n",
"3\n",
"6\n",
"413\n",
"8\n",
"20\n",
"49\n",
"5\n",
"367\n",
"12\n",
"31\n",
"2000\n",
"4000\n",
"991\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"1999\n",
"1333\n",
"1332\n",
"3999\n",
"98\n",
"17\n",
"29\n",
"34\n",
"115\n",
"1330\n",
"45\n",
"2\n",
"1\n",
"1\n",
"3\n",
"2\n",
"4\n",
"2\n",
"3\n",
"4\n",
"1\n",
"8\n",
"1\n",
"2\n",
"2\n",
"8\n",
"325\n",
"1\n",
"4\n",
"7\n",
"10\n",
"11\n",
"1\n",
"100\n",
"6\n",
"1\n",
"6\n",
"10\n",
"4\n",
"5\n",
"20\n",
"49\n",
"367\n",
"6\n",
"4\n",
"1\n",
"1332\n",
"4000\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"3999\n",
"3\n",
"2\n",
"8\n",
"325\n",
"5\n",
"4\n",
"7\n",
"11\n",
"6\n",
"6\n",
"10\n",
"4\n",
"20\n",
"49\n",
"7\n",
"367\n",
"3\n",
"6\n",
"4\n"
]
} | 2CODEFORCES
|
189_A. Cut Ribbon_37922 | Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:
* After the cutting each ribbon piece should have length a, b or c.
* After the cutting the number of ribbon pieces should be maximum.
Help Polycarpus and find the number of ribbon pieces after the required cutting.
Input
The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.
Output
Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.
Examples
Input
5 5 3 2
Output
2
Input
7 5 5 2
Output
2
Note
In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.
In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2. | from math import *;
lineup=[int(x) for x in input().split()]
a,b,c=sorted(lineup[1:4])
n=lineup[0]
value=0
if a==1:
print(n)
exit()
for i in range(0,n+1,a):
for j in range(0,n+1,b):
z=(n-i-j)/c
if ceil(z)==floor(z) and int(z)>=0:
x=i//a
y=j//b
z=int(z)
value=max(value,x+y+z)
print(int(value)) | 3Python3
| {
"input": [
"5 5 3 2\n",
"7 5 5 2\n",
"2 19 15 1\n",
"918 102 1327 1733\n",
"27 23 4 3\n",
"29 27 18 2\n",
"370 2 1 15\n",
"5 17 26 5\n",
"9 1 10 3\n",
"490 4 49 50\n",
"14 6 2 17\n",
"728 412 789 158\n",
"10 6 2 9\n",
"100 9 11 99\n",
"4 4 4 4\n",
"100 100 1 1\n",
"13 4 6 7\n",
"27 24 5 27\n",
"418 18 14 17\n",
"4 6 4 9\n",
"5 14 5 2\n",
"413 101 102 105\n",
"18 16 28 9\n",
"10 3 4 5\n",
"8 3 8 4\n",
"25 6 8 11\n",
"100 3 17 22\n",
"1 1 1 1\n",
"26 1 772 2683\n",
"17 3 4 10\n",
"2 2 9 6\n",
"734 12 6 2\n",
"29 12 7 10\n",
"60 33 20 9\n",
"595 2263 3625 1\n",
"53 10 11 23\n",
"5 1 3 3\n",
"6 2 4 1\n",
"100 23 15 50\n",
"3164 42 430 1309\n",
"3964 4 2916 176\n",
"3043 317 1141 2438\n",
"4000 33 7 3333\n",
"4000 5 2 2\n",
"3399 2035 2 3334\n",
"4000 2 3 4\n",
"4000 1 1 1\n",
"3455 244 3301 3\n",
"3999 2 2 3999\n",
"4000 500 1000 2000\n",
"2009 6 8 9\n",
"4000 1 2 3\n",
"2683 83 26 2709\n",
"3119 3515 1021 7\n",
"3999 2 2 3\n",
"4000 3 4 5\n",
"4000 3 3 5\n",
"3999 2 3 3\n",
"27 23 4 4\n",
"325 2 1 15\n",
"5 17 46 5\n",
"9 2 10 3\n",
"490 4 94 50\n",
"14 9 2 17\n",
"10 1 2 9\n",
"101 9 11 99\n",
"100 100 2 1\n",
"13 3 6 7\n",
"27 4 5 27\n",
"413 001 102 105\n",
"50 6 8 11\n",
"100 5 17 22\n",
"49 1 772 2683\n",
"17 3 4 16\n",
"734 9 6 2\n",
"29 12 7 2\n",
"3164 39 430 1309\n",
"4000 5 3 2\n",
"4000 1 1 2\n",
"3455 244 1248 3\n",
"2009 6 1 9\n",
"3610 1 2 3\n",
"2683 75 26 2709\n",
"3119 3515 261 7\n",
"3999 4 2 3\n",
"4000 3 4 9\n",
"4000 3 6 5\n",
"3999 2 1 3\n",
"490 5 94 50\n",
"17 3 1 10\n",
"29 12 1 2\n",
"1326 39 430 1309\n",
"586 244 1248 3\n",
"4000 3 8 9\n",
"490 9 94 50\n",
"29 27 26 2\n",
"4 3 4 4\n",
"4 10 4 9\n",
"18 6 28 9\n",
"10 3 7 5\n",
"13 3 8 4\n",
"4 2 9 6\n",
"60 33 20 11\n",
"4 1 3 3\n",
"1 2 4 1\n",
"4000 500 1000 1671\n",
"3 5 3 2\n",
"7 5 4 2\n",
"46 23 4 4\n",
"41 27 26 2\n",
"325 2 1 29\n",
"5 17 8 5\n",
"9 2 17 3\n",
"14 5 2 17\n",
"10 1 2 1\n",
"111 9 11 99\n",
"3 3 4 4\n",
"100 100 4 1\n",
"27 4 5 39\n",
"4 10 4 18\n",
"36 6 28 9\n",
"10 3 1 5\n",
"13 3 10 4\n",
"50 12 8 11\n",
"100 5 17 13\n",
"49 1 870 2683\n",
"734 9 8 2\n",
"60 33 8 11\n",
"4 1 1 3\n",
"1 2 5 1\n",
"4000 5 3 3\n",
"4000 1 1 3\n",
"2009 6 1 3\n",
"3610 1 2 1\n",
"2683 75 26 646\n",
"3119 2640 261 7\n",
"3999 3 1 3\n",
"6 5 3 2\n",
"7 5 4 3\n",
"41 27 31 2\n",
"325 3 1 29\n",
"5 17 8 1\n",
"9 2 20 3\n",
"14 3 2 17\n",
"101 9 11 149\n",
"27 4 5 68\n",
"36 6 52 9\n",
"10 3 1 6\n",
"50 12 14 11\n",
"100 5 16 13\n",
"49 1 1419 2683\n",
"7 3 1 10\n",
"734 9 11 2\n",
"3 12 1 2\n",
"60 33 8 20\n",
"4 1 1 5\n"
],
"output": [
"2\n",
"2\n",
"2\n",
"9\n",
"9\n",
"2\n",
"370\n",
"1\n",
"9\n",
"111\n",
"7\n",
"3\n",
"5\n",
"10\n",
"1\n",
"100\n",
"2\n",
"1\n",
"29\n",
"1\n",
"1\n",
"4\n",
"2\n",
"3\n",
"2\n",
"3\n",
"27\n",
"1\n",
"26\n",
"5\n",
"1\n",
"367\n",
"3\n",
"4\n",
"595\n",
"5\n",
"5\n",
"6\n",
"2\n",
"15\n",
"991\n",
"7\n",
"564\n",
"2000\n",
"683\n",
"2000\n",
"4000\n",
"991\n",
"1\n",
"8\n",
"334\n",
"4000\n",
"101\n",
"11\n",
"1999\n",
"1333\n",
"1332\n",
"1999\n",
"2\n",
"325\n",
"1\n",
"4\n",
"111\n",
"7\n",
"10\n",
"11\n",
"100\n",
"3\n",
"6\n",
"413\n",
"8\n",
"20\n",
"49\n",
"5\n",
"367\n",
"12\n",
"31\n",
"2000\n",
"4000\n",
"991\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"1999\n",
"1333\n",
"1332\n",
"3999\n",
"98\n",
"17\n",
"29\n",
"34\n",
"115\n",
"1330\n",
"45\n",
"2\n",
"1\n",
"1\n",
"3\n",
"2\n",
"4\n",
"2\n",
"3\n",
"4\n",
"1\n",
"8\n",
"1\n",
"2\n",
"2\n",
"8\n",
"325\n",
"1\n",
"4\n",
"7\n",
"10\n",
"11\n",
"1\n",
"100\n",
"6\n",
"1\n",
"6\n",
"10\n",
"4\n",
"5\n",
"20\n",
"49\n",
"367\n",
"6\n",
"4\n",
"1\n",
"1332\n",
"4000\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"3999\n",
"3\n",
"2\n",
"8\n",
"325\n",
"5\n",
"4\n",
"7\n",
"11\n",
"6\n",
"6\n",
"10\n",
"4\n",
"20\n",
"49\n",
"7\n",
"367\n",
"3\n",
"6\n",
"4\n"
]
} | 2CODEFORCES
|
189_A. Cut Ribbon_37923 | Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:
* After the cutting each ribbon piece should have length a, b or c.
* After the cutting the number of ribbon pieces should be maximum.
Help Polycarpus and find the number of ribbon pieces after the required cutting.
Input
The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.
Output
Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.
Examples
Input
5 5 3 2
Output
2
Input
7 5 5 2
Output
2
Note
In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.
In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2. | /**
* Created by Akshay on 10/9/17.
*/
import java.util.*;
public class Week_5_Codeforces_A {
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int a = scan.nextInt();
int b = scan.nextInt();
int c = scan.nextInt();
int i = 0;
int j = 0;
int max = 0;
while(i*a + j*b <= n){
while(i*a + j*b <= n){
if(Math.abs((i*a + j*b) - n)%c == 0){
int k = Math.abs((i*a + j*b) - n)/c;
if(i + j + k > max){
max = i + j + k;
}
}
j++;
}
i++;
j = 0;
}
System.out.println(max);
}
}
| 4JAVA
| {
"input": [
"5 5 3 2\n",
"7 5 5 2\n",
"2 19 15 1\n",
"918 102 1327 1733\n",
"27 23 4 3\n",
"29 27 18 2\n",
"370 2 1 15\n",
"5 17 26 5\n",
"9 1 10 3\n",
"490 4 49 50\n",
"14 6 2 17\n",
"728 412 789 158\n",
"10 6 2 9\n",
"100 9 11 99\n",
"4 4 4 4\n",
"100 100 1 1\n",
"13 4 6 7\n",
"27 24 5 27\n",
"418 18 14 17\n",
"4 6 4 9\n",
"5 14 5 2\n",
"413 101 102 105\n",
"18 16 28 9\n",
"10 3 4 5\n",
"8 3 8 4\n",
"25 6 8 11\n",
"100 3 17 22\n",
"1 1 1 1\n",
"26 1 772 2683\n",
"17 3 4 10\n",
"2 2 9 6\n",
"734 12 6 2\n",
"29 12 7 10\n",
"60 33 20 9\n",
"595 2263 3625 1\n",
"53 10 11 23\n",
"5 1 3 3\n",
"6 2 4 1\n",
"100 23 15 50\n",
"3164 42 430 1309\n",
"3964 4 2916 176\n",
"3043 317 1141 2438\n",
"4000 33 7 3333\n",
"4000 5 2 2\n",
"3399 2035 2 3334\n",
"4000 2 3 4\n",
"4000 1 1 1\n",
"3455 244 3301 3\n",
"3999 2 2 3999\n",
"4000 500 1000 2000\n",
"2009 6 8 9\n",
"4000 1 2 3\n",
"2683 83 26 2709\n",
"3119 3515 1021 7\n",
"3999 2 2 3\n",
"4000 3 4 5\n",
"4000 3 3 5\n",
"3999 2 3 3\n",
"27 23 4 4\n",
"325 2 1 15\n",
"5 17 46 5\n",
"9 2 10 3\n",
"490 4 94 50\n",
"14 9 2 17\n",
"10 1 2 9\n",
"101 9 11 99\n",
"100 100 2 1\n",
"13 3 6 7\n",
"27 4 5 27\n",
"413 001 102 105\n",
"50 6 8 11\n",
"100 5 17 22\n",
"49 1 772 2683\n",
"17 3 4 16\n",
"734 9 6 2\n",
"29 12 7 2\n",
"3164 39 430 1309\n",
"4000 5 3 2\n",
"4000 1 1 2\n",
"3455 244 1248 3\n",
"2009 6 1 9\n",
"3610 1 2 3\n",
"2683 75 26 2709\n",
"3119 3515 261 7\n",
"3999 4 2 3\n",
"4000 3 4 9\n",
"4000 3 6 5\n",
"3999 2 1 3\n",
"490 5 94 50\n",
"17 3 1 10\n",
"29 12 1 2\n",
"1326 39 430 1309\n",
"586 244 1248 3\n",
"4000 3 8 9\n",
"490 9 94 50\n",
"29 27 26 2\n",
"4 3 4 4\n",
"4 10 4 9\n",
"18 6 28 9\n",
"10 3 7 5\n",
"13 3 8 4\n",
"4 2 9 6\n",
"60 33 20 11\n",
"4 1 3 3\n",
"1 2 4 1\n",
"4000 500 1000 1671\n",
"3 5 3 2\n",
"7 5 4 2\n",
"46 23 4 4\n",
"41 27 26 2\n",
"325 2 1 29\n",
"5 17 8 5\n",
"9 2 17 3\n",
"14 5 2 17\n",
"10 1 2 1\n",
"111 9 11 99\n",
"3 3 4 4\n",
"100 100 4 1\n",
"27 4 5 39\n",
"4 10 4 18\n",
"36 6 28 9\n",
"10 3 1 5\n",
"13 3 10 4\n",
"50 12 8 11\n",
"100 5 17 13\n",
"49 1 870 2683\n",
"734 9 8 2\n",
"60 33 8 11\n",
"4 1 1 3\n",
"1 2 5 1\n",
"4000 5 3 3\n",
"4000 1 1 3\n",
"2009 6 1 3\n",
"3610 1 2 1\n",
"2683 75 26 646\n",
"3119 2640 261 7\n",
"3999 3 1 3\n",
"6 5 3 2\n",
"7 5 4 3\n",
"41 27 31 2\n",
"325 3 1 29\n",
"5 17 8 1\n",
"9 2 20 3\n",
"14 3 2 17\n",
"101 9 11 149\n",
"27 4 5 68\n",
"36 6 52 9\n",
"10 3 1 6\n",
"50 12 14 11\n",
"100 5 16 13\n",
"49 1 1419 2683\n",
"7 3 1 10\n",
"734 9 11 2\n",
"3 12 1 2\n",
"60 33 8 20\n",
"4 1 1 5\n"
],
"output": [
"2\n",
"2\n",
"2\n",
"9\n",
"9\n",
"2\n",
"370\n",
"1\n",
"9\n",
"111\n",
"7\n",
"3\n",
"5\n",
"10\n",
"1\n",
"100\n",
"2\n",
"1\n",
"29\n",
"1\n",
"1\n",
"4\n",
"2\n",
"3\n",
"2\n",
"3\n",
"27\n",
"1\n",
"26\n",
"5\n",
"1\n",
"367\n",
"3\n",
"4\n",
"595\n",
"5\n",
"5\n",
"6\n",
"2\n",
"15\n",
"991\n",
"7\n",
"564\n",
"2000\n",
"683\n",
"2000\n",
"4000\n",
"991\n",
"1\n",
"8\n",
"334\n",
"4000\n",
"101\n",
"11\n",
"1999\n",
"1333\n",
"1332\n",
"1999\n",
"2\n",
"325\n",
"1\n",
"4\n",
"111\n",
"7\n",
"10\n",
"11\n",
"100\n",
"3\n",
"6\n",
"413\n",
"8\n",
"20\n",
"49\n",
"5\n",
"367\n",
"12\n",
"31\n",
"2000\n",
"4000\n",
"991\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"1999\n",
"1333\n",
"1332\n",
"3999\n",
"98\n",
"17\n",
"29\n",
"34\n",
"115\n",
"1330\n",
"45\n",
"2\n",
"1\n",
"1\n",
"3\n",
"2\n",
"4\n",
"2\n",
"3\n",
"4\n",
"1\n",
"8\n",
"1\n",
"2\n",
"2\n",
"8\n",
"325\n",
"1\n",
"4\n",
"7\n",
"10\n",
"11\n",
"1\n",
"100\n",
"6\n",
"1\n",
"6\n",
"10\n",
"4\n",
"5\n",
"20\n",
"49\n",
"367\n",
"6\n",
"4\n",
"1\n",
"1332\n",
"4000\n",
"2009\n",
"3610\n",
"90\n",
"373\n",
"3999\n",
"3\n",
"2\n",
"8\n",
"325\n",
"5\n",
"4\n",
"7\n",
"11\n",
"6\n",
"6\n",
"10\n",
"4\n",
"20\n",
"49\n",
"7\n",
"367\n",
"3\n",
"6\n",
"4\n"
]
} | 2CODEFORCES
|
212_A. Privatization_37924 | There is a developed network of flights between Berland and Beerland. All of them belong to the Berland state company BerAvia. Each flight connects some Berland city with some Beerland city. For each flight airplanes fly in both directions.
Changes are coming to Berland — the state decided to privatize BerAvia, namely, to sell out all flights to t private companies. Each of these companies wants to get the maximal number of flights, so if the Berland flights are sold unevenly, Berland can be accused of partiality. Berland Government decided to sell the flights as evenly as possible between the t companies.
The unevenness of the distribution of flights between companies is calculated as follows. For each city i (both Berland and Beerland) we'll calculate the value of
<image> where aij is the number of flights from city i, which belong to company j. The sum of wi for all cities in both countries is called the unevenness of the distribution. The distribution with the minimal unevenness is the most even one.
Help the Berland government come up with the most even distribution plan of selling flights.
Input
The first input line contains four integers n, m, k and t (1 ≤ n, m, t ≤ 200;1 ≤ k ≤ 5000), where n, m are the numbers of cities in Berland and Beerland, correspondingly, k is the number of flights between them, and t is the number of private companies. Next k lines describe the flights, one per line, as pairs of positive integers xi, yi (1 ≤ xi ≤ n;1 ≤ yi ≤ m), where xi and yi are the indexes of cities in Berland and Beerland, correspondingly, connected by the i-th flight. There is at most one flight between any pair of cities, each flight connects cities of different countries. The cities in Berland are indexed from 1 to n, and in Beerland — from 1 to m.
Output
Print the unevenness of the sought plan on the first line. On the second line print a sequence of k integers c1, c2, ..., ck (1 ≤ ci ≤ t), where ci is the index of the company that should buy the i-th flight. Assume that the flights are indexed from 1 to k in the order they appear in the input. If there are multiple solutions, print any of them.
Examples
Input
3 5 8 2
1 4
1 3
3 3
1 2
1 1
2 1
1 5
2 2
Output
4
2 1 2 1 2 1 2 2 | #include <bits/stdc++.h>
using namespace std;
const int N = 605, X = 90005, M = 200005;
int n, m, p, S, T, nA, nB, cnt, du[N], le[X], ri[X], ans[X];
int tot, lnk[N], son[M], w[M], v[M], nxt[M];
int q[N], dst[N], pre[N];
bool bo[N], vis[N];
int read() {
int x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x;
}
void Ifmin(int &x, int y) {
if (y < x) x = y;
}
void add(int x, int y, int z1, int z2) {
tot++;
son[tot] = y;
w[tot] = z1;
v[tot] = z2;
nxt[tot] = lnk[x];
lnk[x] = tot;
tot++;
son[tot] = x;
w[tot] = 0;
v[tot] = -z2;
nxt[tot] = lnk[y];
lnk[y] = tot;
}
bool spfa() {
for (int i = (1); i <= (n); i++) bo[i] = vis[i] = 0, dst[i] = 1e9;
int hed = 0, tal = 1;
dst[q[1] = S] = 0;
bo[S] = vis[S] = 1;
while (hed != tal) {
int x = q[hed = (hed + 1) % N];
vis[x] = 0;
for (int j = lnk[x]; j; j = nxt[j])
if (w[j] > 0 && dst[x] + v[j] < dst[son[j]]) {
dst[son[j]] = dst[x] + v[j];
bo[son[j]] = 1;
pre[son[j]] = j;
if (!vis[son[j]]) vis[q[tal = (tal + 1) % N] = son[j]] = 1;
}
}
return bo[T];
}
void getflow() {
while (spfa()) {
int mn = 1e9;
for (int x = T; x != S; x = son[pre[x] ^ 1]) Ifmin(mn, w[pre[x]]);
for (int x = T; x != S; x = son[pre[x] ^ 1])
w[pre[x]] -= mn, w[pre[x] ^ 1] += mn;
}
}
int main() {
nA = read(), nB = read(), m = read(), p = read();
for (int i = (1); i <= (m); i++) le[i] = read(), ri[i] = read();
for (int i = (1); i <= (m); i++) du[le[i]]++, du[nA + ri[i]]++;
for (int i = (1); i <= (nA + nB); i++)
if (du[i] % p) cnt++;
printf("%d\n", cnt);
for (n = nA + nB, S = ++n, T = ++n; p; p--) {
tot = 1;
memset(lnk, 0, sizeof(lnk));
for (int i = (1); i <= (m); i++)
if (!ans[i]) add(le[i], nA + ri[i], 1, 0);
for (int i = (1); i <= (nA); i++) {
add(S, i, du[i] / p, 0);
if (du[i] % p) add(S, i, 1, 1);
}
for (int i = (nA + 1); i <= (nA + nB); i++) {
add(i, T, du[i] / p, 0);
if (du[i] % p) add(i, T, 1, 1);
}
getflow();
int _ = 0;
for (int i = (1); i <= (m); i++)
if (!ans[i]) {
_ += 2;
if (!w[_]) ans[i] = p, du[le[i]]--, du[nA + ri[i]]--;
}
}
for (int i = (1); i <= (m); i++) printf("%d ", ans[i]);
puts("");
return 0;
}
| 2C++
| {
"input": [
"3 5 8 2\n1 4\n1 3\n3 3\n1 2\n1 1\n2 1\n1 5\n2 2\n",
"1 2 1 1\n1 1\n",
"3 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n2 1\n2 4\n",
"6 5 21 2\n1 4\n5 4\n3 1\n5 3\n5 2\n2 3\n4 4\n6 1\n1 1\n4 5\n6 2\n5 5\n6 4\n2 4\n3 2\n1 5\n6 5\n4 2\n3 5\n2 2\n4 1\n",
"1 2 2 1\n1 1\n1 2\n",
"6 5 10 2\n6 2\n5 4\n3 2\n6 3\n4 5\n6 5\n5 2\n2 2\n6 4\n5 5\n",
"2 1 2 1\n2 1\n1 1\n",
"6 5 14 3\n5 1\n1 3\n4 4\n3 2\n3 1\n1 5\n2 2\n6 2\n2 1\n2 4\n1 1\n4 2\n1 2\n1 4\n",
"6 5 21 4\n4 4\n6 1\n4 2\n1 4\n5 3\n2 3\n5 4\n2 4\n5 1\n4 1\n2 1\n1 5\n3 3\n2 5\n6 4\n3 2\n4 5\n6 3\n3 1\n3 4\n6 2\n",
"6 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 3\n3 2\n4 1\n",
"1 1 1 1\n1 1\n",
"4 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n2 1\n2 4\n",
"2 1 2 2\n2 1\n1 1\n",
"6 5 14 3\n5 1\n1 3\n4 4\n3 2\n3 1\n1 5\n2 2\n6 2\n4 1\n2 4\n1 1\n4 2\n1 2\n1 4\n",
"6 5 21 4\n4 4\n6 1\n4 2\n1 4\n5 3\n2 3\n5 4\n2 2\n5 1\n4 1\n2 1\n1 5\n3 3\n2 5\n6 4\n3 2\n4 5\n6 3\n3 1\n3 4\n6 2\n",
"6 5 7 1\n6 5\n5 2\n1 3\n6 2\n4 3\n3 2\n4 1\n",
"3 6 8 2\n1 4\n1 3\n3 3\n1 2\n1 1\n2 1\n1 5\n2 2\n",
"1 2 0 1\n1 1\n1 2\n",
"1 3 1 1\n1 1\n",
"6 5 10 2\n6 2\n5 4\n3 2\n5 3\n4 5\n6 5\n5 2\n2 2\n6 4\n5 5\n",
"10 5 21 4\n4 4\n6 1\n4 2\n1 4\n5 3\n2 3\n5 4\n2 4\n5 1\n4 1\n2 1\n1 5\n3 3\n2 5\n6 4\n3 2\n4 5\n6 3\n3 1\n3 4\n6 2\n",
"3 5 8 4\n1 4\n1 3\n3 3\n1 2\n1 1\n2 1\n1 5\n2 2\n",
"7 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n4 1\n2 4\n",
"2 1 1 2\n2 1\n1 1\n",
"7 5 7 2\n6 5\n5 2\n1 3\n6 2\n3 1\n3 2\n4 1\n",
"7 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 3\n3 2\n4 1\n",
"7 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n2 1\n2 4\n",
"2 1 0 2\n2 1\n1 1\n",
"6 5 7 1\n6 5\n5 2\n1 3\n4 2\n4 3\n3 2\n4 1\n",
"0 2 0 1\n1 1\n1 2\n",
"7 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 1\n3 2\n4 1\n",
"2 1 0 2\n1 1\n1 1\n",
"0 2 0 1\n1 1\n0 2\n",
"7 10 7 1\n6 5\n5 2\n1 3\n6 2\n3 1\n3 2\n4 1\n",
"3 1 0 2\n1 1\n1 1\n",
"1 2 0 1\n1 1\n0 2\n",
"7 10 7 1\n6 5\n5 2\n1 3\n7 2\n3 1\n3 2\n4 1\n",
"3 1 0 2\n2 1\n1 1\n",
"1 2 0 1\n0 1\n0 2\n",
"1 2 0 1\n0 1\n1 2\n",
"1 2 0 1\n0 1\n1 3\n",
"1 2 0 1\n0 1\n2 3\n",
"1 2 0 1\n0 0\n2 3\n",
"0 2 0 1\n0 0\n2 3\n",
"0 2 0 1\n1 0\n2 3\n",
"0 3 0 1\n1 0\n2 3\n",
"0 2 0 1\n1 0\n2 0\n",
"0 2 0 1\n1 0\n0 0\n",
"0 2 0 1\n0 0\n0 0\n",
"0 2 0 1\n0 0\n0 -1\n",
"0 2 0 1\n0 1\n0 -1\n",
"1 2 0 1\n1 1\n1 4\n",
"7 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 3\n3 1\n4 1\n",
"0 2 0 1\n1 1\n1 0\n",
"2 1 0 2\n0 1\n1 1\n",
"0 2 0 1\n1 0\n0 2\n",
"7 10 7 1\n6 5\n5 2\n1 3\n6 1\n3 1\n3 2\n4 1\n",
"3 1 0 3\n1 1\n1 1\n",
"7 8 7 1\n6 5\n5 2\n1 3\n7 2\n3 1\n3 2\n4 1\n",
"1 1 0 2\n2 1\n1 1\n",
"1 2 0 1\n0 1\n-1 2\n",
"1 2 0 2\n0 1\n2 3\n",
"1 1 0 1\n0 0\n2 3\n",
"1 3 0 1\n1 0\n2 3\n",
"0 2 0 1\n1 -1\n2 0\n",
"0 2 0 1\n1 0\n0 -1\n",
"-1 2 0 1\n0 0\n0 -1\n",
"-1 2 0 1\n0 1\n0 -1\n"
],
"output": [
"4\n1 2 1 1 2 1 1 2 ",
"0\n1 ",
"5\n2 3 3 2 3 1 1 3\n",
"6\n2 1 1 2 2 1 1 2 1 2 1 1 2 2 2 2 1 1 1 1 2 \n",
"0\n1 1 ",
"6\n1 1 2 2 2 1 2 1 2 2\n",
"0\n1 1 ",
"9\n3 1 1 3 2 2 2 1 1 3 3 2 1 2\n",
"6\n2 3 1 3 4 3 1 4 2 4 1 1 1 2 1 2 3 2 3 4 4\n",
"0\n1 1 1 1 1 1 1 ",
"0\n1 ",
"5\n1 2 2 3 3 1 1 2\n",
"2\n2 1\n",
"9\n3 1 3 1 2 2 3 2 1 1 3 2 1 2\n",
"5\n4 2 3 3 4 2 2 1 3 1 4 1 1 3 1 2 2 3 3 4 4\n",
"0\n1 1 1 1 1 1 1\n",
"4\n1 2 1 1 2 1 1 2\n",
"0\n",
"0\n1\n",
"6\n2 2 1 1 2 1 2 1 1 1\n",
"6\n2 3 1 3 4 3 1 4 2 4 1 1 1 2 1 2 3 2 3 4 4\n",
"8\n1 2 1 3 4 1 1 2\n",
"7\n2 2 1 3 3 1 2 1\n",
"2\n1\n",
"6\n1 1 1 2 2 1 1\n",
"0\n1 1 1 1 1 1 1\n",
"5\n1 2 2 3 3 1 1 2\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
212_A. Privatization_37925 | There is a developed network of flights between Berland and Beerland. All of them belong to the Berland state company BerAvia. Each flight connects some Berland city with some Beerland city. For each flight airplanes fly in both directions.
Changes are coming to Berland — the state decided to privatize BerAvia, namely, to sell out all flights to t private companies. Each of these companies wants to get the maximal number of flights, so if the Berland flights are sold unevenly, Berland can be accused of partiality. Berland Government decided to sell the flights as evenly as possible between the t companies.
The unevenness of the distribution of flights between companies is calculated as follows. For each city i (both Berland and Beerland) we'll calculate the value of
<image> where aij is the number of flights from city i, which belong to company j. The sum of wi for all cities in both countries is called the unevenness of the distribution. The distribution with the minimal unevenness is the most even one.
Help the Berland government come up with the most even distribution plan of selling flights.
Input
The first input line contains four integers n, m, k and t (1 ≤ n, m, t ≤ 200;1 ≤ k ≤ 5000), where n, m are the numbers of cities in Berland and Beerland, correspondingly, k is the number of flights between them, and t is the number of private companies. Next k lines describe the flights, one per line, as pairs of positive integers xi, yi (1 ≤ xi ≤ n;1 ≤ yi ≤ m), where xi and yi are the indexes of cities in Berland and Beerland, correspondingly, connected by the i-th flight. There is at most one flight between any pair of cities, each flight connects cities of different countries. The cities in Berland are indexed from 1 to n, and in Beerland — from 1 to m.
Output
Print the unevenness of the sought plan on the first line. On the second line print a sequence of k integers c1, c2, ..., ck (1 ≤ ci ≤ t), where ci is the index of the company that should buy the i-th flight. Assume that the flights are indexed from 1 to k in the order they appear in the input. If there are multiple solutions, print any of them.
Examples
Input
3 5 8 2
1 4
1 3
3 3
1 2
1 1
2 1
1 5
2 2
Output
4
2 1 2 1 2 1 2 2 | import java.util.*;
// BiGraph Matching
public class CF_212A {
static Scanner scanner = new Scanner(System.in);
public static void main(String args[]) {
while (task()) {
}
}
private static int n, m, k, t;
private static int maxK = 5000;
private static int maxT = 2000;
private static int[] a = new int[maxK + 10];
private static int[] b = new int[maxK + 10];
private static int[] X = new int[maxT * maxT + 10];
private static int[] Y = new int[maxT * maxT + 10];
private static int[] xBegin = new int[maxT * maxT + 10];
private static int[] yBegin = new int[maxT * maxT + 10];
private static int[] degree = new int[maxK + 10];
private static int maxDegree = 0;
private static int[] degreeX = new int[maxK + 10];
private static int[] degreeY = new int[maxK + 10];
private static short [][] col = new short[2 * maxT + 10][maxT + 10];
private static short[][] colH = new short[2 * maxT + 10][2 * maxT + 10];
private static boolean[][] realEdge = new boolean[2 * maxT + 10][2 * maxT + 10];
// private static int[][] fakeEdge = new int[2 * maxT + 10][2 * maxT + 10];
public static boolean task() {
n = scanner.nextInt();
m = scanner.nextInt();
k = scanner.nextInt();
t = scanner.nextInt();
for (int i = 0; i < k; i++) {
int x = scanner.nextInt();
int y = scanner.nextInt();
y += n;
a[i] = x;
b[i] = y;
degree[x]++;
degree[y]++;
}
int ans = 0;
for (int i = 1; i <= n + m; i++) {
ans += degree[i] % t == 0? 0: 1;
// System.out.println("deg " + i + " " + degree[i]);
}
System.out.println(ans);
if (t == 1) {
for (int i = 0; i < k; i++) {
if (i != 0) {
System.out.print(" ");
}
System.out.print("1");
}
System.out.println("");
return false;
}
maxDegree = t;
int hX = 1, hY = 1;
for (int i = 1; i <= n; i++) {
// System.out.println("deg " + i + " " + degree[i] + " " + hX);
int deg = degree[i];
xBegin[i] = hX;
while (deg > 0) {
X[hX] = i;
hX++;
deg -= maxDegree;
}
}
for (int i = 1; i <= m; i++) {
int deg = degree[n + i];
yBegin[i] = hY;
while (deg > 0) {
Y[hY] = i;
hY++;
deg -= maxDegree;
}
}
int h = hX - 1;
if (h < hY - 1) {
h = hY - 1;
}
/*
for (int i = 1; i <= h; i++) {
System.out.println(i + " " + X[i]);
}
System.out.println(" -- ");
for (int i = 1; i <= h; i++) {
System.out.println(i + " " + Y[i]);
}
*/
Matcher matcher = new Matcher(h, h);
for (int i = 0; i < k; i++) {
int x = a[i];
int y = b[i] - n;
int realX = xBegin[x];
int realY = yBegin[y];
matcher.addEdge(realX, realY);
realEdge[realX][realY] = true;
degreeX[realX]++;
if (degreeX[realX] == maxDegree) {
xBegin[x]++;
}
degreeY[realY]++;
if (degreeY[realY] == maxDegree) {
yBegin[y]++;
}
}
int hy = 1;
for (int i = 1; i <= h; i++) {
int need = maxDegree - degreeX[i];
while (need > 0) {
while (degreeY[hy] == maxDegree) {
hy++;
}
matcher.addEdge(i, hy);
// fakeEdge[i][hy] = 1;
need--;
degreeY[hy]++;
degreeX[i]++;
}
}
/*
for (int i = 1; i <= h; i++) {
System.out.println("check deg x " + i + " " + degreeX[i]);
}
for (int i = 1; i <= h; i++) {
System.out.println("check deg y " + i + " " + degreeY[i]);
}
*/
for (int i = 0; i < maxDegree; i++) {
matcher.match();
// System.out.println(matcher.ans());
int c = i + 1;
for (int x = 1; x <= h; x++) {
int y = matcher.matching[x] - h;
if (y + h == -1) {
continue;
}
int originalX = X[x];
int originalY = Y[y];
if (originalX == 5 && originalY == 4) {
//System.out.println("hit !! " + originalX + " " + originalY + " " + col[originalX][originalY]);
//System.out.println("hit !! " + x + " " + y + " " + c);
}
if (realEdge[x][y] && colH[x][y] == 0) {
colH[x][y] = (short)c;
if (col[originalX][originalY] == 0) {
col[originalX][originalY] = (short)c;
//col[originalY][originalX] = c;
} else {
}
}
// System.out.println("col " + originalX + " " + originalY + " " + c);
matcher.delEdge(x, y);
}
}
int tot = 0;
for (int i = 0; i < k; i++) {
int x = a[i];
int y = b[i] - n;
if (i > 0) {
System.out.print(" ");
}
System.out.print(col[x][y]);
tot++;
}
System.out.println();
/*
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
System.out.print(col[i][j] + " ");
if (col[i][j] > 0) {
}
}
System.out.println();
}
System.out.println(tot);
// check
int [][] sumX = new int[maxT + 10][4];
int [][] sumY = new int[maxT + 10][4];
for (int i = 1; i <= n; i++) {
sumX[i][1] = sumX[i][2] = sumX[i][3] = 0;
sumY[i][1] = sumY[i][2] = sumY[i][3] = 0;
}
for (int i = 0; i < k; i++) {
int x = a[i];
int y = b[i] - n;
sumX[x][col[x][y]]++;
sumY[y][col[x][y]]++;
if (x == 5) {
System.out.println("check " + x + " " + y + " " + col[x][y]);
}
}
for (int i = 1; i <= n; i++) {
int min = sumX[i][1];
int max = sumX[i][1];
if (min > sumX[i][2]) {
min = sumX[i][2];
}
if (min > sumX[i][3]) {
min = sumX[i][3];
}
if (max < sumX[i][2]) {
max = sumX[i][2];
}
if (max < sumX[i][3]) {
max = sumX[i][3];
}
int yes = 0;
if (degree[i] % 3 == 0) {
if (min == max) {
yes = 1;
}
} else {
if (min == max - 1) {
yes = 1;
}
}
if (i == 5) {
System.out.println("x " + i + " " + degree[i] + " " + min + " " + max + " " + yes);
}
}
System.out.println("---");
for (int i = 1; i <= m; i++) {
int min = sumY[i][1];
int max = sumY[i][1];
if (min > sumY[i][2]) {
min = sumY[i][2];
}
if (min > sumY[i][3]) {
min = sumY[i][3];
}
if (max < sumY[i][2]) {
max = sumY[i][2];
}
if (max < sumY[i][3]) {
max = sumY[i][3];
}
int yes = 0;
if (degree[i + n] % 3 == 0) {
if (min == max) {
yes = 1;
}
} else {
if (min == max - 1) {
yes = 1;
}
}
System.out.println("y " + i + " " + degree[i + n] + " " + min + " " + max + " " + yes);
}
*/
return false;
}
public static final int maxN = 10000;
public static class Matcher {
public Map<Integer, Integer>[] g = new Map[2 * maxN + 10];
private int nx, ny;
private int nEdge;
public static int[] matching = new int[2 * maxN + 10];
private static int[] checked = new int[2 * maxN + 10];
public Matcher(int nx, int ny) {
this.nx = nx;
this.ny = ny;
nEdge = 0;
for (int i = 0; i < g.length; i++) {
g[i] = new HashMap<>();
}
}
public void addEdge(int x, int y) {
int now = g[x].getOrDefault(nx + y, 0);
g[x].put(nx + y, now + 1);
nEdge++;
// System.out.println(("add " + x + " " + y));
}
public void delEdge(int x, int y) {
int now = g[x].getOrDefault(nx + y, 0);
if (now > 1) {
g[x].put(nx + y, now - 1);
} else {
g[x].remove(nx + y);
}
nEdge--;
// System.out.println(("del " + x + " " + y));
}
public void reset() {
ans = 0;
for (int i = 0; i < matching.length; i++) {
matching[i] = -1;
}
for (int i = 0; i < checked.length; i++) {
checked[i] = -1;
}
}
private int ans = 0;
private Queue<Integer> q = new LinkedList<>();
private int[] prev = new int[2 * maxN + 10];
public void match() {
reset();
for (int x = 1; x <= nx; x++) {
int step = x;
if (matching[x] == -1) {
q.clear();
q.add(x);
prev[x] = -1;
boolean flag = false;
while (!q.isEmpty() && !flag) {
int u = q.poll();
//System.out.println(u);
for (int v: g[u].keySet()) {
if (flag) {
break;
}
if (checked[v] != step) {
checked[v] = step;
q.add(matching[v]);
if (matching[v] >= 0) {
prev[matching[v]] = u;
} else {
flag = true;
int d = u;
int e = v;
while (d != -1) {
int t = matching[d];
matching[d] = e;
matching[e] = d;
d = prev[d];
e = t;
}
}
}
}
// q.poll();
}
if (matching[x] != -1) {
ans++;
}
}
}
}
public int ans() {
return ans;
}
}
}
| 4JAVA
| {
"input": [
"3 5 8 2\n1 4\n1 3\n3 3\n1 2\n1 1\n2 1\n1 5\n2 2\n",
"1 2 1 1\n1 1\n",
"3 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n2 1\n2 4\n",
"6 5 21 2\n1 4\n5 4\n3 1\n5 3\n5 2\n2 3\n4 4\n6 1\n1 1\n4 5\n6 2\n5 5\n6 4\n2 4\n3 2\n1 5\n6 5\n4 2\n3 5\n2 2\n4 1\n",
"1 2 2 1\n1 1\n1 2\n",
"6 5 10 2\n6 2\n5 4\n3 2\n6 3\n4 5\n6 5\n5 2\n2 2\n6 4\n5 5\n",
"2 1 2 1\n2 1\n1 1\n",
"6 5 14 3\n5 1\n1 3\n4 4\n3 2\n3 1\n1 5\n2 2\n6 2\n2 1\n2 4\n1 1\n4 2\n1 2\n1 4\n",
"6 5 21 4\n4 4\n6 1\n4 2\n1 4\n5 3\n2 3\n5 4\n2 4\n5 1\n4 1\n2 1\n1 5\n3 3\n2 5\n6 4\n3 2\n4 5\n6 3\n3 1\n3 4\n6 2\n",
"6 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 3\n3 2\n4 1\n",
"1 1 1 1\n1 1\n",
"4 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n2 1\n2 4\n",
"2 1 2 2\n2 1\n1 1\n",
"6 5 14 3\n5 1\n1 3\n4 4\n3 2\n3 1\n1 5\n2 2\n6 2\n4 1\n2 4\n1 1\n4 2\n1 2\n1 4\n",
"6 5 21 4\n4 4\n6 1\n4 2\n1 4\n5 3\n2 3\n5 4\n2 2\n5 1\n4 1\n2 1\n1 5\n3 3\n2 5\n6 4\n3 2\n4 5\n6 3\n3 1\n3 4\n6 2\n",
"6 5 7 1\n6 5\n5 2\n1 3\n6 2\n4 3\n3 2\n4 1\n",
"3 6 8 2\n1 4\n1 3\n3 3\n1 2\n1 1\n2 1\n1 5\n2 2\n",
"1 2 0 1\n1 1\n1 2\n",
"1 3 1 1\n1 1\n",
"6 5 10 2\n6 2\n5 4\n3 2\n5 3\n4 5\n6 5\n5 2\n2 2\n6 4\n5 5\n",
"10 5 21 4\n4 4\n6 1\n4 2\n1 4\n5 3\n2 3\n5 4\n2 4\n5 1\n4 1\n2 1\n1 5\n3 3\n2 5\n6 4\n3 2\n4 5\n6 3\n3 1\n3 4\n6 2\n",
"3 5 8 4\n1 4\n1 3\n3 3\n1 2\n1 1\n2 1\n1 5\n2 2\n",
"7 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n4 1\n2 4\n",
"2 1 1 2\n2 1\n1 1\n",
"7 5 7 2\n6 5\n5 2\n1 3\n6 2\n3 1\n3 2\n4 1\n",
"7 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 3\n3 2\n4 1\n",
"7 5 8 3\n1 4\n3 2\n1 1\n2 2\n1 5\n1 2\n2 1\n2 4\n",
"2 1 0 2\n2 1\n1 1\n",
"6 5 7 1\n6 5\n5 2\n1 3\n4 2\n4 3\n3 2\n4 1\n",
"0 2 0 1\n1 1\n1 2\n",
"7 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 1\n3 2\n4 1\n",
"2 1 0 2\n1 1\n1 1\n",
"0 2 0 1\n1 1\n0 2\n",
"7 10 7 1\n6 5\n5 2\n1 3\n6 2\n3 1\n3 2\n4 1\n",
"3 1 0 2\n1 1\n1 1\n",
"1 2 0 1\n1 1\n0 2\n",
"7 10 7 1\n6 5\n5 2\n1 3\n7 2\n3 1\n3 2\n4 1\n",
"3 1 0 2\n2 1\n1 1\n",
"1 2 0 1\n0 1\n0 2\n",
"1 2 0 1\n0 1\n1 2\n",
"1 2 0 1\n0 1\n1 3\n",
"1 2 0 1\n0 1\n2 3\n",
"1 2 0 1\n0 0\n2 3\n",
"0 2 0 1\n0 0\n2 3\n",
"0 2 0 1\n1 0\n2 3\n",
"0 3 0 1\n1 0\n2 3\n",
"0 2 0 1\n1 0\n2 0\n",
"0 2 0 1\n1 0\n0 0\n",
"0 2 0 1\n0 0\n0 0\n",
"0 2 0 1\n0 0\n0 -1\n",
"0 2 0 1\n0 1\n0 -1\n",
"1 2 0 1\n1 1\n1 4\n",
"7 5 7 1\n6 5\n5 2\n1 3\n6 2\n3 3\n3 1\n4 1\n",
"0 2 0 1\n1 1\n1 0\n",
"2 1 0 2\n0 1\n1 1\n",
"0 2 0 1\n1 0\n0 2\n",
"7 10 7 1\n6 5\n5 2\n1 3\n6 1\n3 1\n3 2\n4 1\n",
"3 1 0 3\n1 1\n1 1\n",
"7 8 7 1\n6 5\n5 2\n1 3\n7 2\n3 1\n3 2\n4 1\n",
"1 1 0 2\n2 1\n1 1\n",
"1 2 0 1\n0 1\n-1 2\n",
"1 2 0 2\n0 1\n2 3\n",
"1 1 0 1\n0 0\n2 3\n",
"1 3 0 1\n1 0\n2 3\n",
"0 2 0 1\n1 -1\n2 0\n",
"0 2 0 1\n1 0\n0 -1\n",
"-1 2 0 1\n0 0\n0 -1\n",
"-1 2 0 1\n0 1\n0 -1\n"
],
"output": [
"4\n1 2 1 1 2 1 1 2 ",
"0\n1 ",
"5\n2 3 3 2 3 1 1 3\n",
"6\n2 1 1 2 2 1 1 2 1 2 1 1 2 2 2 2 1 1 1 1 2 \n",
"0\n1 1 ",
"6\n1 1 2 2 2 1 2 1 2 2\n",
"0\n1 1 ",
"9\n3 1 1 3 2 2 2 1 1 3 3 2 1 2\n",
"6\n2 3 1 3 4 3 1 4 2 4 1 1 1 2 1 2 3 2 3 4 4\n",
"0\n1 1 1 1 1 1 1 ",
"0\n1 ",
"5\n1 2 2 3 3 1 1 2\n",
"2\n2 1\n",
"9\n3 1 3 1 2 2 3 2 1 1 3 2 1 2\n",
"5\n4 2 3 3 4 2 2 1 3 1 4 1 1 3 1 2 2 3 3 4 4\n",
"0\n1 1 1 1 1 1 1\n",
"4\n1 2 1 1 2 1 1 2\n",
"0\n",
"0\n1\n",
"6\n2 2 1 1 2 1 2 1 1 1\n",
"6\n2 3 1 3 4 3 1 4 2 4 1 1 1 2 1 2 3 2 3 4 4\n",
"8\n1 2 1 3 4 1 1 2\n",
"7\n2 2 1 3 3 1 2 1\n",
"2\n1\n",
"6\n1 1 1 2 2 1 1\n",
"0\n1 1 1 1 1 1 1\n",
"5\n1 2 2 3 3 1 1 2\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n1 1 1 1 1 1 1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
236_A. Boy or Girl_37926 | Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network.
But yesterday, he came to see "her" in the real world and found out "she" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.
This is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.
Input
The first line contains a non-empty string, that contains only lowercase English letters — the user name. This string contains at most 100 letters.
Output
If it is a female by our hero's method, print "CHAT WITH HER!" (without the quotes), otherwise, print "IGNORE HIM!" (without the quotes).
Examples
Input
wjmzbmr
Output
CHAT WITH HER!
Input
xiaodao
Output
IGNORE HIM!
Input
sevenkplus
Output
CHAT WITH HER!
Note
For the first example. There are 6 distinct characters in "wjmzbmr". These characters are: "w", "j", "m", "z", "b", "r". So wjmzbmr is a female and you should print "CHAT WITH HER!". | a = set(list(raw_input()))
if len(a) % 2 == 1:
print 'IGNORE HIM!'
else:
print 'CHAT WITH HER!' | 1Python2
| {
"input": [
"xiaodao\n",
"sevenkplus\n",
"wjmzbmr\n",
"nuezoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxxkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"pezu\n",
"nheihhxkbbrmlpxpxbhnpofcjmxemyvqqdbanwd\n",
"lnpdosnceumubvk\n",
"wnemlgppy\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdphdahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqzgfmbzhezbfaqeywgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdxfomjlzpnduulukszqnnwfvxbvxyzmleocmofwclmzz\n",
"lqonogasrkzhryjxppjyriyfxmdfubieglthyswz\n",
"xczn\n",
"ottnneymszwbumgobazfjyxewkjakglbfflsajuzescplpcxqta\n",
"kmsk\n",
"acrzbavz\n",
"hkdbykboclchfdsuovvpknwqr\n",
"wpxbxzfhtdecetpljcrvpjjnllosdqirnkzesiqeukbedkayqx\n",
"vnxhrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efrk\n",
"tgcdptnkc\n",
"ojjvpnkrxibyevxk\n",
"udlpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagnnhbvepbpy\n",
"drvzznznvrzskftnrhvvzxcalwutxmdza\n",
"wuqvlbblkddeindiiswsinkfrnkxghhwunzmmvyovpqapdfbolyim\n",
"yzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhrbdlnwmtjgtdgziollrfxroabfhadygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgo\n",
"sgubujztzwkzvztitssxxxwzanfmddfqvv\n",
"sxtburpzskucowowebgrbovhadrrayamuwypmmxhscrujkmcgvyinp\n",
"oh\n",
"urigreuzpxnej\n",
"smdfafbyehdylhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqijxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"rhh\n",
"eswpaclodzcwhgixhpyzvhdwsgneqidanbzdzszquefh\n",
"vlhrpzezawyolhbmvxbwhtjustdbqggexmzxyieihjlelvwjosmkwesfjmramsikhkupzvfgezmrqzudjcalpjacmhykhgfhrjx\n",
"rafcaanqytfclvfdegak\n",
"mcjehdiygkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vasvvnpymtgjirnzuynluluvmgpquskuaafwogeztfnvybblajvuuvfomtifeuzpikjrolzeeoftv\n",
"fpellxwskyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokydjoexnvi\n",
"qwbdfzfylckctudyjlyrtmvbidfatdoqfmrfshsqqmhzohhsczscvwzpwyoyswhktjlykumhvaounpzwpxcspxwlgt\n",
"wjweqcrqfuollfvfbiyriijovweg\n",
"zhdouqfmlkenjzdijxdfxnlegxeuvhelo\n",
"qpbjwzwgdzmeluheirjrvzrhbmagfsjdgvzgwumjtjzecsfkrfqjasssrhhtgdqqfydlmrktlgfc\n",
"vbpfgjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"temnownneghnrujforif\n",
"hsfcfvameeupldgvchmogrvwxrvsmnwxxkxoawwodtsahqvehlcw\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoickarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"zwlunigqnhrwirkvufqwrnwcnkqqonebrwzcshcbqqwkjxhymjjeakuzjettebciadjlkbfp\n",
"ecsdicrznvglwggrdbrvehwzaenzjutjydhvimtqegweurpxtjkmpcznshtrvotkvrghxhacjkedidqqzrduzad\n",
"yhbtzfppwcycxqjpqdfmjnhwaogyuaxamwxpnrdrnqsgdyfvxu\n",
"gwntwbpj\n",
"zcinitufxoldnokacdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpbcbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"arcoaeozyeawbveoxpmafxxzdjldsielp\n",
"vujtrrpshinkskgyknlcfckmqdrwtklkzlyipmetjvaqxdsslkskschbalmdhzsdrrjmxdltbtnxbh\n",
"qagzrqjomdwhagkhrjahhxkieijyten\n",
"sbkydrscoojychxchqsuciperfroumenelgiyiwlqfwximrgdbyvkmacy\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhklkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"tpnwfmfsibnccvdwjvzviyvjfljupinfigfunyff\n",
"lxxwbkrjgnqjwsnflfnsdyxihmlspgivirazsbveztnkuzpaxtygidniflyjheejelnjyjvgkgvdqks\n",
"xninyvkuvakfbs\n",
"cpvftiwgyvnlmbkadiafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsqhtwmdlpjwzyafckrqrdduonkgo\n",
"yocxrzspinchmhtmqo\n",
"qbkjsdwpahdbbohggbclfcufqelnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzli\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhysnmadtnyn\n",
"ptkyaxycecpbrjnvxcjtbqiocqcswnmicxbvhdsptbxyxswbw\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkhpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoqupggaqajuzonrpzihbsogjfsrrypbiphehonyhohsbybnnukqebopppa\n",
"gavaihhamfolcndgytcsgucqdqngxkrlovpthvteacmmthoglxu\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpaikixmumkhfbjiswmvzbtiyifbx\n",
"dbdokywnpqnotfrhdbrzmuyoxfdtrgrzcccninbtmoqvxfatcqg\n",
"ppcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqugykyu\n",
"qordzrdiknsympdrkgapjxokbldorpnmnpucmwakklmqenpmkom\n",
"wqfldgihuxfktzanyycluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjrlcalffq\n",
"oacwxipdfcoabhkwxqdbtowiekpnflnqhlrkustgzryvws\n",
"fjuldpuejgmggvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"nueyoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"dwnabdqqvymexmjcfopnhbxpxplmrbbkxhhiehn\n",
"qojblasgfgybxsvjtkaopkyqygcvjsmlicxkxxmvzqlbgwvpenfmyzfzoqeyayughbvznpujdvubpxsriryuogdzevstfzqa\n",
"pezt\n",
"lnpdosnbeumubvk\n",
"wnemlgppz\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmbzhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdffomjlzpnduulukszqnnwxvxbvxyzmleocmofwclmzz\n",
"zwsyhtlgeibufdmxfyiryjppxjyrhzkrsagonoql\n",
"xczm\n",
"atqxcplpcsezujaslffblgkajkwexyjfzabogmubwzsmyenntto\n",
"kmtk\n",
"bcrzbavz\n",
"rqwnkpvvousdfhclcobkybdkh\n",
"vnxgrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efqk\n",
"ckntpdcgt\n",
"ojevpnkrxibyjvxk\n",
"udmpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagynhbvepbpn\n",
"drvzznznvrzskftnuhvvzxcalwrtxmdza\n",
"miylobfdpaqpvoyvmmznuwhhgxknrfkniswsiidnieddklbblvquw\n",
"xzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhhbdlnwmtjgtdgziollrfxroabfradygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgp\n",
"vvqfddmfnazwxxxsstitzvzkwztzjubugs\n",
"sxtburpzskucowowebgrbovhadrryyamuwapmmxhscrujkmcgvyinp\n",
"nh\n",
"urigreuzpxnek\n",
"smdfafbyehdxlhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqikxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"hhr\n",
"eswpaclodzcwhgixhpyzvhdwsgnqqidanbzdzszeuefh\n",
"xjrhfghkyhmcajplacjduzqrmzegfvzpukhkismarmjfsewkmsojwvleljhieiyxzmxeggqbdtsujthwbxvmbhloywazezprhlv\n",
"rafcaanqytfclvfdegal\n",
"mcjehdiyfkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vtfoeezlorjkipzuefitmofvuuvjalbbyvnftzegowfaauksuqpgmvululnyuznrijgtmypnvvsav\n",
"fpellxwrkyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokxdjoexnvi\n",
"tglwxpscxpwzpnuoavhmukyljtkhwsyoywpzwvcszcshhozhmqqshsfrmfqodtafdibvmtryljydutckclyfzfdbwq\n",
"wjweqcrqfuollfvfbiyriijovwef\n",
"zhdouqfmlkenjzdijxdfxnlegxetvhelo\n",
"vbpfhjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"etmnownneghnrujforif\n",
"wclhevqhastdowwaoxkxxwnmsvrxwvrgomhcvgdlpueemavfcfsh\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoibkarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"pfbkljdaicbettejzukaejjmyhxjkwqqbchsczwrbenoqqkncwnrwqfuvkriwrhnqginulwz\n",
"dazudrzqqdidekjcahxhgrvktovrthsnzcpmkjtxpruewgeqtmivhdyjtujzneazwhevrbdrggwlgvnzrcidsce\n",
"uxvfydgsqnrdrnpxwmaxauygoawhnjmfdqpjqxcycwppfztbhy\n",
"gvntwbpj\n",
"zcinitufxoldnokbcdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpacbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"aqcoaeozyeawbveoxpmafxxzdjldsielp\n",
"hbxntbtldxmjrrdszhdmlabhcsksklssdxqavjtempiylzklktwrdqmkcfclnkygksknihsprrtjuv\n",
"qagzrqjomdwhagkhrjanhxkieijyteh\n",
"ycamkvybdgrmixwfqlwiyiglenemuorfrepicusqhcxhcyjoocsrdykbs\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhjlkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"ffynufgifnipujlfjvyivzvjwdvccnbisfmfwnpt\n",
"skqdvgkgvjyjnlejeehjylfindigytxapzukntzevbszarivigpslmhixydsnflfnswjqngjrkbwxxl\n",
"xnjnyvkuvakfbs\n",
"cpvftiwgyvnlmbkadhafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsahtwmdlpjwzyqfckrqrdduonkgo\n",
"yocxrzsoinchmhtmqo\n",
"lbkjsdwpahdbbohggbclfcufqeqnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzki\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhxsnmadtnyn\n",
"wbwsxyxbtpsdhvbxcimnwscqcoiqbtjcxvnjrbpcecyxayktp\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkgpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoquphgaqajuzonrpzihbsogjfsrrypbiphehonyhogsbybnnukqebopppa\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpajkixmumkhfbjiswmvzbtiyifbx\n",
"gqctafxvqomtbninccczrgrtdfxoyumzrbdhrftonqpnwykodbd\n",
"opcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqufykyu\n",
"qordzrdiknsympdrkgapjxokblporpnmnducmwakklmqenpmkom\n",
"wqfldgihuxfktyanyzcluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjqlcalffq\n",
"swvyrzgtsukrlhqnlfnpkeiwotbdqxwkhbaocfdpixwcao\n",
"fjuldpuejgmgfvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"yiaodao\n",
"sepenkvlus\n",
"wjrzbmm\n",
"kkhlqebfcnquwbzwodogxcmdcjcjgejsjpstakttxkrjbaaeomreeuuadaoyeun\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxwkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"oezt\n",
"dwnabdqqvyjexmmcfopnhbxpxplmrbbkxhhiehn\n",
"lnpdosnbeumtbvk\n",
"wnemmgppz\n",
"zqzlnnuwcfufeujygtczfakhcpqbtxtejrbgoodychwpzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmazhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lqonogasrkzhryjxppjyriyfxmdfubiehlthyswz\n",
"zcxm\n",
"wtqxcplpcsezujaslffblgkajkwexyjfzabogmubazsmyenntto\n",
"kltk\n"
],
"output": [
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n"
]
} | 2CODEFORCES
|
236_A. Boy or Girl_37927 | Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network.
But yesterday, he came to see "her" in the real world and found out "she" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.
This is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.
Input
The first line contains a non-empty string, that contains only lowercase English letters — the user name. This string contains at most 100 letters.
Output
If it is a female by our hero's method, print "CHAT WITH HER!" (without the quotes), otherwise, print "IGNORE HIM!" (without the quotes).
Examples
Input
wjmzbmr
Output
CHAT WITH HER!
Input
xiaodao
Output
IGNORE HIM!
Input
sevenkplus
Output
CHAT WITH HER!
Note
For the first example. There are 6 distinct characters in "wjmzbmr". These characters are: "w", "j", "m", "z", "b", "r". So wjmzbmr is a female and you should print "CHAT WITH HER!". | #include <bits/stdc++.h>
int main() {
int alfabet[30] = {};
char string[105];
int i = 0;
int isi;
scanf("%s", string);
for (int i = 0; i < strlen(string); i++) {
alfabet[string[i] - 96]++;
}
for (int i = 0; i < 27; i++) {
if (alfabet[i] != 0) {
isi++;
}
}
if (isi % 2 == 0) {
printf("IGNORE HIM!\n");
} else {
printf("CHAT WITH HER!\n");
}
}
| 2C++
| {
"input": [
"xiaodao\n",
"sevenkplus\n",
"wjmzbmr\n",
"nuezoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxxkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"pezu\n",
"nheihhxkbbrmlpxpxbhnpofcjmxemyvqqdbanwd\n",
"lnpdosnceumubvk\n",
"wnemlgppy\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdphdahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqzgfmbzhezbfaqeywgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdxfomjlzpnduulukszqnnwfvxbvxyzmleocmofwclmzz\n",
"lqonogasrkzhryjxppjyriyfxmdfubieglthyswz\n",
"xczn\n",
"ottnneymszwbumgobazfjyxewkjakglbfflsajuzescplpcxqta\n",
"kmsk\n",
"acrzbavz\n",
"hkdbykboclchfdsuovvpknwqr\n",
"wpxbxzfhtdecetpljcrvpjjnllosdqirnkzesiqeukbedkayqx\n",
"vnxhrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efrk\n",
"tgcdptnkc\n",
"ojjvpnkrxibyevxk\n",
"udlpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagnnhbvepbpy\n",
"drvzznznvrzskftnrhvvzxcalwutxmdza\n",
"wuqvlbblkddeindiiswsinkfrnkxghhwunzmmvyovpqapdfbolyim\n",
"yzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhrbdlnwmtjgtdgziollrfxroabfhadygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgo\n",
"sgubujztzwkzvztitssxxxwzanfmddfqvv\n",
"sxtburpzskucowowebgrbovhadrrayamuwypmmxhscrujkmcgvyinp\n",
"oh\n",
"urigreuzpxnej\n",
"smdfafbyehdylhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqijxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"rhh\n",
"eswpaclodzcwhgixhpyzvhdwsgneqidanbzdzszquefh\n",
"vlhrpzezawyolhbmvxbwhtjustdbqggexmzxyieihjlelvwjosmkwesfjmramsikhkupzvfgezmrqzudjcalpjacmhykhgfhrjx\n",
"rafcaanqytfclvfdegak\n",
"mcjehdiygkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vasvvnpymtgjirnzuynluluvmgpquskuaafwogeztfnvybblajvuuvfomtifeuzpikjrolzeeoftv\n",
"fpellxwskyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokydjoexnvi\n",
"qwbdfzfylckctudyjlyrtmvbidfatdoqfmrfshsqqmhzohhsczscvwzpwyoyswhktjlykumhvaounpzwpxcspxwlgt\n",
"wjweqcrqfuollfvfbiyriijovweg\n",
"zhdouqfmlkenjzdijxdfxnlegxeuvhelo\n",
"qpbjwzwgdzmeluheirjrvzrhbmagfsjdgvzgwumjtjzecsfkrfqjasssrhhtgdqqfydlmrktlgfc\n",
"vbpfgjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"temnownneghnrujforif\n",
"hsfcfvameeupldgvchmogrvwxrvsmnwxxkxoawwodtsahqvehlcw\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoickarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"zwlunigqnhrwirkvufqwrnwcnkqqonebrwzcshcbqqwkjxhymjjeakuzjettebciadjlkbfp\n",
"ecsdicrznvglwggrdbrvehwzaenzjutjydhvimtqegweurpxtjkmpcznshtrvotkvrghxhacjkedidqqzrduzad\n",
"yhbtzfppwcycxqjpqdfmjnhwaogyuaxamwxpnrdrnqsgdyfvxu\n",
"gwntwbpj\n",
"zcinitufxoldnokacdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpbcbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"arcoaeozyeawbveoxpmafxxzdjldsielp\n",
"vujtrrpshinkskgyknlcfckmqdrwtklkzlyipmetjvaqxdsslkskschbalmdhzsdrrjmxdltbtnxbh\n",
"qagzrqjomdwhagkhrjahhxkieijyten\n",
"sbkydrscoojychxchqsuciperfroumenelgiyiwlqfwximrgdbyvkmacy\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhklkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"tpnwfmfsibnccvdwjvzviyvjfljupinfigfunyff\n",
"lxxwbkrjgnqjwsnflfnsdyxihmlspgivirazsbveztnkuzpaxtygidniflyjheejelnjyjvgkgvdqks\n",
"xninyvkuvakfbs\n",
"cpvftiwgyvnlmbkadiafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsqhtwmdlpjwzyafckrqrdduonkgo\n",
"yocxrzspinchmhtmqo\n",
"qbkjsdwpahdbbohggbclfcufqelnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzli\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhysnmadtnyn\n",
"ptkyaxycecpbrjnvxcjtbqiocqcswnmicxbvhdsptbxyxswbw\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkhpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoqupggaqajuzonrpzihbsogjfsrrypbiphehonyhohsbybnnukqebopppa\n",
"gavaihhamfolcndgytcsgucqdqngxkrlovpthvteacmmthoglxu\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpaikixmumkhfbjiswmvzbtiyifbx\n",
"dbdokywnpqnotfrhdbrzmuyoxfdtrgrzcccninbtmoqvxfatcqg\n",
"ppcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqugykyu\n",
"qordzrdiknsympdrkgapjxokbldorpnmnpucmwakklmqenpmkom\n",
"wqfldgihuxfktzanyycluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjrlcalffq\n",
"oacwxipdfcoabhkwxqdbtowiekpnflnqhlrkustgzryvws\n",
"fjuldpuejgmggvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"nueyoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"dwnabdqqvymexmjcfopnhbxpxplmrbbkxhhiehn\n",
"qojblasgfgybxsvjtkaopkyqygcvjsmlicxkxxmvzqlbgwvpenfmyzfzoqeyayughbvznpujdvubpxsriryuogdzevstfzqa\n",
"pezt\n",
"lnpdosnbeumubvk\n",
"wnemlgppz\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmbzhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdffomjlzpnduulukszqnnwxvxbvxyzmleocmofwclmzz\n",
"zwsyhtlgeibufdmxfyiryjppxjyrhzkrsagonoql\n",
"xczm\n",
"atqxcplpcsezujaslffblgkajkwexyjfzabogmubwzsmyenntto\n",
"kmtk\n",
"bcrzbavz\n",
"rqwnkpvvousdfhclcobkybdkh\n",
"vnxgrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efqk\n",
"ckntpdcgt\n",
"ojevpnkrxibyjvxk\n",
"udmpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagynhbvepbpn\n",
"drvzznznvrzskftnuhvvzxcalwrtxmdza\n",
"miylobfdpaqpvoyvmmznuwhhgxknrfkniswsiidnieddklbblvquw\n",
"xzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhhbdlnwmtjgtdgziollrfxroabfradygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgp\n",
"vvqfddmfnazwxxxsstitzvzkwztzjubugs\n",
"sxtburpzskucowowebgrbovhadrryyamuwapmmxhscrujkmcgvyinp\n",
"nh\n",
"urigreuzpxnek\n",
"smdfafbyehdxlhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqikxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"hhr\n",
"eswpaclodzcwhgixhpyzvhdwsgnqqidanbzdzszeuefh\n",
"xjrhfghkyhmcajplacjduzqrmzegfvzpukhkismarmjfsewkmsojwvleljhieiyxzmxeggqbdtsujthwbxvmbhloywazezprhlv\n",
"rafcaanqytfclvfdegal\n",
"mcjehdiyfkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vtfoeezlorjkipzuefitmofvuuvjalbbyvnftzegowfaauksuqpgmvululnyuznrijgtmypnvvsav\n",
"fpellxwrkyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokxdjoexnvi\n",
"tglwxpscxpwzpnuoavhmukyljtkhwsyoywpzwvcszcshhozhmqqshsfrmfqodtafdibvmtryljydutckclyfzfdbwq\n",
"wjweqcrqfuollfvfbiyriijovwef\n",
"zhdouqfmlkenjzdijxdfxnlegxetvhelo\n",
"vbpfhjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"etmnownneghnrujforif\n",
"wclhevqhastdowwaoxkxxwnmsvrxwvrgomhcvgdlpueemavfcfsh\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoibkarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"pfbkljdaicbettejzukaejjmyhxjkwqqbchsczwrbenoqqkncwnrwqfuvkriwrhnqginulwz\n",
"dazudrzqqdidekjcahxhgrvktovrthsnzcpmkjtxpruewgeqtmivhdyjtujzneazwhevrbdrggwlgvnzrcidsce\n",
"uxvfydgsqnrdrnpxwmaxauygoawhnjmfdqpjqxcycwppfztbhy\n",
"gvntwbpj\n",
"zcinitufxoldnokbcdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpacbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"aqcoaeozyeawbveoxpmafxxzdjldsielp\n",
"hbxntbtldxmjrrdszhdmlabhcsksklssdxqavjtempiylzklktwrdqmkcfclnkygksknihsprrtjuv\n",
"qagzrqjomdwhagkhrjanhxkieijyteh\n",
"ycamkvybdgrmixwfqlwiyiglenemuorfrepicusqhcxhcyjoocsrdykbs\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhjlkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"ffynufgifnipujlfjvyivzvjwdvccnbisfmfwnpt\n",
"skqdvgkgvjyjnlejeehjylfindigytxapzukntzevbszarivigpslmhixydsnflfnswjqngjrkbwxxl\n",
"xnjnyvkuvakfbs\n",
"cpvftiwgyvnlmbkadhafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsahtwmdlpjwzyqfckrqrdduonkgo\n",
"yocxrzsoinchmhtmqo\n",
"lbkjsdwpahdbbohggbclfcufqeqnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzki\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhxsnmadtnyn\n",
"wbwsxyxbtpsdhvbxcimnwscqcoiqbtjcxvnjrbpcecyxayktp\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkgpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoquphgaqajuzonrpzihbsogjfsrrypbiphehonyhogsbybnnukqebopppa\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpajkixmumkhfbjiswmvzbtiyifbx\n",
"gqctafxvqomtbninccczrgrtdfxoyumzrbdhrftonqpnwykodbd\n",
"opcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqufykyu\n",
"qordzrdiknsympdrkgapjxokblporpnmnducmwakklmqenpmkom\n",
"wqfldgihuxfktyanyzcluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjqlcalffq\n",
"swvyrzgtsukrlhqnlfnpkeiwotbdqxwkhbaocfdpixwcao\n",
"fjuldpuejgmgfvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"yiaodao\n",
"sepenkvlus\n",
"wjrzbmm\n",
"kkhlqebfcnquwbzwodogxcmdcjcjgejsjpstakttxkrjbaaeomreeuuadaoyeun\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxwkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"oezt\n",
"dwnabdqqvyjexmmcfopnhbxpxplmrbbkxhhiehn\n",
"lnpdosnbeumtbvk\n",
"wnemmgppz\n",
"zqzlnnuwcfufeujygtczfakhcpqbtxtejrbgoodychwpzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmazhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lqonogasrkzhryjxppjyriyfxmdfubiehlthyswz\n",
"zcxm\n",
"wtqxcplpcsezujaslffblgkajkwexyjfzabogmubazsmyenntto\n",
"kltk\n"
],
"output": [
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n"
]
} | 2CODEFORCES
|
236_A. Boy or Girl_37928 | Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network.
But yesterday, he came to see "her" in the real world and found out "she" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.
This is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.
Input
The first line contains a non-empty string, that contains only lowercase English letters — the user name. This string contains at most 100 letters.
Output
If it is a female by our hero's method, print "CHAT WITH HER!" (without the quotes), otherwise, print "IGNORE HIM!" (without the quotes).
Examples
Input
wjmzbmr
Output
CHAT WITH HER!
Input
xiaodao
Output
IGNORE HIM!
Input
sevenkplus
Output
CHAT WITH HER!
Note
For the first example. There are 6 distinct characters in "wjmzbmr". These characters are: "w", "j", "m", "z", "b", "r". So wjmzbmr is a female and you should print "CHAT WITH HER!". | for _ in range(1):
x=set(list(input()))
if len(x)%2==0:
print('CHAT WITH HER!')
else:
print("IGNORE HIM!")
| 3Python3
| {
"input": [
"xiaodao\n",
"sevenkplus\n",
"wjmzbmr\n",
"nuezoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxxkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"pezu\n",
"nheihhxkbbrmlpxpxbhnpofcjmxemyvqqdbanwd\n",
"lnpdosnceumubvk\n",
"wnemlgppy\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdphdahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqzgfmbzhezbfaqeywgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdxfomjlzpnduulukszqnnwfvxbvxyzmleocmofwclmzz\n",
"lqonogasrkzhryjxppjyriyfxmdfubieglthyswz\n",
"xczn\n",
"ottnneymszwbumgobazfjyxewkjakglbfflsajuzescplpcxqta\n",
"kmsk\n",
"acrzbavz\n",
"hkdbykboclchfdsuovvpknwqr\n",
"wpxbxzfhtdecetpljcrvpjjnllosdqirnkzesiqeukbedkayqx\n",
"vnxhrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efrk\n",
"tgcdptnkc\n",
"ojjvpnkrxibyevxk\n",
"udlpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagnnhbvepbpy\n",
"drvzznznvrzskftnrhvvzxcalwutxmdza\n",
"wuqvlbblkddeindiiswsinkfrnkxghhwunzmmvyovpqapdfbolyim\n",
"yzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhrbdlnwmtjgtdgziollrfxroabfhadygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgo\n",
"sgubujztzwkzvztitssxxxwzanfmddfqvv\n",
"sxtburpzskucowowebgrbovhadrrayamuwypmmxhscrujkmcgvyinp\n",
"oh\n",
"urigreuzpxnej\n",
"smdfafbyehdylhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqijxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"rhh\n",
"eswpaclodzcwhgixhpyzvhdwsgneqidanbzdzszquefh\n",
"vlhrpzezawyolhbmvxbwhtjustdbqggexmzxyieihjlelvwjosmkwesfjmramsikhkupzvfgezmrqzudjcalpjacmhykhgfhrjx\n",
"rafcaanqytfclvfdegak\n",
"mcjehdiygkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vasvvnpymtgjirnzuynluluvmgpquskuaafwogeztfnvybblajvuuvfomtifeuzpikjrolzeeoftv\n",
"fpellxwskyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokydjoexnvi\n",
"qwbdfzfylckctudyjlyrtmvbidfatdoqfmrfshsqqmhzohhsczscvwzpwyoyswhktjlykumhvaounpzwpxcspxwlgt\n",
"wjweqcrqfuollfvfbiyriijovweg\n",
"zhdouqfmlkenjzdijxdfxnlegxeuvhelo\n",
"qpbjwzwgdzmeluheirjrvzrhbmagfsjdgvzgwumjtjzecsfkrfqjasssrhhtgdqqfydlmrktlgfc\n",
"vbpfgjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"temnownneghnrujforif\n",
"hsfcfvameeupldgvchmogrvwxrvsmnwxxkxoawwodtsahqvehlcw\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoickarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"zwlunigqnhrwirkvufqwrnwcnkqqonebrwzcshcbqqwkjxhymjjeakuzjettebciadjlkbfp\n",
"ecsdicrznvglwggrdbrvehwzaenzjutjydhvimtqegweurpxtjkmpcznshtrvotkvrghxhacjkedidqqzrduzad\n",
"yhbtzfppwcycxqjpqdfmjnhwaogyuaxamwxpnrdrnqsgdyfvxu\n",
"gwntwbpj\n",
"zcinitufxoldnokacdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpbcbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"arcoaeozyeawbveoxpmafxxzdjldsielp\n",
"vujtrrpshinkskgyknlcfckmqdrwtklkzlyipmetjvaqxdsslkskschbalmdhzsdrrjmxdltbtnxbh\n",
"qagzrqjomdwhagkhrjahhxkieijyten\n",
"sbkydrscoojychxchqsuciperfroumenelgiyiwlqfwximrgdbyvkmacy\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhklkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"tpnwfmfsibnccvdwjvzviyvjfljupinfigfunyff\n",
"lxxwbkrjgnqjwsnflfnsdyxihmlspgivirazsbveztnkuzpaxtygidniflyjheejelnjyjvgkgvdqks\n",
"xninyvkuvakfbs\n",
"cpvftiwgyvnlmbkadiafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsqhtwmdlpjwzyafckrqrdduonkgo\n",
"yocxrzspinchmhtmqo\n",
"qbkjsdwpahdbbohggbclfcufqelnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzli\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhysnmadtnyn\n",
"ptkyaxycecpbrjnvxcjtbqiocqcswnmicxbvhdsptbxyxswbw\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkhpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoqupggaqajuzonrpzihbsogjfsrrypbiphehonyhohsbybnnukqebopppa\n",
"gavaihhamfolcndgytcsgucqdqngxkrlovpthvteacmmthoglxu\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpaikixmumkhfbjiswmvzbtiyifbx\n",
"dbdokywnpqnotfrhdbrzmuyoxfdtrgrzcccninbtmoqvxfatcqg\n",
"ppcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqugykyu\n",
"qordzrdiknsympdrkgapjxokbldorpnmnpucmwakklmqenpmkom\n",
"wqfldgihuxfktzanyycluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjrlcalffq\n",
"oacwxipdfcoabhkwxqdbtowiekpnflnqhlrkustgzryvws\n",
"fjuldpuejgmggvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"nueyoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"dwnabdqqvymexmjcfopnhbxpxplmrbbkxhhiehn\n",
"qojblasgfgybxsvjtkaopkyqygcvjsmlicxkxxmvzqlbgwvpenfmyzfzoqeyayughbvznpujdvubpxsriryuogdzevstfzqa\n",
"pezt\n",
"lnpdosnbeumubvk\n",
"wnemlgppz\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmbzhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdffomjlzpnduulukszqnnwxvxbvxyzmleocmofwclmzz\n",
"zwsyhtlgeibufdmxfyiryjppxjyrhzkrsagonoql\n",
"xczm\n",
"atqxcplpcsezujaslffblgkajkwexyjfzabogmubwzsmyenntto\n",
"kmtk\n",
"bcrzbavz\n",
"rqwnkpvvousdfhclcobkybdkh\n",
"vnxgrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efqk\n",
"ckntpdcgt\n",
"ojevpnkrxibyjvxk\n",
"udmpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagynhbvepbpn\n",
"drvzznznvrzskftnuhvvzxcalwrtxmdza\n",
"miylobfdpaqpvoyvmmznuwhhgxknrfkniswsiidnieddklbblvquw\n",
"xzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhhbdlnwmtjgtdgziollrfxroabfradygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgp\n",
"vvqfddmfnazwxxxsstitzvzkwztzjubugs\n",
"sxtburpzskucowowebgrbovhadrryyamuwapmmxhscrujkmcgvyinp\n",
"nh\n",
"urigreuzpxnek\n",
"smdfafbyehdxlhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqikxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"hhr\n",
"eswpaclodzcwhgixhpyzvhdwsgnqqidanbzdzszeuefh\n",
"xjrhfghkyhmcajplacjduzqrmzegfvzpukhkismarmjfsewkmsojwvleljhieiyxzmxeggqbdtsujthwbxvmbhloywazezprhlv\n",
"rafcaanqytfclvfdegal\n",
"mcjehdiyfkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vtfoeezlorjkipzuefitmofvuuvjalbbyvnftzegowfaauksuqpgmvululnyuznrijgtmypnvvsav\n",
"fpellxwrkyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokxdjoexnvi\n",
"tglwxpscxpwzpnuoavhmukyljtkhwsyoywpzwvcszcshhozhmqqshsfrmfqodtafdibvmtryljydutckclyfzfdbwq\n",
"wjweqcrqfuollfvfbiyriijovwef\n",
"zhdouqfmlkenjzdijxdfxnlegxetvhelo\n",
"vbpfhjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"etmnownneghnrujforif\n",
"wclhevqhastdowwaoxkxxwnmsvrxwvrgomhcvgdlpueemavfcfsh\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoibkarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"pfbkljdaicbettejzukaejjmyhxjkwqqbchsczwrbenoqqkncwnrwqfuvkriwrhnqginulwz\n",
"dazudrzqqdidekjcahxhgrvktovrthsnzcpmkjtxpruewgeqtmivhdyjtujzneazwhevrbdrggwlgvnzrcidsce\n",
"uxvfydgsqnrdrnpxwmaxauygoawhnjmfdqpjqxcycwppfztbhy\n",
"gvntwbpj\n",
"zcinitufxoldnokbcdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpacbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"aqcoaeozyeawbveoxpmafxxzdjldsielp\n",
"hbxntbtldxmjrrdszhdmlabhcsksklssdxqavjtempiylzklktwrdqmkcfclnkygksknihsprrtjuv\n",
"qagzrqjomdwhagkhrjanhxkieijyteh\n",
"ycamkvybdgrmixwfqlwiyiglenemuorfrepicusqhcxhcyjoocsrdykbs\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhjlkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"ffynufgifnipujlfjvyivzvjwdvccnbisfmfwnpt\n",
"skqdvgkgvjyjnlejeehjylfindigytxapzukntzevbszarivigpslmhixydsnflfnswjqngjrkbwxxl\n",
"xnjnyvkuvakfbs\n",
"cpvftiwgyvnlmbkadhafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsahtwmdlpjwzyqfckrqrdduonkgo\n",
"yocxrzsoinchmhtmqo\n",
"lbkjsdwpahdbbohggbclfcufqeqnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzki\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhxsnmadtnyn\n",
"wbwsxyxbtpsdhvbxcimnwscqcoiqbtjcxvnjrbpcecyxayktp\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkgpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoquphgaqajuzonrpzihbsogjfsrrypbiphehonyhogsbybnnukqebopppa\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpajkixmumkhfbjiswmvzbtiyifbx\n",
"gqctafxvqomtbninccczrgrtdfxoyumzrbdhrftonqpnwykodbd\n",
"opcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqufykyu\n",
"qordzrdiknsympdrkgapjxokblporpnmnducmwakklmqenpmkom\n",
"wqfldgihuxfktyanyzcluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjqlcalffq\n",
"swvyrzgtsukrlhqnlfnpkeiwotbdqxwkhbaocfdpixwcao\n",
"fjuldpuejgmgfvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"yiaodao\n",
"sepenkvlus\n",
"wjrzbmm\n",
"kkhlqebfcnquwbzwodogxcmdcjcjgejsjpstakttxkrjbaaeomreeuuadaoyeun\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxwkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"oezt\n",
"dwnabdqqvyjexmmcfopnhbxpxplmrbbkxhhiehn\n",
"lnpdosnbeumtbvk\n",
"wnemmgppz\n",
"zqzlnnuwcfufeujygtczfakhcpqbtxtejrbgoodychwpzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmazhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lqonogasrkzhryjxppjyriyfxmdfubiehlthyswz\n",
"zcxm\n",
"wtqxcplpcsezujaslffblgkajkwexyjfzabogmubazsmyenntto\n",
"kltk\n"
],
"output": [
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n"
]
} | 2CODEFORCES
|
236_A. Boy or Girl_37929 | Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network.
But yesterday, he came to see "her" in the real world and found out "she" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.
This is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.
Input
The first line contains a non-empty string, that contains only lowercase English letters — the user name. This string contains at most 100 letters.
Output
If it is a female by our hero's method, print "CHAT WITH HER!" (without the quotes), otherwise, print "IGNORE HIM!" (without the quotes).
Examples
Input
wjmzbmr
Output
CHAT WITH HER!
Input
xiaodao
Output
IGNORE HIM!
Input
sevenkplus
Output
CHAT WITH HER!
Note
For the first example. There are 6 distinct characters in "wjmzbmr". These characters are: "w", "j", "m", "z", "b", "r". So wjmzbmr is a female and you should print "CHAT WITH HER!". | import java.util.ArrayList;
import java.util.Scanner;
public class main {
public static void main(String[] args) {
// TODO Auto-generated method stub
String word,finalWord;
Scanner input = new Scanner(System.in);
ArrayList <Boolean> check = new ArrayList<Boolean>();
word = input.nextLine();
finalWord = word.substring(0,1);
for(int i=1 ; i<word.length() ; i++){
char c = word.charAt(i);
for(int j=0 ; j<finalWord.length() ; j++){
if(c == finalWord.charAt(j)){
check.add(false);
}else{
check.add(true);
}
}
if(check.contains(false)){
}else{
finalWord += c;
}
check.clear();
}
if(finalWord.length()%2 == 0){
System.out.println("CHAT WITH HER!");
}else{
System.out.println("IGNORE HIM!");
}
}
}
| 4JAVA
| {
"input": [
"xiaodao\n",
"sevenkplus\n",
"wjmzbmr\n",
"nuezoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxxkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"pezu\n",
"nheihhxkbbrmlpxpxbhnpofcjmxemyvqqdbanwd\n",
"lnpdosnceumubvk\n",
"wnemlgppy\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdphdahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqzgfmbzhezbfaqeywgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdxfomjlzpnduulukszqnnwfvxbvxyzmleocmofwclmzz\n",
"lqonogasrkzhryjxppjyriyfxmdfubieglthyswz\n",
"xczn\n",
"ottnneymszwbumgobazfjyxewkjakglbfflsajuzescplpcxqta\n",
"kmsk\n",
"acrzbavz\n",
"hkdbykboclchfdsuovvpknwqr\n",
"wpxbxzfhtdecetpljcrvpjjnllosdqirnkzesiqeukbedkayqx\n",
"vnxhrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efrk\n",
"tgcdptnkc\n",
"ojjvpnkrxibyevxk\n",
"udlpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagnnhbvepbpy\n",
"drvzznznvrzskftnrhvvzxcalwutxmdza\n",
"wuqvlbblkddeindiiswsinkfrnkxghhwunzmmvyovpqapdfbolyim\n",
"yzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhrbdlnwmtjgtdgziollrfxroabfhadygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgo\n",
"sgubujztzwkzvztitssxxxwzanfmddfqvv\n",
"sxtburpzskucowowebgrbovhadrrayamuwypmmxhscrujkmcgvyinp\n",
"oh\n",
"urigreuzpxnej\n",
"smdfafbyehdylhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqijxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"rhh\n",
"eswpaclodzcwhgixhpyzvhdwsgneqidanbzdzszquefh\n",
"vlhrpzezawyolhbmvxbwhtjustdbqggexmzxyieihjlelvwjosmkwesfjmramsikhkupzvfgezmrqzudjcalpjacmhykhgfhrjx\n",
"rafcaanqytfclvfdegak\n",
"mcjehdiygkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vasvvnpymtgjirnzuynluluvmgpquskuaafwogeztfnvybblajvuuvfomtifeuzpikjrolzeeoftv\n",
"fpellxwskyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokydjoexnvi\n",
"qwbdfzfylckctudyjlyrtmvbidfatdoqfmrfshsqqmhzohhsczscvwzpwyoyswhktjlykumhvaounpzwpxcspxwlgt\n",
"wjweqcrqfuollfvfbiyriijovweg\n",
"zhdouqfmlkenjzdijxdfxnlegxeuvhelo\n",
"qpbjwzwgdzmeluheirjrvzrhbmagfsjdgvzgwumjtjzecsfkrfqjasssrhhtgdqqfydlmrktlgfc\n",
"vbpfgjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"temnownneghnrujforif\n",
"hsfcfvameeupldgvchmogrvwxrvsmnwxxkxoawwodtsahqvehlcw\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoickarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"zwlunigqnhrwirkvufqwrnwcnkqqonebrwzcshcbqqwkjxhymjjeakuzjettebciadjlkbfp\n",
"ecsdicrznvglwggrdbrvehwzaenzjutjydhvimtqegweurpxtjkmpcznshtrvotkvrghxhacjkedidqqzrduzad\n",
"yhbtzfppwcycxqjpqdfmjnhwaogyuaxamwxpnrdrnqsgdyfvxu\n",
"gwntwbpj\n",
"zcinitufxoldnokacdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpbcbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"arcoaeozyeawbveoxpmafxxzdjldsielp\n",
"vujtrrpshinkskgyknlcfckmqdrwtklkzlyipmetjvaqxdsslkskschbalmdhzsdrrjmxdltbtnxbh\n",
"qagzrqjomdwhagkhrjahhxkieijyten\n",
"sbkydrscoojychxchqsuciperfroumenelgiyiwlqfwximrgdbyvkmacy\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhklkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"tpnwfmfsibnccvdwjvzviyvjfljupinfigfunyff\n",
"lxxwbkrjgnqjwsnflfnsdyxihmlspgivirazsbveztnkuzpaxtygidniflyjheejelnjyjvgkgvdqks\n",
"xninyvkuvakfbs\n",
"cpvftiwgyvnlmbkadiafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsqhtwmdlpjwzyafckrqrdduonkgo\n",
"yocxrzspinchmhtmqo\n",
"qbkjsdwpahdbbohggbclfcufqelnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzli\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhysnmadtnyn\n",
"ptkyaxycecpbrjnvxcjtbqiocqcswnmicxbvhdsptbxyxswbw\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkhpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoqupggaqajuzonrpzihbsogjfsrrypbiphehonyhohsbybnnukqebopppa\n",
"gavaihhamfolcndgytcsgucqdqngxkrlovpthvteacmmthoglxu\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpaikixmumkhfbjiswmvzbtiyifbx\n",
"dbdokywnpqnotfrhdbrzmuyoxfdtrgrzcccninbtmoqvxfatcqg\n",
"ppcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqugykyu\n",
"qordzrdiknsympdrkgapjxokbldorpnmnpucmwakklmqenpmkom\n",
"wqfldgihuxfktzanyycluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjrlcalffq\n",
"oacwxipdfcoabhkwxqdbtowiekpnflnqhlrkustgzryvws\n",
"fjuldpuejgmggvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"nueyoadauueermoeaabjrkxttkatspjsjegjcjcdmcxgodowzbwuqncfbeqlhkk\n",
"dwnabdqqvymexmjcfopnhbxpxplmrbbkxhhiehn\n",
"qojblasgfgybxsvjtkaopkyqygcvjsmlicxkxxmvzqlbgwvpenfmyzfzoqeyayughbvznpujdvubpxsriryuogdzevstfzqa\n",
"pezt\n",
"lnpdosnbeumubvk\n",
"wnemlgppz\n",
"zqzlnnuwcfufwujygtczfakhcpqbtxtejrbgoodychepzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmbzhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lggvdmulrsvtuagoavstuyufhypdffomjlzpnduulukszqnnwxvxbvxyzmleocmofwclmzz\n",
"zwsyhtlgeibufdmxfyiryjppxjyrhzkrsagonoql\n",
"xczm\n",
"atqxcplpcsezujaslffblgkajkwexyjfzabogmubwzsmyenntto\n",
"kmtk\n",
"bcrzbavz\n",
"rqwnkpvvousdfhclcobkybdkh\n",
"vnxgrweyvhqufpfywdwftoyrfgrhxuamqhblkvdpxmgvphcbeeqbqssresjifwyzgfhurmamhkwupymuomak\n",
"efqk\n",
"ckntpdcgt\n",
"ojevpnkrxibyjvxk\n",
"udmpagtpq\n",
"gogbxfeqylxoummvgxpkoqzsmobasesxbqjjktqbwqxeiaagynhbvepbpn\n",
"drvzznznvrzskftnuhvvzxcalwrtxmdza\n",
"miylobfdpaqpvoyvmmznuwhhgxknrfkniswsiidnieddklbblvquw\n",
"xzlzmesxdttfcztooypjztlgxwcr\n",
"znicjjgijhhbdlnwmtjgtdgziollrfxroabfradygnomodaembllreorlyhnehijfyjbfxucazellblegyfrzuraogadj\n",
"mnmbupgp\n",
"vvqfddmfnazwxxxsstitzvzkwztzjubugs\n",
"sxtburpzskucowowebgrbovhadrryyamuwapmmxhscrujkmcgvyinp\n",
"nh\n",
"urigreuzpxnek\n",
"smdfafbyehdxlhaleevhoggiurdgeleaxkeqdixyfztkuqsculgslheqfafxyghyuibdgiuwrdxfcitojxika\n",
"zjurevbytijifnpfuyswfchdzelxheboruwjqikxcucylysmwtiqsqqhktexcynquvcwhbjsipy\n",
"hhr\n",
"eswpaclodzcwhgixhpyzvhdwsgnqqidanbzdzszeuefh\n",
"xjrhfghkyhmcajplacjduzqrmzegfvzpukhkismarmjfsewkmsojwvleljhieiyxzmxeggqbdtsujthwbxvmbhloywazezprhlv\n",
"rafcaanqytfclvfdegal\n",
"mcjehdiyfkbmrbfjqwpwxidbdfelifwhstaxdapigbymmsgrhnzsdjhsqchl\n",
"vtfoeezlorjkipzuefitmofvuuvjalbbyvnftzegowfaauksuqpgmvululnyuznrijgtmypnvvsav\n",
"fpellxwrkyekoyvrfnuf\n",
"wvfgnfrzabgibzxhzsojskmnlmrokxdjoexnvi\n",
"tglwxpscxpwzpnuoavhmukyljtkhwsyoywpzwvcszcshhozhmqqshsfrmfqodtafdibvmtryljydutckclyfzfdbwq\n",
"wjweqcrqfuollfvfbiyriijovwef\n",
"zhdouqfmlkenjzdijxdfxnlegxetvhelo\n",
"vbpfhjqnhfazmvtkpjrdasfhsuxnpiepxfrzvoh\n",
"etmnownneghnrujforif\n",
"wclhevqhastdowwaoxkxxwnmsvrxwvrgomhcvgdlpueemavfcfsh\n",
"vmzxgacicvweclaodrunmjnfwtimceetsaoibkarqyrkdghcmyjgmtgsqastcktyrjgvjqimdc\n",
"pfbkljdaicbettejzukaejjmyhxjkwqqbchsczwrbenoqqkncwnrwqfuvkriwrhnqginulwz\n",
"dazudrzqqdidekjcahxhgrvktovrthsnzcpmkjtxpruewgeqtmivhdyjtujzneazwhevrbdrggwlgvnzrcidsce\n",
"uxvfydgsqnrdrnpxwmaxauygoawhnjmfdqpjqxcycwppfztbhy\n",
"gvntwbpj\n",
"zcinitufxoldnokbcdvtmdohsfdjepyfioyvclhmujiqwvmudbfjzxjfqqxjmoiyxrfsbvseawwoyynn\n",
"kxqthadqesbpgpsvpacbznxpecqrzjoilpauttzlnxvaczcqwuri\n",
"aqcoaeozyeawbveoxpmafxxzdjldsielp\n",
"hbxntbtldxmjrrdszhdmlabhcsksklssdxqavjtempiylzklktwrdqmkcfclnkygksknihsprrtjuv\n",
"qagzrqjomdwhagkhrjanhxkieijyteh\n",
"ycamkvybdgrmixwfqlwiyiglenemuorfrepicusqhcxhcyjoocsrdykbs\n",
"achhcfjnnfwgoufxamcqrsontgjjhgyfzuhjlkmiwybnrlsvblnsrjqdytglipxsulpnphpjpoewvlusalsgovwnsngb\n",
"ffynufgifnipujlfjvyivzvjwdvccnbisfmfwnpt\n",
"skqdvgkgvjyjnlejeehjylfindigytxapzukntzevbszarivigpslmhixydsnflfnswjqngjrkbwxxl\n",
"xnjnyvkuvakfbs\n",
"cpvftiwgyvnlmbkadhafddpgfpvhqqvuehkypqjsoibpiudfvpkhzlfrykc\n",
"xiwntnheuitbtqxrmzvxmieldudakogealwrpygbxsbluhsahtwmdlpjwzyqfckrqrdduonkgo\n",
"yocxrzsoinchmhtmqo\n",
"lbkjsdwpahdbbohggbclfcufqeqnojoehsxxkr\n",
"ubvhyaebyxoghakajqrpqpctwbrfqzki\n",
"yufkkfwyhhvcjntsgsvpzbhqtmtgyxifqoewmuplphykmptfdebjxuaxigomjtwgtljwdjhjernkitifbomifbhxsnmadtnyn\n",
"wbwsxyxbtpsdhvbxcimnwscqcoiqbtjcxvnjrbpcecyxayktp\n",
"pjqxhvxkyeqqvyuujxhmbspatvrckhhkfloottuybjivkkgpyivcighxumavrxzxslfpggnwbtalmhysyfllznphzia\n",
"zioixjibuhrzyrbzqcdjbbhhdmpgmqykixcxoquphgaqajuzonrpzihbsogjfsrrypbiphehonyhogsbybnnukqebopppa\n",
"qsxxuoynwtebujwpxwpajitiwxaxwgbcylxneqiebzfphugwkftpajkixmumkhfbjiswmvzbtiyifbx\n",
"gqctafxvqomtbninccczrgrtdfxoyumzrbdhrftonqpnwykodbd\n",
"opcpbnhwoizajrl\n",
"stjvyfrfowopwfjdveduedqylerqufykyu\n",
"qordzrdiknsympdrkgapjxokblporpnmnducmwakklmqenpmkom\n",
"wqfldgihuxfktyanyzcluzhtewmwvnawqlfoavuguhygqrrxtstxwouuzzsryjqtfqo\n",
"ndormkufcrkxlihdhmcehzoimcfhqsmombnfjqlcalffq\n",
"swvyrzgtsukrlhqnlfnpkeiwotbdqxwkhbaocfdpixwcao\n",
"fjuldpuejgmgfvvigkwdyzytfxzwdlofrpifqpdnhfyroginqaufwgjcbgshyyruwhofctsdaisqpjxqjmtpp\n",
"yiaodao\n",
"sepenkvlus\n",
"wjrzbmm\n",
"kkhlqebfcnquwbzwodogxcmdcjcjgejsjpstakttxkrjbaaeomreeuuadaoyeun\n",
"aqzftsvezdgouyrirsxpbuvdjupnzvbhguyayeqozfzymfnepvwgblqzvmxwkxcilmsjvcgyqykpoaktjvsxbygfgsalbjoq\n",
"oezt\n",
"dwnabdqqvyjexmmcfopnhbxpxplmrbbkxhhiehn\n",
"lnpdosnbeumtbvk\n",
"wnemmgppz\n",
"zqzlnnuwcfufeujygtczfakhcpqbtxtejrbgoodychwpzdpheahtxyfpmlrycyicqthsgm\n",
"swdqsnzmzmsyvktukaoyqsqwgfmazhezbfaqeyzgwizrwjyzquaahucjchegknqaioliqd\n",
"lqonogasrkzhryjxppjyriyfxmdfubiehlthyswz\n",
"zcxm\n",
"wtqxcplpcsezujaslffblgkajkwexyjfzabogmubazsmyenntto\n",
"kltk\n"
],
"output": [
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"CHAT WITH HER!\n",
"IGNORE HIM!\n",
"IGNORE HIM!\n"
]
} | 2CODEFORCES
|
260_D. Black and White Tree_37930 | The board has got a painted tree graph, consisting of n nodes. Let us remind you that a non-directed graph is called a tree if it is connected and doesn't contain any cycles.
Each node of the graph is painted black or white in such a manner that there aren't two nodes of the same color, connected by an edge. Each edge contains its value written on it as a non-negative integer.
A bad boy Vasya came up to the board and wrote number sv near each node v — the sum of values of all edges that are incident to this node. Then Vasya removed the edges and their values from the board.
Your task is to restore the original tree by the node colors and numbers sv.
Input
The first line of the input contains a single integer n (2 ≤ n ≤ 105) — the number of nodes in the tree. Next n lines contain pairs of space-separated integers ci, si (0 ≤ ci ≤ 1, 0 ≤ si ≤ 109), where ci stands for the color of the i-th vertex (0 is for white, 1 is for black), and si represents the sum of values of the edges that are incident to the i-th vertex of the tree that is painted on the board.
Output
Print the description of n - 1 edges of the tree graph. Each description is a group of three integers vi, ui, wi (1 ≤ vi, ui ≤ n, vi ≠ ui, 0 ≤ wi ≤ 109), where vi and ui — are the numbers of the nodes that are connected by the i-th edge, and wi is its value. Note that the following condition must fulfill cvi ≠ cui.
It is guaranteed that for any input data there exists at least one graph that meets these data. If there are multiple solutions, print any of them. You are allowed to print the edges in any order. As you print the numbers, separate them with spaces.
Examples
Input
3
1 3
1 2
0 5
Output
3 1 3
3 2 2
Input
6
1 0
0 3
1 8
0 2
0 3
0 0
Output
2 3 3
5 3 3
4 3 2
1 6 0
2 1 0 | #!/usr/bin/python2.7
def main():
n = int(raw_input())
b = []
w = []
lb = lw = 0
for i in range(1, n+1):
c, x = map(int, raw_input().split() )
if c:
b.append([i, x])
lb += 1
else:
w.append([i, x])
lw += 1
i = 0
j = 0
while i<lb and j<lw:
if b[i][1]<w[j][1]:
print b[i][0], w[j][0], b[i][1]
w[j][1] -= b[i][1]
i += 1
else:
print b[i][0], w[j][0], w[j][1]
b[i][1] -= w[j][1]
j += 1
while i<lb-1:
i += 1
print b[i][0], w[lw-1][0], 0
while j<lw-1:
j += 1
print b[lb-1][0], w[j][0], 0
if __name__ == '__main__':
main()
| 1Python2
| {
"input": [
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"3\n1 3\n1 2\n0 5\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"50\n1 574339\n0 409333\n0 330634\n0 420557\n0 323095\n0 63399\n0 69999\n1 82396\n1 90197\n0 265793\n0 65065\n1 38496\n1 43632\n1 95792\n1 61780\n1 87623\n1 31246\n0 48483\n1 76824\n1 81693\n1 66004\n1 72826\n1 146477\n1 12359\n1 27042\n1 12542\n0 81514\n0 28986\n1 73958\n1 8219\n0 5679\n0 77936\n1 892\n0 69776\n1 71921\n1 86390\n0 47969\n1 51544\n0 22463\n1 69975\n1 80092\n1 90894\n0 56989\n1 79786\n0 24301\n1 72558\n1 73728\n0 24482\n1 8467\n1 66761\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"5\n0 0\n0 0\n0 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"10\n0 24\n1 164\n0 206\n0 45\n1 110\n0 66\n1 59\n1 92\n0 152\n1 68\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"6\n0 0\n0 0\n0 0\n1 0\n1 0\n1 0\n",
"2\n0 0\n1 0\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"4\n1 0\n1 0\n0 0\n0 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"9\n0 3\n1 8\n0 2\n0 3\n1 0\n1 0\n1 0\n1 0\n1 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"7\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"5\n0 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 0\n1 0\n0 0\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 1\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 31\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 2\n0 0\n",
"5\n0 0\n0 0\n0 0\n0 -1\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 82\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 0\n1 0\n",
"2\n0 -1\n1 -1\n",
"5\n1 0\n0 0\n0 0\n1 0\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 2\n0 1\n",
"7\n0 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 2\n0 5\n",
"5\n1 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 -1\n1 0\n0 0\n1 0\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 1\n0 0\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 1\n1 0\n",
"5\n1 0\n0 0\n1 0\n1 0\n0 0\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 4\n0 5\n",
"6\n0 0\n0 1\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"5\n1 0\n1 0\n1 0\n1 0\n0 0\n",
"6\n1 1\n1 2\n1 1\n0 1\n0 4\n0 1\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 1\n0 0\n0 0\n",
"6\n0 0\n0 2\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 138\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"6\n1 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 7\n0 2\n0 2\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 4\n0 1\n",
"6\n0 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n"
],
"output": [
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"3 2 2\n3 1 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"31 33 892\n31 30 4787\n39 30 3432\n39 49 8467\n39 24 10564\n45 24 1795\n45 26 12542\n45 25 9964\n48 25 17078\n48 17 7404\n28 17 23842\n28 12 5144\n37 12 33352\n37 13 14617\n18 13 29015\n18 38 19468\n43 38 32076\n43 15 24913\n6 15 36867\n6 21 26532\n11 21 39472\n11 50 25593\n34 50 41168\n34 40 28608\n7 40 41367\n7 35 28632\n32 35 43289\n32 46 34647\n27 46 37911\n27 22 43603\n10 22 29223\n10 47 73728\n10 29 73958\n10 19 76824\n10 44 12060\n5 44 67726\n5 41 80092\n5 20 81693\n5 8 82396\n5 36 11188\n3 36 75202\n3 16 87623\n3 9 90197\n3 42 77612\n2 42 13282\n2 14 95792\n2 23 146477\n2 1 153782\n4 1 420557\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"1 5 0\n2 5 0\n3 5 0\n4 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 7 24\n4 7 35\n4 10 10\n6 10 58\n6 8 8\n9 8 84\n9 5 68\n3 5 42\n3 2 164\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 0\n",
"1 2 0\n3 2 0\n3 4 0\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"3 1 0\n4 1 0\n4 2 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"1 2 0\n3 2 0\n3 4 0\n",
"2 1 0\n3 1 0\n4 1 0\n5 1 0\n",
"3 5 0\n3 6 0\n3 7 0\n3 8 0\n3 9 0\n3 2 2\n1 2 3\n4 2 3\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"3 1 0\n4 1 0\n5 1 0\n6 1 0\n7 1 0\n7 2 0\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n",
"3 1 0\n3 2 0\n3 4 0\n",
"6 1 -1\n4 1 1\n4 3 1\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 16 7\n18 16 32\n18 11 5\n8 11 36\n8 13 3\n14 13 42\n14 10 3\n20 10 56\n20 12 14\n7 12 59\n7 3 19\n19 3 55\n19 4 40\n1 4 48\n1 5 90\n1 6 124\n",
"1 2 0\n3 2 0\n3 4 0\n",
"6 1 0\n4 1 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 11 7\n18 11 34\n18 13 3\n8 13 39\n14 13 3\n14 10 42\n20 10 17\n20 16 53\n7 16 12\n7 12 66\n19 12 7\n19 3 74\n19 4 14\n1 4 74\n1 5 90\n1 6 124\n",
"1 3 0\n6 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 24\n18 11 13\n8 11 28\n8 10 11\n14 10 45\n20 10 3\n20 16 65\n20 12 2\n7 12 71\n7 3 7\n19 3 67\n19 4 28\n1 4 60\n1 5 90\n1 6 124\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 5 -1\n1 5 0\n2 5 0\n3 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 25 16\n23 25 29\n27 25 10\n27 28 23\n30 28 37\n30 29 4\n18 29 44\n17 29 18\n17 20 36\n8 20 46\n8 15 22\n10 15 76\n13 15 21\n13 4 55\n12 4 80\n21 4 3\n21 5 81\n22 5 72\n22 11 18\n1 11 110\n9 11 28\n9 16 108\n6 16 91\n6 2 55\n3 2 169\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 -1\n",
"2 1 0\n3 1 0\n5 1 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"1 2 0\n3 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n",
"3 1 1\n3 2 2\n",
"2 1 0\n3 1 0\n3 4 0\n3 5 0\n",
"3 1 -1\n3 2 0\n3 4 0\n",
"6 3 -1\n1 3 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n20 10 29\n20 16 41\n7 16 24\n7 12 54\n19 12 19\n19 3 74\n19 4 2\n1 4 86\n1 5 90\n1 6 124\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n5 3 1\n4 3 2\n",
"1 4 0\n2 4 0\n3 4 0\n3 6 0\n3 5 1\n",
"2 1 0\n5 1 0\n5 3 0\n5 4 0\n",
"1 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n7 3 0\n",
"3 1 1\n3 2 4\n",
"6 3 -1\n1 3 0\n2 3 1\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n7 10 29\n7 16 49\n19 16 16\n19 12 73\n19 3 6\n20 3 68\n20 4 50\n1 4 38\n1 5 90\n1 6 124\n",
"5 1 0\n5 2 0\n5 3 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 3 1\n5 3 0\n5 2 2\n",
"1 2 0\n4 2 0\n6 2 0\n7 2 0\n5 2 0\n5 3 0\n",
"6 3 -1\n1 3 0\n2 3 2\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n19 10 29\n19 16 65\n19 12 1\n20 12 72\n20 3 46\n7 3 28\n7 4 88\n7 5 22\n1 5 68\n1 6 124\n",
"6 1 -1\n4 1 1\n4 3 1\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n"
]
} | 2CODEFORCES
|
260_D. Black and White Tree_37931 | The board has got a painted tree graph, consisting of n nodes. Let us remind you that a non-directed graph is called a tree if it is connected and doesn't contain any cycles.
Each node of the graph is painted black or white in such a manner that there aren't two nodes of the same color, connected by an edge. Each edge contains its value written on it as a non-negative integer.
A bad boy Vasya came up to the board and wrote number sv near each node v — the sum of values of all edges that are incident to this node. Then Vasya removed the edges and their values from the board.
Your task is to restore the original tree by the node colors and numbers sv.
Input
The first line of the input contains a single integer n (2 ≤ n ≤ 105) — the number of nodes in the tree. Next n lines contain pairs of space-separated integers ci, si (0 ≤ ci ≤ 1, 0 ≤ si ≤ 109), where ci stands for the color of the i-th vertex (0 is for white, 1 is for black), and si represents the sum of values of the edges that are incident to the i-th vertex of the tree that is painted on the board.
Output
Print the description of n - 1 edges of the tree graph. Each description is a group of three integers vi, ui, wi (1 ≤ vi, ui ≤ n, vi ≠ ui, 0 ≤ wi ≤ 109), where vi and ui — are the numbers of the nodes that are connected by the i-th edge, and wi is its value. Note that the following condition must fulfill cvi ≠ cui.
It is guaranteed that for any input data there exists at least one graph that meets these data. If there are multiple solutions, print any of them. You are allowed to print the edges in any order. As you print the numbers, separate them with spaces.
Examples
Input
3
1 3
1 2
0 5
Output
3 1 3
3 2 2
Input
6
1 0
0 3
1 8
0 2
0 3
0 0
Output
2 3 3
5 3 3
4 3 2
1 6 0
2 1 0 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed() {
long long a = rng();
return a;
}
int n;
vector<pair<int, int> > val[3];
struct muchii {
int a, b, c;
};
muchii v[100002];
int nr = 0;
int drop[100002];
struct cmp {
bool operator()(pair<int, int> a, pair<int, int> b) {
return drop[a.second] < drop[b.second];
}
};
priority_queue<pair<int, int>, vector<pair<int, int> >, cmp> d;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int un = 0, ze = 0;
for (int i = 1; i <= n; ++i) {
int a, b;
cin >> a >> b;
drop[i] = b;
val[a].push_back({b, i});
}
for (int i = 0; i <= 1; ++i) {
sort(val[i].begin(), val[i].end());
reverse(val[i].begin(), val[i].end());
}
d.push({0, val[0][0].second});
int a = 1;
int b = 0;
int edg = 0;
while (!d.empty()) {
pair<int, int> x = d.top();
d.pop();
int nul = (drop[x.second] == 0);
if (x.first == 0) {
if (b == val[1].size()) continue;
int xx = min(drop[x.second], drop[val[1][b].second]);
v[++edg] = {x.second, val[1][b].second, xx};
drop[x.second] -= xx;
drop[val[1][b].second] -= xx;
d.push({1, val[1][b].second});
++b;
d.push({0, x.second});
} else {
if (a == val[0].size()) continue;
int xx = min(drop[x.second], drop[val[0][a].second]);
v[++edg] = {x.second, val[0][a].second, xx};
drop[x.second] -= xx;
drop[val[0][a].second] -= xx;
d.push({0, val[0][a].second});
++a;
d.push({1, x.second});
}
}
for (int i = 1; i < n; ++i)
cout << v[i].a << " " << v[i].b << " " << v[i].c << '\n';
return 0;
}
| 2C++
| {
"input": [
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"3\n1 3\n1 2\n0 5\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"50\n1 574339\n0 409333\n0 330634\n0 420557\n0 323095\n0 63399\n0 69999\n1 82396\n1 90197\n0 265793\n0 65065\n1 38496\n1 43632\n1 95792\n1 61780\n1 87623\n1 31246\n0 48483\n1 76824\n1 81693\n1 66004\n1 72826\n1 146477\n1 12359\n1 27042\n1 12542\n0 81514\n0 28986\n1 73958\n1 8219\n0 5679\n0 77936\n1 892\n0 69776\n1 71921\n1 86390\n0 47969\n1 51544\n0 22463\n1 69975\n1 80092\n1 90894\n0 56989\n1 79786\n0 24301\n1 72558\n1 73728\n0 24482\n1 8467\n1 66761\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"5\n0 0\n0 0\n0 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"10\n0 24\n1 164\n0 206\n0 45\n1 110\n0 66\n1 59\n1 92\n0 152\n1 68\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"6\n0 0\n0 0\n0 0\n1 0\n1 0\n1 0\n",
"2\n0 0\n1 0\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"4\n1 0\n1 0\n0 0\n0 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"9\n0 3\n1 8\n0 2\n0 3\n1 0\n1 0\n1 0\n1 0\n1 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"7\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"5\n0 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 0\n1 0\n0 0\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 1\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 31\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 2\n0 0\n",
"5\n0 0\n0 0\n0 0\n0 -1\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 82\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 0\n1 0\n",
"2\n0 -1\n1 -1\n",
"5\n1 0\n0 0\n0 0\n1 0\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 2\n0 1\n",
"7\n0 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 2\n0 5\n",
"5\n1 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 -1\n1 0\n0 0\n1 0\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 1\n0 0\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 1\n1 0\n",
"5\n1 0\n0 0\n1 0\n1 0\n0 0\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 4\n0 5\n",
"6\n0 0\n0 1\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"5\n1 0\n1 0\n1 0\n1 0\n0 0\n",
"6\n1 1\n1 2\n1 1\n0 1\n0 4\n0 1\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 1\n0 0\n0 0\n",
"6\n0 0\n0 2\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 138\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"6\n1 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 7\n0 2\n0 2\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 4\n0 1\n",
"6\n0 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n"
],
"output": [
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"3 2 2\n3 1 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"31 33 892\n31 30 4787\n39 30 3432\n39 49 8467\n39 24 10564\n45 24 1795\n45 26 12542\n45 25 9964\n48 25 17078\n48 17 7404\n28 17 23842\n28 12 5144\n37 12 33352\n37 13 14617\n18 13 29015\n18 38 19468\n43 38 32076\n43 15 24913\n6 15 36867\n6 21 26532\n11 21 39472\n11 50 25593\n34 50 41168\n34 40 28608\n7 40 41367\n7 35 28632\n32 35 43289\n32 46 34647\n27 46 37911\n27 22 43603\n10 22 29223\n10 47 73728\n10 29 73958\n10 19 76824\n10 44 12060\n5 44 67726\n5 41 80092\n5 20 81693\n5 8 82396\n5 36 11188\n3 36 75202\n3 16 87623\n3 9 90197\n3 42 77612\n2 42 13282\n2 14 95792\n2 23 146477\n2 1 153782\n4 1 420557\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"1 5 0\n2 5 0\n3 5 0\n4 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 7 24\n4 7 35\n4 10 10\n6 10 58\n6 8 8\n9 8 84\n9 5 68\n3 5 42\n3 2 164\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 0\n",
"1 2 0\n3 2 0\n3 4 0\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"3 1 0\n4 1 0\n4 2 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"1 2 0\n3 2 0\n3 4 0\n",
"2 1 0\n3 1 0\n4 1 0\n5 1 0\n",
"3 5 0\n3 6 0\n3 7 0\n3 8 0\n3 9 0\n3 2 2\n1 2 3\n4 2 3\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"3 1 0\n4 1 0\n5 1 0\n6 1 0\n7 1 0\n7 2 0\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n",
"3 1 0\n3 2 0\n3 4 0\n",
"6 1 -1\n4 1 1\n4 3 1\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 16 7\n18 16 32\n18 11 5\n8 11 36\n8 13 3\n14 13 42\n14 10 3\n20 10 56\n20 12 14\n7 12 59\n7 3 19\n19 3 55\n19 4 40\n1 4 48\n1 5 90\n1 6 124\n",
"1 2 0\n3 2 0\n3 4 0\n",
"6 1 0\n4 1 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 11 7\n18 11 34\n18 13 3\n8 13 39\n14 13 3\n14 10 42\n20 10 17\n20 16 53\n7 16 12\n7 12 66\n19 12 7\n19 3 74\n19 4 14\n1 4 74\n1 5 90\n1 6 124\n",
"1 3 0\n6 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 24\n18 11 13\n8 11 28\n8 10 11\n14 10 45\n20 10 3\n20 16 65\n20 12 2\n7 12 71\n7 3 7\n19 3 67\n19 4 28\n1 4 60\n1 5 90\n1 6 124\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 5 -1\n1 5 0\n2 5 0\n3 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 25 16\n23 25 29\n27 25 10\n27 28 23\n30 28 37\n30 29 4\n18 29 44\n17 29 18\n17 20 36\n8 20 46\n8 15 22\n10 15 76\n13 15 21\n13 4 55\n12 4 80\n21 4 3\n21 5 81\n22 5 72\n22 11 18\n1 11 110\n9 11 28\n9 16 108\n6 16 91\n6 2 55\n3 2 169\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 -1\n",
"2 1 0\n3 1 0\n5 1 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"1 2 0\n3 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n",
"3 1 1\n3 2 2\n",
"2 1 0\n3 1 0\n3 4 0\n3 5 0\n",
"3 1 -1\n3 2 0\n3 4 0\n",
"6 3 -1\n1 3 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n20 10 29\n20 16 41\n7 16 24\n7 12 54\n19 12 19\n19 3 74\n19 4 2\n1 4 86\n1 5 90\n1 6 124\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n5 3 1\n4 3 2\n",
"1 4 0\n2 4 0\n3 4 0\n3 6 0\n3 5 1\n",
"2 1 0\n5 1 0\n5 3 0\n5 4 0\n",
"1 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n7 3 0\n",
"3 1 1\n3 2 4\n",
"6 3 -1\n1 3 0\n2 3 1\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n7 10 29\n7 16 49\n19 16 16\n19 12 73\n19 3 6\n20 3 68\n20 4 50\n1 4 38\n1 5 90\n1 6 124\n",
"5 1 0\n5 2 0\n5 3 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 3 1\n5 3 0\n5 2 2\n",
"1 2 0\n4 2 0\n6 2 0\n7 2 0\n5 2 0\n5 3 0\n",
"6 3 -1\n1 3 0\n2 3 2\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n19 10 29\n19 16 65\n19 12 1\n20 12 72\n20 3 46\n7 3 28\n7 4 88\n7 5 22\n1 5 68\n1 6 124\n",
"6 1 -1\n4 1 1\n4 3 1\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n"
]
} | 2CODEFORCES
|
260_D. Black and White Tree_37932 | The board has got a painted tree graph, consisting of n nodes. Let us remind you that a non-directed graph is called a tree if it is connected and doesn't contain any cycles.
Each node of the graph is painted black or white in such a manner that there aren't two nodes of the same color, connected by an edge. Each edge contains its value written on it as a non-negative integer.
A bad boy Vasya came up to the board and wrote number sv near each node v — the sum of values of all edges that are incident to this node. Then Vasya removed the edges and their values from the board.
Your task is to restore the original tree by the node colors and numbers sv.
Input
The first line of the input contains a single integer n (2 ≤ n ≤ 105) — the number of nodes in the tree. Next n lines contain pairs of space-separated integers ci, si (0 ≤ ci ≤ 1, 0 ≤ si ≤ 109), where ci stands for the color of the i-th vertex (0 is for white, 1 is for black), and si represents the sum of values of the edges that are incident to the i-th vertex of the tree that is painted on the board.
Output
Print the description of n - 1 edges of the tree graph. Each description is a group of three integers vi, ui, wi (1 ≤ vi, ui ≤ n, vi ≠ ui, 0 ≤ wi ≤ 109), where vi and ui — are the numbers of the nodes that are connected by the i-th edge, and wi is its value. Note that the following condition must fulfill cvi ≠ cui.
It is guaranteed that for any input data there exists at least one graph that meets these data. If there are multiple solutions, print any of them. You are allowed to print the edges in any order. As you print the numbers, separate them with spaces.
Examples
Input
3
1 3
1 2
0 5
Output
3 1 3
3 2 2
Input
6
1 0
0 3
1 8
0 2
0 3
0 0
Output
2 3 3
5 3 3
4 3 2
1 6 0
2 1 0 | n = int(input())
white, black = [], []
for i in range(n):
color, weightSum = map(int, input().split())
if color == 0:
white.append([weightSum, i+1])
else :
black.append([weightSum, i+1])
#white.sort()
#black.sort()
wc,bc, wl, bl, edges = 0 , 0, len(white), len(black), []
while wc < wl and bc < bl:
weight = white[wc][0] - black[bc][0]
edges.append([white[wc][1], black[bc][1], min(white[wc][0], black[bc][0])])
#print([ wc, bc ,white[wc][1], black[bc][1], min(white[wc][0], black[bc][0])])
if weight > 0 or (weight == 0 and wl - wc < bl - bc):
white[wc][0]-= black[bc][0]
bc += 1
else:
black[bc][0] -= white[wc][0]
wc+=1
#print([wc, bc])
print("\n".join(map("{0[0]} {0[1]} {0[2]}".format, edges)))
| 3Python3
| {
"input": [
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"3\n1 3\n1 2\n0 5\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"50\n1 574339\n0 409333\n0 330634\n0 420557\n0 323095\n0 63399\n0 69999\n1 82396\n1 90197\n0 265793\n0 65065\n1 38496\n1 43632\n1 95792\n1 61780\n1 87623\n1 31246\n0 48483\n1 76824\n1 81693\n1 66004\n1 72826\n1 146477\n1 12359\n1 27042\n1 12542\n0 81514\n0 28986\n1 73958\n1 8219\n0 5679\n0 77936\n1 892\n0 69776\n1 71921\n1 86390\n0 47969\n1 51544\n0 22463\n1 69975\n1 80092\n1 90894\n0 56989\n1 79786\n0 24301\n1 72558\n1 73728\n0 24482\n1 8467\n1 66761\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"5\n0 0\n0 0\n0 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"10\n0 24\n1 164\n0 206\n0 45\n1 110\n0 66\n1 59\n1 92\n0 152\n1 68\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"6\n0 0\n0 0\n0 0\n1 0\n1 0\n1 0\n",
"2\n0 0\n1 0\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"4\n1 0\n1 0\n0 0\n0 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"9\n0 3\n1 8\n0 2\n0 3\n1 0\n1 0\n1 0\n1 0\n1 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"7\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"5\n0 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 0\n1 0\n0 0\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 1\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 31\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 2\n0 0\n",
"5\n0 0\n0 0\n0 0\n0 -1\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 82\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 0\n1 0\n",
"2\n0 -1\n1 -1\n",
"5\n1 0\n0 0\n0 0\n1 0\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 2\n0 1\n",
"7\n0 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 2\n0 5\n",
"5\n1 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 -1\n1 0\n0 0\n1 0\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 1\n0 0\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 1\n1 0\n",
"5\n1 0\n0 0\n1 0\n1 0\n0 0\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 4\n0 5\n",
"6\n0 0\n0 1\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"5\n1 0\n1 0\n1 0\n1 0\n0 0\n",
"6\n1 1\n1 2\n1 1\n0 1\n0 4\n0 1\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 1\n0 0\n0 0\n",
"6\n0 0\n0 2\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 138\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"6\n1 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 7\n0 2\n0 2\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 4\n0 1\n",
"6\n0 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n"
],
"output": [
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"3 2 2\n3 1 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"31 33 892\n31 30 4787\n39 30 3432\n39 49 8467\n39 24 10564\n45 24 1795\n45 26 12542\n45 25 9964\n48 25 17078\n48 17 7404\n28 17 23842\n28 12 5144\n37 12 33352\n37 13 14617\n18 13 29015\n18 38 19468\n43 38 32076\n43 15 24913\n6 15 36867\n6 21 26532\n11 21 39472\n11 50 25593\n34 50 41168\n34 40 28608\n7 40 41367\n7 35 28632\n32 35 43289\n32 46 34647\n27 46 37911\n27 22 43603\n10 22 29223\n10 47 73728\n10 29 73958\n10 19 76824\n10 44 12060\n5 44 67726\n5 41 80092\n5 20 81693\n5 8 82396\n5 36 11188\n3 36 75202\n3 16 87623\n3 9 90197\n3 42 77612\n2 42 13282\n2 14 95792\n2 23 146477\n2 1 153782\n4 1 420557\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"1 5 0\n2 5 0\n3 5 0\n4 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 7 24\n4 7 35\n4 10 10\n6 10 58\n6 8 8\n9 8 84\n9 5 68\n3 5 42\n3 2 164\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 0\n",
"1 2 0\n3 2 0\n3 4 0\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"3 1 0\n4 1 0\n4 2 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"1 2 0\n3 2 0\n3 4 0\n",
"2 1 0\n3 1 0\n4 1 0\n5 1 0\n",
"3 5 0\n3 6 0\n3 7 0\n3 8 0\n3 9 0\n3 2 2\n1 2 3\n4 2 3\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"3 1 0\n4 1 0\n5 1 0\n6 1 0\n7 1 0\n7 2 0\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n",
"3 1 0\n3 2 0\n3 4 0\n",
"6 1 -1\n4 1 1\n4 3 1\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 16 7\n18 16 32\n18 11 5\n8 11 36\n8 13 3\n14 13 42\n14 10 3\n20 10 56\n20 12 14\n7 12 59\n7 3 19\n19 3 55\n19 4 40\n1 4 48\n1 5 90\n1 6 124\n",
"1 2 0\n3 2 0\n3 4 0\n",
"6 1 0\n4 1 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 11 7\n18 11 34\n18 13 3\n8 13 39\n14 13 3\n14 10 42\n20 10 17\n20 16 53\n7 16 12\n7 12 66\n19 12 7\n19 3 74\n19 4 14\n1 4 74\n1 5 90\n1 6 124\n",
"1 3 0\n6 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 24\n18 11 13\n8 11 28\n8 10 11\n14 10 45\n20 10 3\n20 16 65\n20 12 2\n7 12 71\n7 3 7\n19 3 67\n19 4 28\n1 4 60\n1 5 90\n1 6 124\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 5 -1\n1 5 0\n2 5 0\n3 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 25 16\n23 25 29\n27 25 10\n27 28 23\n30 28 37\n30 29 4\n18 29 44\n17 29 18\n17 20 36\n8 20 46\n8 15 22\n10 15 76\n13 15 21\n13 4 55\n12 4 80\n21 4 3\n21 5 81\n22 5 72\n22 11 18\n1 11 110\n9 11 28\n9 16 108\n6 16 91\n6 2 55\n3 2 169\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 -1\n",
"2 1 0\n3 1 0\n5 1 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"1 2 0\n3 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n",
"3 1 1\n3 2 2\n",
"2 1 0\n3 1 0\n3 4 0\n3 5 0\n",
"3 1 -1\n3 2 0\n3 4 0\n",
"6 3 -1\n1 3 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n20 10 29\n20 16 41\n7 16 24\n7 12 54\n19 12 19\n19 3 74\n19 4 2\n1 4 86\n1 5 90\n1 6 124\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n5 3 1\n4 3 2\n",
"1 4 0\n2 4 0\n3 4 0\n3 6 0\n3 5 1\n",
"2 1 0\n5 1 0\n5 3 0\n5 4 0\n",
"1 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n7 3 0\n",
"3 1 1\n3 2 4\n",
"6 3 -1\n1 3 0\n2 3 1\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n7 10 29\n7 16 49\n19 16 16\n19 12 73\n19 3 6\n20 3 68\n20 4 50\n1 4 38\n1 5 90\n1 6 124\n",
"5 1 0\n5 2 0\n5 3 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 3 1\n5 3 0\n5 2 2\n",
"1 2 0\n4 2 0\n6 2 0\n7 2 0\n5 2 0\n5 3 0\n",
"6 3 -1\n1 3 0\n2 3 2\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n19 10 29\n19 16 65\n19 12 1\n20 12 72\n20 3 46\n7 3 28\n7 4 88\n7 5 22\n1 5 68\n1 6 124\n",
"6 1 -1\n4 1 1\n4 3 1\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n"
]
} | 2CODEFORCES
|
260_D. Black and White Tree_37933 | The board has got a painted tree graph, consisting of n nodes. Let us remind you that a non-directed graph is called a tree if it is connected and doesn't contain any cycles.
Each node of the graph is painted black or white in such a manner that there aren't two nodes of the same color, connected by an edge. Each edge contains its value written on it as a non-negative integer.
A bad boy Vasya came up to the board and wrote number sv near each node v — the sum of values of all edges that are incident to this node. Then Vasya removed the edges and their values from the board.
Your task is to restore the original tree by the node colors and numbers sv.
Input
The first line of the input contains a single integer n (2 ≤ n ≤ 105) — the number of nodes in the tree. Next n lines contain pairs of space-separated integers ci, si (0 ≤ ci ≤ 1, 0 ≤ si ≤ 109), where ci stands for the color of the i-th vertex (0 is for white, 1 is for black), and si represents the sum of values of the edges that are incident to the i-th vertex of the tree that is painted on the board.
Output
Print the description of n - 1 edges of the tree graph. Each description is a group of three integers vi, ui, wi (1 ≤ vi, ui ≤ n, vi ≠ ui, 0 ≤ wi ≤ 109), where vi and ui — are the numbers of the nodes that are connected by the i-th edge, and wi is its value. Note that the following condition must fulfill cvi ≠ cui.
It is guaranteed that for any input data there exists at least one graph that meets these data. If there are multiple solutions, print any of them. You are allowed to print the edges in any order. As you print the numbers, separate them with spaces.
Examples
Input
3
1 3
1 2
0 5
Output
3 1 3
3 2 2
Input
6
1 0
0 3
1 8
0 2
0 3
0 0
Output
2 3 3
5 3 3
4 3 2
1 6 0
2 1 0 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Map.Entry;
import java.util.NavigableMap;
import java.util.TreeMap;
public class BlackWhiteTree {
public static BufferedReader in;
public static PrintWriter out;
public static void main(String[] args) throws IOException {
in = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWriter(System.out);
solve();
out.close();
}
static void debug(Object... os) {
out.println(Arrays.deepToString(os));
}
private static void solve() throws IOException {
int n = Integer.parseInt(in.readLine());
NavigableMap<Integer, List<Integer>> black = new TreeMap<Integer, List<Integer>>();
int blackSize = 0;
int whiteSize = 0;
NavigableMap<Integer, List<Integer>> white = new TreeMap<Integer, List<Integer>>();
for (int i = 1; i <= n; i++) {
String[] line = in.readLine().split(" ");
String color = line[0];
if (color.equals("0")) {
add(white, Integer.parseInt(line[1]), i);
whiteSize++;
} else {
add(black, Integer.parseInt(line[1]), i);
blackSize++;
}
}
while (blackSize + whiteSize > 2) {
if (blackSize > 1)
if (insert(black, white))
blackSize--;
if (whiteSize > 1)
if (insert(white, black))
whiteSize--;
}
int index1 = black.firstEntry().getValue().get(0);
int index2 = white.firstEntry().getValue().get(0);
int value = black.firstKey();
out.println(index1 + " " + index2 + " " + value);
}
private static boolean insert(NavigableMap<Integer, List<Integer>> source,
NavigableMap<Integer, List<Integer>> target) {
Entry<Integer, List<Integer>> entrySource = source.firstEntry();
Entry<Integer, List<Integer>> entryTarget = target
.ceilingEntry(entrySource.getKey());
if (null == entryTarget)
return false;
int indexSource = entrySource.getValue().get(
entrySource.getValue().size() - 1);
int indexTarget = entryTarget.getValue().get(
entryTarget.getValue().size() - 1);
out.println(indexSource + " " + indexTarget + " "
+ entrySource.getKey());
delete(entrySource, source);
add(target, entryTarget.getKey() - entrySource.getKey(), entryTarget
.getValue().get(entryTarget.getValue().size() - 1));
delete(entryTarget, target);
return true;
}
private static void delete(Entry<Integer, List<Integer>> entry,
NavigableMap<Integer, List<Integer>> map) {
if (entry.getValue().size() == 1) {
map.remove(entry.getKey());
} else {
entry.getValue().remove(entry.getValue().size() - 1);
}
}
private static void add(NavigableMap<Integer, List<Integer>> map,
int value, int index) {
if (map.containsKey(value)) {
map.get(value).add(index);
} else {
List<Integer> list = new ArrayList<Integer>();
list.add(index);
map.put(value, list);
}
}
} | 4JAVA
| {
"input": [
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"3\n1 3\n1 2\n0 5\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"50\n1 574339\n0 409333\n0 330634\n0 420557\n0 323095\n0 63399\n0 69999\n1 82396\n1 90197\n0 265793\n0 65065\n1 38496\n1 43632\n1 95792\n1 61780\n1 87623\n1 31246\n0 48483\n1 76824\n1 81693\n1 66004\n1 72826\n1 146477\n1 12359\n1 27042\n1 12542\n0 81514\n0 28986\n1 73958\n1 8219\n0 5679\n0 77936\n1 892\n0 69776\n1 71921\n1 86390\n0 47969\n1 51544\n0 22463\n1 69975\n1 80092\n1 90894\n0 56989\n1 79786\n0 24301\n1 72558\n1 73728\n0 24482\n1 8467\n1 66761\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"5\n0 0\n0 0\n0 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"10\n0 24\n1 164\n0 206\n0 45\n1 110\n0 66\n1 59\n1 92\n0 152\n1 68\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"6\n0 0\n0 0\n0 0\n1 0\n1 0\n1 0\n",
"2\n0 0\n1 0\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n1 0\n0 0\n1 0\n0 0\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"4\n1 0\n1 0\n0 0\n0 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 43\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"5\n1 11\n0 9\n1 4\n0 4\n0 2\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 0\n",
"20\n0 569\n1 328\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 0\n1 0\n",
"5\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"9\n0 3\n1 8\n0 2\n0 3\n1 0\n1 0\n1 0\n1 0\n1 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 1\n0 1\n",
"7\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"5\n0 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 0\n1 0\n0 0\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 39\n0 24\n0 37\n0 95\n0 70\n",
"4\n0 0\n1 0\n0 1\n1 0\n",
"6\n1 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 0\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 41\n1 73\n1 31\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 2\n0 0\n",
"5\n0 0\n0 0\n0 0\n0 -1\n1 0\n",
"30\n0 110\n1 263\n0 169\n1 138\n1 153\n0 146\n0 7\n0 68\n0 136\n0 76\n1 156\n0 80\n0 76\n1 43\n1 119\n1 199\n0 54\n0 44\n0 7\n1 82\n0 84\n0 90\n0 29\n0 22\n1 55\n0 23\n0 33\n1 60\n1 66\n0 41\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 0\n1 0\n",
"2\n0 -1\n1 -1\n",
"5\n1 0\n0 0\n0 0\n1 0\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 2\n0 1\n",
"7\n0 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 2\n0 5\n",
"5\n1 0\n0 0\n0 0\n1 0\n1 0\n",
"4\n1 -1\n1 0\n0 0\n1 0\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 70\n",
"6\n0 0\n0 3\n1 8\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 8\n0 2\n0 1\n0 0\n",
"6\n0 0\n0 0\n0 1\n1 0\n1 1\n1 0\n",
"5\n1 0\n0 0\n1 0\n1 0\n0 0\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 0\n0 0\n0 0\n",
"3\n1 1\n1 4\n0 5\n",
"6\n0 0\n0 1\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 78\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"5\n1 0\n1 0\n1 0\n1 0\n0 0\n",
"6\n1 1\n1 2\n1 1\n0 1\n0 4\n0 1\n",
"7\n0 0\n1 0\n1 0\n0 0\n0 1\n0 0\n0 0\n",
"6\n0 0\n0 2\n1 8\n0 2\n0 3\n0 -1\n",
"20\n0 569\n1 21\n1 74\n1 88\n1 90\n1 124\n0 138\n0 39\n1 9\n1 59\n1 53\n1 73\n1 45\n0 45\n0 13\n1 65\n0 24\n0 37\n0 95\n0 118\n",
"6\n1 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n",
"6\n0 0\n0 0\n1 7\n0 2\n0 2\n0 0\n",
"6\n1 1\n1 1\n1 1\n0 1\n0 4\n0 1\n",
"6\n0 0\n0 3\n1 9\n0 2\n0 2\n0 -1\n"
],
"output": [
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"3 2 2\n3 1 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"31 33 892\n31 30 4787\n39 30 3432\n39 49 8467\n39 24 10564\n45 24 1795\n45 26 12542\n45 25 9964\n48 25 17078\n48 17 7404\n28 17 23842\n28 12 5144\n37 12 33352\n37 13 14617\n18 13 29015\n18 38 19468\n43 38 32076\n43 15 24913\n6 15 36867\n6 21 26532\n11 21 39472\n11 50 25593\n34 50 41168\n34 40 28608\n7 40 41367\n7 35 28632\n32 35 43289\n32 46 34647\n27 46 37911\n27 22 43603\n10 22 29223\n10 47 73728\n10 29 73958\n10 19 76824\n10 44 12060\n5 44 67726\n5 41 80092\n5 20 81693\n5 8 82396\n5 36 11188\n3 36 75202\n3 16 87623\n3 9 90197\n3 42 77612\n2 42 13282\n2 14 95792\n2 23 146477\n2 1 153782\n4 1 420557\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"1 5 0\n2 5 0\n3 5 0\n4 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 7 24\n4 7 35\n4 10 10\n6 10 58\n6 8 8\n9 8 84\n9 5 68\n3 5 42\n3 2 164\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 0\n",
"1 2 0\n3 2 0\n3 4 0\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"1 2 0\n3 2 0\n5 2 0\n5 4 0\n5 6 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"3 1 0\n4 1 0\n4 2 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 20 16\n23 20 27\n23 25 2\n27 25 33\n30 25 20\n30 28 21\n18 28 39\n18 29 5\n17 29 54\n8 29 7\n8 15 61\n10 15 58\n10 4 18\n13 4 76\n12 4 44\n12 5 36\n21 5 84\n22 5 33\n22 11 57\n1 11 99\n1 16 11\n9 16 136\n6 16 52\n6 2 94\n3 2 169\n",
"5 3 2\n4 3 2\n4 1 2\n2 1 9\n",
"6 1 0\n4 1 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 16 4\n17 16 24\n18 16 11\n18 11 26\n8 11 15\n8 13 24\n14 13 21\n14 10 24\n20 10 35\n20 12 35\n7 12 38\n7 3 40\n19 3 34\n19 4 61\n1 4 27\n1 5 90\n1 6 124\n1 2 328\n",
"1 2 0\n3 2 0\n3 4 0\n",
"2 1 0\n3 1 0\n4 1 0\n5 1 0\n",
"3 5 0\n3 6 0\n3 7 0\n3 8 0\n3 9 0\n3 2 2\n1 2 3\n4 2 3\n",
"4 1 1\n5 1 0\n5 2 1\n6 2 0\n6 3 1\n",
"3 1 0\n4 1 0\n5 1 0\n6 1 0\n7 1 0\n7 2 0\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n",
"3 1 0\n3 2 0\n3 4 0\n",
"6 1 -1\n4 1 1\n4 3 1\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 16 7\n18 16 32\n18 11 5\n8 11 36\n8 13 3\n14 13 42\n14 10 3\n20 10 56\n20 12 14\n7 12 59\n7 3 19\n19 3 55\n19 4 40\n1 4 48\n1 5 90\n1 6 124\n",
"1 2 0\n3 2 0\n3 4 0\n",
"6 1 0\n4 1 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 11 7\n18 11 34\n18 13 3\n8 13 39\n14 13 3\n14 10 42\n20 10 17\n20 16 53\n7 16 12\n7 12 66\n19 12 7\n19 3 74\n19 4 14\n1 4 74\n1 5 90\n1 6 124\n",
"1 3 0\n6 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 24\n18 11 13\n8 11 28\n8 10 11\n14 10 45\n20 10 3\n20 16 65\n20 12 2\n7 12 71\n7 3 7\n19 3 67\n19 4 28\n1 4 60\n1 5 90\n1 6 124\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 5 -1\n1 5 0\n2 5 0\n3 5 0\n",
"7 14 7\n19 14 7\n24 14 22\n26 14 7\n26 25 16\n23 25 29\n27 25 10\n27 28 23\n30 28 37\n30 29 4\n18 29 44\n17 29 18\n17 20 36\n8 20 46\n8 15 22\n10 15 76\n13 15 21\n13 4 55\n12 4 80\n21 4 3\n21 5 81\n22 5 72\n22 11 18\n1 11 110\n9 11 28\n9 16 108\n6 16 91\n6 2 55\n3 2 169\n",
"1 4 0\n2 4 0\n3 4 0\n3 5 0\n3 6 0\n",
"1 2 -1\n",
"2 1 0\n3 1 0\n5 1 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"1 2 0\n3 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n",
"3 1 1\n3 2 2\n",
"2 1 0\n3 1 0\n3 4 0\n3 5 0\n",
"3 1 -1\n3 2 0\n3 4 0\n",
"6 3 -1\n1 3 0\n4 3 2\n2 3 3\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n20 10 29\n20 16 41\n7 16 24\n7 12 54\n19 12 19\n19 3 74\n19 4 2\n1 4 86\n1 5 90\n1 6 124\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n5 3 1\n4 3 2\n",
"1 4 0\n2 4 0\n3 4 0\n3 6 0\n3 5 1\n",
"2 1 0\n5 1 0\n5 3 0\n5 4 0\n",
"1 2 0\n4 2 0\n5 2 0\n6 2 0\n7 2 0\n7 3 0\n",
"3 1 1\n3 2 4\n",
"6 3 -1\n1 3 0\n2 3 1\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n7 10 29\n7 16 49\n19 16 16\n19 12 73\n19 3 6\n20 3 68\n20 4 50\n1 4 38\n1 5 90\n1 6 124\n",
"5 1 0\n5 2 0\n5 3 0\n5 4 0\n",
"4 1 1\n6 1 0\n6 3 1\n5 3 0\n5 2 2\n",
"1 2 0\n4 2 0\n6 2 0\n7 2 0\n5 2 0\n5 3 0\n",
"6 3 -1\n1 3 0\n2 3 2\n4 3 2\n5 3 3\n",
"15 9 9\n15 2 4\n17 2 17\n17 13 7\n18 13 37\n8 13 1\n8 11 38\n14 11 15\n14 10 30\n19 10 29\n19 16 65\n19 12 1\n20 12 72\n20 3 46\n7 3 28\n7 4 88\n7 5 22\n1 5 68\n1 6 124\n",
"6 1 -1\n4 1 1\n4 3 1\n5 3 2\n2 3 3\n",
"1 3 0\n2 3 0\n6 3 0\n4 3 2\n5 3 2\n",
"4 1 1\n6 1 0\n6 2 1\n5 2 0\n5 3 1\n",
"6 3 -1\n1 3 0\n4 3 2\n5 3 2\n2 3 3\n"
]
} | 2CODEFORCES
|
284_D. Cow Program_37934 | Farmer John has just given the cows a program to play with! The program contains two integer variables, x and y, and performs the following operations on a sequence a1, a2, ..., an of positive integers:
1. Initially, x = 1 and y = 0. If, after any step, x ≤ 0 or x > n, the program immediately terminates.
2. The program increases both x and y by a value equal to ax simultaneously.
3. The program now increases y by ax while decreasing x by ax.
4. The program executes steps 2 and 3 (first step 2, then step 3) repeatedly until it terminates (it may never terminate). So, the sequence of executed steps may start with: step 2, step 3, step 2, step 3, step 2 and so on.
The cows are not very good at arithmetic though, and they want to see how the program works. Please help them!
You are given the sequence a2, a3, ..., an. Suppose for each i (1 ≤ i ≤ n - 1) we run the program on the sequence i, a2, a3, ..., an. For each such run output the final value of y if the program terminates or -1 if it does not terminate.
Input
The first line contains a single integer, n (2 ≤ n ≤ 2·105). The next line contains n - 1 space separated integers, a2, a3, ..., an (1 ≤ ai ≤ 109).
Output
Output n - 1 lines. On the i-th line, print the requested value when the program is run on the sequence i, a2, a3, ...an.
Please do not use 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
2 4 1
Output
3
6
8
Input
3
1 2
Output
-1
-1
Note
In the first sample
1. For i = 1, x becomes <image> and y becomes 1 + 2 = 3.
2. For i = 2, x becomes <image> and y becomes 2 + 4 = 6.
3. For i = 3, x becomes <image> and y becomes 3 + 1 + 4 = 8. | from sys import stdin,stdout
def dfs():
visit, stack = {(0, 0)}, []
cur, su, ix, ext = 1, a[0], a[0], 0
while ix > -1 and ix < n:
if mem[ix][cur]:
if mem[ix][cur] != -1:
ext = mem[ix][cur]
else:
su = -1
break
visit.add((ix, cur))
stack.append([ix, cur])
cur ^= 1
if cur:
ix += a[ix]
else:
ix -= a[ix]
if (ix, cur) in visit:
su = -1
break
# print(stack, su, ix)
while stack:
ele = stack.pop()
ext += a[ele[0]]
mem[ele[0]][ele[1]] = -1 if su == -1 else ext
return -1 if su == -1 else ext + su
rints = lambda: [int(x) for x in stdin.readline().split()]
n, a = int(input()), [0] + rints()
mem, out = [[0, 0] for _ in range(n)], []
for i in range(n - 1):
a[0] = i + 1
out.append(dfs())
stdout.write('\n'.join(map(str, out)))
| 1Python2
| {
"input": [
"3\n1 2\n",
"4\n2 4 1\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 64 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 61 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 3 1 2 2 3 3\n",
"2\n1\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"6\n2 1 2 2 3\n",
"10\n6 7 5 3 1 5 2 4 6\n",
"5\n3 2 4 2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 9 7 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"8\n7 6 2 6 2 6 6\n",
"5\n2 2 1 3\n",
"3\n1 1\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 12 14 935874687 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 36 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 44 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 3 2 3 3 3\n",
"8\n6 311942309 3 1 3 2 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 3 3\n",
"2\n2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"10\n11 7 5 3 1 5 2 4 6\n",
"5\n4 2 4 2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 52 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 9 5 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"8\n7 6 2 6 4 6 6\n",
"5\n2 1 1 3\n",
"3\n1 3\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 10 14 935874687 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 3 2 3 6 3\n",
"8\n6 311942309 3 2 3 2 2\n",
"3\n1 4\n",
"4\n2 4 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 15 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 52 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 16 5 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"5\n4 1 1 3\n",
"3\n2 1\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 28 29 27 25 23 21 19 17 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 10 14 1835437532 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 105 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 64 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 4 2 3 6 3\n",
"4\n4 4 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 67 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 1612569566 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 20 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 53 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"5\n4 1 2 3\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 28 29 27 25 23 21 19 6 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 14 7 5 3 1 8 2 4 6 8 10 10 14 1835437532 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 105 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 8 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 28 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 64 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 4 2 3 6 1\n",
"4\n5 4 2\n",
"98\n94 24 17 133 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 67 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 45 32 78 52 65 57 90 1612569566 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n2 50 62 35 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 53 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 6 3\n",
"8\n2 2 1 2 2 6 5\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 20 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 6 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 6 7\n"
],
"output": [
"-1\n-1\n",
"3\n6\n8\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n106\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n881058217\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n101\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n5\n-1\n-1\n-1\n-1\n-1\n",
"-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515\n",
"3\n-1\n-1\n-1\n-1\n",
"7\n9\n8\n-1\n-1\n-1\n-1\n-1\n-1\n",
"4\n-1\n7\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515\n",
"21\n-1\n-1\n-1\n18\n17\n16\n-1\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37\n",
"8\n8\n12\n10\n-1\n-1\n20\n",
"3\n-1\n-1\n-1\n",
"-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n650617329\n650617319\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n650617395\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n51\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n198\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n-1\n-1\n-1\n-1\n-1\n",
"7\n311942311\n-1\n311942323\n311942317\n311942321\n12\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n881058217\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"3\n",
"3\n52\n65\n45\n55\n22\n72\n397\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n427\n663\n87\n743\n487\n267\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n181\n245\n313\n385\n461\n541\n625\n713\n805\n901\n1001\n543\n109\n129\n1009\n913\n620768534\n637608076\n439\n569\n121\n515\n",
"12\n9\n8\n18\n28\n22\n26\n34\n46\n",
"5\n-1\n7\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n620768676\n87\n620768756\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n620768638\n620768726\n620768818\n620768914\n620769014\n543\n119\n129\n620769022\n620768926\n620768534\n637608076\n843\n973\n121\n515\n",
"21\n-1\n-1\n-1\n18\n17\n16\n27\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37\n",
"8\n8\n12\n10\n16\n-1\n20\n",
"3\n-1\n-1\n-1\n",
"-1\n5\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n-1\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n-1\n-1\n-1\n-1\n-1\n",
"7\n311942311\n-1\n311942315\n311942317\n-1\n12\n",
"-1\n6\n",
"3\n6\n-1\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n256\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"3\n52\n65\n45\n55\n22\n72\n397\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n427\n663\n87\n743\n487\n267\n1033\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n915\n963\n1015\n1071\n181\n245\n313\n385\n461\n541\n625\n713\n805\n901\n1001\n1089\n109\n129\n1009\n913\n620768534\n637608076\n439\n569\n121\n1061\n",
"3\n52\n65\n45\n55\n22\n72\n-1\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n-1\n620768676\n87\n620768756\n-1\n-1\n-1\n-1\n-1\n151\n111\n105\n109\n117\n129\n145\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n620768638\n620768726\n620768818\n620768914\n620769014\n-1\n119\n129\n620769022\n620768926\n620768534\n637608076\n-1\n-1\n121\n-1\n",
"21\n119\n-1\n123\n18\n17\n23\n27\n33\n29\n87\n81\n85\n93\n105\n101\n43\n67\n95\n55\n117\n37\n",
"5\n7\n-1\n11\n",
"3\n5\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n47\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n1835437552\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n128\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n116\n145\n-1\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n7\n-1\n-1\n-1\n-1\n",
"5\n6\n9\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n86\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n34\n35\n82\n57\n71\n64\n98\n1612569575\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n1612569673\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n256\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n31\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n255\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n285\n521\n87\n601\n345\n125\n891\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n773\n821\n873\n929\n181\n103\n171\n243\n319\n399\n483\n571\n663\n759\n859\n947\n109\n129\n867\n771\n620768534\n637608076\n297\n427\n121\n919\n",
"5\n7\n9\n11\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n47\n49\n48\n47\n-1\n-1\n113\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n21\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n1835437552\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n128\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n986959120\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n131\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n201\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n210\n104\n53\n90\n113\n117\n86\n50\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n116\n145\n262\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n324\n168\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n386\n186\n202\n269\n214\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n7\n18\n20\n-1\n14\n",
"6\n6\n10\n",
"95\n26\n20\n137\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n86\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n47\n35\n82\n57\n71\n64\n98\n1612569575\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n402\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n1612569673\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n316\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n338\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"3\n52\n65\n39\n55\n22\n72\n255\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n285\n521\n87\n601\n345\n125\n891\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n773\n821\n873\n929\n181\n103\n171\n243\n319\n399\n483\n571\n663\n759\n859\n947\n109\n129\n867\n771\n620768534\n637608076\n297\n427\n121\n919\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n31\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n"
]
} | 2CODEFORCES
|
284_D. Cow Program_37935 | Farmer John has just given the cows a program to play with! The program contains two integer variables, x and y, and performs the following operations on a sequence a1, a2, ..., an of positive integers:
1. Initially, x = 1 and y = 0. If, after any step, x ≤ 0 or x > n, the program immediately terminates.
2. The program increases both x and y by a value equal to ax simultaneously.
3. The program now increases y by ax while decreasing x by ax.
4. The program executes steps 2 and 3 (first step 2, then step 3) repeatedly until it terminates (it may never terminate). So, the sequence of executed steps may start with: step 2, step 3, step 2, step 3, step 2 and so on.
The cows are not very good at arithmetic though, and they want to see how the program works. Please help them!
You are given the sequence a2, a3, ..., an. Suppose for each i (1 ≤ i ≤ n - 1) we run the program on the sequence i, a2, a3, ..., an. For each such run output the final value of y if the program terminates or -1 if it does not terminate.
Input
The first line contains a single integer, n (2 ≤ n ≤ 2·105). The next line contains n - 1 space separated integers, a2, a3, ..., an (1 ≤ ai ≤ 109).
Output
Output n - 1 lines. On the i-th line, print the requested value when the program is run on the sequence i, a2, a3, ...an.
Please do not use 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
2 4 1
Output
3
6
8
Input
3
1 2
Output
-1
-1
Note
In the first sample
1. For i = 1, x becomes <image> and y becomes 1 + 2 = 3.
2. For i = 2, x becomes <image> and y becomes 2 + 4 = 6.
3. For i = 3, x becomes <image> and y becomes 3 + 1 + 4 = 8. | #include <bits/stdc++.h>
using namespace std;
using namespace std;
int n, a[300001], was[300001][3];
long long d[300001][3];
long long calc(int v, int bit) {
if (v <= 0 || v > n) return 0ll;
if (v == 1) return -1;
if (was[v][bit] == 2) return d[v][bit] = -1;
if (was[v][bit] == 1) return d[v][bit];
was[v][bit] = 2;
if (bit) {
if (calc(v + a[v], bit ? 0 : 1) != -1)
d[v][bit] = calc(v + a[v], bit ? 0 : 1) + a[v];
else
d[v][bit] = -1;
} else {
if (calc(v - a[v], bit ? 0 : 1) != -1)
d[v][bit] = calc(v - a[v], bit ? 0 : 1) + a[v];
else
d[v][bit] = -1;
}
was[v][bit] = 1;
return d[v][bit];
}
int main() {
scanf("%d", &n);
for (int i = 2; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 2; i <= n; ++i) {
if (!was[i][0]) calc(i, 0);
if (!was[i][1]) calc(i, 1);
}
for (int i = 1; i < n; i++)
if (d[i + 1][0] != -1)
cout << d[i + 1][0] + i << '\n';
else
puts("-1");
return 0;
}
| 2C++
| {
"input": [
"3\n1 2\n",
"4\n2 4 1\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 64 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 61 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 3 1 2 2 3 3\n",
"2\n1\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"6\n2 1 2 2 3\n",
"10\n6 7 5 3 1 5 2 4 6\n",
"5\n3 2 4 2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 9 7 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"8\n7 6 2 6 2 6 6\n",
"5\n2 2 1 3\n",
"3\n1 1\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 12 14 935874687 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 36 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 44 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 3 2 3 3 3\n",
"8\n6 311942309 3 1 3 2 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 3 3\n",
"2\n2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"10\n11 7 5 3 1 5 2 4 6\n",
"5\n4 2 4 2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 52 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 9 5 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"8\n7 6 2 6 4 6 6\n",
"5\n2 1 1 3\n",
"3\n1 3\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 10 14 935874687 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 3 2 3 6 3\n",
"8\n6 311942309 3 2 3 2 2\n",
"3\n1 4\n",
"4\n2 4 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 15 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 52 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 16 5 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"5\n4 1 1 3\n",
"3\n2 1\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 28 29 27 25 23 21 19 17 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 10 14 1835437532 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 105 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 64 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 4 2 3 6 3\n",
"4\n4 4 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 67 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 1612569566 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 20 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 53 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"5\n4 1 2 3\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 28 29 27 25 23 21 19 6 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 14 7 5 3 1 8 2 4 6 8 10 10 14 1835437532 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 105 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 8 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 28 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 64 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 4 2 3 6 1\n",
"4\n5 4 2\n",
"98\n94 24 17 133 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 67 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 45 32 78 52 65 57 90 1612569566 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n2 50 62 35 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 53 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 6 3\n",
"8\n2 2 1 2 2 6 5\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 20 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 6 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 6 7\n"
],
"output": [
"-1\n-1\n",
"3\n6\n8\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n106\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n881058217\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n101\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n5\n-1\n-1\n-1\n-1\n-1\n",
"-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515\n",
"3\n-1\n-1\n-1\n-1\n",
"7\n9\n8\n-1\n-1\n-1\n-1\n-1\n-1\n",
"4\n-1\n7\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515\n",
"21\n-1\n-1\n-1\n18\n17\n16\n-1\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37\n",
"8\n8\n12\n10\n-1\n-1\n20\n",
"3\n-1\n-1\n-1\n",
"-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n650617329\n650617319\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n650617395\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n51\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n198\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n-1\n-1\n-1\n-1\n-1\n",
"7\n311942311\n-1\n311942323\n311942317\n311942321\n12\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n881058217\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"3\n",
"3\n52\n65\n45\n55\n22\n72\n397\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n427\n663\n87\n743\n487\n267\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n181\n245\n313\n385\n461\n541\n625\n713\n805\n901\n1001\n543\n109\n129\n1009\n913\n620768534\n637608076\n439\n569\n121\n515\n",
"12\n9\n8\n18\n28\n22\n26\n34\n46\n",
"5\n-1\n7\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n620768676\n87\n620768756\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n620768638\n620768726\n620768818\n620768914\n620769014\n543\n119\n129\n620769022\n620768926\n620768534\n637608076\n843\n973\n121\n515\n",
"21\n-1\n-1\n-1\n18\n17\n16\n27\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37\n",
"8\n8\n12\n10\n16\n-1\n20\n",
"3\n-1\n-1\n-1\n",
"-1\n5\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n-1\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n-1\n-1\n-1\n-1\n-1\n",
"7\n311942311\n-1\n311942315\n311942317\n-1\n12\n",
"-1\n6\n",
"3\n6\n-1\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n256\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"3\n52\n65\n45\n55\n22\n72\n397\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n427\n663\n87\n743\n487\n267\n1033\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n915\n963\n1015\n1071\n181\n245\n313\n385\n461\n541\n625\n713\n805\n901\n1001\n1089\n109\n129\n1009\n913\n620768534\n637608076\n439\n569\n121\n1061\n",
"3\n52\n65\n45\n55\n22\n72\n-1\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n-1\n620768676\n87\n620768756\n-1\n-1\n-1\n-1\n-1\n151\n111\n105\n109\n117\n129\n145\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n620768638\n620768726\n620768818\n620768914\n620769014\n-1\n119\n129\n620769022\n620768926\n620768534\n637608076\n-1\n-1\n121\n-1\n",
"21\n119\n-1\n123\n18\n17\n23\n27\n33\n29\n87\n81\n85\n93\n105\n101\n43\n67\n95\n55\n117\n37\n",
"5\n7\n-1\n11\n",
"3\n5\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n47\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n1835437552\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n128\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n116\n145\n-1\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n7\n-1\n-1\n-1\n-1\n",
"5\n6\n9\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n86\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n34\n35\n82\n57\n71\n64\n98\n1612569575\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n1612569673\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n256\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n31\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n255\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n285\n521\n87\n601\n345\n125\n891\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n773\n821\n873\n929\n181\n103\n171\n243\n319\n399\n483\n571\n663\n759\n859\n947\n109\n129\n867\n771\n620768534\n637608076\n297\n427\n121\n919\n",
"5\n7\n9\n11\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n47\n49\n48\n47\n-1\n-1\n113\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n21\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n1835437552\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n128\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n986959120\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n131\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n201\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n210\n104\n53\n90\n113\n117\n86\n50\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n116\n145\n262\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n324\n168\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n386\n186\n202\n269\n214\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n7\n18\n20\n-1\n14\n",
"6\n6\n10\n",
"95\n26\n20\n137\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n86\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n47\n35\n82\n57\n71\n64\n98\n1612569575\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n402\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n1612569673\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n316\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n338\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"3\n52\n65\n39\n55\n22\n72\n255\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n285\n521\n87\n601\n345\n125\n891\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n773\n821\n873\n929\n181\n103\n171\n243\n319\n399\n483\n571\n663\n759\n859\n947\n109\n129\n867\n771\n620768534\n637608076\n297\n427\n121\n919\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n31\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n"
]
} | 2CODEFORCES
|
284_D. Cow Program_37936 | Farmer John has just given the cows a program to play with! The program contains two integer variables, x and y, and performs the following operations on a sequence a1, a2, ..., an of positive integers:
1. Initially, x = 1 and y = 0. If, after any step, x ≤ 0 or x > n, the program immediately terminates.
2. The program increases both x and y by a value equal to ax simultaneously.
3. The program now increases y by ax while decreasing x by ax.
4. The program executes steps 2 and 3 (first step 2, then step 3) repeatedly until it terminates (it may never terminate). So, the sequence of executed steps may start with: step 2, step 3, step 2, step 3, step 2 and so on.
The cows are not very good at arithmetic though, and they want to see how the program works. Please help them!
You are given the sequence a2, a3, ..., an. Suppose for each i (1 ≤ i ≤ n - 1) we run the program on the sequence i, a2, a3, ..., an. For each such run output the final value of y if the program terminates or -1 if it does not terminate.
Input
The first line contains a single integer, n (2 ≤ n ≤ 2·105). The next line contains n - 1 space separated integers, a2, a3, ..., an (1 ≤ ai ≤ 109).
Output
Output n - 1 lines. On the i-th line, print the requested value when the program is run on the sequence i, a2, a3, ...an.
Please do not use 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
2 4 1
Output
3
6
8
Input
3
1 2
Output
-1
-1
Note
In the first sample
1. For i = 1, x becomes <image> and y becomes 1 + 2 = 3.
2. For i = 2, x becomes <image> and y becomes 2 + 4 = 6.
3. For i = 3, x becomes <image> and y becomes 3 + 1 + 4 = 8. | import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class cf283b {
static int n;
static int INC = 0, DEC = 1;
static int[] v;
static Long[][] memo;
public static void main(String[] args) {
FastIO in,out;
in = out = new FastIO();
n = in.nextInt();
v = new int[n];
for(int i=1; i<n; i++) v[i] = in.nextInt();
memo = new Long[2][n];
memo[INC][0] = -1L;
memo[DEC][0] = 0L;
for(int i=1; i<n; i++) {
long ans = go(DEC,i);
if(ans != -1) ans += i;
out.println(ans);
}
out.close();
}
static long go(int dir, int pos) {
if(pos < 0 || pos >= n) return 0;
if(memo[dir][pos] != null) return memo[dir][pos];
memo[dir][pos] = -1L;
long ans = go(1-dir, pos+(dir==INC?v[pos]:-v[pos]));
if(ans != -1) ans += v[pos];
return memo[dir][pos] = ans;
}
static class FastIO extends PrintWriter {
BufferedReader br;
StringTokenizer st;
public FastIO() {
this(System.in,System.out);
}
public FastIO(InputStream in, OutputStream out) {
super(new BufferedWriter(new OutputStreamWriter(out)));
br = new BufferedReader(new InputStreamReader(in));
scanLine();
}
public void scanLine() {
try {
st = new StringTokenizer(br.readLine().trim());
} catch(Exception e) {
throw new RuntimeException(e.getMessage());
}
}
public int numTokens() {
if(!st.hasMoreTokens()) {
scanLine();
return numTokens();
}
return st.countTokens();
}
public String next() {
if(!st.hasMoreTokens()) {
scanLine();
return next();
}
return st.nextToken();
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
| 4JAVA
| {
"input": [
"3\n1 2\n",
"4\n2 4 1\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 64 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 61 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 3 1 2 2 3 3\n",
"2\n1\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"6\n2 1 2 2 3\n",
"10\n6 7 5 3 1 5 2 4 6\n",
"5\n3 2 4 2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 9 7 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"8\n7 6 2 6 2 6 6\n",
"5\n2 2 1 3\n",
"3\n1 1\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 12 14 935874687 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 36 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 44 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 3 2 3 3 3\n",
"8\n6 311942309 3 1 3 2 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 3 3\n",
"2\n2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"10\n11 7 5 3 1 5 2 4 6\n",
"5\n4 2 4 2\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 52 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 9 5 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"8\n7 6 2 6 4 6 6\n",
"5\n2 1 1 3\n",
"3\n1 3\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 10 14 935874687 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 3 2 3 6 3\n",
"8\n6 311942309 3 2 3 2 2\n",
"3\n1 4\n",
"4\n2 4 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 15 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 52 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"23\n20 1 3 3 13 11 16 5 5 3 1 7 2 4 6 8 10 12 14 16 12 5\n",
"5\n4 1 1 3\n",
"3\n2 1\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 28 29 27 25 23 21 19 17 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 10 14 1835437532 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 105 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 64 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 4 2 3 6 3\n",
"4\n4 4 2\n",
"98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 67 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 32 32 78 52 65 57 90 1612569566 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 20 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 53 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"5\n4 1 2 3\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 28 29 27 25 23 21 19 6 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"23\n11 6 21 9 13 11 14 7 5 3 1 8 2 4 6 8 10 10 14 1835437532 21 1\n",
"92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 105 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 8 18 6 63 44 52 37 5 5 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37\n",
"98\n54 88 79 67 72 6 66 71 40 1 76 14 74 8 12 88 36 72 94 97 65 28 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 64 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9\n",
"8\n4 5 4 2 3 6 1\n",
"4\n5 4 2\n",
"98\n94 24 17 133 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 67 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 71 94 77 48 74 19 96700186 5 67 867418949 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46\n",
"98\n19 45 32 78 52 65 57 90 1612569566 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 57 31 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21\n",
"71\n2 50 62 35 50 16 65 6 49 47 45 43 41 39 37 35 33 31 50 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 1 24 26 28 30 53 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 5 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 4 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 6 3\n",
"8\n2 2 1 2 2 6 5\n",
"71\n28 11 39 275858941 64 69 66 18 468038892 49 20 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 9 3 1 25 2 6 6 6 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57\n",
"8\n2 2 1 2 2 6 7\n"
],
"output": [
"-1\n-1\n",
"3\n6\n8\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n106\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n881058217\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n101\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n5\n-1\n-1\n-1\n-1\n-1\n",
"-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515\n",
"3\n-1\n-1\n-1\n-1\n",
"7\n9\n8\n-1\n-1\n-1\n-1\n-1\n-1\n",
"4\n-1\n7\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515\n",
"21\n-1\n-1\n-1\n18\n17\n16\n-1\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37\n",
"8\n8\n12\n10\n-1\n-1\n20\n",
"3\n-1\n-1\n-1\n",
"-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n650617329\n650617319\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n650617395\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n51\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n198\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n-1\n-1\n-1\n-1\n-1\n",
"7\n311942311\n-1\n311942323\n311942317\n311942321\n12\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n881058217\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"3\n",
"3\n52\n65\n45\n55\n22\n72\n397\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n427\n663\n87\n743\n487\n267\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n181\n245\n313\n385\n461\n541\n625\n713\n805\n901\n1001\n543\n109\n129\n1009\n913\n620768534\n637608076\n439\n569\n121\n515\n",
"12\n9\n8\n18\n28\n22\n26\n34\n46\n",
"5\n-1\n7\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n620768676\n87\n620768756\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n620768638\n620768726\n620768818\n620768914\n620769014\n543\n119\n129\n620769022\n620768926\n620768534\n637608076\n843\n973\n121\n515\n",
"21\n-1\n-1\n-1\n18\n17\n16\n27\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37\n",
"8\n8\n12\n10\n16\n-1\n20\n",
"3\n-1\n-1\n-1\n",
"-1\n5\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n-1\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n-1\n-1\n-1\n-1\n-1\n",
"7\n311942311\n-1\n311942315\n311942317\n-1\n12\n",
"-1\n6\n",
"3\n6\n-1\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n256\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"3\n52\n65\n45\n55\n22\n72\n397\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n427\n663\n87\n743\n487\n267\n1033\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n915\n963\n1015\n1071\n181\n245\n313\n385\n461\n541\n625\n713\n805\n901\n1001\n1089\n109\n129\n1009\n913\n620768534\n637608076\n439\n569\n121\n1061\n",
"3\n52\n65\n45\n55\n22\n72\n-1\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n-1\n620768676\n87\n620768756\n-1\n-1\n-1\n-1\n-1\n151\n111\n105\n109\n117\n129\n145\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n620768638\n620768726\n620768818\n620768914\n620769014\n-1\n119\n129\n620769022\n620768926\n620768534\n637608076\n-1\n-1\n121\n-1\n",
"21\n119\n-1\n123\n18\n17\n23\n27\n33\n29\n87\n81\n85\n93\n105\n101\n43\n67\n95\n55\n117\n37\n",
"5\n7\n-1\n11\n",
"3\n5\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n47\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n1835437552\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n128\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n210\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n116\n145\n-1\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n7\n-1\n-1\n-1\n-1\n",
"5\n6\n9\n",
"95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n86\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n34\n35\n82\n57\n71\n64\n98\n1612569575\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n1612569673\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n256\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n278\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n31\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n52\n65\n45\n55\n22\n72\n255\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n285\n521\n87\n601\n345\n125\n891\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n773\n821\n873\n929\n181\n103\n171\n243\n319\n399\n483\n571\n663\n759\n859\n947\n109\n129\n867\n771\n620768534\n637608076\n297\n427\n121\n919\n",
"5\n7\n9\n11\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n47\n49\n48\n47\n-1\n-1\n113\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"12\n8\n24\n13\n18\n17\n21\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n1835437552\n-1\n44\n",
"80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n128\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n986959120\n129\n577324467\n103\n85\n94\n12520617\n123\n113\n131\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n189\n194\n491073056\n259\n201\n491073064\n233\n285\n986959216\n119\n137\n97\n173\n804681680\n185\n",
"55\n90\n82\n71\n77\n-1\n73\n79\n49\n-1\n87\n26\n87\n42\n210\n104\n53\n90\n113\n117\n86\n50\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n116\n145\n262\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n324\n168\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n386\n186\n202\n269\n214\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n798374379\n207\n155\n",
"5\n7\n7\n18\n20\n-1\n14\n",
"6\n6\n10\n",
"95\n26\n20\n137\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n86\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n113\n137\n121\n93\n120\n143\n96700234\n131\n117\n867419000\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181\n186\n568562233\n850624734\n-1\n-1\n235\n249\n237\n867419092\n",
"20\n47\n35\n82\n57\n71\n64\n98\n1612569575\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n97\n956483350\n151\n126\n114\n402\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n1612569673\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n264\n960620495\n198\n95865757\n208\n173\n316\n152\n216\n-1\n240\n194\n95865775\n956483480\n208\n956483444\n904133787\n338\n272\n960620625\n968490848\n672903894\n201\n904133801\n95865799\n",
"3\n52\n65\n39\n55\n22\n72\n255\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n69\n47\n46\n45\n285\n521\n87\n601\n345\n125\n891\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n773\n821\n873\n929\n181\n103\n171\n243\n319\n399\n483\n571\n663\n759\n859\n947\n109\n129\n867\n771\n620768534\n637608076\n297\n427\n121\n919\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n",
"29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n31\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1\n",
"3\n-1\n-1\n-1\n-1\n-1\n-1\n"
]
} | 2CODEFORCES
|
309_D. Tennis Rackets_37937 | Professional sport is more than hard work. It also is the equipment, designed by top engineers. As an example, let's take tennis. Not only should you be in great shape, you also need an excellent racket! In this problem your task is to contribute to the development of tennis and to help to design a revolutionary new concept of a racket!
The concept is a triangular racket. Ant it should be not just any triangle, but a regular one. As soon as you've chosen the shape, you need to stretch the net. By the time you came the rocket had n holes drilled on each of its sides. The holes divide each side into equal n + 1 parts. At that, the m closest to each apex holes on each side are made for better ventilation only and you cannot stretch the net through them. The next revolutionary idea as to stretch the net as obtuse triangles through the holes, so that for each triangle all apexes lay on different sides. Moreover, you need the net to be stretched along every possible obtuse triangle. That's where we need your help — help us to count the number of triangles the net is going to consist of.
Two triangles are considered to be different if their pictures on the fixed at some position racket are different.
Input
The first and the only input line contains two integers n, m <image>.
Output
Print a single number — the answer to the problem.
Examples
Input
3 0
Output
9
Input
4 0
Output
24
Input
10 1
Output
210
Input
8 4
Output
0
Note
For the following picture n = 8, m = 2. White circles are the holes for ventilation, red circles — holes for net stretching. One of the possible obtuse triangles is painted red.
<image> | #include <bits/stdc++.h>
using namespace std;
int n, m;
long long ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = m + 1; i <= (n + 1) / 2; i++) {
int p = n + 1 - i;
int q = 2 * i;
for (int j = m + 1; j <= n - m; j++) {
int tmp = (p * (q - j) - 1) / (i + j);
int now = (((tmp) < (n - m)) ? tmp : n - m);
if (now <= m) break;
ans += now - m;
}
if (i == n / 2) ans = ans * 2;
}
ans = ans * 3;
printf("%I64d", ans);
return 0;
}
| 2C++
| {
"input": [
"3 0\n",
"4 0\n",
"10 1\n",
"8 4\n",
"19000 5743\n",
"50 4\n",
"500 37\n",
"20000 10000\n",
"250 16\n",
"10000 0\n",
"2 0\n",
"5123 323\n",
"1000 141\n",
"16756 4\n",
"1 0\n",
"16234 61\n",
"12334 51\n",
"23847 32\n",
"24122 587\n",
"25000 18\n",
"25000 0\n",
"23849 12\n",
"58 4\n",
"500 56\n",
"20000 10100\n",
"426 16\n",
"10001 0\n",
"7192 323\n",
"1000 90\n",
"16756 1\n",
"16234 34\n",
"20762 51\n",
"23847 44\n",
"24122 490\n",
"25000 21\n",
"25000 1\n",
"6 0\n",
"10 2\n",
"78 4\n",
"854 56\n",
"600 16\n",
"10001 1\n",
"7192 122\n",
"1000 151\n",
"16756 2\n",
"16234 32\n",
"23847 60\n",
"24122 886\n",
"25537 21\n",
"6 1\n",
"10 0\n",
"78 7\n",
"854 1\n",
"979 16\n",
"11001 1\n",
"2908 122\n",
"1100 151\n",
"22127 2\n",
"16234 44\n",
"23757 886\n",
"21910 21\n",
"113 7\n",
"1430 1\n",
"162 16\n",
"11101 1\n",
"2908 76\n",
"1100 87\n",
"22127 3\n",
"0 0\n"
],
"output": [
"9\n",
"24\n",
"210\n",
"0\n",
"42723355320\n",
"37680\n",
"40969344\n",
"0\n",
"5615358\n",
"616244609316\n",
"0\n",
"48958836510\n",
"159977052\n",
"2893984759194\n",
"0\n",
"2562574374918\n",
"1120612094406\n",
"8273206744692\n",
"7150209021150\n",
"9577113629202\n",
"9629267050260\n",
"8327896907037\n",
"65796\n",
"27785622\n",
"0\n",
"35209614\n",
"616429521276\n",
"159392893560\n",
"280200696\n",
"2897893195638\n",
"2595179690886\n",
"5413897342500\n",
"8241747036816\n",
"7386222383724\n",
"9568437873672\n",
"9626365191462\n",
"102\n",
"48\n",
"189402\n",
"221304474\n",
"107803668\n",
"615965201595\n",
"201052282950\n",
"141546306\n",
"2896590032916\n",
"2597604731172\n",
"8199912397584\n",
"6451728080970\n",
"10199734628730\n",
"18\n",
"534\n",
"131148\n",
"380119950\n",
"509236308\n",
"819889241352\n",
"10807683174\n",
"222627870\n",
"6671803764111\n",
"2583074838504\n",
"6133874809716\n",
"6435133220556\n",
"525552\n",
"1791709152\n",
"1081578\n",
"842457435852\n",
"12341655288\n",
"415767696\n",
"6669531499632\n",
"0\n"
]
} | 2CODEFORCES
|
309_D. Tennis Rackets_37938 | Professional sport is more than hard work. It also is the equipment, designed by top engineers. As an example, let's take tennis. Not only should you be in great shape, you also need an excellent racket! In this problem your task is to contribute to the development of tennis and to help to design a revolutionary new concept of a racket!
The concept is a triangular racket. Ant it should be not just any triangle, but a regular one. As soon as you've chosen the shape, you need to stretch the net. By the time you came the rocket had n holes drilled on each of its sides. The holes divide each side into equal n + 1 parts. At that, the m closest to each apex holes on each side are made for better ventilation only and you cannot stretch the net through them. The next revolutionary idea as to stretch the net as obtuse triangles through the holes, so that for each triangle all apexes lay on different sides. Moreover, you need the net to be stretched along every possible obtuse triangle. That's where we need your help — help us to count the number of triangles the net is going to consist of.
Two triangles are considered to be different if their pictures on the fixed at some position racket are different.
Input
The first and the only input line contains two integers n, m <image>.
Output
Print a single number — the answer to the problem.
Examples
Input
3 0
Output
9
Input
4 0
Output
24
Input
10 1
Output
210
Input
8 4
Output
0
Note
For the following picture n = 8, m = 2. White circles are the holes for ventilation, red circles — holes for net stretching. One of the possible obtuse triangles is painted red.
<image> | import static java.lang.System.currentTimeMillis;
import java.io.*;
import java.util.*;
public class D {
static void solve() throws IOException {
// while (true) {
// testWithVsWithout();
// if (false) {
// break;
// }
// }
// test();
int n = nextInt(), m = nextInt();
// long time = currentTimeMillis();
long answer = solve(n, m);
// System.err.println(currentTimeMillis() - time);
out.println(answer);
}
static void test() {
for (int n = 1; n < 100; n++) {
for (int m = 0; 2 * m <= n; m++) {
long got = solve(n, m);
long stup = solveStupid(n, m);
if (got != stup) {
throw new AssertionError();
}
}
}
System.err.println("pass");
}
static void testWithVsWithout() {
Random rng = new Random();
int n = rng.nextInt(32001);
while (n < 5) {
n = rng.nextInt(32001);
}
int m = rng.nextInt(n / 2);
long got = solve(n, m);
long stup = solveWithoutOptimizations(n, m);
if (got != stup) {
throw new AssertionError();
}
System.err.println("pass");
}
private static long solve(int n, int m) {
Point[] pointsLeft = new Point[n];
Point[] pointsRight = new Point[n];
for (int i = 0; i < n; i++) {
pointsLeft[i] = new Point((i + 1) * 2, (i + 1) * 2);
pointsRight[i] = new Point(4 * (n + 1) - (i + 1) * 2, (i + 1) * 2);
// pointsLeft[i] = new Point((i+1) * 0.5, (i+1) * ok);
// pointsRight[i] = new Point(n + 1 - (i+1) * 0.5, (i+1) * ok);
}
long answer = 0;
int lastSegmentThing = m;
int rightStop = n - m;
for (int leftPointId = m; leftPointId + m < n; leftPointId++) {
int segmentLeft = -1, segmentRight = -1;
int xx, yy, theirDx, theirDy;
long theirAbs, yyyy3;
{
int rightPointId = leftPointId;
xx = pointsLeft[leftPointId].x + pointsRight[rightPointId].x >> 1;
yy = pointsLeft[leftPointId].y + pointsRight[rightPointId].y >> 1;
theirDx = xx - pointsLeft[leftPointId].x;
theirDy = yy - pointsLeft[leftPointId].y;
theirAbs = (long) theirDx * theirDx + (long) theirDy * theirDy
* 3;
yyyy3 = (long) yy * yy * 3;
for (int low = lastSegmentThing; low + m < n; low++) {
long lowX = 4 * (low + 1);
long dx = xx - lowX;
long abs = dx * dx + yyyy3;
if (abs < theirAbs) {
segmentLeft = low;
break;
}
}
}
// timeFirst += currentTimeMillis();
int yyyy3i = (int) yyyy3;
int theirAbsi = (int) theirAbs;
if (segmentLeft < 0) {
break;
}
lastSegmentThing = segmentLeft;
segmentRight = n - 1 - segmentLeft;
answer += segmentRight - segmentLeft + 1;
int dx;
int yyyy3MinusTheirAbsi = yyyy3i - theirAbsi;
int curAddInt = 0;
for (int rightPointId = leftPointId + 1; rightPointId < rightStop; rightPointId++) {
--xx;
++yy;
// xx = pointsLeft[leftPointId].x + pointsRight[rightPointId].x
// >> 1;
// yy = pointsLeft[leftPointId].y + pointsRight[rightPointId].y
// >> 1;
--theirDx;
++theirDy;
// theirDx = xx - pointsLeft[leftPointId].x;
// theirDy = yy - pointsLeft[leftPointId].y;
yyyy3MinusTheirAbsi += 2 * theirDx + 1;
yyyy3MinusTheirAbsi -= 6 * theirDy - 3;
// theirAbs = theirDx * theirDx + theirDy * theirDy * 3;
yyyy3MinusTheirAbsi += 6 * yy - 3;
// if (yyyy3 > Integer.MAX_VALUE) {
// System.err.println(yyyy3);
// }
// long yyyy3 = yy * yy * 3;
// if (segmentLeft < lastLeftForThisRight[rightPointId]) {
// segmentLeft = lastLeftForThisRight[rightPointId];
// }
// if(segmentRight > lastRightForThisRight[rightPointId]) {
// segmentRight = lastRightForThisRight[rightPointId];
// }
int lowX = 4 * (segmentLeft + 1);
dx = xx - lowX;
int abs = dx * dx + yyyy3MinusTheirAbsi;
while (segmentLeft <= segmentRight) {
// if (dx * dx > Integer.MAX_VALUE) {
// System.err.println(dx * dx);
// }
if (abs < 0) {
break;
} else {
++segmentLeft;
abs -= 8 * dx - 16;
dx -= 4;
}
}
lowX = 4 * (segmentRight + 1);
dx = (xx - lowX);
abs = dx * dx + yyyy3MinusTheirAbsi;
while (segmentLeft <= segmentRight) {
if (abs < 0) {
break;
} else {
--segmentRight;
abs += 8 * dx + 16;
dx += 4;
}
}
if (segmentLeft > segmentRight) {
rightStop = rightPointId;
break;
}
curAddInt += segmentRight - segmentLeft + 1;
}
answer += 2L * curAddInt;
}
// System.err.println("time first: "+timeFirst);
// System.err.println("time second: "+timeSecond);
return answer * 3L;
}
private static long solveWithoutOptimizations(int n, int m) {
Point[] pointsLeft = new Point[n];
Point[] pointsRight = new Point[n];
for (int i = 0; i < n; i++) {
pointsLeft[i] = new Point((i + 1) * 2, (i + 1) * 2);
pointsRight[i] = new Point(4 * (n + 1) - (i + 1) * 2, (i + 1) * 2);
}
long answer = 0;
int lastSegmentThing = m;
for (int leftPointId = m; leftPointId + m < n; leftPointId++) {
int segmentLeft = -1, segmentRight = -1;
{
int rightPointId = leftPointId;
long xx = pointsLeft[leftPointId].x
+ pointsRight[rightPointId].x >> 1;
long yy = pointsLeft[leftPointId].y
+ pointsRight[rightPointId].y >> 1;
long theirDx = xx - pointsLeft[leftPointId].x;
long theirDy = yy - pointsLeft[leftPointId].y;
long theirAbs = theirDx * theirDx + (long) theirDy * theirDy
* 3;
for (int low = lastSegmentThing; low + m < n; low++) {
long lowX = 4 * (low + 1);
long dx = xx - lowX;
long abs = dx * dx + yy * yy * 3;
if (abs < theirAbs) {
segmentLeft = low;
break;
}
}
}
if (segmentLeft < 0) {
break;
}
lastSegmentThing = segmentLeft;
segmentRight = n - 1 - segmentLeft;
answer += segmentRight - segmentLeft + 1;
for (int rightPointId = leftPointId + 1; rightPointId < n - m; rightPointId++) {
long xx = pointsLeft[leftPointId].x
+ pointsRight[rightPointId].x >> 1;
long yy = pointsLeft[leftPointId].y
+ pointsRight[rightPointId].y >> 1;
long theirDx = xx - pointsLeft[leftPointId].x;
long theirDy = yy - pointsLeft[leftPointId].y;
long theirAbs = theirDx * theirDx + theirDy * theirDy * 3;
while (segmentLeft <= segmentRight) {
long lowX = 4 * (segmentLeft + 1);
long dx = xx - lowX;
long abs = dx * dx + yy * yy * 3;
if (abs < theirAbs) {
break;
} else {
++segmentLeft;
}
}
while (segmentLeft <= segmentRight) {
long lowX = 4 * (segmentRight + 1);
long dx = xx - lowX;
long abs = dx * dx + yy * yy * 3;
if (abs < theirAbs) {
break;
} else {
--segmentRight;
}
}
if (segmentLeft > segmentRight) {
break;
}
answer += 2 * (segmentRight - segmentLeft + 1);
}
}
return answer * 3L;
}
static long solveStupid(int n, int m) {
Point[] pointsLeft = new Point[n];
Point[] pointsRight = new Point[n];
// double ok = Math.sqrt(3) * 0.5;
for (int i = 0; i < n; i++) {
pointsLeft[i] = new Point((i + 1) * 2, (i + 1) * 2);
pointsRight[i] = new Point(4 * (n + 1) - (i + 1) * 2, (i + 1) * 2);
// pointsLeft[i] = new Point((i+1) * 0.5, (i+1) * ok);
// pointsRight[i] = new Point(n + 1 - (i+1) * 0.5, (i+1) * ok);
}
long answer = 0;
for (int leftPointId = m; leftPointId + m < n; leftPointId++) {
for (int rightPointId = m; rightPointId + m < n; rightPointId++) {
long xx = pointsLeft[leftPointId].x
+ pointsRight[rightPointId].x >> 1;
long yy = pointsLeft[leftPointId].y
+ pointsRight[rightPointId].y >> 1;
long theirDx = xx - pointsLeft[leftPointId].x;
long theirDy = yy - pointsLeft[leftPointId].y;
long theirAbs = theirDx * theirDx + theirDy * theirDy * 3;
for (int low = m; low + m < n; low++) {
long lowX = 4 * (low + 1);
long dx = xx - lowX;
long abs = dx * dx + yy * yy * 3;
if (abs < theirAbs) {
++answer;
}
}
}
}
return answer * 3L;
}
static class Point {
final int x, y;
public Point(int x, int y) {
this.x = x;
this.y = y;
}
}
static BufferedReader br;
static StringTokenizer st;
static PrintWriter out;
public static void main(String[] args) throws IOException {
InputStream input = System.in;
PrintStream output = System.out;
File file = new File("d.in");
if (file.exists() && file.canRead()) {
input = new FileInputStream(file);
}
br = new BufferedReader(new InputStreamReader(input));
out = new PrintWriter(output);
solve();
out.close();
}
static long nextLong() throws IOException {
return Long.parseLong(nextToken());
}
static double nextDouble() throws IOException {
return Double.parseDouble(nextToken());
}
static int nextInt() throws IOException {
return Integer.parseInt(nextToken());
}
static String nextToken() throws IOException {
while (st == null || !st.hasMoreTokens()) {
String line = br.readLine();
if (line == null) {
return null;
}
st = new StringTokenizer(line);
}
return st.nextToken();
}
}
| 4JAVA
| {
"input": [
"3 0\n",
"4 0\n",
"10 1\n",
"8 4\n",
"19000 5743\n",
"50 4\n",
"500 37\n",
"20000 10000\n",
"250 16\n",
"10000 0\n",
"2 0\n",
"5123 323\n",
"1000 141\n",
"16756 4\n",
"1 0\n",
"16234 61\n",
"12334 51\n",
"23847 32\n",
"24122 587\n",
"25000 18\n",
"25000 0\n",
"23849 12\n",
"58 4\n",
"500 56\n",
"20000 10100\n",
"426 16\n",
"10001 0\n",
"7192 323\n",
"1000 90\n",
"16756 1\n",
"16234 34\n",
"20762 51\n",
"23847 44\n",
"24122 490\n",
"25000 21\n",
"25000 1\n",
"6 0\n",
"10 2\n",
"78 4\n",
"854 56\n",
"600 16\n",
"10001 1\n",
"7192 122\n",
"1000 151\n",
"16756 2\n",
"16234 32\n",
"23847 60\n",
"24122 886\n",
"25537 21\n",
"6 1\n",
"10 0\n",
"78 7\n",
"854 1\n",
"979 16\n",
"11001 1\n",
"2908 122\n",
"1100 151\n",
"22127 2\n",
"16234 44\n",
"23757 886\n",
"21910 21\n",
"113 7\n",
"1430 1\n",
"162 16\n",
"11101 1\n",
"2908 76\n",
"1100 87\n",
"22127 3\n",
"0 0\n"
],
"output": [
"9\n",
"24\n",
"210\n",
"0\n",
"42723355320\n",
"37680\n",
"40969344\n",
"0\n",
"5615358\n",
"616244609316\n",
"0\n",
"48958836510\n",
"159977052\n",
"2893984759194\n",
"0\n",
"2562574374918\n",
"1120612094406\n",
"8273206744692\n",
"7150209021150\n",
"9577113629202\n",
"9629267050260\n",
"8327896907037\n",
"65796\n",
"27785622\n",
"0\n",
"35209614\n",
"616429521276\n",
"159392893560\n",
"280200696\n",
"2897893195638\n",
"2595179690886\n",
"5413897342500\n",
"8241747036816\n",
"7386222383724\n",
"9568437873672\n",
"9626365191462\n",
"102\n",
"48\n",
"189402\n",
"221304474\n",
"107803668\n",
"615965201595\n",
"201052282950\n",
"141546306\n",
"2896590032916\n",
"2597604731172\n",
"8199912397584\n",
"6451728080970\n",
"10199734628730\n",
"18\n",
"534\n",
"131148\n",
"380119950\n",
"509236308\n",
"819889241352\n",
"10807683174\n",
"222627870\n",
"6671803764111\n",
"2583074838504\n",
"6133874809716\n",
"6435133220556\n",
"525552\n",
"1791709152\n",
"1081578\n",
"842457435852\n",
"12341655288\n",
"415767696\n",
"6669531499632\n",
"0\n"
]
} | 2CODEFORCES
|
332_B. Maximum Absurdity_37939 | Reforms continue entering Berland. For example, during yesterday sitting the Berland Parliament approved as much as n laws (each law has been assigned a unique number from 1 to n). Today all these laws were put on the table of the President of Berland, G.W. Boosch, to be signed.
This time mr. Boosch plans to sign 2k laws. He decided to choose exactly two non-intersecting segments of integers from 1 to n of length k and sign all laws, whose numbers fall into these segments. More formally, mr. Boosch is going to choose two integers a, b (1 ≤ a ≤ b ≤ n - k + 1, b - a ≥ k) and sign all laws with numbers lying in the segments [a; a + k - 1] and [b; b + k - 1] (borders are included).
As mr. Boosch chooses the laws to sign, he of course considers the public opinion. Allberland Public Opinion Study Centre (APOSC) conducted opinion polls among the citizens, processed the results into a report and gave it to the president. The report contains the absurdity value for each law, in the public opinion. As mr. Boosch is a real patriot, he is keen on signing the laws with the maximum total absurdity. Help him.
Input
The first line contains two integers n and k (2 ≤ n ≤ 2·105, 0 < 2k ≤ n) — the number of laws accepted by the parliament and the length of one segment in the law list, correspondingly. The next line contains n integers x1, x2, ..., xn — the absurdity of each law (1 ≤ xi ≤ 109).
Output
Print two integers a, b — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments [a; a + k - 1] and [b; b + k - 1]. If there are multiple solutions, print the one with the minimum number a. If there still are multiple solutions, print the one with the minimum b.
Examples
Input
5 2
3 6 1 1 6
Output
1 4
Input
6 2
1 1 1 1 1 1
Output
1 3
Note
In the first sample mr. Boosch signs laws with numbers from segments [1;2] and [4;5]. The total absurdity of the signed laws equals 3 + 6 + 1 + 6 = 16.
In the second sample mr. Boosch signs laws with numbers from segments [1;2] and [3;4]. The total absurdity of the signed laws equals 1 + 1 + 1 + 1 = 4. | readintarray = lambda : map(int, raw_input().split(" "))
def check(s, ans, tans):
res = s[ans[0] - 1] + s[ans[1] - 1] < s[tans[0] - 1] + s[tans[1] - 1]
# print s, ans, tans
# print res
return res
n, k = readintarray()
a = readintarray()
presum = [0]
for i in a:
presum.append(presum[-1] + i)
#print presum
presumk = [presum[i] - presum[i - k]
for i in range(k,len(presum))]
#print presumk
maxpresumk = [[0,0]]
index = 0
for i in xrange(len(presumk)):
if presumk[i] > maxpresumk[-1][0]:
index = i + 1
else:
index = maxpresumk[-1][1]
maxpresumk.append(
[max(presumk[i],maxpresumk[-1][0]), index])
#print maxpresumk
ans = [1, 1 + k]
for i in xrange(k + 1,len(presumk)):
if check(presumk,ans,[maxpresumk[i + 1 - k][1], i + 1]):
ans = [maxpresumk[i + 1 - k][1], i + 1]
print ans[0], ans[1] | 1Python2
| {
"input": [
"6 2\n1 1 1 1 1 1\n",
"5 2\n3 6 1 1 6\n",
"4 1\n1 2 2 2\n",
"3 1\n547468 78578678 6467834\n",
"14 2\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n1 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 1 2 1 2\n",
"4 1\n90000 34567 90000 90001\n",
"12 3\n1 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 5\n",
"2 1\n1000000000 999999999\n",
"6 2\n1 4 1 2 5 6\n",
"6 3\n15 20 1 15 43 6\n",
"6 2\n4 4 7 1 1 7\n",
"10 4\n9 3 3 9 1 9 9 4 4 9\n",
"6 3\n1 2 2 2 1 1\n",
"4 2\n999999 8888888 7777777 666666\n",
"5 2\n98 96 98 96 96\n",
"3 1\n100 30 563\n",
"4 1\n1 1 2 2\n",
"3 1\n547468 115275900 6467834\n",
"14 3\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 0 2 1 2\n",
"12 3\n2 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 10\n",
"6 2\n1 4 1 2 5 5\n",
"10 4\n9 3 3 9 1 9 16 4 4 9\n",
"6 2\n1 1 1 1 2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 1 15 2 3 6 5 3 3 8 6\n",
"7 2\n1 2 5 5 5 5 10\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 0\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"4 1\n1 2 2 4\n",
"14 2\n2 1 2 3 1 1 2 3 1 2 2 3 2 3\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 39 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"10 4\n9 3 3 9 1 8 9 4 4 9\n",
"12 3\n2 4 1 15 2 3 6 8 3 3 8 6\n",
"4 1\n90000 34567 158303 90001\n",
"6 2\n4 4 7 1 2 7\n",
"4 2\n999999 8888888 7468339 666666\n",
"3 1\n100 30 470\n",
"5 2\n3 6 0 1 6\n",
"3 1\n547468 77851989 6467834\n",
"14 3\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n90000 61755 158303 90001\n",
"6 2\n6 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 7 9\n",
"3 1\n100 30 714\n",
"14 5\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n158880 61755 158303 90001\n",
"12 3\n2 2 1 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 5 10\n",
"6 2\n0 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 1 9\n",
"3 1\n100 30 465\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90001\n",
"12 3\n2 2 0 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 10 10\n",
"6 2\n0 1 7 1 2 7\n",
"3 1\n100 30 644\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90690\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 8 6\n",
"7 2\n2 2 5 8 5 10 10\n",
"6 2\n0 1 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 6\n",
"6 2\n0 2 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 6 3 3 16 0\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 95 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"5 1\n2 1 2 0 2\n",
"4 1\n90000 3039 90000 90001\n",
"12 3\n1 2 0 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 6 5 5\n",
"2 1\n1000000000 280956868\n",
"4 2\n999999 8888888 6813869 666666\n",
"5 2\n191 96 98 96 96\n",
"5 2\n3 9 1 1 6\n",
"4 2\n1 1 2 2\n",
"14 3\n1 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 2\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 70 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n90000 21355 158303 90001\n",
"7 3\n2 2 5 5 5 5 10\n",
"6 2\n2 4 1 2 5 5\n",
"6 2\n4 4 7 1 2 1\n",
"10 4\n9 3 3 9 1 9 16 4 4 7\n",
"3 1\n100 20 470\n",
"6 2\n1 1 0 1 2 1\n",
"5 1\n3 6 0 1 6\n",
"3 1\n547468 84599976 6467834\n"
],
"output": [
"1 3\n",
"1 4\n",
"2 3\n",
"2 3\n",
"3 7\n",
"1 2\n",
"30 67\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 5\n",
"1 4\n",
"2 5\n",
"1 6\n",
"1 4\n",
"1 3\n",
"1 3\n",
"1 3\n",
"3 4\n",
"2 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"1 3\n",
"4 7\n",
"2 5\n",
"1 5\n",
"1 6\n",
"1 4\n",
"38 67\n",
"4 10\n",
"3 6\n",
"9 48\n",
"4 9\n",
"31 56\n",
"2 4\n",
"3 7\n",
"30 67\n",
"1 7\n",
"2 6\n",
"3 4\n",
"2 5\n",
"1 3\n",
"1 3\n",
"1 4\n",
"2 3\n",
"6 12\n",
"3 4\n",
"2 5\n",
"1 6\n",
"1 3\n",
"4 10\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 10\n",
"3 6\n",
"2 5\n",
"28 53\n",
"4 10\n",
"2 5\n",
"28 53\n",
"28 53\n",
"4 9\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 3\n",
"1 3\n",
"1 4\n",
"1 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"3 4\n",
"2 5\n",
"1 5\n",
"1 3\n",
"1 6\n",
"1 3\n",
"1 4\n",
"2 5\n",
"2 3\n"
]
} | 2CODEFORCES
|
332_B. Maximum Absurdity_37940 | Reforms continue entering Berland. For example, during yesterday sitting the Berland Parliament approved as much as n laws (each law has been assigned a unique number from 1 to n). Today all these laws were put on the table of the President of Berland, G.W. Boosch, to be signed.
This time mr. Boosch plans to sign 2k laws. He decided to choose exactly two non-intersecting segments of integers from 1 to n of length k and sign all laws, whose numbers fall into these segments. More formally, mr. Boosch is going to choose two integers a, b (1 ≤ a ≤ b ≤ n - k + 1, b - a ≥ k) and sign all laws with numbers lying in the segments [a; a + k - 1] and [b; b + k - 1] (borders are included).
As mr. Boosch chooses the laws to sign, he of course considers the public opinion. Allberland Public Opinion Study Centre (APOSC) conducted opinion polls among the citizens, processed the results into a report and gave it to the president. The report contains the absurdity value for each law, in the public opinion. As mr. Boosch is a real patriot, he is keen on signing the laws with the maximum total absurdity. Help him.
Input
The first line contains two integers n and k (2 ≤ n ≤ 2·105, 0 < 2k ≤ n) — the number of laws accepted by the parliament and the length of one segment in the law list, correspondingly. The next line contains n integers x1, x2, ..., xn — the absurdity of each law (1 ≤ xi ≤ 109).
Output
Print two integers a, b — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments [a; a + k - 1] and [b; b + k - 1]. If there are multiple solutions, print the one with the minimum number a. If there still are multiple solutions, print the one with the minimum b.
Examples
Input
5 2
3 6 1 1 6
Output
1 4
Input
6 2
1 1 1 1 1 1
Output
1 3
Note
In the first sample mr. Boosch signs laws with numbers from segments [1;2] and [4;5]. The total absurdity of the signed laws equals 3 + 6 + 1 + 6 = 16.
In the second sample mr. Boosch signs laws with numbers from segments [1;2] and [3;4]. The total absurdity of the signed laws equals 1 + 1 + 1 + 1 = 4. | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, temp, idx = 0;
long long sum = 0;
cin >> n >> k;
vector<long long> s;
vector<long long> v;
for (int i = 0; i < n; i++) {
cin >> temp;
v.push_back(temp);
sum += temp;
if ((i + 1) >= k) {
s.push_back(sum);
sum -= v[idx++];
}
}
int l = s.size();
vector<long long> Max(l);
vector<int> pos(l);
Max[l - 1] = s[l - 1];
pos[l - 1] = l - 1;
for (int i = l - 2; i >= 0; i--) {
if (s[i] >= Max[i + 1]) {
Max[i] = s[i];
pos[i] = i;
} else {
Max[i] = Max[i + 1];
pos[i] = pos[i + 1];
}
}
long long MAX = -1;
for (int i = 0; i < s.size() - k; i++)
if (s[i] + Max[i + k] > MAX) MAX = s[i] + Max[i + k];
for (int i = 0; i < s.size() - k; i++)
if (s[i] + Max[i + k] == MAX) {
cout << (i + 1) << " " << (pos[i + k] + 1) << endl;
break;
}
}
| 2C++
| {
"input": [
"6 2\n1 1 1 1 1 1\n",
"5 2\n3 6 1 1 6\n",
"4 1\n1 2 2 2\n",
"3 1\n547468 78578678 6467834\n",
"14 2\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n1 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 1 2 1 2\n",
"4 1\n90000 34567 90000 90001\n",
"12 3\n1 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 5\n",
"2 1\n1000000000 999999999\n",
"6 2\n1 4 1 2 5 6\n",
"6 3\n15 20 1 15 43 6\n",
"6 2\n4 4 7 1 1 7\n",
"10 4\n9 3 3 9 1 9 9 4 4 9\n",
"6 3\n1 2 2 2 1 1\n",
"4 2\n999999 8888888 7777777 666666\n",
"5 2\n98 96 98 96 96\n",
"3 1\n100 30 563\n",
"4 1\n1 1 2 2\n",
"3 1\n547468 115275900 6467834\n",
"14 3\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 0 2 1 2\n",
"12 3\n2 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 10\n",
"6 2\n1 4 1 2 5 5\n",
"10 4\n9 3 3 9 1 9 16 4 4 9\n",
"6 2\n1 1 1 1 2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 1 15 2 3 6 5 3 3 8 6\n",
"7 2\n1 2 5 5 5 5 10\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 0\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"4 1\n1 2 2 4\n",
"14 2\n2 1 2 3 1 1 2 3 1 2 2 3 2 3\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 39 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"10 4\n9 3 3 9 1 8 9 4 4 9\n",
"12 3\n2 4 1 15 2 3 6 8 3 3 8 6\n",
"4 1\n90000 34567 158303 90001\n",
"6 2\n4 4 7 1 2 7\n",
"4 2\n999999 8888888 7468339 666666\n",
"3 1\n100 30 470\n",
"5 2\n3 6 0 1 6\n",
"3 1\n547468 77851989 6467834\n",
"14 3\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n90000 61755 158303 90001\n",
"6 2\n6 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 7 9\n",
"3 1\n100 30 714\n",
"14 5\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n158880 61755 158303 90001\n",
"12 3\n2 2 1 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 5 10\n",
"6 2\n0 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 1 9\n",
"3 1\n100 30 465\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90001\n",
"12 3\n2 2 0 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 10 10\n",
"6 2\n0 1 7 1 2 7\n",
"3 1\n100 30 644\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90690\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 8 6\n",
"7 2\n2 2 5 8 5 10 10\n",
"6 2\n0 1 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 6\n",
"6 2\n0 2 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 6 3 3 16 0\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 95 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"5 1\n2 1 2 0 2\n",
"4 1\n90000 3039 90000 90001\n",
"12 3\n1 2 0 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 6 5 5\n",
"2 1\n1000000000 280956868\n",
"4 2\n999999 8888888 6813869 666666\n",
"5 2\n191 96 98 96 96\n",
"5 2\n3 9 1 1 6\n",
"4 2\n1 1 2 2\n",
"14 3\n1 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 2\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 70 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n90000 21355 158303 90001\n",
"7 3\n2 2 5 5 5 5 10\n",
"6 2\n2 4 1 2 5 5\n",
"6 2\n4 4 7 1 2 1\n",
"10 4\n9 3 3 9 1 9 16 4 4 7\n",
"3 1\n100 20 470\n",
"6 2\n1 1 0 1 2 1\n",
"5 1\n3 6 0 1 6\n",
"3 1\n547468 84599976 6467834\n"
],
"output": [
"1 3\n",
"1 4\n",
"2 3\n",
"2 3\n",
"3 7\n",
"1 2\n",
"30 67\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 5\n",
"1 4\n",
"2 5\n",
"1 6\n",
"1 4\n",
"1 3\n",
"1 3\n",
"1 3\n",
"3 4\n",
"2 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"1 3\n",
"4 7\n",
"2 5\n",
"1 5\n",
"1 6\n",
"1 4\n",
"38 67\n",
"4 10\n",
"3 6\n",
"9 48\n",
"4 9\n",
"31 56\n",
"2 4\n",
"3 7\n",
"30 67\n",
"1 7\n",
"2 6\n",
"3 4\n",
"2 5\n",
"1 3\n",
"1 3\n",
"1 4\n",
"2 3\n",
"6 12\n",
"3 4\n",
"2 5\n",
"1 6\n",
"1 3\n",
"4 10\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 10\n",
"3 6\n",
"2 5\n",
"28 53\n",
"4 10\n",
"2 5\n",
"28 53\n",
"28 53\n",
"4 9\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 3\n",
"1 3\n",
"1 4\n",
"1 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"3 4\n",
"2 5\n",
"1 5\n",
"1 3\n",
"1 6\n",
"1 3\n",
"1 4\n",
"2 5\n",
"2 3\n"
]
} | 2CODEFORCES
|
332_B. Maximum Absurdity_37941 | Reforms continue entering Berland. For example, during yesterday sitting the Berland Parliament approved as much as n laws (each law has been assigned a unique number from 1 to n). Today all these laws were put on the table of the President of Berland, G.W. Boosch, to be signed.
This time mr. Boosch plans to sign 2k laws. He decided to choose exactly two non-intersecting segments of integers from 1 to n of length k and sign all laws, whose numbers fall into these segments. More formally, mr. Boosch is going to choose two integers a, b (1 ≤ a ≤ b ≤ n - k + 1, b - a ≥ k) and sign all laws with numbers lying in the segments [a; a + k - 1] and [b; b + k - 1] (borders are included).
As mr. Boosch chooses the laws to sign, he of course considers the public opinion. Allberland Public Opinion Study Centre (APOSC) conducted opinion polls among the citizens, processed the results into a report and gave it to the president. The report contains the absurdity value for each law, in the public opinion. As mr. Boosch is a real patriot, he is keen on signing the laws with the maximum total absurdity. Help him.
Input
The first line contains two integers n and k (2 ≤ n ≤ 2·105, 0 < 2k ≤ n) — the number of laws accepted by the parliament and the length of one segment in the law list, correspondingly. The next line contains n integers x1, x2, ..., xn — the absurdity of each law (1 ≤ xi ≤ 109).
Output
Print two integers a, b — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments [a; a + k - 1] and [b; b + k - 1]. If there are multiple solutions, print the one with the minimum number a. If there still are multiple solutions, print the one with the minimum b.
Examples
Input
5 2
3 6 1 1 6
Output
1 4
Input
6 2
1 1 1 1 1 1
Output
1 3
Note
In the first sample mr. Boosch signs laws with numbers from segments [1;2] and [4;5]. The total absurdity of the signed laws equals 3 + 6 + 1 + 6 = 16.
In the second sample mr. Boosch signs laws with numbers from segments [1;2] and [3;4]. The total absurdity of the signed laws equals 1 + 1 + 1 + 1 = 4. | def main():
wynik = 0
para = (0,0)
n,k = input().split()
n,k = int(n), int(k)
odl = []
tab = list(map(int, input().split()))
pocz = tab[0]
odl = [pocz]
for i in range(1,n):
if i < k :
odl.append(odl[i-1]+tab[i])
else:
odl.append(odl[i-1]+tab[i] - tab[i-k])
odl = odl[k-1:]
maks = odl[-1]
maksy = []
b = n-k+1
for i in range(len(odl)-1,-1,-1):
if odl[i] >= maks:
maks = odl[i]
b = i+1
maksy.append((maks,b))
maksy.reverse()
for i in range(0,len(odl)-k):
if odl[i] + maksy[i+k][0] > wynik:
wynik = odl[i] + maksy[i+k][0]
para = (i+1,maksy[i+k][1])
return f'{para[0]} {para[1]}'
print(main())
| 3Python3
| {
"input": [
"6 2\n1 1 1 1 1 1\n",
"5 2\n3 6 1 1 6\n",
"4 1\n1 2 2 2\n",
"3 1\n547468 78578678 6467834\n",
"14 2\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n1 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 1 2 1 2\n",
"4 1\n90000 34567 90000 90001\n",
"12 3\n1 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 5\n",
"2 1\n1000000000 999999999\n",
"6 2\n1 4 1 2 5 6\n",
"6 3\n15 20 1 15 43 6\n",
"6 2\n4 4 7 1 1 7\n",
"10 4\n9 3 3 9 1 9 9 4 4 9\n",
"6 3\n1 2 2 2 1 1\n",
"4 2\n999999 8888888 7777777 666666\n",
"5 2\n98 96 98 96 96\n",
"3 1\n100 30 563\n",
"4 1\n1 1 2 2\n",
"3 1\n547468 115275900 6467834\n",
"14 3\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 0 2 1 2\n",
"12 3\n2 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 10\n",
"6 2\n1 4 1 2 5 5\n",
"10 4\n9 3 3 9 1 9 16 4 4 9\n",
"6 2\n1 1 1 1 2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 1 15 2 3 6 5 3 3 8 6\n",
"7 2\n1 2 5 5 5 5 10\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 0\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"4 1\n1 2 2 4\n",
"14 2\n2 1 2 3 1 1 2 3 1 2 2 3 2 3\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 39 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"10 4\n9 3 3 9 1 8 9 4 4 9\n",
"12 3\n2 4 1 15 2 3 6 8 3 3 8 6\n",
"4 1\n90000 34567 158303 90001\n",
"6 2\n4 4 7 1 2 7\n",
"4 2\n999999 8888888 7468339 666666\n",
"3 1\n100 30 470\n",
"5 2\n3 6 0 1 6\n",
"3 1\n547468 77851989 6467834\n",
"14 3\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n90000 61755 158303 90001\n",
"6 2\n6 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 7 9\n",
"3 1\n100 30 714\n",
"14 5\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n158880 61755 158303 90001\n",
"12 3\n2 2 1 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 5 10\n",
"6 2\n0 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 1 9\n",
"3 1\n100 30 465\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90001\n",
"12 3\n2 2 0 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 10 10\n",
"6 2\n0 1 7 1 2 7\n",
"3 1\n100 30 644\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90690\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 8 6\n",
"7 2\n2 2 5 8 5 10 10\n",
"6 2\n0 1 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 6\n",
"6 2\n0 2 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 6 3 3 16 0\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 95 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"5 1\n2 1 2 0 2\n",
"4 1\n90000 3039 90000 90001\n",
"12 3\n1 2 0 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 6 5 5\n",
"2 1\n1000000000 280956868\n",
"4 2\n999999 8888888 6813869 666666\n",
"5 2\n191 96 98 96 96\n",
"5 2\n3 9 1 1 6\n",
"4 2\n1 1 2 2\n",
"14 3\n1 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 2\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 70 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n90000 21355 158303 90001\n",
"7 3\n2 2 5 5 5 5 10\n",
"6 2\n2 4 1 2 5 5\n",
"6 2\n4 4 7 1 2 1\n",
"10 4\n9 3 3 9 1 9 16 4 4 7\n",
"3 1\n100 20 470\n",
"6 2\n1 1 0 1 2 1\n",
"5 1\n3 6 0 1 6\n",
"3 1\n547468 84599976 6467834\n"
],
"output": [
"1 3\n",
"1 4\n",
"2 3\n",
"2 3\n",
"3 7\n",
"1 2\n",
"30 67\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 5\n",
"1 4\n",
"2 5\n",
"1 6\n",
"1 4\n",
"1 3\n",
"1 3\n",
"1 3\n",
"3 4\n",
"2 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"1 3\n",
"4 7\n",
"2 5\n",
"1 5\n",
"1 6\n",
"1 4\n",
"38 67\n",
"4 10\n",
"3 6\n",
"9 48\n",
"4 9\n",
"31 56\n",
"2 4\n",
"3 7\n",
"30 67\n",
"1 7\n",
"2 6\n",
"3 4\n",
"2 5\n",
"1 3\n",
"1 3\n",
"1 4\n",
"2 3\n",
"6 12\n",
"3 4\n",
"2 5\n",
"1 6\n",
"1 3\n",
"4 10\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 10\n",
"3 6\n",
"2 5\n",
"28 53\n",
"4 10\n",
"2 5\n",
"28 53\n",
"28 53\n",
"4 9\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 3\n",
"1 3\n",
"1 4\n",
"1 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"3 4\n",
"2 5\n",
"1 5\n",
"1 3\n",
"1 6\n",
"1 3\n",
"1 4\n",
"2 5\n",
"2 3\n"
]
} | 2CODEFORCES
|
332_B. Maximum Absurdity_37942 | Reforms continue entering Berland. For example, during yesterday sitting the Berland Parliament approved as much as n laws (each law has been assigned a unique number from 1 to n). Today all these laws were put on the table of the President of Berland, G.W. Boosch, to be signed.
This time mr. Boosch plans to sign 2k laws. He decided to choose exactly two non-intersecting segments of integers from 1 to n of length k and sign all laws, whose numbers fall into these segments. More formally, mr. Boosch is going to choose two integers a, b (1 ≤ a ≤ b ≤ n - k + 1, b - a ≥ k) and sign all laws with numbers lying in the segments [a; a + k - 1] and [b; b + k - 1] (borders are included).
As mr. Boosch chooses the laws to sign, he of course considers the public opinion. Allberland Public Opinion Study Centre (APOSC) conducted opinion polls among the citizens, processed the results into a report and gave it to the president. The report contains the absurdity value for each law, in the public opinion. As mr. Boosch is a real patriot, he is keen on signing the laws with the maximum total absurdity. Help him.
Input
The first line contains two integers n and k (2 ≤ n ≤ 2·105, 0 < 2k ≤ n) — the number of laws accepted by the parliament and the length of one segment in the law list, correspondingly. The next line contains n integers x1, x2, ..., xn — the absurdity of each law (1 ≤ xi ≤ 109).
Output
Print two integers a, b — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments [a; a + k - 1] and [b; b + k - 1]. If there are multiple solutions, print the one with the minimum number a. If there still are multiple solutions, print the one with the minimum b.
Examples
Input
5 2
3 6 1 1 6
Output
1 4
Input
6 2
1 1 1 1 1 1
Output
1 3
Note
In the first sample mr. Boosch signs laws with numbers from segments [1;2] and [4;5]. The total absurdity of the signed laws equals 3 + 6 + 1 + 6 = 16.
In the second sample mr. Boosch signs laws with numbers from segments [1;2] and [3;4]. The total absurdity of the signed laws equals 1 + 1 + 1 + 1 = 4. | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
public class Solution1 implements Runnable
{
static final long MAX = 1000003L;
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
private BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
public InputReader(InputStream stream)
{
this.stream = stream;
}
public int read()
{
if (numChars==-1)
throw new InputMismatchException();
if (curChar >= numChars)
{
curChar = 0;
try
{
numChars = stream.read(buf);
}
catch (IOException e)
{
throw new InputMismatchException();
}
if(numChars <= 0)
return -1;
}
return buf[curChar++];
}
public String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
public int nextInt()
{
int c = read();
while(isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
int res = 0;
do
{
if(c<'0'||c>'9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public long nextLong()
{
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
long res = 0;
do
{
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public double nextDouble()
{
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.')
{
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
if (c == '.')
{
c = read();
double m = 1;
while (!isSpaceChar(c))
{
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public String readString()
{
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do
{
res.appendCodePoint(c);
c = read();
}
while (!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c)
{
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next()
{
return readString();
}
public interface SpaceCharFilter
{
public boolean isSpaceChar(int ch);
}
}
public static void main(String args[]) throws Exception
{
new Thread(null, new Solution1(),"Solution",1<<26).start();
}
public static int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b%a, a);
}
int lcm(int a, int b)
{
return (a*b)/gcd(a, b);
}
ArrayList<Integer> adj[];
public void run()
{
InputReader sc= new InputReader(System.in);
PrintWriter w= new PrintWriter(System.out);
int n = sc.nextInt();
int m = sc.nextInt();
long[] ar = new long[n];
for(int i = 0;i < n;i++) {
ar[i] = sc.nextLong();
}
long[] prefix = new long[n+1];
arr = new long[n][2];
segTree = new long[4*n][2];
for(int i = 0;i < n;i++) {
prefix[i+1] = prefix[i] + ar[i];
}
for(int i = 0;i < n;i++) {
if(i + m > n) {
arr[i][0] = 0;
arr[i][1] = i;
}else {
arr[i][0] = prefix[i+m] - prefix[i];
arr[i][1] = i;
}
}
build(0, n-1, 0);
long fans = Long.MIN_VALUE;
int rem = -1;
int a = -1;
long b = -1;
for(int i = 0;i < n;i++) {
int left = i;
int right = i+m;
long ans = prefix[right] - prefix[left];
if(right + m - 1 < n) {
long[] quer = query(0, n-1, right,n-1,0);
if(ans + quer[0] > fans) {
fans = ans + quer[0];
a = i;
b = quer[1];
}
}else {
break;
}
}
w.println((a+1) + " " + (b+1));
w.close();
}
int fun(int n,int d,int e,int f) {
int rem = -1;
for(int i = 1;i <= 4000;i++) {
if(d*i <= n && ((n - (d*i)) % e == 0 || (n - (d*i)) % f == 0)) {
rem = i;
}
}
return rem;
}
boolean[] visited;
void bfs(int a) {
Queue<Integer> q = new LinkedList();
q.add(a);
visited[a] = true;
while(!q.isEmpty()) {
int x = q.poll();
Iterator<Integer> it = adj[x].iterator();
while(it.hasNext()) {
int temp = it.next();
if(!visited[temp]) {
visited[temp] = true;
q.add(temp);
}
}
}
}
long[][] segTree;
long[][] arr;
void build(int l,int r,int pos){
if(l == r){
segTree[pos][0] = arr[l][0];
segTree[pos][1] = arr[l][1];
return;
}
int mid = (l+r)/2;
build(l, mid, 2*pos+1);
build(mid+1, r, 2*pos+2);
segTree[pos] = merge(segTree[2*pos+1],segTree[2*pos+2]);
}
long[] merge(long[] a,long[] b){
long[] temp = new long[2];
if(a[0] >= b[0]) {
temp[0] = a[0];
temp[1] = a[1];
}else {
temp[0] = b[0];
temp[1] = b[1];
}
return temp;
}
long[] query(int l,int r,int start,int end,int pos){
if(l > end || r < start || l > r){
return new long[2];
}
if(l >= start && r <= end){
return segTree[pos];
}
int mid = (l + r)/2;
long[] p1 = query(l,mid, start, end, 2*pos+1);
long[] p2 = query(mid+1, r, start, end, 2*pos+2);
return merge(p1,p2);
}
long[][] multiply(long[][] a,long[][] b){
long[][] temp = new long[3][3];
for(int i = 0;i < 3;i++) {
for(int j = 0;j < 3;j++) {
for(int k = 0;k < 3;k++) {
temp[i][j] = (temp[i][j] + (a[i][k] * b[k][j]) % MAX)%MAX;
}
}
}
return temp;
}
long pow(long[][] f,int val,long a,long b) {
long[][] in = {{1,0,0},{0,1,0},{0,0,1}};
while(val > 0) {
if((val & 1) == 1) {
in = multiply(in,f);
}
val = val/2;
f = multiply(f, f);
}
return ((4*in[0][0])%MAX + (2*in[0][1])%MAX + in[0][2])%MAX;
}
static long power(long x, long y,long p)
{
// Initialize result
long res = 1;
// Update x if it is more
// than or equal to p
x = x % p;
while (y > 0)
{
// If y is odd, multiply x
// with result
if((y & 1)==1)
res = (res * x) % p;
// y must be even now
// y = y / 2
y = y >> 1;
x = (x * x) % p;
}
return res;
}
static class Pair implements Comparable<Pair>{
int a;
int b;
long c;
Pair(int a,int b,long c){
this.a =a;
this.b = b;
this.c = c;
}
Pair(){}
public boolean equals(Object o)
{
Pair p = (Pair)o;
return true;
}
public int compareTo(Pair p){
return Long.compare(this.c,p.c);
}
}
} | 4JAVA
| {
"input": [
"6 2\n1 1 1 1 1 1\n",
"5 2\n3 6 1 1 6\n",
"4 1\n1 2 2 2\n",
"3 1\n547468 78578678 6467834\n",
"14 2\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n1 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 1 2 1 2\n",
"4 1\n90000 34567 90000 90001\n",
"12 3\n1 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 5\n",
"2 1\n1000000000 999999999\n",
"6 2\n1 4 1 2 5 6\n",
"6 3\n15 20 1 15 43 6\n",
"6 2\n4 4 7 1 1 7\n",
"10 4\n9 3 3 9 1 9 9 4 4 9\n",
"6 3\n1 2 2 2 1 1\n",
"4 2\n999999 8888888 7777777 666666\n",
"5 2\n98 96 98 96 96\n",
"3 1\n100 30 563\n",
"4 1\n1 1 2 2\n",
"3 1\n547468 115275900 6467834\n",
"14 3\n2 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"5 1\n2 0 2 1 2\n",
"12 3\n2 2 1 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 5 5 10\n",
"6 2\n1 4 1 2 5 5\n",
"10 4\n9 3 3 9 1 9 16 4 4 9\n",
"6 2\n1 1 1 1 2 1\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 1 15 2 3 6 5 3 3 8 6\n",
"7 2\n1 2 5 5 5 5 10\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 60 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 0\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"4 1\n1 2 2 4\n",
"14 2\n2 1 2 3 1 1 2 3 1 2 2 3 2 3\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 39 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"10 4\n9 3 3 9 1 8 9 4 4 9\n",
"12 3\n2 4 1 15 2 3 6 8 3 3 8 6\n",
"4 1\n90000 34567 158303 90001\n",
"6 2\n4 4 7 1 2 7\n",
"4 2\n999999 8888888 7468339 666666\n",
"3 1\n100 30 470\n",
"5 2\n3 6 0 1 6\n",
"3 1\n547468 77851989 6467834\n",
"14 3\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n90000 61755 158303 90001\n",
"6 2\n6 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 7 9\n",
"3 1\n100 30 714\n",
"14 5\n2 1 2 3 1 3 2 3 1 2 2 3 2 3\n",
"4 1\n158880 61755 158303 90001\n",
"12 3\n2 2 1 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 5 10\n",
"6 2\n0 4 7 1 2 7\n",
"10 4\n9 3 3 9 1 9 16 4 1 9\n",
"3 1\n100 30 465\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90001\n",
"12 3\n2 2 0 15 2 3 12 5 3 3 8 6\n",
"7 2\n1 2 5 8 5 10 10\n",
"6 2\n0 1 7 1 2 7\n",
"3 1\n100 30 644\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n158880 8581 158303 90690\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 8 6\n",
"7 2\n2 2 5 8 5 10 10\n",
"6 2\n0 1 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 1 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 5 3 3 16 6\n",
"6 2\n0 2 14 1 2 7\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 55 87 16 68 6 36 98\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"12 3\n2 2 0 15 2 3 0 6 3 3 16 0\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 85 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 54 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 49 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 34 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 2 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 46 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 76 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 108 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 69 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 44 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 98 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 53 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 22 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 10 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 2 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 66 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"98 24\n52 20 12 75 5 22 20 25 18 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 11 54 45 46 94 10 47 114 1 15 54 17 82 46 22 32 62 89 37 30 26 92 77 69 11 59 78 24 95 88 19 32 93 46 14 57 20 5 135 53 99 81 94 67 22 54 31 49 52 46 51 49 4 67 31 4 66 28 38 103 5 40 75 15 52 87 16 68 6 36 98\n",
"5 1\n2 1 2 0 2\n",
"4 1\n90000 3039 90000 90001\n",
"12 3\n1 2 0 15 2 3 6 8 3 3 8 6\n",
"7 3\n1 2 5 5 6 5 5\n",
"2 1\n1000000000 280956868\n",
"4 2\n999999 8888888 6813869 666666\n",
"5 2\n191 96 98 96 96\n",
"5 2\n3 9 1 1 6\n",
"4 2\n1 1 2 2\n",
"14 3\n1 1 2 3 1 2 2 3 1 2 2 3 2 3\n",
"2 1\n2 2\n",
"98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 70 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 31 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98\n",
"4 1\n90000 21355 158303 90001\n",
"7 3\n2 2 5 5 5 5 10\n",
"6 2\n2 4 1 2 5 5\n",
"6 2\n4 4 7 1 2 1\n",
"10 4\n9 3 3 9 1 9 16 4 4 7\n",
"3 1\n100 20 470\n",
"6 2\n1 1 0 1 2 1\n",
"5 1\n3 6 0 1 6\n",
"3 1\n547468 84599976 6467834\n"
],
"output": [
"1 3\n",
"1 4\n",
"2 3\n",
"2 3\n",
"3 7\n",
"1 2\n",
"30 67\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 5\n",
"1 4\n",
"2 5\n",
"1 6\n",
"1 4\n",
"1 3\n",
"1 3\n",
"1 3\n",
"3 4\n",
"2 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"1 3\n",
"4 7\n",
"2 5\n",
"1 5\n",
"1 6\n",
"1 4\n",
"38 67\n",
"4 10\n",
"3 6\n",
"9 48\n",
"4 9\n",
"31 56\n",
"2 4\n",
"3 7\n",
"30 67\n",
"1 7\n",
"2 6\n",
"3 4\n",
"2 5\n",
"1 3\n",
"1 3\n",
"1 4\n",
"2 3\n",
"6 12\n",
"3 4\n",
"2 5\n",
"1 6\n",
"1 3\n",
"4 10\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 7\n",
"3 6\n",
"2 5\n",
"1 3\n",
"28 53\n",
"1 3\n",
"4 10\n",
"3 6\n",
"2 5\n",
"28 53\n",
"4 10\n",
"2 5\n",
"28 53\n",
"28 53\n",
"4 9\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"28 53\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"31 56\n",
"1 3\n",
"1 4\n",
"4 7\n",
"2 5\n",
"1 2\n",
"1 3\n",
"1 3\n",
"1 4\n",
"1 3\n",
"6 12\n",
"1 2\n",
"28 53\n",
"3 4\n",
"2 5\n",
"1 5\n",
"1 3\n",
"1 6\n",
"1 3\n",
"1 4\n",
"2 5\n",
"2 3\n"
]
} | 2CODEFORCES
|
355_B. Vasya and Public Transport_37943 | Vasya often uses public transport. The transport in the city is of two types: trolleys and buses. The city has n buses and m trolleys, the buses are numbered by integers from 1 to n, the trolleys are numbered by integers from 1 to m.
Public transport is not free. There are 4 types of tickets:
1. A ticket for one ride on some bus or trolley. It costs c1 burles;
2. A ticket for an unlimited number of rides on some bus or on some trolley. It costs c2 burles;
3. A ticket for an unlimited number of rides on all buses or all trolleys. It costs c3 burles;
4. A ticket for an unlimited number of rides on all buses and trolleys. It costs c4 burles.
Vasya knows for sure the number of rides he is going to make and the transport he is going to use. He asked you for help to find the minimum sum of burles he will have to spend on the tickets.
Input
The first line contains four integers c1, c2, c3, c4 (1 ≤ c1, c2, c3, c4 ≤ 1000) — the costs of the tickets.
The second line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of buses and trolleys Vasya is going to use.
The third line contains n integers ai (0 ≤ ai ≤ 1000) — the number of times Vasya is going to use the bus number i.
The fourth line contains m integers bi (0 ≤ bi ≤ 1000) — the number of times Vasya is going to use the trolley number i.
Output
Print a single number — the minimum sum of burles Vasya will have to spend on the tickets.
Examples
Input
1 3 7 19
2 3
2 5
4 4 4
Output
12
Input
4 3 2 1
1 3
798
1 2 3
Output
1
Input
100 100 8 100
3 5
7 94 12
100 1 47 0 42
Output
16
Note
In the first sample the profitable strategy is to buy two tickets of the first type (for the first bus), one ticket of the second type (for the second bus) and one ticket of the third type (for all trolleys). It totals to (2·1) + 3 + 7 = 12 burles.
In the second sample the profitable strategy is to buy one ticket of the fourth type.
In the third sample the profitable strategy is to buy two tickets of the third type: for all buses and for all trolleys. | c = map(int, raw_input().split())
n, m = map(int, raw_input().split())
a = map(int, raw_input().split())
b = map(int, raw_input().split())
x = min(c[2], sum(min(c[1], ai * c[0]) for ai in a))
y = min(c[2], sum(min(c[1], bi * c[0]) for bi in b))
print min(c[3], x + y) | 1Python2
| {
"input": [
"4 3 2 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 47 0 42\n",
"1 3 7 19\n2 3\n2 5\n4 4 4\n",
"3 103 945 1000\n7 9\n34 35 34 35 34 35 34\n0 0 0 0 0 0 0 0 0\n",
"4 4 4 1\n1 1\n0\n0\n",
"7 11 597 948\n4 1\n5 1 0 11\n7\n",
"7 32 109 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 199 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 20 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 0 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 2 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 39 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 1 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"1 1 3 4\n2 3\n1 1\n1 1 1\n",
"7 32 104 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 85 0 42\n",
"1 3 1 19\n2 3\n2 5\n4 4 4\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"1 2 3 4\n2 3\n1 1\n1 1 1\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n2 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 111 0 42\n",
"1 3 1 19\n2 3\n1 5\n4 4 4\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n2 2 3\n",
"100 100 8 110\n3 5\n7 94 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 2 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 3 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 47\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 2 1\n1 3\n1135\n3 3 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 010 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 69 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 4 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 7 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 56 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 20 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 101 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n0 3\n1066\n0 1 3\n"
],
"output": [
"1",
"16",
"12",
"717",
"0",
"40",
"0",
"783",
"494",
"945",
"486",
"694",
"2",
"4",
"0\n",
"783\n",
"494\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"496\n",
"489\n",
"516\n",
"491\n",
"492\n",
"488\n",
"4\n",
"783\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"945\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"492\n",
"945\n",
"516\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n"
]
} | 2CODEFORCES
|
355_B. Vasya and Public Transport_37944 | Vasya often uses public transport. The transport in the city is of two types: trolleys and buses. The city has n buses and m trolleys, the buses are numbered by integers from 1 to n, the trolleys are numbered by integers from 1 to m.
Public transport is not free. There are 4 types of tickets:
1. A ticket for one ride on some bus or trolley. It costs c1 burles;
2. A ticket for an unlimited number of rides on some bus or on some trolley. It costs c2 burles;
3. A ticket for an unlimited number of rides on all buses or all trolleys. It costs c3 burles;
4. A ticket for an unlimited number of rides on all buses and trolleys. It costs c4 burles.
Vasya knows for sure the number of rides he is going to make and the transport he is going to use. He asked you for help to find the minimum sum of burles he will have to spend on the tickets.
Input
The first line contains four integers c1, c2, c3, c4 (1 ≤ c1, c2, c3, c4 ≤ 1000) — the costs of the tickets.
The second line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of buses and trolleys Vasya is going to use.
The third line contains n integers ai (0 ≤ ai ≤ 1000) — the number of times Vasya is going to use the bus number i.
The fourth line contains m integers bi (0 ≤ bi ≤ 1000) — the number of times Vasya is going to use the trolley number i.
Output
Print a single number — the minimum sum of burles Vasya will have to spend on the tickets.
Examples
Input
1 3 7 19
2 3
2 5
4 4 4
Output
12
Input
4 3 2 1
1 3
798
1 2 3
Output
1
Input
100 100 8 100
3 5
7 94 12
100 1 47 0 42
Output
16
Note
In the first sample the profitable strategy is to buy two tickets of the first type (for the first bus), one ticket of the second type (for the second bus) and one ticket of the third type (for all trolleys). It totals to (2·1) + 3 + 7 = 12 burles.
In the second sample the profitable strategy is to buy one ticket of the fourth type.
In the third sample the profitable strategy is to buy two tickets of the third type: for all buses and for all trolleys. | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
;
int arr[4];
for (int i = 0; i < 4; ++i) {
cin >> arr[i];
}
int n, m;
cin >> n >> m;
vector<int> b(n), t(m);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
for (int i = 0; i < m; ++i) {
cin >> t[i];
}
int ansB = 0, ansT = 0, resB = 0, resT = 0, totalB = 0, totalT = 0;
for (int i = 0; i < n; ++i) {
ansB = b[i] * arr[0];
ansB = min(ansB, arr[1]);
resB += ansB;
}
totalB = min(resB, arr[2]);
for (int i = 0; i < m; ++i) {
ansT = t[i] * arr[0];
ansT = min(ansT, arr[1]);
resT += ansT;
}
totalT = min(resT, arr[2]);
cout << min(arr[3], totalB + totalT);
return 0;
}
| 2C++
| {
"input": [
"4 3 2 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 47 0 42\n",
"1 3 7 19\n2 3\n2 5\n4 4 4\n",
"3 103 945 1000\n7 9\n34 35 34 35 34 35 34\n0 0 0 0 0 0 0 0 0\n",
"4 4 4 1\n1 1\n0\n0\n",
"7 11 597 948\n4 1\n5 1 0 11\n7\n",
"7 32 109 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 199 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 20 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 0 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 2 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 39 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 1 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"1 1 3 4\n2 3\n1 1\n1 1 1\n",
"7 32 104 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 85 0 42\n",
"1 3 1 19\n2 3\n2 5\n4 4 4\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"1 2 3 4\n2 3\n1 1\n1 1 1\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n2 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 111 0 42\n",
"1 3 1 19\n2 3\n1 5\n4 4 4\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n2 2 3\n",
"100 100 8 110\n3 5\n7 94 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 2 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 3 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 47\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 2 1\n1 3\n1135\n3 3 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 010 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 69 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 4 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 7 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 56 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 20 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 101 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n0 3\n1066\n0 1 3\n"
],
"output": [
"1",
"16",
"12",
"717",
"0",
"40",
"0",
"783",
"494",
"945",
"486",
"694",
"2",
"4",
"0\n",
"783\n",
"494\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"496\n",
"489\n",
"516\n",
"491\n",
"492\n",
"488\n",
"4\n",
"783\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"945\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"492\n",
"945\n",
"516\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n"
]
} | 2CODEFORCES
|
355_B. Vasya and Public Transport_37945 | Vasya often uses public transport. The transport in the city is of two types: trolleys and buses. The city has n buses and m trolleys, the buses are numbered by integers from 1 to n, the trolleys are numbered by integers from 1 to m.
Public transport is not free. There are 4 types of tickets:
1. A ticket for one ride on some bus or trolley. It costs c1 burles;
2. A ticket for an unlimited number of rides on some bus or on some trolley. It costs c2 burles;
3. A ticket for an unlimited number of rides on all buses or all trolleys. It costs c3 burles;
4. A ticket for an unlimited number of rides on all buses and trolleys. It costs c4 burles.
Vasya knows for sure the number of rides he is going to make and the transport he is going to use. He asked you for help to find the minimum sum of burles he will have to spend on the tickets.
Input
The first line contains four integers c1, c2, c3, c4 (1 ≤ c1, c2, c3, c4 ≤ 1000) — the costs of the tickets.
The second line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of buses and trolleys Vasya is going to use.
The third line contains n integers ai (0 ≤ ai ≤ 1000) — the number of times Vasya is going to use the bus number i.
The fourth line contains m integers bi (0 ≤ bi ≤ 1000) — the number of times Vasya is going to use the trolley number i.
Output
Print a single number — the minimum sum of burles Vasya will have to spend on the tickets.
Examples
Input
1 3 7 19
2 3
2 5
4 4 4
Output
12
Input
4 3 2 1
1 3
798
1 2 3
Output
1
Input
100 100 8 100
3 5
7 94 12
100 1 47 0 42
Output
16
Note
In the first sample the profitable strategy is to buy two tickets of the first type (for the first bus), one ticket of the second type (for the second bus) and one ticket of the third type (for all trolleys). It totals to (2·1) + 3 + 7 = 12 burles.
In the second sample the profitable strategy is to buy one ticket of the fourth type.
In the third sample the profitable strategy is to buy two tickets of the third type: for all buses and for all trolleys. | c1,c2,c3 ,c4 = map(int,input().split())
n , m = map(int, input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ans1 = 0
ans2 = 0
for i in a:
ans1 += min(c1 * i,c2)
ans1 = min(ans1, c3)
for i in b:
ans2 += min(c1 * i,c2)
ans2 = min(ans2, c3)
ans = min(ans1 + ans2, c4)
print(ans) | 3Python3
| {
"input": [
"4 3 2 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 47 0 42\n",
"1 3 7 19\n2 3\n2 5\n4 4 4\n",
"3 103 945 1000\n7 9\n34 35 34 35 34 35 34\n0 0 0 0 0 0 0 0 0\n",
"4 4 4 1\n1 1\n0\n0\n",
"7 11 597 948\n4 1\n5 1 0 11\n7\n",
"7 32 109 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 199 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 20 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 0 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 2 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 39 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 1 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"1 1 3 4\n2 3\n1 1\n1 1 1\n",
"7 32 104 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 85 0 42\n",
"1 3 1 19\n2 3\n2 5\n4 4 4\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"1 2 3 4\n2 3\n1 1\n1 1 1\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n2 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 111 0 42\n",
"1 3 1 19\n2 3\n1 5\n4 4 4\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n2 2 3\n",
"100 100 8 110\n3 5\n7 94 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 2 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 3 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 47\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 2 1\n1 3\n1135\n3 3 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 010 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 69 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 4 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 7 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 56 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 20 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 101 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n0 3\n1066\n0 1 3\n"
],
"output": [
"1",
"16",
"12",
"717",
"0",
"40",
"0",
"783",
"494",
"945",
"486",
"694",
"2",
"4",
"0\n",
"783\n",
"494\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"496\n",
"489\n",
"516\n",
"491\n",
"492\n",
"488\n",
"4\n",
"783\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"945\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"492\n",
"945\n",
"516\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n"
]
} | 2CODEFORCES
|
355_B. Vasya and Public Transport_37946 | Vasya often uses public transport. The transport in the city is of two types: trolleys and buses. The city has n buses and m trolleys, the buses are numbered by integers from 1 to n, the trolleys are numbered by integers from 1 to m.
Public transport is not free. There are 4 types of tickets:
1. A ticket for one ride on some bus or trolley. It costs c1 burles;
2. A ticket for an unlimited number of rides on some bus or on some trolley. It costs c2 burles;
3. A ticket for an unlimited number of rides on all buses or all trolleys. It costs c3 burles;
4. A ticket for an unlimited number of rides on all buses and trolleys. It costs c4 burles.
Vasya knows for sure the number of rides he is going to make and the transport he is going to use. He asked you for help to find the minimum sum of burles he will have to spend on the tickets.
Input
The first line contains four integers c1, c2, c3, c4 (1 ≤ c1, c2, c3, c4 ≤ 1000) — the costs of the tickets.
The second line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of buses and trolleys Vasya is going to use.
The third line contains n integers ai (0 ≤ ai ≤ 1000) — the number of times Vasya is going to use the bus number i.
The fourth line contains m integers bi (0 ≤ bi ≤ 1000) — the number of times Vasya is going to use the trolley number i.
Output
Print a single number — the minimum sum of burles Vasya will have to spend on the tickets.
Examples
Input
1 3 7 19
2 3
2 5
4 4 4
Output
12
Input
4 3 2 1
1 3
798
1 2 3
Output
1
Input
100 100 8 100
3 5
7 94 12
100 1 47 0 42
Output
16
Note
In the first sample the profitable strategy is to buy two tickets of the first type (for the first bus), one ticket of the second type (for the second bus) and one ticket of the third type (for all trolleys). It totals to (2·1) + 3 + 7 = 12 burles.
In the second sample the profitable strategy is to buy one ticket of the fourth type.
In the third sample the profitable strategy is to buy two tickets of the third type: for all buses and for all trolleys. | import java.io.*;
import java.util.*;
public class cf355b {
static FastIO in = new FastIO(), out = in;
public static void main(String[] args) {
int c1 = in.nextInt(), c2 = in.nextInt(), c3 = in.nextInt(), c4 = in.nextInt();
int n = in.nextInt(), m = in.nextInt();
int ans = 0, tmp = 0;
for(int i=0; i<n; i++)
tmp += Math.min(c2, in.nextInt()*c1);
ans += Math.min(tmp,c3);
tmp = 0;
for(int i=0; i<m; i++)
tmp += Math.min(c2, in.nextInt()*c1);
ans += Math.min(tmp,c3);
out.println(Math.min(ans,c4));
out.close();
}
static class FastIO extends PrintWriter {
BufferedReader br;
StringTokenizer st;
public FastIO() {
this(System.in, System.out);
}
public FastIO(InputStream in, OutputStream out) {
super(new BufferedWriter(new OutputStreamWriter(out)));
br = new BufferedReader(new InputStreamReader(in));
scanLine();
}
public void scanLine() {
try {
st = new StringTokenizer(br.readLine().trim());
} catch (Exception e) {
throw new RuntimeException(e.getMessage());
}
}
public int numTokens() {
if (!st.hasMoreTokens()) {
scanLine();
return numTokens();
}
return st.countTokens();
}
public String next() {
if (!st.hasMoreTokens()) {
scanLine();
return next();
}
return st.nextToken();
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
| 4JAVA
| {
"input": [
"4 3 2 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 47 0 42\n",
"1 3 7 19\n2 3\n2 5\n4 4 4\n",
"3 103 945 1000\n7 9\n34 35 34 35 34 35 34\n0 0 0 0 0 0 0 0 0\n",
"4 4 4 1\n1 1\n0\n0\n",
"7 11 597 948\n4 1\n5 1 0 11\n7\n",
"7 32 109 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 199 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 20 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 0 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 2 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 39 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 1 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"1 1 3 4\n2 3\n1 1\n1 1 1\n",
"7 32 104 645\n1 3\n0\n0 0 0\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 161 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 0 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 6 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 7 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 938\n",
"100 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n1 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 85 0 42\n",
"1 3 1 19\n2 3\n2 5\n4 4 4\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 0 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 3 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"1 2 3 4\n2 3\n1 1\n1 1 1\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 210 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 4 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 0 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 634 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 100 100 100\n",
"4 3 1 1\n1 3\n798\n2 2 3\n",
"100 100 8 100\n3 5\n7 94 12\n100 1 111 0 42\n",
"1 3 1 19\n2 3\n1 5\n4 4 4\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 18 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 20 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 0 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 17 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 800 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 100 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n2 2 3\n",
"100 100 8 110\n3 5\n7 94 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 520 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 18 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 5 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 3 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 458 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 100 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 2 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 42\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 467 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 0 0 17 11 3 0 2 15 0 15 11 19 14 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 0 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 1 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 19 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 95 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 100 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 3 3\n",
"100 100 8 110\n3 5\n7 70 12\n100 1 111 0 47\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 277 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 9 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 296 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 100 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 2 1\n1 3\n1135\n3 3 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 794 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 14 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 0 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 12 839 323 831 24 907 703 754 251 902\n",
"110 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1135\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 764 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 16 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 0 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 103 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 100 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n3 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 755 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 0 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 7 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"4 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 15 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 832 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 000 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n846\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 171 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 11 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 0 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 128 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 000 010 100 100 100 000 100 100\n",
"4 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 217 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 12 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 4 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 50 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 15 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 100 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n1 3\n1066\n0 1 3\n",
"671 644 748 783\n100 10\n520 363 816 957 635 753 314 254 763 819 27 970 663 164 195 230 708 587 568 707 343 30 217 227 1002 63 773 497 900 589 826 666 115 784 494 904 69 892 658 388 550 812 248 447 876 581 94 915 675 967 508 754 768 79 261 934 603 712 20 358 997 501 465 91 897 257 820 645 217 105 564 8 668 250 168 15 565 840 418 42 808 918 409 617 132 268 13 241 194 628 213 199 545 448 113 410 756 261 211 539\n147 3 178 680 701 193 697 666 846 389\n",
"2 7 291 972\n63 92\n7 0 1 6 0 13 0 20 2 8 0 17 7 0 0 0 0 2 2 0 0 8 20 0 0 0 3 0 0 0 4 22 0 0 0 12 0 8 17 9 0 0 0 0 4 0 1 0 17 11 4 0 2 15 0 15 11 19 0 0 0 20 13\n0 0 0 3 7 0 0 -1 0 8 13 6 15 0 7 0 0 20 0 0 12 0 4 0 15 0 -1 1 11 14 0 14 12 0 0 0 0 0 16 16 0 17 20 0 11 0 0 20 14 0 16 -1 3 6 12 0 0 0 0 0 15 3 0 9 17 12 20 17 0 0 0 0 15 9 0 14 10 10 1 36 16 17 20 6 6 0 0 16 4 6 0 7\n",
"4 43 490 945\n63 92\n0 0 0 0 0 2 6 5 18 0 1 7 0 17 0 19 0 19 8 15 0 0 0 9 10 13 7 0 10 16 0 0 0 0 0 14 0 2 9 15 0 0 2 0 0 0 0 7 0 0 0 11 11 0 0 0 0 1 10 12 3 0 0\n0 12 0 18 7 7 0 0 11 0 0 13 17 0 18 12 3 0 0 14 18 20 0 0 12 9 17 1 19 0 11 0 5 0 0 14 0 0 16 0 19 15 9 14 7 10 0 19 19 0 0 1 0 0 1 6 0 0 0 6 0 20 1 9 0 0 10 17 5 2 5 4 16 6 0 11 0 8 13 4 0 2 0 0 13 10 0 13 0 0 8 4\n",
"2 56 258 922\n42 17\n0 1 0 1 0 1 0 11 18 9 0 0 0 0 10 14 22 4 20 0 5 0 -1 13 13 0 0 2 0 4 0 20 4 0 11 3 7 0 0 0 1 0\n8 4 19 0 0 19 14 17 6 1 18 0 0 0 0 9 0\n",
"680 871 347 800\n10 100\n872 156 571 136 703 201 881 213 20 333\n465 435 870 173 660 237 694 594 423 405 27 866 325 490 255 989 188 345 278 125 708 210 771 848 961 448 871 190 745 343 532 174 67 999 874 221 252 500 886 129 185 208 137 425 758 34 696 15 198 981 91 50 545 885 194 583 475 415 162 712 116 911 313 488 646 189 429 756 728 30 985 114 823 111 106 447 105 430 307 388 345 362 84 156 169 859 274 934 500 62 22 839 323 831 24 907 703 754 251 902\n",
"100 000 2 100\n10 10\n100 100 100 100 100 000 110 100 101 100\n100 100 100 010 100 100 100 000 100 100\n",
"8 3 1 1\n0 3\n1066\n0 1 3\n"
],
"output": [
"1",
"16",
"12",
"717",
"0",
"40",
"0",
"783",
"494",
"945",
"486",
"694",
"2",
"4",
"0\n",
"783\n",
"494\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"496\n",
"489\n",
"516\n",
"491\n",
"492\n",
"488\n",
"4\n",
"783\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"2\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"496\n",
"945\n",
"486\n",
"694\n",
"4\n",
"1\n",
"16\n",
"783\n",
"945\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"945\n",
"516\n",
"694\n",
"4\n",
"1\n",
"783\n",
"492\n",
"945\n",
"516\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n",
"783\n",
"492\n",
"945\n",
"488\n",
"694\n",
"0\n",
"1\n"
]
} | 2CODEFORCES
|
379_C. New Year Ratings Change_37947 | One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000 | # -*- coding: utf-8 -*-
import sys
n = int(raw_input())
a = map(int, raw_input().split())
new_a = []
b = [0] * n
for i in xrange(len(a)):
new_a.append([a[i],i])
sorted_new_a = sorted(new_a, key=lambda x:x[0])
now = 1
for l in sorted_new_a:
now = max(l[0], now)
b[l[1]] = now
now += 1
print ' '.join(map(str, b))
| 1Python2
| {
"input": [
"1\n1000000000\n",
"3\n5 1 1\n",
"10\n4 5 10 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 1 1\n",
"10\n1 10 1 10 1 1 7 8 6 7\n",
"10\n20 19 12 1 12 15 2 12 6 10\n",
"10\n4 5 10 7 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 4 8 6 7\n",
"10\n20 19 10 1 12 15 2 12 6 10\n",
"3\n3 1 1\n",
"10\n4 5 9 7 2 14 15 6 10 6\n",
"10\n1 1 1 2 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 2 14 15 6 10 6\n",
"10\n1 1 1 3 1 1 1 1 2 1\n",
"10\n1 10 2 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 4\n",
"10\n5 3 9 4 3 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 16 4\n",
"10\n5 3 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 7\n",
"10\n5 1 1 5 3 47 28 6 18 7\n",
"10\n5 1 1 5 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 54 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 2\n",
"10\n5 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 56 12 18 1\n",
"10\n1 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 63 56 19 18 1\n",
"10\n2 1 4 7 3 63 56 19 18 1\n",
"10\n4 5 7 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 2 1 1\n",
"10\n1 10 1 10 1 1 7 8 4 7\n",
"10\n20 19 12 1 12 15 2 1 6 10\n",
"3\n5 2 1\n",
"10\n4 5 10 14 2 14 15 6 10 6\n",
"10\n20 19 10 2 12 15 2 12 6 10\n",
"3\n3 2 1\n",
"10\n4 5 9 12 2 14 15 6 10 6\n",
"10\n4 5 9 4 2 14 15 10 10 6\n",
"10\n1 10 2 10 1 1 6 8 6 8\n",
"10\n4 5 9 2 3 14 15 6 10 6\n",
"10\n5 5 9 8 3 14 15 6 10 6\n",
"10\n5 5 9 5 3 14 15 6 16 6\n",
"10\n5 1 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 28 4\n",
"10\n5 3 9 4 2 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 26 4\n",
"10\n5 3 1 5 3 26 15 2 16 4\n",
"10\n5 1 1 5 3 47 15 6 18 1\n",
"10\n5 1 1 4 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 71 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 10 7\n",
"10\n5 1 1 5 3 47 54 12 17 2\n",
"10\n5 1 2 5 3 47 3 12 18 2\n",
"10\n5 2 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 10 3 47 54 12 18 1\n",
"10\n1 1 1 5 3 47 54 12 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 2\n",
"10\n2 1 4 5 3 5 56 19 18 1\n",
"10\n5 1 2 5 3 47 54 12 18 2\n",
"10\n1 10 1 10 1 1 3 8 6 7\n",
"10\n1 10 1 10 1 1 6 9 6 7\n",
"10\n1 1 5 5 3 47 56 12 18 1\n"
],
"output": [
"1000000000 \n",
"5 \n1 \n2 \n",
"4 \n5 \n10 \n6 \n2 \n14 \n15 \n7 \n11 \n8 \n",
"1 \n2 \n3 \n4 \n5 \n6 \n7 \n8 \n9 \n10 \n",
"1 \n10 \n2 \n11 \n3 \n4 \n7 \n9 \n6 \n8 \n",
"20 \n19 \n12 \n1 \n13 \n15 \n2 \n14 \n6 \n10 \n",
"4 5 10 8 2 14 15 6 11 7\n",
"1 2 3 4 5 6 7 8 10 9\n",
"1 10 2 11 3 4 5 8 6 7\n",
"20 19 10 1 12 15 2 13 6 11\n",
"3 1 2\n",
"4 5 9 8 2 14 15 6 10 7\n",
"1 2 3 9 4 5 6 7 10 8\n",
"1 10 2 11 3 4 6 9 7 8\n",
"4 6 9 5 2 14 15 7 10 8\n",
"1 2 3 10 4 5 6 7 9 8\n",
"1 10 4 11 2 3 6 9 7 8\n",
"4 6 9 5 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 16 8\n",
"6 3 9 5 4 14 15 7 16 8\n",
"7 3 9 5 4 14 15 8 16 6\n",
"7 3 9 5 4 26 15 8 16 6\n",
"6 3 9 7 4 26 15 8 16 5\n",
"6 3 1 7 4 26 15 8 16 5\n",
"5 1 2 6 3 26 15 7 16 4\n",
"5 1 2 6 3 26 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 8\n",
"5 1 2 6 3 47 28 7 18 8\n",
"5 1 2 6 3 47 28 8 18 7\n",
"5 1 2 6 3 47 54 8 18 7\n",
"5 1 2 6 3 47 54 12 18 7\n",
"5 1 2 6 4 47 54 12 18 3\n",
"5 1 3 6 4 47 54 12 18 2\n",
"1 2 4 6 5 47 54 12 18 3\n",
"1 2 5 6 4 47 54 12 18 3\n",
"1 2 5 6 4 47 56 12 18 3\n",
"1 2 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 47 56 19 18 2\n",
"3 1 5 6 4 63 56 19 18 2\n",
"3 1 5 7 4 63 56 19 18 2\n",
"4 5 9 6 2 14 15 7 10 8\n",
"1 2 3 4 5 6 7 10 8 9\n",
"1 10 2 11 3 4 7 9 5 8\n",
"20 19 12 1 13 15 3 2 6 10\n",
"5 2 1\n",
"4 5 10 14 2 15 16 6 11 7\n",
"20 19 10 2 12 15 3 13 6 11\n",
"3 2 1\n",
"4 5 9 12 2 14 15 6 10 7\n",
"4 6 9 5 2 14 15 10 11 7\n",
"1 10 4 11 2 3 6 8 7 9\n",
"4 5 9 2 3 14 15 6 10 7\n",
"5 6 10 9 3 14 15 7 11 8\n",
"5 6 10 7 3 14 15 8 16 9\n",
"5 1 9 4 3 14 15 6 16 7\n",
"7 3 9 5 4 14 15 8 28 6\n",
"6 3 9 4 2 26 15 7 16 5\n",
"6 3 9 7 4 26 15 8 27 5\n",
"6 3 1 7 4 26 15 2 16 5\n",
"5 1 2 6 4 47 15 7 18 3\n",
"5 1 2 4 3 47 28 8 18 7\n",
"5 1 2 6 3 47 71 8 18 7\n",
"5 1 2 6 3 47 54 12 10 7\n",
"5 1 2 6 4 47 54 12 17 3\n",
"6 1 2 7 4 47 5 12 18 3\n",
"5 2 3 6 4 47 54 12 18 1\n",
"1 2 4 10 5 47 54 12 18 3\n",
"1 2 3 6 5 47 54 12 18 4\n",
"2 1 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 7 56 19 18 2\n",
"5 1 2 6 4 47 54 12 18 3\n",
"1 10 2 11 3 4 5 8 6 7\n",
"1 10 2 11 3 4 6 9 7 8\n",
"1 2 5 6 4 47 56 12 18 3\n"
]
} | 2CODEFORCES
|
379_C. New Year Ratings Change_37948 | One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000 | #include <bits/stdc++.h>
using namespace std;
const int MX = 25;
int main(int argc, char *argv[]) {
int n;
cin >> n;
pair<int, int> a[n];
for (int i = (0), _b = (n); i < (_b); ++i) {
cin >> a[i].first;
a[i].second = i;
}
sort(a, a + n);
int ans[n];
int cur = 0;
for (int i = (0), _b = (n); i < (_b); ++i) {
if (cur < a[i].first) cur = a[i].first;
ans[a[i].second] = cur++;
}
for (int i = (0), _b = (n); i < (_b); ++i) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 2C++
| {
"input": [
"1\n1000000000\n",
"3\n5 1 1\n",
"10\n4 5 10 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 1 1\n",
"10\n1 10 1 10 1 1 7 8 6 7\n",
"10\n20 19 12 1 12 15 2 12 6 10\n",
"10\n4 5 10 7 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 4 8 6 7\n",
"10\n20 19 10 1 12 15 2 12 6 10\n",
"3\n3 1 1\n",
"10\n4 5 9 7 2 14 15 6 10 6\n",
"10\n1 1 1 2 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 2 14 15 6 10 6\n",
"10\n1 1 1 3 1 1 1 1 2 1\n",
"10\n1 10 2 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 4\n",
"10\n5 3 9 4 3 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 16 4\n",
"10\n5 3 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 7\n",
"10\n5 1 1 5 3 47 28 6 18 7\n",
"10\n5 1 1 5 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 54 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 2\n",
"10\n5 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 56 12 18 1\n",
"10\n1 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 63 56 19 18 1\n",
"10\n2 1 4 7 3 63 56 19 18 1\n",
"10\n4 5 7 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 2 1 1\n",
"10\n1 10 1 10 1 1 7 8 4 7\n",
"10\n20 19 12 1 12 15 2 1 6 10\n",
"3\n5 2 1\n",
"10\n4 5 10 14 2 14 15 6 10 6\n",
"10\n20 19 10 2 12 15 2 12 6 10\n",
"3\n3 2 1\n",
"10\n4 5 9 12 2 14 15 6 10 6\n",
"10\n4 5 9 4 2 14 15 10 10 6\n",
"10\n1 10 2 10 1 1 6 8 6 8\n",
"10\n4 5 9 2 3 14 15 6 10 6\n",
"10\n5 5 9 8 3 14 15 6 10 6\n",
"10\n5 5 9 5 3 14 15 6 16 6\n",
"10\n5 1 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 28 4\n",
"10\n5 3 9 4 2 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 26 4\n",
"10\n5 3 1 5 3 26 15 2 16 4\n",
"10\n5 1 1 5 3 47 15 6 18 1\n",
"10\n5 1 1 4 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 71 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 10 7\n",
"10\n5 1 1 5 3 47 54 12 17 2\n",
"10\n5 1 2 5 3 47 3 12 18 2\n",
"10\n5 2 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 10 3 47 54 12 18 1\n",
"10\n1 1 1 5 3 47 54 12 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 2\n",
"10\n2 1 4 5 3 5 56 19 18 1\n",
"10\n5 1 2 5 3 47 54 12 18 2\n",
"10\n1 10 1 10 1 1 3 8 6 7\n",
"10\n1 10 1 10 1 1 6 9 6 7\n",
"10\n1 1 5 5 3 47 56 12 18 1\n"
],
"output": [
"1000000000 \n",
"5 \n1 \n2 \n",
"4 \n5 \n10 \n6 \n2 \n14 \n15 \n7 \n11 \n8 \n",
"1 \n2 \n3 \n4 \n5 \n6 \n7 \n8 \n9 \n10 \n",
"1 \n10 \n2 \n11 \n3 \n4 \n7 \n9 \n6 \n8 \n",
"20 \n19 \n12 \n1 \n13 \n15 \n2 \n14 \n6 \n10 \n",
"4 5 10 8 2 14 15 6 11 7\n",
"1 2 3 4 5 6 7 8 10 9\n",
"1 10 2 11 3 4 5 8 6 7\n",
"20 19 10 1 12 15 2 13 6 11\n",
"3 1 2\n",
"4 5 9 8 2 14 15 6 10 7\n",
"1 2 3 9 4 5 6 7 10 8\n",
"1 10 2 11 3 4 6 9 7 8\n",
"4 6 9 5 2 14 15 7 10 8\n",
"1 2 3 10 4 5 6 7 9 8\n",
"1 10 4 11 2 3 6 9 7 8\n",
"4 6 9 5 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 16 8\n",
"6 3 9 5 4 14 15 7 16 8\n",
"7 3 9 5 4 14 15 8 16 6\n",
"7 3 9 5 4 26 15 8 16 6\n",
"6 3 9 7 4 26 15 8 16 5\n",
"6 3 1 7 4 26 15 8 16 5\n",
"5 1 2 6 3 26 15 7 16 4\n",
"5 1 2 6 3 26 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 8\n",
"5 1 2 6 3 47 28 7 18 8\n",
"5 1 2 6 3 47 28 8 18 7\n",
"5 1 2 6 3 47 54 8 18 7\n",
"5 1 2 6 3 47 54 12 18 7\n",
"5 1 2 6 4 47 54 12 18 3\n",
"5 1 3 6 4 47 54 12 18 2\n",
"1 2 4 6 5 47 54 12 18 3\n",
"1 2 5 6 4 47 54 12 18 3\n",
"1 2 5 6 4 47 56 12 18 3\n",
"1 2 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 47 56 19 18 2\n",
"3 1 5 6 4 63 56 19 18 2\n",
"3 1 5 7 4 63 56 19 18 2\n",
"4 5 9 6 2 14 15 7 10 8\n",
"1 2 3 4 5 6 7 10 8 9\n",
"1 10 2 11 3 4 7 9 5 8\n",
"20 19 12 1 13 15 3 2 6 10\n",
"5 2 1\n",
"4 5 10 14 2 15 16 6 11 7\n",
"20 19 10 2 12 15 3 13 6 11\n",
"3 2 1\n",
"4 5 9 12 2 14 15 6 10 7\n",
"4 6 9 5 2 14 15 10 11 7\n",
"1 10 4 11 2 3 6 8 7 9\n",
"4 5 9 2 3 14 15 6 10 7\n",
"5 6 10 9 3 14 15 7 11 8\n",
"5 6 10 7 3 14 15 8 16 9\n",
"5 1 9 4 3 14 15 6 16 7\n",
"7 3 9 5 4 14 15 8 28 6\n",
"6 3 9 4 2 26 15 7 16 5\n",
"6 3 9 7 4 26 15 8 27 5\n",
"6 3 1 7 4 26 15 2 16 5\n",
"5 1 2 6 4 47 15 7 18 3\n",
"5 1 2 4 3 47 28 8 18 7\n",
"5 1 2 6 3 47 71 8 18 7\n",
"5 1 2 6 3 47 54 12 10 7\n",
"5 1 2 6 4 47 54 12 17 3\n",
"6 1 2 7 4 47 5 12 18 3\n",
"5 2 3 6 4 47 54 12 18 1\n",
"1 2 4 10 5 47 54 12 18 3\n",
"1 2 3 6 5 47 54 12 18 4\n",
"2 1 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 7 56 19 18 2\n",
"5 1 2 6 4 47 54 12 18 3\n",
"1 10 2 11 3 4 5 8 6 7\n",
"1 10 2 11 3 4 6 9 7 8\n",
"1 2 5 6 4 47 56 12 18 3\n"
]
} | 2CODEFORCES
|
379_C. New Year Ratings Change_37949 | One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000 | n = int(input())
x = list(map(int, input().split()))
ans = x.copy()
b = sorted(x.copy())
k = b[0] + 1
d = {b[0]: [1, b[0]]}
for i in range(1, n):
if b[i - 1] == b[i]:
d[b[i]].append(k)
k += 1
else:
if b[i] < k:
d[b[i]] = [1, k]
else:
d[b[i]] = [1, b[i]]
k = b[i]
k += 1
for j in range(n):
ans[j] = d[x[j]][d[x[j]][0]]
d[x[j]][0] += 1
print(*ans)
| 3Python3
| {
"input": [
"1\n1000000000\n",
"3\n5 1 1\n",
"10\n4 5 10 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 1 1\n",
"10\n1 10 1 10 1 1 7 8 6 7\n",
"10\n20 19 12 1 12 15 2 12 6 10\n",
"10\n4 5 10 7 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 4 8 6 7\n",
"10\n20 19 10 1 12 15 2 12 6 10\n",
"3\n3 1 1\n",
"10\n4 5 9 7 2 14 15 6 10 6\n",
"10\n1 1 1 2 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 2 14 15 6 10 6\n",
"10\n1 1 1 3 1 1 1 1 2 1\n",
"10\n1 10 2 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 4\n",
"10\n5 3 9 4 3 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 16 4\n",
"10\n5 3 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 7\n",
"10\n5 1 1 5 3 47 28 6 18 7\n",
"10\n5 1 1 5 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 54 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 2\n",
"10\n5 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 56 12 18 1\n",
"10\n1 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 63 56 19 18 1\n",
"10\n2 1 4 7 3 63 56 19 18 1\n",
"10\n4 5 7 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 2 1 1\n",
"10\n1 10 1 10 1 1 7 8 4 7\n",
"10\n20 19 12 1 12 15 2 1 6 10\n",
"3\n5 2 1\n",
"10\n4 5 10 14 2 14 15 6 10 6\n",
"10\n20 19 10 2 12 15 2 12 6 10\n",
"3\n3 2 1\n",
"10\n4 5 9 12 2 14 15 6 10 6\n",
"10\n4 5 9 4 2 14 15 10 10 6\n",
"10\n1 10 2 10 1 1 6 8 6 8\n",
"10\n4 5 9 2 3 14 15 6 10 6\n",
"10\n5 5 9 8 3 14 15 6 10 6\n",
"10\n5 5 9 5 3 14 15 6 16 6\n",
"10\n5 1 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 28 4\n",
"10\n5 3 9 4 2 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 26 4\n",
"10\n5 3 1 5 3 26 15 2 16 4\n",
"10\n5 1 1 5 3 47 15 6 18 1\n",
"10\n5 1 1 4 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 71 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 10 7\n",
"10\n5 1 1 5 3 47 54 12 17 2\n",
"10\n5 1 2 5 3 47 3 12 18 2\n",
"10\n5 2 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 10 3 47 54 12 18 1\n",
"10\n1 1 1 5 3 47 54 12 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 2\n",
"10\n2 1 4 5 3 5 56 19 18 1\n",
"10\n5 1 2 5 3 47 54 12 18 2\n",
"10\n1 10 1 10 1 1 3 8 6 7\n",
"10\n1 10 1 10 1 1 6 9 6 7\n",
"10\n1 1 5 5 3 47 56 12 18 1\n"
],
"output": [
"1000000000 \n",
"5 \n1 \n2 \n",
"4 \n5 \n10 \n6 \n2 \n14 \n15 \n7 \n11 \n8 \n",
"1 \n2 \n3 \n4 \n5 \n6 \n7 \n8 \n9 \n10 \n",
"1 \n10 \n2 \n11 \n3 \n4 \n7 \n9 \n6 \n8 \n",
"20 \n19 \n12 \n1 \n13 \n15 \n2 \n14 \n6 \n10 \n",
"4 5 10 8 2 14 15 6 11 7\n",
"1 2 3 4 5 6 7 8 10 9\n",
"1 10 2 11 3 4 5 8 6 7\n",
"20 19 10 1 12 15 2 13 6 11\n",
"3 1 2\n",
"4 5 9 8 2 14 15 6 10 7\n",
"1 2 3 9 4 5 6 7 10 8\n",
"1 10 2 11 3 4 6 9 7 8\n",
"4 6 9 5 2 14 15 7 10 8\n",
"1 2 3 10 4 5 6 7 9 8\n",
"1 10 4 11 2 3 6 9 7 8\n",
"4 6 9 5 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 16 8\n",
"6 3 9 5 4 14 15 7 16 8\n",
"7 3 9 5 4 14 15 8 16 6\n",
"7 3 9 5 4 26 15 8 16 6\n",
"6 3 9 7 4 26 15 8 16 5\n",
"6 3 1 7 4 26 15 8 16 5\n",
"5 1 2 6 3 26 15 7 16 4\n",
"5 1 2 6 3 26 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 8\n",
"5 1 2 6 3 47 28 7 18 8\n",
"5 1 2 6 3 47 28 8 18 7\n",
"5 1 2 6 3 47 54 8 18 7\n",
"5 1 2 6 3 47 54 12 18 7\n",
"5 1 2 6 4 47 54 12 18 3\n",
"5 1 3 6 4 47 54 12 18 2\n",
"1 2 4 6 5 47 54 12 18 3\n",
"1 2 5 6 4 47 54 12 18 3\n",
"1 2 5 6 4 47 56 12 18 3\n",
"1 2 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 47 56 19 18 2\n",
"3 1 5 6 4 63 56 19 18 2\n",
"3 1 5 7 4 63 56 19 18 2\n",
"4 5 9 6 2 14 15 7 10 8\n",
"1 2 3 4 5 6 7 10 8 9\n",
"1 10 2 11 3 4 7 9 5 8\n",
"20 19 12 1 13 15 3 2 6 10\n",
"5 2 1\n",
"4 5 10 14 2 15 16 6 11 7\n",
"20 19 10 2 12 15 3 13 6 11\n",
"3 2 1\n",
"4 5 9 12 2 14 15 6 10 7\n",
"4 6 9 5 2 14 15 10 11 7\n",
"1 10 4 11 2 3 6 8 7 9\n",
"4 5 9 2 3 14 15 6 10 7\n",
"5 6 10 9 3 14 15 7 11 8\n",
"5 6 10 7 3 14 15 8 16 9\n",
"5 1 9 4 3 14 15 6 16 7\n",
"7 3 9 5 4 14 15 8 28 6\n",
"6 3 9 4 2 26 15 7 16 5\n",
"6 3 9 7 4 26 15 8 27 5\n",
"6 3 1 7 4 26 15 2 16 5\n",
"5 1 2 6 4 47 15 7 18 3\n",
"5 1 2 4 3 47 28 8 18 7\n",
"5 1 2 6 3 47 71 8 18 7\n",
"5 1 2 6 3 47 54 12 10 7\n",
"5 1 2 6 4 47 54 12 17 3\n",
"6 1 2 7 4 47 5 12 18 3\n",
"5 2 3 6 4 47 54 12 18 1\n",
"1 2 4 10 5 47 54 12 18 3\n",
"1 2 3 6 5 47 54 12 18 4\n",
"2 1 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 7 56 19 18 2\n",
"5 1 2 6 4 47 54 12 18 3\n",
"1 10 2 11 3 4 5 8 6 7\n",
"1 10 2 11 3 4 6 9 7 8\n",
"1 2 5 6 4 47 56 12 18 3\n"
]
} | 2CODEFORCES
|
379_C. New Year Ratings Change_37950 | One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000 | import java.awt.*;
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.ParseException;
import java.util.*;
import java.util.List;
import static java.lang.Math.max;
public class Main implements Runnable {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
final Scanner in;
Writer out;
long timeBegin, timeEnd;
public Main() throws FileNotFoundException {
Locale.setDefault(Locale.US);
if (ONLINE_JUDGE) {
in = new Scanner(new InputStreamReader(System.in));
out = new Writer(System.out);
} else {
in = new Scanner(new FileReader("input.txt"));
//out = new Writer("output.txt");
out = new Writer(System.out);
}
}
public static void main(String[] args) throws FileNotFoundException {
new Thread(null, new Main(), "", 128 * (1L << 20)).start();
}
void time() {
timeEnd = System.currentTimeMillis();
System.err.println("Time: " + (timeEnd - timeBegin) + "ms");
}
public void run() {
try {
timeBegin = System.currentTimeMillis();
solve();
out.close();
time();
} catch (Exception e) {
e.printStackTrace(System.err);
System.exit(-1);
}
}
void solve() throws IOException, ParseException {
int n = in.nextInt();
ArrayList<Pair<Integer>> a = in.nextIndexedIntArrayList(n);
Collections.sort(a, new Comparator<Pair<Integer>>() {
@Override
public int compare(Pair<Integer> o1, Pair<Integer> o2) {
return o1.x - o2.x;
}
});
int c = 0;
int[] ans = new int[n];
for (int i = 0; i < n; ++i) {
c = max(c, a.get(i).x);
ans[a.get(i).y] = c;
c++;
}
out.printArray(ans);
}
}
class Pair<T> {
T x;
T y;
Pair(T x, T y) {
this.x = x;
this.y = y;
}
}
class Scanner {
BufferedReader in;
StringTokenizer stringTokenizer;
public Scanner(InputStreamReader inputStreamReader) throws FileNotFoundException {
in = new BufferedReader(inputStreamReader);
}
String next() {
while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {
try {
stringTokenizer = new StringTokenizer(in.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return stringTokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int[] nextIntArray(int size) throws IOException {
int[] array = new int[size];
for (int index = 0; index < size; ++index) {
array[index] = nextInt();
}
return array;
}
ArrayList<Integer> nextIntArrayList(int size) {
ArrayList<Integer> result = new ArrayList<>();
for (int i = 0; i < size; i++) {
result.add(nextInt());
}
return result;
}
ArrayList<Pair<Integer>> nextIndexedIntArrayList(int size) {
ArrayList<Pair<Integer>> result = new ArrayList<>();
for (int i = 0; i < size; i++) {
result.add(new Pair<>(nextInt(), i));
}
return result;
}
long nextLong() {
return Long.parseLong(next());
}
long[] readLongArray(int size) throws IOException {
long[] array = new long[size];
for (int index = 0; index < size; ++index) {
array[index] = nextLong();
}
return array;
}
double nextDouble() {
return Double.parseDouble(next());
}
double[] readDoubleArray(int size) throws IOException {
double[] array = new double[size];
for (int index = 0; index < size; ++index) {
array[index] = nextDouble();
}
return array;
}
char nextChar() throws IOException {
int intValue = in.read();
while (intValue == 10 || intValue == 13) {
intValue = in.read();
}
if (intValue == -1) {
return '\0';
}
return (char) intValue;
}
char[] readCharArray() throws IOException {
return nextLine().toCharArray();
}
BigInteger readBigInteger() throws IOException {
return new BigInteger(next());
}
BigDecimal readBigDecimal() throws IOException {
return new BigDecimal(next());
}
Point nextPoint() throws IOException {
int x = nextInt(), y = nextInt();
return new Point(x, y);
}
Point[] nextPointArray(int size) throws IOException {
Point[] array = new Point[size];
for (int index = 0; index < size; ++index) {
array[index] = nextPoint();
}
return array;
}
List<Integer>[] readGraph(int vertexNumber, int edgeNumber) throws IOException {
@SuppressWarnings("unchecked")
List<Integer>[] graph = new List[vertexNumber];
for (int index = 0; index < vertexNumber; ++index) {
graph[index] = new ArrayList<>();
}
while (edgeNumber-- > 0) {
int from = nextInt() - 1;
int to = nextInt() - 1;
graph[from].add(to);
graph[to].add(from);
}
return graph;
}
String nextLine() {
String str = "";
try {
str = in.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
class Writer extends PrintWriter {
final int DEFAULT_PRECISION = 12;
int precision;
String format, formatWithSpace;
{
precision = DEFAULT_PRECISION;
format = createFormat(precision);
formatWithSpace = format + " ";
}
public Writer(OutputStream out) {
super(out);
}
public Writer(String fileName) throws FileNotFoundException {
super(fileName);
}
public int getPrecision() {
return precision;
}
public void setPrecision(int precision) {
precision = max(0, precision);
this.precision = precision;
format = createFormat(precision);
formatWithSpace = format + " ";
}
public <T> void printMany(List<T> list) {
for (T element : list) {
print(element);
print(" ");
}
}
public void printArray(int[] a) {
for (int element : a) {
print(element);
print(" ");
}
}
private String createFormat(int precision) {
return "%." + precision + "f";
}
@Override
public void print(double d) {
printf(format, d);
}
public void printWithSpace(double d) {
printf(formatWithSpace, d);
}
public void printAll(double... d) {
for (int i = 0; i < d.length - 1; ++i) {
printWithSpace(d[i]);
}
print(d[d.length - 1]);
}
@Override
public void println(double d) {
printlnAll(d);
}
public void printlnAll(double... d) {
printAll(d);
println();
}
}
| 4JAVA
| {
"input": [
"1\n1000000000\n",
"3\n5 1 1\n",
"10\n4 5 10 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 1 1\n",
"10\n1 10 1 10 1 1 7 8 6 7\n",
"10\n20 19 12 1 12 15 2 12 6 10\n",
"10\n4 5 10 7 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 4 8 6 7\n",
"10\n20 19 10 1 12 15 2 12 6 10\n",
"3\n3 1 1\n",
"10\n4 5 9 7 2 14 15 6 10 6\n",
"10\n1 1 1 2 1 1 1 1 2 1\n",
"10\n1 10 1 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 2 14 15 6 10 6\n",
"10\n1 1 1 3 1 1 1 1 2 1\n",
"10\n1 10 2 10 1 1 6 8 6 7\n",
"10\n4 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 10 6\n",
"10\n5 5 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 16 4\n",
"10\n5 3 9 4 3 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 16 4\n",
"10\n5 3 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 16 4\n",
"10\n5 1 1 5 3 26 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 4\n",
"10\n5 1 1 5 3 47 15 6 18 7\n",
"10\n5 1 1 5 3 47 28 6 18 7\n",
"10\n5 1 1 5 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 54 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 7\n",
"10\n5 1 1 5 3 47 54 12 18 2\n",
"10\n5 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 54 12 18 1\n",
"10\n1 1 4 5 3 47 56 12 18 1\n",
"10\n1 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 1\n",
"10\n2 1 4 5 3 63 56 19 18 1\n",
"10\n2 1 4 7 3 63 56 19 18 1\n",
"10\n4 5 7 5 2 14 15 6 10 6\n",
"10\n1 1 1 1 1 1 1 2 1 1\n",
"10\n1 10 1 10 1 1 7 8 4 7\n",
"10\n20 19 12 1 12 15 2 1 6 10\n",
"3\n5 2 1\n",
"10\n4 5 10 14 2 14 15 6 10 6\n",
"10\n20 19 10 2 12 15 2 12 6 10\n",
"3\n3 2 1\n",
"10\n4 5 9 12 2 14 15 6 10 6\n",
"10\n4 5 9 4 2 14 15 10 10 6\n",
"10\n1 10 2 10 1 1 6 8 6 8\n",
"10\n4 5 9 2 3 14 15 6 10 6\n",
"10\n5 5 9 8 3 14 15 6 10 6\n",
"10\n5 5 9 5 3 14 15 6 16 6\n",
"10\n5 1 9 4 3 14 15 6 16 6\n",
"10\n5 3 9 4 3 14 15 6 28 4\n",
"10\n5 3 9 4 2 26 15 6 16 4\n",
"10\n5 3 9 5 3 26 15 6 26 4\n",
"10\n5 3 1 5 3 26 15 2 16 4\n",
"10\n5 1 1 5 3 47 15 6 18 1\n",
"10\n5 1 1 4 3 47 28 8 18 7\n",
"10\n5 1 1 5 3 47 71 8 18 7\n",
"10\n5 1 1 5 3 47 54 12 10 7\n",
"10\n5 1 1 5 3 47 54 12 17 2\n",
"10\n5 1 2 5 3 47 3 12 18 2\n",
"10\n5 2 2 5 3 47 54 12 18 1\n",
"10\n1 1 2 10 3 47 54 12 18 1\n",
"10\n1 1 1 5 3 47 54 12 18 1\n",
"10\n2 1 4 5 3 47 56 19 18 2\n",
"10\n2 1 4 5 3 5 56 19 18 1\n",
"10\n5 1 2 5 3 47 54 12 18 2\n",
"10\n1 10 1 10 1 1 3 8 6 7\n",
"10\n1 10 1 10 1 1 6 9 6 7\n",
"10\n1 1 5 5 3 47 56 12 18 1\n"
],
"output": [
"1000000000 \n",
"5 \n1 \n2 \n",
"4 \n5 \n10 \n6 \n2 \n14 \n15 \n7 \n11 \n8 \n",
"1 \n2 \n3 \n4 \n5 \n6 \n7 \n8 \n9 \n10 \n",
"1 \n10 \n2 \n11 \n3 \n4 \n7 \n9 \n6 \n8 \n",
"20 \n19 \n12 \n1 \n13 \n15 \n2 \n14 \n6 \n10 \n",
"4 5 10 8 2 14 15 6 11 7\n",
"1 2 3 4 5 6 7 8 10 9\n",
"1 10 2 11 3 4 5 8 6 7\n",
"20 19 10 1 12 15 2 13 6 11\n",
"3 1 2\n",
"4 5 9 8 2 14 15 6 10 7\n",
"1 2 3 9 4 5 6 7 10 8\n",
"1 10 2 11 3 4 6 9 7 8\n",
"4 6 9 5 2 14 15 7 10 8\n",
"1 2 3 10 4 5 6 7 9 8\n",
"1 10 4 11 2 3 6 9 7 8\n",
"4 6 9 5 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 10 8\n",
"5 6 9 4 3 14 15 7 16 8\n",
"6 3 9 5 4 14 15 7 16 8\n",
"7 3 9 5 4 14 15 8 16 6\n",
"7 3 9 5 4 26 15 8 16 6\n",
"6 3 9 7 4 26 15 8 16 5\n",
"6 3 1 7 4 26 15 8 16 5\n",
"5 1 2 6 3 26 15 7 16 4\n",
"5 1 2 6 3 26 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 4\n",
"5 1 2 6 3 47 15 7 18 8\n",
"5 1 2 6 3 47 28 7 18 8\n",
"5 1 2 6 3 47 28 8 18 7\n",
"5 1 2 6 3 47 54 8 18 7\n",
"5 1 2 6 3 47 54 12 18 7\n",
"5 1 2 6 4 47 54 12 18 3\n",
"5 1 3 6 4 47 54 12 18 2\n",
"1 2 4 6 5 47 54 12 18 3\n",
"1 2 5 6 4 47 54 12 18 3\n",
"1 2 5 6 4 47 56 12 18 3\n",
"1 2 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 47 56 19 18 2\n",
"3 1 5 6 4 63 56 19 18 2\n",
"3 1 5 7 4 63 56 19 18 2\n",
"4 5 9 6 2 14 15 7 10 8\n",
"1 2 3 4 5 6 7 10 8 9\n",
"1 10 2 11 3 4 7 9 5 8\n",
"20 19 12 1 13 15 3 2 6 10\n",
"5 2 1\n",
"4 5 10 14 2 15 16 6 11 7\n",
"20 19 10 2 12 15 3 13 6 11\n",
"3 2 1\n",
"4 5 9 12 2 14 15 6 10 7\n",
"4 6 9 5 2 14 15 10 11 7\n",
"1 10 4 11 2 3 6 8 7 9\n",
"4 5 9 2 3 14 15 6 10 7\n",
"5 6 10 9 3 14 15 7 11 8\n",
"5 6 10 7 3 14 15 8 16 9\n",
"5 1 9 4 3 14 15 6 16 7\n",
"7 3 9 5 4 14 15 8 28 6\n",
"6 3 9 4 2 26 15 7 16 5\n",
"6 3 9 7 4 26 15 8 27 5\n",
"6 3 1 7 4 26 15 2 16 5\n",
"5 1 2 6 4 47 15 7 18 3\n",
"5 1 2 4 3 47 28 8 18 7\n",
"5 1 2 6 3 47 71 8 18 7\n",
"5 1 2 6 3 47 54 12 10 7\n",
"5 1 2 6 4 47 54 12 17 3\n",
"6 1 2 7 4 47 5 12 18 3\n",
"5 2 3 6 4 47 54 12 18 1\n",
"1 2 4 10 5 47 54 12 18 3\n",
"1 2 3 6 5 47 54 12 18 4\n",
"2 1 5 6 4 47 56 19 18 3\n",
"3 1 5 6 4 7 56 19 18 2\n",
"5 1 2 6 4 47 54 12 18 3\n",
"1 10 2 11 3 4 5 8 6 7\n",
"1 10 2 11 3 4 6 9 7 8\n",
"1 2 5 6 4 47 56 12 18 3\n"
]
} | 2CODEFORCES
|
39_J. Spelling Check_37951 | Petya has noticed that when he types using a keyboard, he often presses extra buttons and adds extra letters to the words. Of course, the spell-checking system underlines the words for him and he has to click every word and choose the right variant. Petya got fed up with correcting his mistakes himself, that’s why he decided to invent the function that will correct the words itself. Petya started from analyzing the case that happens to him most of the time, when all one needs is to delete one letter for the word to match a word from the dictionary. Thus, Petya faces one mini-task: he has a printed word and a word from the dictionary, and he should delete one letter from the first word to get the second one. And now the very non-trivial question that Petya faces is: which letter should he delete?
Input
The input data contains two strings, consisting of lower-case Latin letters. The length of each string is from 1 to 106 symbols inclusive, the first string contains exactly 1 symbol more than the second one.
Output
In the first line output the number of positions of the symbols in the first string, after the deleting of which the first string becomes identical to the second one. In the second line output space-separated positions of these symbols in increasing order. The positions are numbered starting from 1. If it is impossible to make the first string identical to the second string by deleting one symbol, output one number 0.
Examples
Input
abdrakadabra
abrakadabra
Output
1
3
Input
aa
a
Output
2
1 2
Input
competition
codeforces
Output
0 | #!/usr/bin/python
import os
import sys
import itertools
import collections
import string
def solve(f):
s1 = f.read_str()
s2 = f.read_str()
n = len(s1)
c1 = collections.Counter(s1)
c2 = collections.Counter(s2)
ans1 = None
for i in xrange(n-1):
if s1[i] != s2[i]:
ans1 = i
break
if ans1 is None: ans1 = n-1
ans2 = None
for i in xrange(n-1,0,-1):
if s1[i] != s2[i-1]:
ans2 = i
break
if ans2 is None: ans2 = 0
# print ans1, ans2
if len(set(s1[ans2:ans1+1])) == 1:
print ans1-ans2+1
ans = []
for i in xrange(ans2, ans1+1):
ans.append(str(i+1))
print ' '.join(ans)
else:
print 0
class Reader(object):
def __init__(self, filename=None):
self.test_mode = filename is not None
self.cases = 1
self.buffer = []
if self.test_mode:
with open(filename) as f:
blank_flg = False
for line in f:
line = line.strip()
if line:
self.buffer.append(line)
blank_flg = False
else:
if not blank_flg: self.cases += 1
blank_flg = True
def __readline(self):
return self.buffer.pop(0) if self.test_mode else raw_input()
def read_int(self):
return int(self.__readline())
def read_float(self):
return float(self.__readline())
def read_long(self):
return long(self.__readline())
def read_str(self):
return self.__readline()
def read_int_list(self):
return [int(item) for item in self.__readline().split()]
def read_float_list(self):
return [float(item) for item in self.__readline().split()]
def read_long_list(self):
return [long(item) for item in self.__readline().split()]
def read_str_list(self):
return self.__readline().split()
if __name__ == '__main__':
filename = sys.argv[1] if len(sys.argv)>1 else None
f = Reader(filename)
if f.test_mode:
for c in xrange(f.cases):
print "Case #%d"%(c+1)
solve(f)
else:
solve(f)
| 1Python2
| {
"input": [
"competition\ncodeforces\n",
"abdrakadabra\nabrakadabra\n",
"aa\na\n",
"babbbtaamba\nbabbbaabba\n",
"vct\nie\n",
"xdfxmcnzpch\nazvotghvtk\n",
"aaaaaaaaaaa\naaaaaaaaaa\n",
"feee\nsnl\n",
"cccacaccacb\ncccacaccac\n",
"ababcaabaaa\nabacaabaaa\n",
"ki\nb\n",
"bccaabbcccc\nbccaabcccc\n",
"ab\na\n",
"babaacaacaa\nbbaacaacaa\n",
"bb\nb\n",
"aabb\nabb\n",
"qybldcgfhdhhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\nqybldcgfhdhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\n",
"lcaaxcbcjca\nccaaacccca\n",
"cbxxxxzvks\ncbxxxzvks\n",
"aab\nab\n",
"babbataamba\nbabbbaabba\n",
"ab\nb\n",
"vtc\nie\n",
"xdfymcnzpch\nazvotghvtk\n",
"cccacaccadb\ncccacaccac\n",
"ababcaabaaa\nabaca`baaa\n",
"ik\nb\n",
"ac\nb\n",
"lcaaxcbcjca\nccaaaccdca\n",
"competision\ncodeforces\n",
"abdrakad`bra\nabrakadabra\n",
"babbataamba\nabbaabbbab\n",
"vtc\nei\n",
"xdfymcnzpch\nazvotfhvtk\n",
"cccacaccadb\ncccbcaccac\n",
"ababcaacaaa\nabaca`baaa\n",
"il\nb\n",
"ac\nc\n",
"lcabxcbcjca\nccaaaccdca\n",
"comoetision\ncodeforces\n",
"abdrakad`bra\nabrakadbbra\n",
"vtc\nfi\n",
"xdfymcnzpch\nazvotehvtk\n",
"cccacaccbdb\ncccbcaccac\n",
"ababcaacaaa\nabaca`aaaa\n",
"im\nb\n",
"ac\nd\n",
"acjcbcxbacl\nccaaaccdca\n",
"comoitiseon\ncodeforces\n",
"arb`dakardba\nabrakadbbra\n",
"ctv\nfi\n",
"xdfymchzpcn\nazvotehvtk\n",
"ababcaacaaa\nabaca`aa`a\n",
"in\nb\n",
"ac\ne\n",
"acjcbcxbacl\nacdccaaacc\n",
"comoithseon\ncodeforces\n",
"arb`dakardba\nabrakbdabra\n",
"ctv\nei\n",
"xdfymchzpbn\nazvotehvtk\n",
"ababcabcaaa\nabaca`aa`a\n",
"ni\nb\n",
"bc\ne\n",
"acjdbcxbacl\nacdccaaacc\n",
"comoithsoen\ncodeforces\n",
"arb`dakardba\narbadbkarba\n",
"vtc\neh\n",
"xdfymdhzpbn\nazvotehvtk\n",
"mi\nb\n",
"bd\ne\n"
],
"output": [
"0\n",
"1\n3 ",
"2\n1 2 ",
"0\n",
"0\n",
"0\n",
"11\n1 2 3 4 5 6 7 8 9 10 11 ",
"0\n",
"1\n11 ",
"1\n4 ",
"0\n",
"2\n6 7 ",
"1\n2 ",
"1\n2 ",
"2\n1 2 ",
"2\n1 2 ",
"10\n11 12 13 14 15 16 17 18 19 20 ",
"0\n",
"4\n3 4 5 6 ",
"2\n1 2 ",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
39_J. Spelling Check_37952 | Petya has noticed that when he types using a keyboard, he often presses extra buttons and adds extra letters to the words. Of course, the spell-checking system underlines the words for him and he has to click every word and choose the right variant. Petya got fed up with correcting his mistakes himself, that’s why he decided to invent the function that will correct the words itself. Petya started from analyzing the case that happens to him most of the time, when all one needs is to delete one letter for the word to match a word from the dictionary. Thus, Petya faces one mini-task: he has a printed word and a word from the dictionary, and he should delete one letter from the first word to get the second one. And now the very non-trivial question that Petya faces is: which letter should he delete?
Input
The input data contains two strings, consisting of lower-case Latin letters. The length of each string is from 1 to 106 symbols inclusive, the first string contains exactly 1 symbol more than the second one.
Output
In the first line output the number of positions of the symbols in the first string, after the deleting of which the first string becomes identical to the second one. In the second line output space-separated positions of these symbols in increasing order. The positions are numbered starting from 1. If it is impossible to make the first string identical to the second string by deleting one symbol, output one number 0.
Examples
Input
abdrakadabra
abrakadabra
Output
1
3
Input
aa
a
Output
2
1 2
Input
competition
codeforces
Output
0 | #include <bits/stdc++.h>
using namespace std;
void cp() {
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int main() {
cp();
{
string s, t;
cin >> s >> t;
if (s.length() == t.length() + 1) {
long long m = 0;
long long in = -1;
char f;
long long j = 0;
for (long long i = 0; i < s.length(); i += 1) {
if (s[i] != t[j]) {
f = s.at(i);
in = i;
m++;
j--;
}
j++;
}
vector<long long> ans;
if (m == 1) {
while (in > -1) {
if (s[in] == f) {
in--;
} else {
break;
}
}
in++;
while (in < s.length()) {
if (s[in] == f) {
ans.push_back(in + 1);
in++;
} else {
break;
}
}
cout << ans.size();
cout << endl;
;
for (long long i = 0; i < ans.size(); i += 1) cout << ans[i] << " ";
} else {
cout << "0\n";
}
} else {
cout << "0\n";
}
}
return 0;
}
| 2C++
| {
"input": [
"competition\ncodeforces\n",
"abdrakadabra\nabrakadabra\n",
"aa\na\n",
"babbbtaamba\nbabbbaabba\n",
"vct\nie\n",
"xdfxmcnzpch\nazvotghvtk\n",
"aaaaaaaaaaa\naaaaaaaaaa\n",
"feee\nsnl\n",
"cccacaccacb\ncccacaccac\n",
"ababcaabaaa\nabacaabaaa\n",
"ki\nb\n",
"bccaabbcccc\nbccaabcccc\n",
"ab\na\n",
"babaacaacaa\nbbaacaacaa\n",
"bb\nb\n",
"aabb\nabb\n",
"qybldcgfhdhhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\nqybldcgfhdhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\n",
"lcaaxcbcjca\nccaaacccca\n",
"cbxxxxzvks\ncbxxxzvks\n",
"aab\nab\n",
"babbataamba\nbabbbaabba\n",
"ab\nb\n",
"vtc\nie\n",
"xdfymcnzpch\nazvotghvtk\n",
"cccacaccadb\ncccacaccac\n",
"ababcaabaaa\nabaca`baaa\n",
"ik\nb\n",
"ac\nb\n",
"lcaaxcbcjca\nccaaaccdca\n",
"competision\ncodeforces\n",
"abdrakad`bra\nabrakadabra\n",
"babbataamba\nabbaabbbab\n",
"vtc\nei\n",
"xdfymcnzpch\nazvotfhvtk\n",
"cccacaccadb\ncccbcaccac\n",
"ababcaacaaa\nabaca`baaa\n",
"il\nb\n",
"ac\nc\n",
"lcabxcbcjca\nccaaaccdca\n",
"comoetision\ncodeforces\n",
"abdrakad`bra\nabrakadbbra\n",
"vtc\nfi\n",
"xdfymcnzpch\nazvotehvtk\n",
"cccacaccbdb\ncccbcaccac\n",
"ababcaacaaa\nabaca`aaaa\n",
"im\nb\n",
"ac\nd\n",
"acjcbcxbacl\nccaaaccdca\n",
"comoitiseon\ncodeforces\n",
"arb`dakardba\nabrakadbbra\n",
"ctv\nfi\n",
"xdfymchzpcn\nazvotehvtk\n",
"ababcaacaaa\nabaca`aa`a\n",
"in\nb\n",
"ac\ne\n",
"acjcbcxbacl\nacdccaaacc\n",
"comoithseon\ncodeforces\n",
"arb`dakardba\nabrakbdabra\n",
"ctv\nei\n",
"xdfymchzpbn\nazvotehvtk\n",
"ababcabcaaa\nabaca`aa`a\n",
"ni\nb\n",
"bc\ne\n",
"acjdbcxbacl\nacdccaaacc\n",
"comoithsoen\ncodeforces\n",
"arb`dakardba\narbadbkarba\n",
"vtc\neh\n",
"xdfymdhzpbn\nazvotehvtk\n",
"mi\nb\n",
"bd\ne\n"
],
"output": [
"0\n",
"1\n3 ",
"2\n1 2 ",
"0\n",
"0\n",
"0\n",
"11\n1 2 3 4 5 6 7 8 9 10 11 ",
"0\n",
"1\n11 ",
"1\n4 ",
"0\n",
"2\n6 7 ",
"1\n2 ",
"1\n2 ",
"2\n1 2 ",
"2\n1 2 ",
"10\n11 12 13 14 15 16 17 18 19 20 ",
"0\n",
"4\n3 4 5 6 ",
"2\n1 2 ",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
39_J. Spelling Check_37953 | Petya has noticed that when he types using a keyboard, he often presses extra buttons and adds extra letters to the words. Of course, the spell-checking system underlines the words for him and he has to click every word and choose the right variant. Petya got fed up with correcting his mistakes himself, that’s why he decided to invent the function that will correct the words itself. Petya started from analyzing the case that happens to him most of the time, when all one needs is to delete one letter for the word to match a word from the dictionary. Thus, Petya faces one mini-task: he has a printed word and a word from the dictionary, and he should delete one letter from the first word to get the second one. And now the very non-trivial question that Petya faces is: which letter should he delete?
Input
The input data contains two strings, consisting of lower-case Latin letters. The length of each string is from 1 to 106 symbols inclusive, the first string contains exactly 1 symbol more than the second one.
Output
In the first line output the number of positions of the symbols in the first string, after the deleting of which the first string becomes identical to the second one. In the second line output space-separated positions of these symbols in increasing order. The positions are numbered starting from 1. If it is impossible to make the first string identical to the second string by deleting one symbol, output one number 0.
Examples
Input
abdrakadabra
abrakadabra
Output
1
3
Input
aa
a
Output
2
1 2
Input
competition
codeforces
Output
0 | s,t=input(),input()
n=idx=len(t)
for i in range(n):
if s[i]!=t[i]:
idx=i
break
for i in range(idx+1,n+1):
if s[i]!=t[i-1]:
print(0)
import sys
sys.exit()
i=idx
while i>0 and s[i-1]==s[idx]:
i-=1
print(idx-i+1)
print(' '.join(map(str,range(i+1,idx+2)))) | 3Python3
| {
"input": [
"competition\ncodeforces\n",
"abdrakadabra\nabrakadabra\n",
"aa\na\n",
"babbbtaamba\nbabbbaabba\n",
"vct\nie\n",
"xdfxmcnzpch\nazvotghvtk\n",
"aaaaaaaaaaa\naaaaaaaaaa\n",
"feee\nsnl\n",
"cccacaccacb\ncccacaccac\n",
"ababcaabaaa\nabacaabaaa\n",
"ki\nb\n",
"bccaabbcccc\nbccaabcccc\n",
"ab\na\n",
"babaacaacaa\nbbaacaacaa\n",
"bb\nb\n",
"aabb\nabb\n",
"qybldcgfhdhhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\nqybldcgfhdhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\n",
"lcaaxcbcjca\nccaaacccca\n",
"cbxxxxzvks\ncbxxxzvks\n",
"aab\nab\n",
"babbataamba\nbabbbaabba\n",
"ab\nb\n",
"vtc\nie\n",
"xdfymcnzpch\nazvotghvtk\n",
"cccacaccadb\ncccacaccac\n",
"ababcaabaaa\nabaca`baaa\n",
"ik\nb\n",
"ac\nb\n",
"lcaaxcbcjca\nccaaaccdca\n",
"competision\ncodeforces\n",
"abdrakad`bra\nabrakadabra\n",
"babbataamba\nabbaabbbab\n",
"vtc\nei\n",
"xdfymcnzpch\nazvotfhvtk\n",
"cccacaccadb\ncccbcaccac\n",
"ababcaacaaa\nabaca`baaa\n",
"il\nb\n",
"ac\nc\n",
"lcabxcbcjca\nccaaaccdca\n",
"comoetision\ncodeforces\n",
"abdrakad`bra\nabrakadbbra\n",
"vtc\nfi\n",
"xdfymcnzpch\nazvotehvtk\n",
"cccacaccbdb\ncccbcaccac\n",
"ababcaacaaa\nabaca`aaaa\n",
"im\nb\n",
"ac\nd\n",
"acjcbcxbacl\nccaaaccdca\n",
"comoitiseon\ncodeforces\n",
"arb`dakardba\nabrakadbbra\n",
"ctv\nfi\n",
"xdfymchzpcn\nazvotehvtk\n",
"ababcaacaaa\nabaca`aa`a\n",
"in\nb\n",
"ac\ne\n",
"acjcbcxbacl\nacdccaaacc\n",
"comoithseon\ncodeforces\n",
"arb`dakardba\nabrakbdabra\n",
"ctv\nei\n",
"xdfymchzpbn\nazvotehvtk\n",
"ababcabcaaa\nabaca`aa`a\n",
"ni\nb\n",
"bc\ne\n",
"acjdbcxbacl\nacdccaaacc\n",
"comoithsoen\ncodeforces\n",
"arb`dakardba\narbadbkarba\n",
"vtc\neh\n",
"xdfymdhzpbn\nazvotehvtk\n",
"mi\nb\n",
"bd\ne\n"
],
"output": [
"0\n",
"1\n3 ",
"2\n1 2 ",
"0\n",
"0\n",
"0\n",
"11\n1 2 3 4 5 6 7 8 9 10 11 ",
"0\n",
"1\n11 ",
"1\n4 ",
"0\n",
"2\n6 7 ",
"1\n2 ",
"1\n2 ",
"2\n1 2 ",
"2\n1 2 ",
"10\n11 12 13 14 15 16 17 18 19 20 ",
"0\n",
"4\n3 4 5 6 ",
"2\n1 2 ",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
39_J. Spelling Check_37954 | Petya has noticed that when he types using a keyboard, he often presses extra buttons and adds extra letters to the words. Of course, the spell-checking system underlines the words for him and he has to click every word and choose the right variant. Petya got fed up with correcting his mistakes himself, that’s why he decided to invent the function that will correct the words itself. Petya started from analyzing the case that happens to him most of the time, when all one needs is to delete one letter for the word to match a word from the dictionary. Thus, Petya faces one mini-task: he has a printed word and a word from the dictionary, and he should delete one letter from the first word to get the second one. And now the very non-trivial question that Petya faces is: which letter should he delete?
Input
The input data contains two strings, consisting of lower-case Latin letters. The length of each string is from 1 to 106 symbols inclusive, the first string contains exactly 1 symbol more than the second one.
Output
In the first line output the number of positions of the symbols in the first string, after the deleting of which the first string becomes identical to the second one. In the second line output space-separated positions of these symbols in increasing order. The positions are numbered starting from 1. If it is impossible to make the first string identical to the second string by deleting one symbol, output one number 0.
Examples
Input
abdrakadabra
abrakadabra
Output
1
3
Input
aa
a
Output
2
1 2
Input
competition
codeforces
Output
0 | import java.util.Scanner;
public class cf39j {
final static long mod1 = (long)1e9+7;
final static long mod2 = (long)1e9+9;
final static long p1 = 137;
final static long p2 = 179;
public static void main(String []args){
Scanner cin = new Scanner(System.in);
String str1,str2;
str1 = cin.nextLine();
str2 = cin.nextLine();
int l = str1.length(),cnt = 0;
int []ans = new int[l+10];
Hash a = new Hash(p1,mod1,str1);
Hash b= new Hash(p1,mod1,str2);
a.gethash();
b.gethash();
for(int i = 0; i < l; i++){
//System.out.println(i);
if(a.getval(0,i-1) == b.getval(0,i-1) && a.getval(i+1,l-1) == b.getval(i, l-2)){
ans[cnt++] = i;
}
}
System.out.println(cnt);
StringBuilder res = new StringBuilder();
for(int i = 0; i < cnt; i++){
res.append(ans[i]+1);
res.append(" ");
}
System.out.println(res);
}
};
class Hash{
long a[],X[],base,M;
String s;
Hash(){}
Hash(long base,long M,String s){
this.base = base;
this.M = M;
this.s = s;
a = new long[s.length() + 10];
X = new long[s.length() + 10];
}
void gethash(){
a[s.length()] = 0;
for(int i = s.length()-1; i >= 0; i--){
a[i] = a[i+1] * base % M + s.charAt(i);
}
X[0] = 1;
for(int i = 1; i < s.length(); i++)
X[i] = X[i-1] * base % M;
}
long getval(int l,int r){
if(r < l) return 0;
return (a[l] - a[r+1]*X[r-l+1]%M+M)%M;
}
};
| 4JAVA
| {
"input": [
"competition\ncodeforces\n",
"abdrakadabra\nabrakadabra\n",
"aa\na\n",
"babbbtaamba\nbabbbaabba\n",
"vct\nie\n",
"xdfxmcnzpch\nazvotghvtk\n",
"aaaaaaaaaaa\naaaaaaaaaa\n",
"feee\nsnl\n",
"cccacaccacb\ncccacaccac\n",
"ababcaabaaa\nabacaabaaa\n",
"ki\nb\n",
"bccaabbcccc\nbccaabcccc\n",
"ab\na\n",
"babaacaacaa\nbbaacaacaa\n",
"bb\nb\n",
"aabb\nabb\n",
"qybldcgfhdhhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\nqybldcgfhdhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\n",
"lcaaxcbcjca\nccaaacccca\n",
"cbxxxxzvks\ncbxxxzvks\n",
"aab\nab\n",
"babbataamba\nbabbbaabba\n",
"ab\nb\n",
"vtc\nie\n",
"xdfymcnzpch\nazvotghvtk\n",
"cccacaccadb\ncccacaccac\n",
"ababcaabaaa\nabaca`baaa\n",
"ik\nb\n",
"ac\nb\n",
"lcaaxcbcjca\nccaaaccdca\n",
"competision\ncodeforces\n",
"abdrakad`bra\nabrakadabra\n",
"babbataamba\nabbaabbbab\n",
"vtc\nei\n",
"xdfymcnzpch\nazvotfhvtk\n",
"cccacaccadb\ncccbcaccac\n",
"ababcaacaaa\nabaca`baaa\n",
"il\nb\n",
"ac\nc\n",
"lcabxcbcjca\nccaaaccdca\n",
"comoetision\ncodeforces\n",
"abdrakad`bra\nabrakadbbra\n",
"vtc\nfi\n",
"xdfymcnzpch\nazvotehvtk\n",
"cccacaccbdb\ncccbcaccac\n",
"ababcaacaaa\nabaca`aaaa\n",
"im\nb\n",
"ac\nd\n",
"acjcbcxbacl\nccaaaccdca\n",
"comoitiseon\ncodeforces\n",
"arb`dakardba\nabrakadbbra\n",
"ctv\nfi\n",
"xdfymchzpcn\nazvotehvtk\n",
"ababcaacaaa\nabaca`aa`a\n",
"in\nb\n",
"ac\ne\n",
"acjcbcxbacl\nacdccaaacc\n",
"comoithseon\ncodeforces\n",
"arb`dakardba\nabrakbdabra\n",
"ctv\nei\n",
"xdfymchzpbn\nazvotehvtk\n",
"ababcabcaaa\nabaca`aa`a\n",
"ni\nb\n",
"bc\ne\n",
"acjdbcxbacl\nacdccaaacc\n",
"comoithsoen\ncodeforces\n",
"arb`dakardba\narbadbkarba\n",
"vtc\neh\n",
"xdfymdhzpbn\nazvotehvtk\n",
"mi\nb\n",
"bd\ne\n"
],
"output": [
"0\n",
"1\n3 ",
"2\n1 2 ",
"0\n",
"0\n",
"0\n",
"11\n1 2 3 4 5 6 7 8 9 10 11 ",
"0\n",
"1\n11 ",
"1\n4 ",
"0\n",
"2\n6 7 ",
"1\n2 ",
"1\n2 ",
"2\n1 2 ",
"2\n1 2 ",
"10\n11 12 13 14 15 16 17 18 19 20 ",
"0\n",
"4\n3 4 5 6 ",
"2\n1 2 ",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"1\n1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
426_A. Sereja and Mugs_37955 | Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and n water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.
As soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (n - 1) friends. Determine if Sereja's friends can play the game so that nobody loses.
Input
The first line contains integers n and s (2 ≤ n ≤ 100; 1 ≤ s ≤ 1000) — the number of mugs and the volume of the cup. The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 10). Number ai means the volume of the i-th mug.
Output
In a single line, print "YES" (without the quotes) if his friends can play in the described manner, and "NO" (without the quotes) otherwise.
Examples
Input
3 4
1 1 1
Output
YES
Input
3 4
3 1 3
Output
YES
Input
3 4
4 4 4
Output
NO | # -*- coding:utf-8 -*-
import sys
def some_func():
"""
"""
n,s = map(int,raw_input().split(' '))
n_list = map(int,raw_input().split(' '))
n_list.sort()
n_list.pop(-1)
if sum(n_list) > s:
print "NO"
else:
print "YES"
if __name__ == '__main__':
some_func()
| 1Python2
| {
"input": [
"3 4\n1 1 1\n",
"3 4\n3 1 3\n",
"3 4\n4 4 4\n",
"8 15\n8 10 4 2 10 9 7 6\n",
"2 1\n1 10\n",
"4 10\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 3 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 9 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 1 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 5 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 5 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 6\n",
"2 1000\n1 1\n",
"2 1\n1 1\n",
"8 50\n8 8 8 4 4 6 10 10\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 8 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 9 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 3 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"100 989\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"2 4\n4 4\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 3 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 1 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 10 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"5 16\n3 3 2 7 9\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 6 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 7 7 2\n",
"7 24\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"9 22\n1 3 5 9 7 6 1 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 7 1 6 10 5 7 4 5 10\n",
"6 38\n9 10 3 8 10 6\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 4 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 5 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 6\n",
"10 89\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n2 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 6 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 8 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 3 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"8 15\n8 10 8 2 10 9 7 6\n",
"2 1\n1 19\n",
"4 16\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 1\n",
"2 1001\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 17 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 5 7 2\n",
"7 22\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"9 22\n1 3 5 9 7 6 2 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n3 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n1 1 2\n",
"3 4\n3 1 5\n",
"3 4\n4 4 8\n",
"8 15\n8 10 8 0 10 9 7 6\n",
"2 2\n1 19\n",
"4 24\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"3 18\n5 6 1\n",
"2 1101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 5 7 2\n",
"7 22\n1 4 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 9 10\n",
"2 1\n3 4\n",
"100 1\n14 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 9 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 6 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 0 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n0 1 2\n",
"3 4\n4 1 5\n",
"3 4\n4 4 13\n",
"8 15\n8 10 8 0 10 9 7 11\n",
"2 2\n1 13\n",
"4 47\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 4 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 11 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 0 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 4 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 3 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"2 0101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 4 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 5 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 1 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 3 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 13 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 16 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 6 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 0 7 2\n",
"7 22\n1 3 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 8 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 8 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 4 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 18\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 14 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 9 10 9 10\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n"
]
} | 2CODEFORCES
|
426_A. Sereja and Mugs_37956 | Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and n water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.
As soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (n - 1) friends. Determine if Sereja's friends can play the game so that nobody loses.
Input
The first line contains integers n and s (2 ≤ n ≤ 100; 1 ≤ s ≤ 1000) — the number of mugs and the volume of the cup. The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 10). Number ai means the volume of the i-th mug.
Output
In a single line, print "YES" (without the quotes) if his friends can play in the described manner, and "NO" (without the quotes) otherwise.
Examples
Input
3 4
1 1 1
Output
YES
Input
3 4
3 1 3
Output
YES
Input
3 4
4 4 4
Output
NO | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, m, i, sum = 0;
int a[101];
m = -1;
scanf("%d%d", &n, &s);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (m < a[i]) {
m = a[i];
}
sum += a[i];
}
if (sum - m <= s) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
| 2C++
| {
"input": [
"3 4\n1 1 1\n",
"3 4\n3 1 3\n",
"3 4\n4 4 4\n",
"8 15\n8 10 4 2 10 9 7 6\n",
"2 1\n1 10\n",
"4 10\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 3 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 9 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 1 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 5 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 5 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 6\n",
"2 1000\n1 1\n",
"2 1\n1 1\n",
"8 50\n8 8 8 4 4 6 10 10\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 8 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 9 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 3 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"100 989\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"2 4\n4 4\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 3 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 1 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 10 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"5 16\n3 3 2 7 9\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 6 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 7 7 2\n",
"7 24\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"9 22\n1 3 5 9 7 6 1 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 7 1 6 10 5 7 4 5 10\n",
"6 38\n9 10 3 8 10 6\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 4 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 5 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 6\n",
"10 89\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n2 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 6 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 8 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 3 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"8 15\n8 10 8 2 10 9 7 6\n",
"2 1\n1 19\n",
"4 16\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 1\n",
"2 1001\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 17 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 5 7 2\n",
"7 22\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"9 22\n1 3 5 9 7 6 2 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n3 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n1 1 2\n",
"3 4\n3 1 5\n",
"3 4\n4 4 8\n",
"8 15\n8 10 8 0 10 9 7 6\n",
"2 2\n1 19\n",
"4 24\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"3 18\n5 6 1\n",
"2 1101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 5 7 2\n",
"7 22\n1 4 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 9 10\n",
"2 1\n3 4\n",
"100 1\n14 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 9 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 6 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 0 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n0 1 2\n",
"3 4\n4 1 5\n",
"3 4\n4 4 13\n",
"8 15\n8 10 8 0 10 9 7 11\n",
"2 2\n1 13\n",
"4 47\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 4 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 11 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 0 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 4 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 3 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"2 0101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 4 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 5 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 1 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 3 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 13 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 16 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 6 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 0 7 2\n",
"7 22\n1 3 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 8 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 8 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 4 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 18\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 14 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 9 10 9 10\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n"
]
} | 2CODEFORCES
|
426_A. Sereja and Mugs_37957 | Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and n water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.
As soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (n - 1) friends. Determine if Sereja's friends can play the game so that nobody loses.
Input
The first line contains integers n and s (2 ≤ n ≤ 100; 1 ≤ s ≤ 1000) — the number of mugs and the volume of the cup. The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 10). Number ai means the volume of the i-th mug.
Output
In a single line, print "YES" (without the quotes) if his friends can play in the described manner, and "NO" (without the quotes) otherwise.
Examples
Input
3 4
1 1 1
Output
YES
Input
3 4
3 1 3
Output
YES
Input
3 4
4 4 4
Output
NO | n, s = map(int, input().split())
arr = list(map(int, input().split()))
print("NO" if sum(arr) - max(arr) > s else "YES")
| 3Python3
| {
"input": [
"3 4\n1 1 1\n",
"3 4\n3 1 3\n",
"3 4\n4 4 4\n",
"8 15\n8 10 4 2 10 9 7 6\n",
"2 1\n1 10\n",
"4 10\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 3 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 9 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 1 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 5 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 5 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 6\n",
"2 1000\n1 1\n",
"2 1\n1 1\n",
"8 50\n8 8 8 4 4 6 10 10\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 8 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 9 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 3 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"100 989\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"2 4\n4 4\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 3 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 1 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 10 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"5 16\n3 3 2 7 9\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 6 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 7 7 2\n",
"7 24\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"9 22\n1 3 5 9 7 6 1 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 7 1 6 10 5 7 4 5 10\n",
"6 38\n9 10 3 8 10 6\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 4 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 5 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 6\n",
"10 89\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n2 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 6 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 8 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 3 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"8 15\n8 10 8 2 10 9 7 6\n",
"2 1\n1 19\n",
"4 16\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 1\n",
"2 1001\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 17 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 5 7 2\n",
"7 22\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"9 22\n1 3 5 9 7 6 2 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n3 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n1 1 2\n",
"3 4\n3 1 5\n",
"3 4\n4 4 8\n",
"8 15\n8 10 8 0 10 9 7 6\n",
"2 2\n1 19\n",
"4 24\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"3 18\n5 6 1\n",
"2 1101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 5 7 2\n",
"7 22\n1 4 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 9 10\n",
"2 1\n3 4\n",
"100 1\n14 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 9 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 6 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 0 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n0 1 2\n",
"3 4\n4 1 5\n",
"3 4\n4 4 13\n",
"8 15\n8 10 8 0 10 9 7 11\n",
"2 2\n1 13\n",
"4 47\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 4 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 11 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 0 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 4 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 3 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"2 0101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 4 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 5 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 1 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 3 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 13 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 16 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 6 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 0 7 2\n",
"7 22\n1 3 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 8 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 8 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 4 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 18\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 14 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 9 10 9 10\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n"
]
} | 2CODEFORCES
|
426_A. Sereja and Mugs_37958 | Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and n water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.
As soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (n - 1) friends. Determine if Sereja's friends can play the game so that nobody loses.
Input
The first line contains integers n and s (2 ≤ n ≤ 100; 1 ≤ s ≤ 1000) — the number of mugs and the volume of the cup. The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 10). Number ai means the volume of the i-th mug.
Output
In a single line, print "YES" (without the quotes) if his friends can play in the described manner, and "NO" (without the quotes) otherwise.
Examples
Input
3 4
1 1 1
Output
YES
Input
3 4
3 1 3
Output
YES
Input
3 4
4 4 4
Output
NO | import java.util.Arrays;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
int n = in.nextInt(), s = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
s -= a[i] = in.nextInt();
Arrays.parallelSort(a);
System.out.println(s + a[n - 1] >= 0 ? "YES" : "NO");
}
}
| 4JAVA
| {
"input": [
"3 4\n1 1 1\n",
"3 4\n3 1 3\n",
"3 4\n4 4 4\n",
"8 15\n8 10 4 2 10 9 7 6\n",
"2 1\n1 10\n",
"4 10\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 3 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 9 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 1 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 5 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 5 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 6\n",
"2 1000\n1 1\n",
"2 1\n1 1\n",
"8 50\n8 8 8 4 4 6 10 10\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 8 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 9 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 3 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"100 989\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"2 4\n4 4\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 3 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 1 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 10 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"5 16\n3 3 2 7 9\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 6 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 7 7 2\n",
"7 24\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"9 22\n1 3 5 9 7 6 1 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 7 1 6 10 5 7 4 5 10\n",
"6 38\n9 10 3 8 10 6\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 4 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 5 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 6\n",
"10 89\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n2 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 6 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 8 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 3 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"8 15\n8 10 8 2 10 9 7 6\n",
"2 1\n1 19\n",
"4 16\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 10 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 9\n",
"6 14\n3 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 5 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 3 7 9 3 6 6 2 1\n",
"3 12\n5 6 1\n",
"2 1001\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 3 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 6 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"100 990\n10 10 10 10 10 10 10 10 10 10 10 10 17 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"41 181\n5 3 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 9 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 10 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 8 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 6 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 4 5 5 7 1 5 7 2\n",
"7 22\n1 4 9 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"9 22\n1 3 5 9 7 6 2 10 1\n",
"38 214\n5 8 4 5 1 9 9 2 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 10 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 9\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 8 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 10 10\n",
"2 1\n3 2\n",
"100 1\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 8 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 8 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 1 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n1 1 2\n",
"3 4\n3 1 5\n",
"3 4\n4 4 8\n",
"8 15\n8 10 8 0 10 9 7 6\n",
"2 2\n1 19\n",
"4 24\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 2 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 16 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 2 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 5 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 5 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"3 18\n5 6 1\n",
"2 1101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 8 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 3 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 2 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 9 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 9 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 9 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 8 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 5 7 2\n",
"7 22\n1 4 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 10 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 2 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 12\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 8 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 10 10 9 10\n",
"2 1\n3 4\n",
"100 1\n14 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 12 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"10 44\n1 10 2 3 4 5 1 7 9 9\n",
"47 262\n3 7 6 4 10 3 5 7 2 9 3 2 2 10 6 7 3 10 6 3 1 1 4 10 2 9 2 10 6 4 3 6 3 6 9 7 8 6 3 3 10 5 2 10 7 10 9\n",
"80 78\n1 9 4 9 8 6 7 10 4 9 2 0 4 4 9 5 9 1 2 6 5 2 4 8 4 6 9 6 7 10 1 9 10 4 7 1 7 10 8 9 10 5 2 6 7 7 7 7 7 8 2 5 1 7 2 3 2 5 10 6 3 4 5 2 6 3 4 2 7 9 9 3 8 8 2 3 7 1 5 10\n",
"3 4\n0 1 2\n",
"3 4\n4 1 5\n",
"3 4\n4 4 13\n",
"8 15\n8 10 8 0 10 9 7 11\n",
"2 2\n1 13\n",
"4 47\n6 3 8 7\n",
"97 65\n3 10 2 6 1 4 7 5 10 3 7 4 5 5 1 6 10 7 4 5 3 9 9 8 6 9 2 3 6 8 5 5 5 5 5 3 10 4 1 8 8 9 8 4 1 4 9 3 6 3 1 4 8 3 10 8 6 4 5 4 3 2 2 4 3 6 4 6 4 3 3 4 7 5 1 8 1 4 5 1 1 6 4 2 1 7 8 6 1 1 5 6 5 10 6 7 5\n",
"53 245\n5 6 9 9 2 3 2 5 10 9 3 5 6 3 10 10 9 4 9 7 10 11 7 7 3 4 9 3 7 3 8 6 8 9 3 8 9 1 3 1 9 10 3 9 3 1 6 6 3 8 7 8 4\n",
"6 14\n6 9 0 0 4 2\n",
"91 486\n1 3 5 4 4 7 3 9 3 4 0 4 5 4 7 9 5 8 4 10 9 1 1 9 9 1 6 2 4 4 7 4 10 3 2 10 9 3 4 5 1 3 4 2 10 9 10 9 10 2 4 6 2 5 3 6 4 9 10 3 9 8 1 2 5 9 2 10 4 6 10 8 10 9 1 2 5 8 6 6 6 1 10 3 9 3 5 6 1 10 5\n",
"49 272\n4 10 8 7 5 6 9 7 2 6 6 2 10 7 3 6 5 3 6 4 3 7 9 3 7 7 4 10 5 6 7 3 6 4 6 7 7 2 7 5 7 4 7 9 3 6 6 2 1\n",
"2 0101\n1 1\n",
"78 400\n5 9 3 4 7 4 1 4 6 3 9 1 8 3 3 6 10 2 1 9 6 1 8 10 1 6 4 5 2 1 5 9 6 10 3 6 5 2 4 10 6 9 3 6 10 7 2 8 8 2 10 1 4 5 2 8 6 4 4 5 5 2 3 10 1 9 4 5 6 7 9 1 8 8 5 4 2 4\n",
"50 271\n6 9 10 1 1 1 8 5 6 6 3 2 5 9 7 5 7 9 10 0 4 6 6 2 2 6 9 5 1 6 5 8 3 2 5 10 10 1 4 1 4 6 1 8 7 8 9 4 7 5\n",
"41 181\n5 4 10 4 2 5 9 3 1 6 6 10 4 5 9 8 5 9 2 5 4 6 6 3 7 9 10 3 10 6 10 5 6 1 6 9 9 1 1 4 3\n",
"29 71\n4 8 9 4 8 10 4 10 2 9 5 3 1 2 17 5 9 7 1 10 4 1 1 9 8 7 4 6 7\n",
"84 212\n6 2 3 1 2 7 5 2 7 2 9 10 9 5 2 5 4 10 9 9 1 9 8 8 9 4 9 4 8 2 1 8 4 5 10 7 6 2 1 18 10 7 9 4 5 9 5 10 10 3 6 6 4 4 4 8 5 4 9 1 9 9 1 7 9 2 10 9 10 8 3 3 13 3 9 10 1 8 9 2 6 9 7 2\n",
"42 227\n3 6 1 9 4 10 4 10 7 9 13 10 8 7 10 4 6 8 7 7 6 9 3 6 5 5 2 7 2 7 4 4 6 6 4 3 16 3 6 4 7 2\n",
"38 83\n9 9 3 10 2 4 8 10 9 5 1 8 7 4 7 2 1 5 3 1 10 6 4 8 3 7 1 2 7 6 8 6 5 2 3 1 1 2\n",
"10 30\n9 10 5 5 5 7 1 0 7 2\n",
"7 22\n1 3 4 1 2 3 6\n",
"100 1000\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 8 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 10\n",
"38 214\n5 8 4 5 1 9 9 1 6 3 4 3 5 7 7 7 3 10 1 5 8 4 2 2 10 10 6 6 6 11 1 6 10 5 7 4 5 10\n",
"58 70\n8 2 10 2 7 3 8 3 8 7 6 2 4 10 10 6 10 3 7 6 4 3 5 5 5 3 8 9 3 4 8 0 2 6 8 9 6 9 4 3 5 2 4 6 10 6 2 1 7 5 6 4 1 9 10 2 4 5\n",
"7 18\n4 4 6 2 2 4 16\n",
"100 100\n10 10 10 10 10 10 10 10 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 3 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 4 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n",
"94 279\n2 5 9 5 10 3 1 8 1 7 1 8 1 6 7 8 4 9 5 10 3 7 6 0 8 5 6 8 10 9 4 1 3 3 4 7 8 2 6 6 5 1 3 7 1 7 2 2 2 8 4 1 1 5 9 4 1 2 3 10 1 4 9 9 6 8 14 1 9 10 4 1 8 5 8 9 4 8 2 1 1 9 4 5 6 1 2 5 6 7 3 1 4 1\n",
"10 102\n10 10 10 10 10 10 9 10 9 10\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n"
]
} | 2CODEFORCES
|
44_D. Hyperdrive_37959 | 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 | import sys
import math
n = int(sys.stdin.readline())
p = []
for i in range(n):
p.append([int(i) for i in sys.stdin.readline().split()])
p[0].append(0)
for i in range(1, n):
p[i] = [p[i][0]-p[0][0], p[i][1]-p[0][1], p[i][2]-p[0][2], 0]
p[i][3] = math.sqrt(p[i][0]**2+p[i][1]**2+p[i][2]**2)
p.sort(key=lambda x:x[3])
md = 1000000
for i in range(1,n):
if p[i][3] > md: break
for j in range(i+1, n):
if p[i][3]+p[j][3] > md: break
md = min(md, p[i][3]+p[j][3]+math.sqrt((p[i][0]-p[j][0])**2+(p[i][1]-p[j][1])**2+(p[i][2]-p[j][2])**2))
print "%0.10f" % (md/2)
| 1Python2
| {
"input": [
"4\n0 0 0\n0 0 1\n0 1 0\n1 0 0\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n10000 10000 -10000\n10000 10000 10000\n",
"5\n94 1 26\n-88 -26 32\n-32 -82 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-7849 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 2845 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"3\n40 -39 28\n-46 6 -7\n60 -75 26\n",
"25\n-10000 10000 -10000\n9979 -9960 9950\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n9979 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 58 -93\n-94 65 37\n21 -40 -74\n-100 57 99\n-37 78 35\n",
"3\n5 -5 4\n-5 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -10000 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 9954\n9954 -9973 9962\n9993 -9953 9976\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-360 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -7911 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -72 93\n-40 42 49\n31 76 -36\n-56 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1287 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1202 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 9989\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9978 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"3\n28 -69 72\n-36 9 -49\n94 83 95\n",
"4\n70 34 -12\n-48 53 51\n34 -58 14\n84 92 42\n",
"3\n1 4 0\n-5 3 5\n-2 -1 -1\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n00000 10000 -10000\n10000 10000 10000\n",
"5\n94 1 26\n-88 -35 32\n-32 -82 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 2845 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"3\n40 -39 28\n-46 6 -8\n60 -75 26\n",
"25\n-10000 10000 -10000\n9979 -9960 9950\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 58 -93\n-94 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 4\n-5 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 9954\n9954 -9973 9962\n9993 -9953 9976\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -7911 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -91 93\n-40 42 49\n31 76 -36\n-56 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1202 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9978 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"3\n28 -69 72\n-38 9 -49\n94 83 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n84 92 42\n",
"3\n1 4 0\n-6 3 5\n-2 -1 -1\n",
"4\n-1 0 0\n0 0 1\n0 1 0\n1 0 0\n",
"5\n94 1 26\n-88 -35 32\n-32 -14 84\n22 -2 85\n-40 21 7\n",
"3\n40 -39 28\n-46 6 -8\n17 -75 26\n",
"5\n-92 58 -93\n-54 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 4\n-1 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 954\n9954 -9973 9962\n9993 -9953 9976\n",
"4\n-7 -91 93\n-40 42 49\n31 76 -36\n-91 12 -1\n",
"3\n6 -69 72\n-38 9 -49\n94 83 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n84 92 25\n",
"3\n1 4 -1\n-6 3 5\n-2 -1 -1\n",
"3\n40 -39 28\n-46 6 -8\n17 -75 0\n",
"5\n-92 68 -93\n-54 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 7\n-1 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 954\n9954 -2149 9962\n9993 -9953 9976\n",
"3\n6 -69 72\n-38 9 -49\n94 61 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n83 92 25\n",
"3\n1 4 0\n-6 3 3\n-2 -1 -1\n",
"4\n-1 0 0\n0 0 2\n0 1 0\n1 -1 0\n",
"8\n-10000 -10000 -7873\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -17024\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"5\n94 1 26\n-169 -35 32\n-32 -14 84\n40 -2 85\n-40 21 7\n",
"3\n40 -39 28\n-46 6 -8\n17 -60 0\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 1727\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -7066 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 68 -93\n-54 71 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -15097 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1747 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9583 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"4\n-1 0 0\n0 0 1\n0 1 0\n1 -1 0\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -17024\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"5\n94 1 26\n-169 -35 32\n-32 -14 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n717 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -7066 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n15050 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -15097 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -91 93\n-40 42 49\n31 131 -36\n-91 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n7301 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1747 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -18578 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9583 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n717 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -10159\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n"
],
"output": [
"1.707106781186547\n",
"34142.13562373095\n",
"166.1019364255597\n",
"4586.261618084529\n",
"140.9184277419145\n",
"34571.58786687205\n",
"164.7229995307349\n",
"12.6839364452369\n",
"34587.38178217085\n",
"7548.850352316169\n",
"161.1452860862361\n",
"8987.415287728927\n",
"34515.41422084766\n",
"266.2401228106858\n",
"171.6021554806262\n",
"10.80016866650904\n",
"26180.33988749894848169220",
"166.10193642555968482344",
"5328.83262927726582791621",
"141.21194780585227528114",
"34571.58786687204588972122",
"164.72299953073488709698",
"9.14173702495867925369",
"34587.38178217084772114731",
"7548.85035231616840079027",
"176.09619042008959528822",
"8987.41528772892712950693",
"34515.41422084765513034199",
"267.28063520263654062603",
"170.53201515090174353317",
"11.41127253608966180508",
"2.12132034355964257315",
"143.98882022016153246768",
"127.19577887381693251379",
"148.92971469738385306703",
"6.92630699010801339230",
"34588.04449298388511380153",
"192.09049493704551961337",
"268.28178406473745298833",
"165.67206334816043625247",
"11.67539082078816266123",
"128.76423709132197355232",
"148.32102587037363138067",
"9.03508014835922144969",
"34588.32947084214448096873",
"255.67209210558240536915",
"165.44639988074198046208",
"10.26271438062186669611",
"2.94317475868633722080",
"26287.19989018283921922148",
"146.27725763294270133752",
"118.49760590988695172637",
"31009.29291012957182971377",
"146.82055424472475753384",
"26180.33988749894848169220",
"5328.83262927726582791621",
"34571.58786687204588972122",
"7548.85035231616840079027",
"8987.41528772892712950693",
"34515.41422084765513034199",
"2.12132034355964257315",
"26180.33988749894848169220",
"143.98882022016153246768",
"5328.83262927726582791621",
"34571.58786687204588972122",
"7548.85035231616840079027",
"192.09049493704551961337",
"8987.41528772892712950693",
"34515.41422084765513034199",
"5328.83262927726582791621"
]
} | 2CODEFORCES
|
44_D. Hyperdrive_37960 | 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 | #include <bits/stdc++.h>
using namespace std;
const int N = 5010;
int x[N], y[N], z[N];
double sqr(double x) { return x * x; }
double dis(int i, int j) {
return sqrt(sqr(x[i] - x[j]) + sqr(y[i] - y[j]) + sqr(z[i] - z[j]));
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d%d%d", x + i, y + i, z + i);
}
double mn = 1e18;
for (int i = 2; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
mn = min(mn, dis(1, i) + dis(i, j) + dis(1, j));
}
}
printf("%.10f\n", mn / 2);
return 0;
}
| 2C++
| {
"input": [
"4\n0 0 0\n0 0 1\n0 1 0\n1 0 0\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n10000 10000 -10000\n10000 10000 10000\n",
"5\n94 1 26\n-88 -26 32\n-32 -82 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-7849 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 2845 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"3\n40 -39 28\n-46 6 -7\n60 -75 26\n",
"25\n-10000 10000 -10000\n9979 -9960 9950\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n9979 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 58 -93\n-94 65 37\n21 -40 -74\n-100 57 99\n-37 78 35\n",
"3\n5 -5 4\n-5 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -10000 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 9954\n9954 -9973 9962\n9993 -9953 9976\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-360 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -7911 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -72 93\n-40 42 49\n31 76 -36\n-56 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1287 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1202 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 9989\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9978 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"3\n28 -69 72\n-36 9 -49\n94 83 95\n",
"4\n70 34 -12\n-48 53 51\n34 -58 14\n84 92 42\n",
"3\n1 4 0\n-5 3 5\n-2 -1 -1\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n00000 10000 -10000\n10000 10000 10000\n",
"5\n94 1 26\n-88 -35 32\n-32 -82 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 2845 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"3\n40 -39 28\n-46 6 -8\n60 -75 26\n",
"25\n-10000 10000 -10000\n9979 -9960 9950\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 58 -93\n-94 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 4\n-5 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 9954\n9954 -9973 9962\n9993 -9953 9976\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -7911 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -91 93\n-40 42 49\n31 76 -36\n-56 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1202 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9978 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"3\n28 -69 72\n-38 9 -49\n94 83 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n84 92 42\n",
"3\n1 4 0\n-6 3 5\n-2 -1 -1\n",
"4\n-1 0 0\n0 0 1\n0 1 0\n1 0 0\n",
"5\n94 1 26\n-88 -35 32\n-32 -14 84\n22 -2 85\n-40 21 7\n",
"3\n40 -39 28\n-46 6 -8\n17 -75 26\n",
"5\n-92 58 -93\n-54 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 4\n-1 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 954\n9954 -9973 9962\n9993 -9953 9976\n",
"4\n-7 -91 93\n-40 42 49\n31 76 -36\n-91 12 -1\n",
"3\n6 -69 72\n-38 9 -49\n94 83 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n84 92 25\n",
"3\n1 4 -1\n-6 3 5\n-2 -1 -1\n",
"3\n40 -39 28\n-46 6 -8\n17 -75 0\n",
"5\n-92 68 -93\n-54 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 7\n-1 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 954\n9954 -2149 9962\n9993 -9953 9976\n",
"3\n6 -69 72\n-38 9 -49\n94 61 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n83 92 25\n",
"3\n1 4 0\n-6 3 3\n-2 -1 -1\n",
"4\n-1 0 0\n0 0 2\n0 1 0\n1 -1 0\n",
"8\n-10000 -10000 -7873\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -17024\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"5\n94 1 26\n-169 -35 32\n-32 -14 84\n40 -2 85\n-40 21 7\n",
"3\n40 -39 28\n-46 6 -8\n17 -60 0\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 1727\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -7066 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 68 -93\n-54 71 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -15097 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1747 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9583 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"4\n-1 0 0\n0 0 1\n0 1 0\n1 -1 0\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -17024\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"5\n94 1 26\n-169 -35 32\n-32 -14 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n717 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -7066 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n15050 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -15097 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -91 93\n-40 42 49\n31 131 -36\n-91 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n7301 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1747 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -18578 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9583 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n717 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -10159\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n"
],
"output": [
"1.707106781186547\n",
"34142.13562373095\n",
"166.1019364255597\n",
"4586.261618084529\n",
"140.9184277419145\n",
"34571.58786687205\n",
"164.7229995307349\n",
"12.6839364452369\n",
"34587.38178217085\n",
"7548.850352316169\n",
"161.1452860862361\n",
"8987.415287728927\n",
"34515.41422084766\n",
"266.2401228106858\n",
"171.6021554806262\n",
"10.80016866650904\n",
"26180.33988749894848169220",
"166.10193642555968482344",
"5328.83262927726582791621",
"141.21194780585227528114",
"34571.58786687204588972122",
"164.72299953073488709698",
"9.14173702495867925369",
"34587.38178217084772114731",
"7548.85035231616840079027",
"176.09619042008959528822",
"8987.41528772892712950693",
"34515.41422084765513034199",
"267.28063520263654062603",
"170.53201515090174353317",
"11.41127253608966180508",
"2.12132034355964257315",
"143.98882022016153246768",
"127.19577887381693251379",
"148.92971469738385306703",
"6.92630699010801339230",
"34588.04449298388511380153",
"192.09049493704551961337",
"268.28178406473745298833",
"165.67206334816043625247",
"11.67539082078816266123",
"128.76423709132197355232",
"148.32102587037363138067",
"9.03508014835922144969",
"34588.32947084214448096873",
"255.67209210558240536915",
"165.44639988074198046208",
"10.26271438062186669611",
"2.94317475868633722080",
"26287.19989018283921922148",
"146.27725763294270133752",
"118.49760590988695172637",
"31009.29291012957182971377",
"146.82055424472475753384",
"26180.33988749894848169220",
"5328.83262927726582791621",
"34571.58786687204588972122",
"7548.85035231616840079027",
"8987.41528772892712950693",
"34515.41422084765513034199",
"2.12132034355964257315",
"26180.33988749894848169220",
"143.98882022016153246768",
"5328.83262927726582791621",
"34571.58786687204588972122",
"7548.85035231616840079027",
"192.09049493704551961337",
"8987.41528772892712950693",
"34515.41422084765513034199",
"5328.83262927726582791621"
]
} | 2CODEFORCES
|
44_D. Hyperdrive_37961 | 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 | //package school2;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class D {
Scanner in;
PrintWriter out;
// String INPUT = "4 0 0 0 0 0 1 0 1 0 1 0 0";
String INPUT = "";
void solve()
{
int n = ni();
int[] x = new int[n];
int[] y = new int[n];
int[] z = new int[n];
double[] u = new double[n];
for(int i = 0;i < n;i++){
x[i] = ni();
y[i] = ni();
z[i] = ni();
u[i] = dd(x[0]-x[i], y[0]-y[i], z[0]-z[i]);
}
double min = 999999999;
for(int i = 1;i < n;i++){
for(int j = 1;j < i;j++){
min = Math.min(min, (u[i] + u[j] + dd(x[i]-x[j], y[i]-y[j],z[i]-z[j])) / 2);
}
}
out.println(min);
}
double dd(double x, double y, double z)
{
return Math.sqrt(x * x + y * y + z * z);
}
void run() throws Exception
{
// int n = 5000;
// StringBuilder sb = new StringBuilder(n + " ");
// Random r = new Random();
// for(int i = 0;i < n;i++){
// sb.append(r.nextInt(10000) + " ");
// sb.append(r.nextInt(10000) + " ");
// sb.append(r.nextInt(10000) + " ");
// }
// INPUT = sb.toString();
in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);
out = new PrintWriter(System.out);
solve();
out.flush();
}
public static void main(String[] args) throws Exception
{
new D().run();
}
int ni() { return Integer.parseInt(in.next()); }
void tr(Object... o) { if(INPUT.length() != 0)System.out.println(o.length > 1 || o[0].getClass().isArray() ? Arrays.deepToString(o) : o[0]); }
}
| 4JAVA
| {
"input": [
"4\n0 0 0\n0 0 1\n0 1 0\n1 0 0\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n10000 10000 -10000\n10000 10000 10000\n",
"5\n94 1 26\n-88 -26 32\n-32 -82 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-7849 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 2845 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"3\n40 -39 28\n-46 6 -7\n60 -75 26\n",
"25\n-10000 10000 -10000\n9979 -9960 9950\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n9979 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 58 -93\n-94 65 37\n21 -40 -74\n-100 57 99\n-37 78 35\n",
"3\n5 -5 4\n-5 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -10000 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 9954\n9954 -9973 9962\n9993 -9953 9976\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-360 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -7911 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -72 93\n-40 42 49\n31 76 -36\n-56 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1287 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1202 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 9989\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9978 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"3\n28 -69 72\n-36 9 -49\n94 83 95\n",
"4\n70 34 -12\n-48 53 51\n34 -58 14\n84 92 42\n",
"3\n1 4 0\n-5 3 5\n-2 -1 -1\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n00000 10000 -10000\n10000 10000 10000\n",
"5\n94 1 26\n-88 -35 32\n-32 -82 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 2845 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"3\n40 -39 28\n-46 6 -8\n60 -75 26\n",
"25\n-10000 10000 -10000\n9979 -9960 9950\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 58 -93\n-94 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 4\n-5 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 9954\n9954 -9973 9962\n9993 -9953 9976\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -7911 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -91 93\n-40 42 49\n31 76 -36\n-56 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1202 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9978 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"3\n28 -69 72\n-38 9 -49\n94 83 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n84 92 42\n",
"3\n1 4 0\n-6 3 5\n-2 -1 -1\n",
"4\n-1 0 0\n0 0 1\n0 1 0\n1 0 0\n",
"5\n94 1 26\n-88 -35 32\n-32 -14 84\n22 -2 85\n-40 21 7\n",
"3\n40 -39 28\n-46 6 -8\n17 -75 26\n",
"5\n-92 58 -93\n-54 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 4\n-1 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 954\n9954 -9973 9962\n9993 -9953 9976\n",
"4\n-7 -91 93\n-40 42 49\n31 76 -36\n-91 12 -1\n",
"3\n6 -69 72\n-38 9 -49\n94 83 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n84 92 25\n",
"3\n1 4 -1\n-6 3 5\n-2 -1 -1\n",
"3\n40 -39 28\n-46 6 -8\n17 -75 0\n",
"5\n-92 68 -93\n-54 65 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"3\n0 -5 7\n-1 -4 2\n-1 1 2\n",
"20\n-10000 10000 -10000\n9973 -9963 9996\n9968 -9972 9968\n9958 -9956 9991\n9982 -9971 9958\n9975 -9957 9985\n9971 -9950 9986\n9996 -9956 9985\n9952 -9977 9989\n9996 -18678 9961\n9971 -9969 9967\n9984 -10000 9973\n9962 -9993 9992\n9951 -9970 9987\n9969 -9970 9962\n9979 -9953 9981\n9975 -9950 9986\n9971 -9973 954\n9954 -2149 9962\n9993 -9953 9976\n",
"3\n6 -69 72\n-38 9 -49\n94 61 95\n",
"4\n70 3 -12\n-48 53 51\n34 -58 14\n83 92 25\n",
"3\n1 4 0\n-6 3 3\n-2 -1 -1\n",
"4\n-1 0 0\n0 0 2\n0 1 0\n1 -1 0\n",
"8\n-10000 -10000 -7873\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -17024\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"5\n94 1 26\n-169 -35 32\n-32 -14 84\n40 -2 85\n-40 21 7\n",
"3\n40 -39 28\n-46 6 -8\n17 -60 0\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 1727\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -7066 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"5\n-92 68 -93\n-54 71 37\n21 -40 -74\n-100 100 99\n-37 78 35\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -10000\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n4300 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -9986 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n9632 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -15097 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n4828 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1747 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -9947 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9583 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"4\n-1 0 0\n0 0 1\n0 1 0\n1 -1 0\n",
"8\n-10000 -10000 -10000\n-10000 -10000 10000\n-10000 10000 -10000\n-10000 10000 10000\n10000 -10000 -17024\n10000 -10000 10000\n00000 10000 -10000\n10000 10001 10000\n",
"5\n94 1 26\n-169 -35 32\n-32 -14 84\n22 -2 85\n-40 21 7\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n717 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -6336\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n",
"25\n-10000 10000 -10000\n9979 -9960 351\n9996 -9986 9952\n9953 -9961 9978\n9999 -9981 9967\n9953 -9983 9982\n9974 -9959 9972\n9960 -9956 9983\n9955 -9991 9952\n9976 -9987 9967\n9960 -9973 9987\n9998 -9952 9968\n9964 -9958 9961\n9957 -9984 9982\n9966 -7066 9963\n9985 -9997 9967\n9993 -9979 9953\n5541 -9965 9975\n9979 -9965 9983\n9997 -9989 9957\n9983 -9996 9969\n9959 -9962 9952\n9986 -9966 9966\n9980 -9961 9975\n9965 -9960 9950\n",
"15\n-4743 -119 3104\n8014 4585 -1756\n-367 4466 -4425\n7157 -5142 -2483\n1691 -505 5849\n15050 6178 4631\n4531 -3438 -4361\n-172 1508 4593\n198 8647 3400\n6904 -188 4830\n-7101 -15097 -4407\n-4366 3174 8353\n4636 -9577 -4017\n1055 5875 1289\n-7014 -7983 1874\n",
"4\n-7 -91 93\n-40 42 49\n31 131 -36\n-91 12 -1\n",
"10\n-3461 4259 -7268\n9964 2370 6622\n4530 5607 -6609\n-3777 4888 6057\n-5403 7982 -651\n7301 -6712 1070\n9886 -1209 -6864\n-369 -7105 1602\n-7603 5424 -3396\n1747 9528 9042\n",
"20\n-10000 10000 -10000\n9940 -18578 10000\n9968 -9977 9918\n9975 -9908 9901\n9948 -9923 10757\n10000 -9966 9906\n9981 -9910 9911\n9962 -9905 9999\n9981 -9977 9949\n9974 -9956 9952\n9986 -9942 9937\n9922 -9913 9984\n9583 -9925 9945\n9974 -9962 9990\n9921 -9985 9998\n9949 -9976 9924\n9991 -9946 9920\n9966 -9987 9993\n9910 -9930 9914\n9927 -9937 9915\n",
"10\n-9903 5249 7357\n1296 -1008 -1209\n-232 1995 9728\n717 3933 2805\n-6265 3366 8098\n-8808 -8688 -535\n-2639 -6815 -10159\n-384 5477 -3663\n-7359 2292 6213\n7124 4173 -132\n"
],
"output": [
"1.707106781186547\n",
"34142.13562373095\n",
"166.1019364255597\n",
"4586.261618084529\n",
"140.9184277419145\n",
"34571.58786687205\n",
"164.7229995307349\n",
"12.6839364452369\n",
"34587.38178217085\n",
"7548.850352316169\n",
"161.1452860862361\n",
"8987.415287728927\n",
"34515.41422084766\n",
"266.2401228106858\n",
"171.6021554806262\n",
"10.80016866650904\n",
"26180.33988749894848169220",
"166.10193642555968482344",
"5328.83262927726582791621",
"141.21194780585227528114",
"34571.58786687204588972122",
"164.72299953073488709698",
"9.14173702495867925369",
"34587.38178217084772114731",
"7548.85035231616840079027",
"176.09619042008959528822",
"8987.41528772892712950693",
"34515.41422084765513034199",
"267.28063520263654062603",
"170.53201515090174353317",
"11.41127253608966180508",
"2.12132034355964257315",
"143.98882022016153246768",
"127.19577887381693251379",
"148.92971469738385306703",
"6.92630699010801339230",
"34588.04449298388511380153",
"192.09049493704551961337",
"268.28178406473745298833",
"165.67206334816043625247",
"11.67539082078816266123",
"128.76423709132197355232",
"148.32102587037363138067",
"9.03508014835922144969",
"34588.32947084214448096873",
"255.67209210558240536915",
"165.44639988074198046208",
"10.26271438062186669611",
"2.94317475868633722080",
"26287.19989018283921922148",
"146.27725763294270133752",
"118.49760590988695172637",
"31009.29291012957182971377",
"146.82055424472475753384",
"26180.33988749894848169220",
"5328.83262927726582791621",
"34571.58786687204588972122",
"7548.85035231616840079027",
"8987.41528772892712950693",
"34515.41422084765513034199",
"2.12132034355964257315",
"26180.33988749894848169220",
"143.98882022016153246768",
"5328.83262927726582791621",
"34571.58786687204588972122",
"7548.85035231616840079027",
"192.09049493704551961337",
"8987.41528772892712950693",
"34515.41422084765513034199",
"5328.83262927726582791621"
]
} | 2CODEFORCES
|
495_A. Digital Counter_37962 | Malek lives in an apartment block with 100 floors numbered from 0 to 99. The apartment has an elevator with a digital counter showing the floor that the elevator is currently on. The elevator shows each digit of a number with 7 light sticks by turning them on or off. The picture below shows how the elevator shows each digit.
<image>
One day when Malek wanted to go from floor 88 to floor 0 using the elevator he noticed that the counter shows number 89 instead of 88. Then when the elevator started moving the number on the counter changed to 87. After a little thinking Malek came to the conclusion that there is only one explanation for this: One of the sticks of the counter was broken. Later that day Malek was thinking about the broken stick and suddenly he came up with the following problem.
Suppose the digital counter is showing number n. Malek calls an integer x (0 ≤ x ≤ 99) good if it's possible that the digital counter was supposed to show x but because of some(possibly none) broken sticks it's showing n instead. Malek wants to know number of good integers for a specific n. So you must write a program that calculates this number. Please note that the counter always shows two digits.
Input
The only line of input contains exactly two digits representing number n (0 ≤ n ≤ 99). Note that n may have a leading zero.
Output
In the only line of the output print the number of good integers.
Examples
Input
89
Output
2
Input
00
Output
4
Input
73
Output
15
Note
In the first sample the counter may be supposed to show 88 or 89.
In the second sample the good integers are 00, 08, 80 and 88.
In the third sample the good integers are 03, 08, 09, 33, 38, 39, 73, 78, 79, 83, 88, 89, 93, 98, 99. | n = raw_input()
d=[2,7,2,3,3,4,2,5,1,2]
print d[int(n[0])]*d[int(n[1])] | 1Python2
| {
"input": [
"00\n",
"89\n",
"73\n",
"22\n",
"90\n",
"77\n",
"35\n",
"60\n",
"80\n",
"55\n",
"44\n",
"67\n",
"99\n",
"49\n",
"04\n",
"33\n",
"88\n",
"92\n",
"26\n",
"57\n",
"20\n",
"46\n",
"05\n",
"66\n",
"78\n",
"11\n",
"08\n",
"34\n",
"68\n",
"81\n",
"27\n",
"50\n",
"87\n",
"23\n",
"47\n",
"38\n",
"17\n",
"15\n",
"45\n",
"10\n",
"58\n",
"14\n",
"75\n",
"86\n",
"64\n",
"18\n",
"36\n",
"24\n",
"30\n",
"74\n",
"71\n",
"12\n",
"25\n",
"40\n",
"84\n",
"16\n",
"37\n",
"21\n",
"29\n",
"48\n",
"59\n",
"53\n",
"28\n",
"79\n",
"43\n",
"31\n",
"19\n",
"13\n",
"65\n",
"62\n",
"39\n",
"42\n",
"52\n",
"70\n",
"32\n",
"61\n",
"41\n",
"72\n",
"69\n",
"76\n",
"56\n",
"85\n",
"51\n",
"98\n",
"96\n",
"63\n",
"54\n",
"93\n",
"94\n",
"83\n",
"97\n",
"82\n",
"91\n",
"95\n"
],
"output": [
"4\n",
"2\n",
"15\n",
"4\n",
"4\n",
"25\n",
"12\n",
"4\n",
"2\n",
"16\n",
"9\n",
"10\n",
"4\n",
"6\n",
"6\n",
"9\n",
"1\n",
"4\n",
"4\n",
"20\n",
"4\n",
"6\n",
"8\n",
"4\n",
"5\n",
"49\n",
"2\n",
"9\n",
"2\n",
"7\n",
"10\n",
"8\n",
"5\n",
"6\n",
"15\n",
"3\n",
"35\n",
"28\n",
"12\n",
"14\n",
"4\n",
"21\n",
"20\n",
"2\n",
"6\n",
"7\n",
"6\n",
"6\n",
"6\n",
"15\n",
"35\n",
"14\n",
"8\n",
"6\n",
"3\n",
"14\n",
"15\n",
"14\n",
"4\n",
"3\n",
"8\n",
"12\n",
"2\n",
"10\n",
"9\n",
"21\n",
"14\n",
"21\n",
"8\n",
"4\n",
"6\n",
"6\n",
"8\n",
"10\n",
"6\n",
"14\n",
"21\n",
"10\n",
"4\n",
"10\n",
"8\n",
"4\n",
"28\n",
"2\n",
"4\n",
"6\n",
"12\n",
"6\n",
"6\n",
"3\n",
"10\n",
"2\n",
"14\n",
"8\n"
]
} | 2CODEFORCES
|
495_A. Digital Counter_37963 | Malek lives in an apartment block with 100 floors numbered from 0 to 99. The apartment has an elevator with a digital counter showing the floor that the elevator is currently on. The elevator shows each digit of a number with 7 light sticks by turning them on or off. The picture below shows how the elevator shows each digit.
<image>
One day when Malek wanted to go from floor 88 to floor 0 using the elevator he noticed that the counter shows number 89 instead of 88. Then when the elevator started moving the number on the counter changed to 87. After a little thinking Malek came to the conclusion that there is only one explanation for this: One of the sticks of the counter was broken. Later that day Malek was thinking about the broken stick and suddenly he came up with the following problem.
Suppose the digital counter is showing number n. Malek calls an integer x (0 ≤ x ≤ 99) good if it's possible that the digital counter was supposed to show x but because of some(possibly none) broken sticks it's showing n instead. Malek wants to know number of good integers for a specific n. So you must write a program that calculates this number. Please note that the counter always shows two digits.
Input
The only line of input contains exactly two digits representing number n (0 ≤ n ≤ 99). Note that n may have a leading zero.
Output
In the only line of the output print the number of good integers.
Examples
Input
89
Output
2
Input
00
Output
4
Input
73
Output
15
Note
In the first sample the counter may be supposed to show 88 or 89.
In the second sample the good integers are 00, 08, 80 and 88.
In the third sample the good integers are 03, 08, 09, 33, 38, 39, 73, 78, 79, 83, 88, 89, 93, 98, 99. | #include <bits/stdc++.h>
using namespace std;
const long long mod1 = static_cast<long long>(1073741824);
const long long mod2 = static_cast<long long>(1000000007);
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const long double ldOne = 1.0;
long long gcd(long long a, long long b) {
if (!b) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long power(long long x, long long y, long long p) {
long long res = 1;
x %= p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long exp(long long x, long long n) {
if (n == 0)
return 1;
else if (n & 1)
return x * exp(x * x, (n - 1) / 2);
else
return exp(x * x, n / 2);
}
bool isPrime(long long n) {
for (long long i = 0; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
vector<long long> SieveOfEratosthenes(long long n) {
vector<bool> prime(n + 1, true);
for (long long p = 2; p * p <= n; p++) {
if (prime[p]) {
for (long long i = p * p; i <= n; i += p) prime[i] = false;
}
}
vector<long long> v;
for (long long i = 2; i <= n; i++) {
if (prime[i]) v.push_back(i);
}
return v;
}
map<long long, long long> PrimeFactorization(long long n) {
vector<long long> v = SieveOfEratosthenes(static_cast<long long>(sqrt(n)));
map<long long, long long> m;
for (unsigned long long i = 0; i < v.size(); i++) {
if (n % v[i] == 0) {
n /= v[i];
m[v[i]]++;
i--;
}
}
return m;
}
long long nCr(long long n, long long r) {
vector<long long> c(r + 1, 0);
c[0] = 1;
for (long long i = 0; i < n + 1; i++) {
for (long long j = min(i, r); j > 0; j--) c[j] = c[j - 1] + c[j];
}
return c[r];
}
long long num(char a) {
switch (a) {
case '0':
return 2;
case '1':
return 7;
case '2':
return 2;
case '3':
return 3;
case '4':
return 3;
case '5':
return 4;
case '6':
return 2;
case '7':
return 5;
case '8':
return 1;
case '9':
return 2;
}
return 0;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
long long multi = 1;
for (long long i = 0; i < static_cast<long long>(s.length()); i++) {
multi *= num(s[i]);
}
cout << multi;
cerr << "Time : " << 1000 * (long double)clock() / (long double)CLOCKS_PER_SEC
<< "ms\n";
;
return 0;
}
| 2C++
| {
"input": [
"00\n",
"89\n",
"73\n",
"22\n",
"90\n",
"77\n",
"35\n",
"60\n",
"80\n",
"55\n",
"44\n",
"67\n",
"99\n",
"49\n",
"04\n",
"33\n",
"88\n",
"92\n",
"26\n",
"57\n",
"20\n",
"46\n",
"05\n",
"66\n",
"78\n",
"11\n",
"08\n",
"34\n",
"68\n",
"81\n",
"27\n",
"50\n",
"87\n",
"23\n",
"47\n",
"38\n",
"17\n",
"15\n",
"45\n",
"10\n",
"58\n",
"14\n",
"75\n",
"86\n",
"64\n",
"18\n",
"36\n",
"24\n",
"30\n",
"74\n",
"71\n",
"12\n",
"25\n",
"40\n",
"84\n",
"16\n",
"37\n",
"21\n",
"29\n",
"48\n",
"59\n",
"53\n",
"28\n",
"79\n",
"43\n",
"31\n",
"19\n",
"13\n",
"65\n",
"62\n",
"39\n",
"42\n",
"52\n",
"70\n",
"32\n",
"61\n",
"41\n",
"72\n",
"69\n",
"76\n",
"56\n",
"85\n",
"51\n",
"98\n",
"96\n",
"63\n",
"54\n",
"93\n",
"94\n",
"83\n",
"97\n",
"82\n",
"91\n",
"95\n"
],
"output": [
"4\n",
"2\n",
"15\n",
"4\n",
"4\n",
"25\n",
"12\n",
"4\n",
"2\n",
"16\n",
"9\n",
"10\n",
"4\n",
"6\n",
"6\n",
"9\n",
"1\n",
"4\n",
"4\n",
"20\n",
"4\n",
"6\n",
"8\n",
"4\n",
"5\n",
"49\n",
"2\n",
"9\n",
"2\n",
"7\n",
"10\n",
"8\n",
"5\n",
"6\n",
"15\n",
"3\n",
"35\n",
"28\n",
"12\n",
"14\n",
"4\n",
"21\n",
"20\n",
"2\n",
"6\n",
"7\n",
"6\n",
"6\n",
"6\n",
"15\n",
"35\n",
"14\n",
"8\n",
"6\n",
"3\n",
"14\n",
"15\n",
"14\n",
"4\n",
"3\n",
"8\n",
"12\n",
"2\n",
"10\n",
"9\n",
"21\n",
"14\n",
"21\n",
"8\n",
"4\n",
"6\n",
"6\n",
"8\n",
"10\n",
"6\n",
"14\n",
"21\n",
"10\n",
"4\n",
"10\n",
"8\n",
"4\n",
"28\n",
"2\n",
"4\n",
"6\n",
"12\n",
"6\n",
"6\n",
"3\n",
"10\n",
"2\n",
"14\n",
"8\n"
]
} | 2CODEFORCES
|
495_A. Digital Counter_37964 | Malek lives in an apartment block with 100 floors numbered from 0 to 99. The apartment has an elevator with a digital counter showing the floor that the elevator is currently on. The elevator shows each digit of a number with 7 light sticks by turning them on or off. The picture below shows how the elevator shows each digit.
<image>
One day when Malek wanted to go from floor 88 to floor 0 using the elevator he noticed that the counter shows number 89 instead of 88. Then when the elevator started moving the number on the counter changed to 87. After a little thinking Malek came to the conclusion that there is only one explanation for this: One of the sticks of the counter was broken. Later that day Malek was thinking about the broken stick and suddenly he came up with the following problem.
Suppose the digital counter is showing number n. Malek calls an integer x (0 ≤ x ≤ 99) good if it's possible that the digital counter was supposed to show x but because of some(possibly none) broken sticks it's showing n instead. Malek wants to know number of good integers for a specific n. So you must write a program that calculates this number. Please note that the counter always shows two digits.
Input
The only line of input contains exactly two digits representing number n (0 ≤ n ≤ 99). Note that n may have a leading zero.
Output
In the only line of the output print the number of good integers.
Examples
Input
89
Output
2
Input
00
Output
4
Input
73
Output
15
Note
In the first sample the counter may be supposed to show 88 or 89.
In the second sample the good integers are 00, 08, 80 and 88.
In the third sample the good integers are 03, 08, 09, 33, 38, 39, 73, 78, 79, 83, 88, 89, 93, 98, 99. | from sys import stdin
def nb_good_numbers(n):
by_digit = {
"0": 2,
"1": 7,
"2": 2,
"3": 3,
"4": 3,
"5": 4,
"6": 2,
"7": 5,
"8": 1,
"9": 2,
}
result = 1
for digit in n:
result *= by_digit[digit]
return result
if __name__ == "__main__":
n = stdin.readline().rstrip()
print(nb_good_numbers(n))
| 3Python3
| {
"input": [
"00\n",
"89\n",
"73\n",
"22\n",
"90\n",
"77\n",
"35\n",
"60\n",
"80\n",
"55\n",
"44\n",
"67\n",
"99\n",
"49\n",
"04\n",
"33\n",
"88\n",
"92\n",
"26\n",
"57\n",
"20\n",
"46\n",
"05\n",
"66\n",
"78\n",
"11\n",
"08\n",
"34\n",
"68\n",
"81\n",
"27\n",
"50\n",
"87\n",
"23\n",
"47\n",
"38\n",
"17\n",
"15\n",
"45\n",
"10\n",
"58\n",
"14\n",
"75\n",
"86\n",
"64\n",
"18\n",
"36\n",
"24\n",
"30\n",
"74\n",
"71\n",
"12\n",
"25\n",
"40\n",
"84\n",
"16\n",
"37\n",
"21\n",
"29\n",
"48\n",
"59\n",
"53\n",
"28\n",
"79\n",
"43\n",
"31\n",
"19\n",
"13\n",
"65\n",
"62\n",
"39\n",
"42\n",
"52\n",
"70\n",
"32\n",
"61\n",
"41\n",
"72\n",
"69\n",
"76\n",
"56\n",
"85\n",
"51\n",
"98\n",
"96\n",
"63\n",
"54\n",
"93\n",
"94\n",
"83\n",
"97\n",
"82\n",
"91\n",
"95\n"
],
"output": [
"4\n",
"2\n",
"15\n",
"4\n",
"4\n",
"25\n",
"12\n",
"4\n",
"2\n",
"16\n",
"9\n",
"10\n",
"4\n",
"6\n",
"6\n",
"9\n",
"1\n",
"4\n",
"4\n",
"20\n",
"4\n",
"6\n",
"8\n",
"4\n",
"5\n",
"49\n",
"2\n",
"9\n",
"2\n",
"7\n",
"10\n",
"8\n",
"5\n",
"6\n",
"15\n",
"3\n",
"35\n",
"28\n",
"12\n",
"14\n",
"4\n",
"21\n",
"20\n",
"2\n",
"6\n",
"7\n",
"6\n",
"6\n",
"6\n",
"15\n",
"35\n",
"14\n",
"8\n",
"6\n",
"3\n",
"14\n",
"15\n",
"14\n",
"4\n",
"3\n",
"8\n",
"12\n",
"2\n",
"10\n",
"9\n",
"21\n",
"14\n",
"21\n",
"8\n",
"4\n",
"6\n",
"6\n",
"8\n",
"10\n",
"6\n",
"14\n",
"21\n",
"10\n",
"4\n",
"10\n",
"8\n",
"4\n",
"28\n",
"2\n",
"4\n",
"6\n",
"12\n",
"6\n",
"6\n",
"3\n",
"10\n",
"2\n",
"14\n",
"8\n"
]
} | 2CODEFORCES
|
495_A. Digital Counter_37965 | Malek lives in an apartment block with 100 floors numbered from 0 to 99. The apartment has an elevator with a digital counter showing the floor that the elevator is currently on. The elevator shows each digit of a number with 7 light sticks by turning them on or off. The picture below shows how the elevator shows each digit.
<image>
One day when Malek wanted to go from floor 88 to floor 0 using the elevator he noticed that the counter shows number 89 instead of 88. Then when the elevator started moving the number on the counter changed to 87. After a little thinking Malek came to the conclusion that there is only one explanation for this: One of the sticks of the counter was broken. Later that day Malek was thinking about the broken stick and suddenly he came up with the following problem.
Suppose the digital counter is showing number n. Malek calls an integer x (0 ≤ x ≤ 99) good if it's possible that the digital counter was supposed to show x but because of some(possibly none) broken sticks it's showing n instead. Malek wants to know number of good integers for a specific n. So you must write a program that calculates this number. Please note that the counter always shows two digits.
Input
The only line of input contains exactly two digits representing number n (0 ≤ n ≤ 99). Note that n may have a leading zero.
Output
In the only line of the output print the number of good integers.
Examples
Input
89
Output
2
Input
00
Output
4
Input
73
Output
15
Note
In the first sample the counter may be supposed to show 88 or 89.
In the second sample the good integers are 00, 08, 80 and 88.
In the third sample the good integers are 03, 08, 09, 33, 38, 39, 73, 78, 79, 83, 88, 89, 93, 98, 99. |
import java.util.Scanner;
public class Elevator {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
String floor=s.next();
int pos=1;
for (int i = 0; i < 2; i++) {
switch (floor.charAt(i)){
case '0':
pos=pos*2;
break;
case '1':
pos=pos*7;
break;
case '2':
pos=pos*2;
break;
case '3':
pos=pos*3;
break;
case '4':
pos=pos*3;
break;
case '5':
pos=pos*4;
break;
case '6':
pos=pos*2;
break;
case '7':
pos=pos*5;
break;
case '8':
pos=pos*1;
break;
case '9':
pos=pos*2;
break;
default:
break;
}
}
System.out.println(pos);
pos=0;
}
}
| 4JAVA
| {
"input": [
"00\n",
"89\n",
"73\n",
"22\n",
"90\n",
"77\n",
"35\n",
"60\n",
"80\n",
"55\n",
"44\n",
"67\n",
"99\n",
"49\n",
"04\n",
"33\n",
"88\n",
"92\n",
"26\n",
"57\n",
"20\n",
"46\n",
"05\n",
"66\n",
"78\n",
"11\n",
"08\n",
"34\n",
"68\n",
"81\n",
"27\n",
"50\n",
"87\n",
"23\n",
"47\n",
"38\n",
"17\n",
"15\n",
"45\n",
"10\n",
"58\n",
"14\n",
"75\n",
"86\n",
"64\n",
"18\n",
"36\n",
"24\n",
"30\n",
"74\n",
"71\n",
"12\n",
"25\n",
"40\n",
"84\n",
"16\n",
"37\n",
"21\n",
"29\n",
"48\n",
"59\n",
"53\n",
"28\n",
"79\n",
"43\n",
"31\n",
"19\n",
"13\n",
"65\n",
"62\n",
"39\n",
"42\n",
"52\n",
"70\n",
"32\n",
"61\n",
"41\n",
"72\n",
"69\n",
"76\n",
"56\n",
"85\n",
"51\n",
"98\n",
"96\n",
"63\n",
"54\n",
"93\n",
"94\n",
"83\n",
"97\n",
"82\n",
"91\n",
"95\n"
],
"output": [
"4\n",
"2\n",
"15\n",
"4\n",
"4\n",
"25\n",
"12\n",
"4\n",
"2\n",
"16\n",
"9\n",
"10\n",
"4\n",
"6\n",
"6\n",
"9\n",
"1\n",
"4\n",
"4\n",
"20\n",
"4\n",
"6\n",
"8\n",
"4\n",
"5\n",
"49\n",
"2\n",
"9\n",
"2\n",
"7\n",
"10\n",
"8\n",
"5\n",
"6\n",
"15\n",
"3\n",
"35\n",
"28\n",
"12\n",
"14\n",
"4\n",
"21\n",
"20\n",
"2\n",
"6\n",
"7\n",
"6\n",
"6\n",
"6\n",
"15\n",
"35\n",
"14\n",
"8\n",
"6\n",
"3\n",
"14\n",
"15\n",
"14\n",
"4\n",
"3\n",
"8\n",
"12\n",
"2\n",
"10\n",
"9\n",
"21\n",
"14\n",
"21\n",
"8\n",
"4\n",
"6\n",
"6\n",
"8\n",
"10\n",
"6\n",
"14\n",
"21\n",
"10\n",
"4\n",
"10\n",
"8\n",
"4\n",
"28\n",
"2\n",
"4\n",
"6\n",
"12\n",
"6\n",
"6\n",
"3\n",
"10\n",
"2\n",
"14\n",
"8\n"
]
} | 2CODEFORCES
|
519_D. A and B and Interesting Substrings_37966 | A and B are preparing themselves for programming contests.
After several years of doing sports programming and solving many problems that require calculating all sorts of abstract objects, A and B also developed rather peculiar tastes.
A likes lowercase letters of the Latin alphabet. He has assigned to each letter a number that shows how much he likes that letter (he has assigned negative numbers to the letters he dislikes).
B likes substrings. He especially likes the ones that start and end with the same letter (their length must exceed one).
Also, A and B have a string s. Now they are trying to find out how many substrings t of a string s are interesting to B (that is, t starts and ends with the same letter and its length is larger than one), and also the sum of values of all letters (assigned by A), except for the first and the last one is equal to zero.
Naturally, A and B have quickly found the number of substrings t that are interesting to them. Can you do it?
Input
The first line contains 26 integers xa, xb, ..., xz ( - 105 ≤ xi ≤ 105) — the value assigned to letters a, b, c, ..., z respectively.
The second line contains string s of length between 1 and 105 characters, consisting of Lating lowercase letters— the string for which you need to calculate the answer.
Output
Print the answer to the problem.
Examples
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
xabcab
Output
2
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
aaa
Output
2
Note
In the first sample test strings satisfying the condition above are abca and bcab.
In the second sample test strings satisfying the condition above are two occurences of aa. | assin = map(int, raw_input().split())
s = list(str(raw_input()))
ssum = [assin[ord(s[0]) - ord('a')]]
for i in range(1, len(s)):
ssum.append(ssum[i-1] + assin[ord(s[i]) - ord('a')])
charsum = dict()
charsum[(s[0], ssum[0])] = 1
ans = 0
for i in range(1, len(s)):
if (s[i], ssum[i-1]) in charsum:
ans = ans + charsum[(s[i], ssum[i-1])]
if (s[i], ssum[i]) not in charsum:
charsum[(s[i], ssum[i])] = 0
charsum[(s[i], ssum[i])] = charsum[(s[i], ssum[i])] + 1
print ans | 1Python2
| {
"input": [
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 4 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\na\n",
"-3 4 -4 -1 3 5 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 0 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 2 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"-3 4 -4 -1 5 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 2 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -3 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 2\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 2\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 4\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 2 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 2 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 4 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 1 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 0 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 2 4\naaa\n"
],
"output": [
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"2\n",
"5\n",
"9\n",
"6\n",
"8\n",
"10\n",
"0\n",
"2\n",
"4\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n"
]
} | 2CODEFORCES
|
519_D. A and B and Interesting Substrings_37967 | A and B are preparing themselves for programming contests.
After several years of doing sports programming and solving many problems that require calculating all sorts of abstract objects, A and B also developed rather peculiar tastes.
A likes lowercase letters of the Latin alphabet. He has assigned to each letter a number that shows how much he likes that letter (he has assigned negative numbers to the letters he dislikes).
B likes substrings. He especially likes the ones that start and end with the same letter (their length must exceed one).
Also, A and B have a string s. Now they are trying to find out how many substrings t of a string s are interesting to B (that is, t starts and ends with the same letter and its length is larger than one), and also the sum of values of all letters (assigned by A), except for the first and the last one is equal to zero.
Naturally, A and B have quickly found the number of substrings t that are interesting to them. Can you do it?
Input
The first line contains 26 integers xa, xb, ..., xz ( - 105 ≤ xi ≤ 105) — the value assigned to letters a, b, c, ..., z respectively.
The second line contains string s of length between 1 and 105 characters, consisting of Lating lowercase letters— the string for which you need to calculate the answer.
Output
Print the answer to the problem.
Examples
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
xabcab
Output
2
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
aaa
Output
2
Note
In the first sample test strings satisfying the condition above are abca and bcab.
In the second sample test strings satisfying the condition above are two occurences of aa. | #include <bits/stdc++.h>
using namespace std;
int val[26];
unordered_map<long long, int> ht[26];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
for (int i = 0; i < 26; ++i) cin >> val[i];
string str;
cin >> str;
long long cm = 0, ans = 0;
for (int i = 0; i < ((int)(str).size()); ++i) {
ans += ht[str[i] - 'a'][cm];
cm += val[str[i] - 'a'];
++ht[str[i] - 'a'][cm];
}
cout << ans << '\n';
return 0;
}
| 2C++
| {
"input": [
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 4 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\na\n",
"-3 4 -4 -1 3 5 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 0 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 2 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"-3 4 -4 -1 5 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 2 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -3 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 2\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 2\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 4\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 2 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 2 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 4 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 1 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 0 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 2 4\naaa\n"
],
"output": [
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"2\n",
"5\n",
"9\n",
"6\n",
"8\n",
"10\n",
"0\n",
"2\n",
"4\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n"
]
} | 2CODEFORCES
|
519_D. A and B and Interesting Substrings_37968 | A and B are preparing themselves for programming contests.
After several years of doing sports programming and solving many problems that require calculating all sorts of abstract objects, A and B also developed rather peculiar tastes.
A likes lowercase letters of the Latin alphabet. He has assigned to each letter a number that shows how much he likes that letter (he has assigned negative numbers to the letters he dislikes).
B likes substrings. He especially likes the ones that start and end with the same letter (their length must exceed one).
Also, A and B have a string s. Now they are trying to find out how many substrings t of a string s are interesting to B (that is, t starts and ends with the same letter and its length is larger than one), and also the sum of values of all letters (assigned by A), except for the first and the last one is equal to zero.
Naturally, A and B have quickly found the number of substrings t that are interesting to them. Can you do it?
Input
The first line contains 26 integers xa, xb, ..., xz ( - 105 ≤ xi ≤ 105) — the value assigned to letters a, b, c, ..., z respectively.
The second line contains string s of length between 1 and 105 characters, consisting of Lating lowercase letters— the string for which you need to calculate the answer.
Output
Print the answer to the problem.
Examples
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
xabcab
Output
2
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
aaa
Output
2
Note
In the first sample test strings satisfying the condition above are abca and bcab.
In the second sample test strings satisfying the condition above are two occurences of aa. | xx = [int(i) for i in input().split()]
s = input()
x = [{} for _ in range(0,26)]
ss = 0
ans = 0
for i in s:
ans += x[ord(i)-97].get(ss,0)
ss += xx[ord(i)-97]
x[ord(i)-97][ss] = x[ord(i)-97].get(ss,0)+1
print(ans) | 3Python3
| {
"input": [
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 4 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\na\n",
"-3 4 -4 -1 3 5 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 0 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 2 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"-3 4 -4 -1 5 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 2 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -3 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 2\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 2\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 4\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 2 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 2 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 4 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 1 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 0 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 2 4\naaa\n"
],
"output": [
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"2\n",
"5\n",
"9\n",
"6\n",
"8\n",
"10\n",
"0\n",
"2\n",
"4\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n"
]
} | 2CODEFORCES
|
519_D. A and B and Interesting Substrings_37969 | A and B are preparing themselves for programming contests.
After several years of doing sports programming and solving many problems that require calculating all sorts of abstract objects, A and B also developed rather peculiar tastes.
A likes lowercase letters of the Latin alphabet. He has assigned to each letter a number that shows how much he likes that letter (he has assigned negative numbers to the letters he dislikes).
B likes substrings. He especially likes the ones that start and end with the same letter (their length must exceed one).
Also, A and B have a string s. Now they are trying to find out how many substrings t of a string s are interesting to B (that is, t starts and ends with the same letter and its length is larger than one), and also the sum of values of all letters (assigned by A), except for the first and the last one is equal to zero.
Naturally, A and B have quickly found the number of substrings t that are interesting to them. Can you do it?
Input
The first line contains 26 integers xa, xb, ..., xz ( - 105 ≤ xi ≤ 105) — the value assigned to letters a, b, c, ..., z respectively.
The second line contains string s of length between 1 and 105 characters, consisting of Lating lowercase letters— the string for which you need to calculate the answer.
Output
Print the answer to the problem.
Examples
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
xabcab
Output
2
Input
1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
aaa
Output
2
Note
In the first sample test strings satisfying the condition above are abca and bcab.
In the second sample test strings satisfying the condition above are two occurences of aa. | import java.util.HashMap;
import java.util.Scanner;
public class AAndBAndInterstingSubstrings
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int[] arr = new int[26];
for(int i=0;i<26;i++)
arr[i] = sc.nextInt();
String s = sc.next();
HashMap<Long, Integer> map[] = new HashMap[26];
for(int i=0;i<26;i++)
map[i] = new HashMap<>();
long ans = 0;
long sum = 0;
for(int i=0;i<s.length();i++)
{
int c = s.charAt(i)-'a';
Integer add = map[c].get(sum);
if(add == null) add = 0;
ans+=add;
sum+=arr[c];
Integer prev = map[c].get(sum);
if(prev == null) prev = 0;
map[c].put(sum, prev + 1);
}
System.out.println(ans);
}
} | 4JAVA
| {
"input": [
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 4 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1\na\n",
"-3 4 -4 -1 3 5 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"-2 -2 2 1 4 0 -2 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 0 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 4 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"-2 -2 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 -1 0 -5 -2 3 -2 6 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 1 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"1 1 -1 1 1 1 1 1 1 1 2 1 1 1 1 7 1 1 1 8 1 1 1 0 1 1\na\n",
"-3 4 -4 -1 3 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 1 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 1 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 1 1 8 1 0 1 1 1 1\naabbccdd\n",
"-3 4 -4 -1 5 6 -5 -3 3 2 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 1 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 1 1 1 1 1 1\nxabcab\n",
"1 1 -1 1 1 1 1 1 0 2 2 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 1\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -3 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 1 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 1 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 4 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 1 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 8 1 0 1 1 1 2\naabbccdd\n",
"0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 5 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 8 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxabcab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 1 0 0 -5 -2 3 -2 0 5 2 3 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 1 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 2 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 2 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 1 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 1 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 1 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 2 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -6 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 1 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 1 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 2 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 7 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 1 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 3 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 1 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 1 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -5 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 1 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 1 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -5 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 1 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 1 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 5 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 1 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 1 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -1 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 1\naaa\n",
"1 1 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 -1 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 1 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 1 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 1 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 2 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 2\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 1 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"-2 0 2 1 4 0 0 4 2 5 -4 -5 3 1 0 0 0 -5 -2 3 -2 0 5 2 0 -5\nqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavsovisrmfaefusoobingjhsmrukx\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 1 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 2 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 0 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 1 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 1 4\naaa\n",
"1 2 -1 0 1 1 0 0 2 1 1 1 2 1 2 0 2 0 1 8 2 1 1 1 1 1\nxaacab\n",
"1 1 -1 0 1 0 1 1 0 2 4 1 1 2 1 9 2 1 2 8 0 1 2 2 1 1\nbb\n",
"1 1 -1 1 2 1 1 2 1 1 1 1 4 1 3 7 0 3 1 11 1 0 1 1 2 2\naabbccdd\n",
"0 1 0 1 0 0 0 -1 0 1 0 -1 0 1 0 0 1 0 1 0 0 0 0 1 0 -1\nhhhhhhhhhh\n",
"-3 4 -4 -1 5 6 -9 -1 3 6 0 3 7 -3 -2 4 3 -2 1 -1 1 5 -4 0 -5 4\nolspxykjqr\n",
"1 0 -1 1 1 0 1 1 2 1 1 1 1 2 2 2 2 1 2 10 2 1 1 1 2 4\naaa\n"
],
"output": [
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"7\n",
"1\n",
"4\n",
"45\n",
"0\n",
"2\n",
"5\n",
"9\n",
"6\n",
"8\n",
"10\n",
"0\n",
"2\n",
"4\n",
"1\n",
"4\n",
"45\n",
"0\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"6\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"7\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"8\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n",
"2\n",
"1\n",
"4\n",
"9\n",
"0\n",
"2\n"
]
} | 2CODEFORCES
|
545_E. Paths and Trees_37970 | Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting, so she wanted to know its solution and decided to ask you about it. So, the problem statement is as follows.
Let's assume that we are given a connected weighted undirected graph G = (V, E) (here V is the set of vertices, E is the set of edges). The shortest-path tree from vertex u is such graph G1 = (V, E1) that is a tree with the set of edges E1 that is the subset of the set of edges of the initial graph E, and the lengths of the shortest paths from u to any vertex to G and to G1 are the same.
You are given a connected weighted undirected graph G and vertex u. Your task is to find the shortest-path tree of the given graph from vertex u, the total weight of whose edges is minimum possible.
Input
The first line contains two numbers, n and m (1 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of vertices and edges of the graph, respectively.
Next m lines contain three integers each, representing an edge — ui, vi, wi — the numbers of vertices connected by an edge and the weight of the edge (ui ≠ vi, 1 ≤ wi ≤ 109). It is guaranteed that graph is connected and that there is no more than one edge between any pair of vertices.
The last line of the input contains integer u (1 ≤ u ≤ n) — the number of the start vertex.
Output
In the first line print the minimum total weight of the edges of the tree.
In the next line print the indices of the edges that are included in the tree, separated by spaces. The edges are numbered starting from 1 in the order they follow in the input. You may print the numbers of the edges in any order.
If there are multiple answers, print any of them.
Examples
Input
3 3
1 2 1
2 3 1
1 3 2
3
Output
2
1 2
Input
4 4
1 2 1
2 3 1
3 4 1
4 1 2
4
Output
4
2 3 4
Note
In the first sample there are two possible shortest path trees:
* with edges 1 – 3 and 2 – 3 (the total weight is 3);
* with edges 1 – 2 and 2 – 3 (the total weight is 2);
And, for example, a tree with edges 1 – 2 and 1 – 3 won't be a shortest path tree for vertex 3, because the distance from vertex 3 to vertex 2 in this tree equals 3, and in the original graph it is 1. | from collections import defaultdict,deque,Counter,OrderedDict
from heapq import heappop,heappush
def main():
n,m = map(int,raw_input().split())
adj = [[] for i in xrange(n+1)]
for i in range(m):
a,b,c = map(int,raw_input().split())
adj[a].append((b, c, i))
adj[b].append((a, c, i))
v = int(raw_input())
visited, ans, tw = [0]*(n+1), [], 0
Q = [(0,0,v,0)]
while Q:
w,lew,u,ei = heappop(Q)
if visited[u]: continue
visited[u] = 1
ans.append(str(ei+1))
tw += lew
for to,we,eii in adj[u]:
if not visited[to]:
heappush(Q,(we+w,we,to,eii))
print tw
print " ".join(ans[1:])
if __name__ == "__main__":
main() | 1Python2
| {
"input": [
"3 3\n1 2 1\n2 3 1\n1 3 2\n3\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 2\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1000000000\n2\n",
"1 0\n1\n",
"4 5\n1 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"2 1\n1 2 1000000000\n1\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 2 30\n2 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"4 4\n1 2 1\n1 3 1\n3 2 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 5\n2 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1001000000\n2\n",
"6 8\n1 4 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 110\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 3 50\n4 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 119\n4\n",
"6 8\n1 1 30\n1 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 3 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 111\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n2 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 14\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 2 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n1 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 35\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 1 60\n4\n",
"4 4\n1 2 1\n2 3 2\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n3 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 7\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 110\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n2 6 60\n4\n"
],
"output": [
"2\n1 2 ",
"4\n4 2 3 ",
"230\n1 4 6 5 7 ",
"1000000000\n1 ",
"0\n",
"3\n1 2 3 ",
"240\n2 4 7 6 8\n",
"1000000000\n1\n",
"3\n2 1 3\n",
"4\n4 1 3\n",
"220\n2 4 6 5 7\n",
"3\n1 2 3\n",
"250\n1 4 7 6 8\n",
"4\n4 1 2\n",
"207\n2 4 6 5 7\n",
"3\n3 2 4\n",
"216\n2 4 6 5 7\n",
"217\n2 4 6 5 7\n",
"227\n2 4 6 5 8\n",
"214\n1 4 3 6 7\n",
"1001000000\n1\n",
"160\n1 5 2 6 8\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"309\n2 4 3 5 7\n",
"5\n4 1 3\n",
"205\n2 4 6 5 8\n",
"240\n7 4 2 6 8\n",
"270\n2 4 3 5 7\n",
"227\n2 4 6 8 7\n",
"219\n2 4 3 5 8\n",
"240\n1 4 6 5 8\n",
"299\n1 4 6 5 8\n",
"170\n2 5 3 6 7\n",
"207\n2 5 4 6 7\n",
"227\n2 4 6 5 7\n",
"237\n1 4 6 5 8\n",
"178\n1 4 3 6 7\n",
"226\n2 4 6 5 8\n",
"199\n2 5 6 8 7\n",
"212\n2 4 6 8 7\n",
"207\n1 4 2 6 7\n",
"170\n8 1 2 6 3\n",
"4\n4 1 3\n",
"3\n2 1 3\n",
"207\n2 4 6 5 7\n",
"4\n4 1 3\n",
"207\n2 4 6 5 7\n",
"216\n2 4 6 5 7\n",
"207\n2 4 6 5 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"250\n1 4 7 6 8\n",
"216\n2 4 6 5 7\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"219\n2 4 3 5 8\n"
]
} | 2CODEFORCES
|
545_E. Paths and Trees_37971 | Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting, so she wanted to know its solution and decided to ask you about it. So, the problem statement is as follows.
Let's assume that we are given a connected weighted undirected graph G = (V, E) (here V is the set of vertices, E is the set of edges). The shortest-path tree from vertex u is such graph G1 = (V, E1) that is a tree with the set of edges E1 that is the subset of the set of edges of the initial graph E, and the lengths of the shortest paths from u to any vertex to G and to G1 are the same.
You are given a connected weighted undirected graph G and vertex u. Your task is to find the shortest-path tree of the given graph from vertex u, the total weight of whose edges is minimum possible.
Input
The first line contains two numbers, n and m (1 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of vertices and edges of the graph, respectively.
Next m lines contain three integers each, representing an edge — ui, vi, wi — the numbers of vertices connected by an edge and the weight of the edge (ui ≠ vi, 1 ≤ wi ≤ 109). It is guaranteed that graph is connected and that there is no more than one edge between any pair of vertices.
The last line of the input contains integer u (1 ≤ u ≤ n) — the number of the start vertex.
Output
In the first line print the minimum total weight of the edges of the tree.
In the next line print the indices of the edges that are included in the tree, separated by spaces. The edges are numbered starting from 1 in the order they follow in the input. You may print the numbers of the edges in any order.
If there are multiple answers, print any of them.
Examples
Input
3 3
1 2 1
2 3 1
1 3 2
3
Output
2
1 2
Input
4 4
1 2 1
2 3 1
3 4 1
4 1 2
4
Output
4
2 3 4
Note
In the first sample there are two possible shortest path trees:
* with edges 1 – 3 and 2 – 3 (the total weight is 3);
* with edges 1 – 2 and 2 – 3 (the total weight is 2);
And, for example, a tree with edges 1 – 2 and 1 – 3 won't be a shortest path tree for vertex 3, because the distance from vertex 3 to vertex 2 in this tree equals 3, and in the original graph it is 1. | #include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 10, Maxn = 1e5 + 10, SQ = 360, lg = 22;
const long long mod = 1e9 + 7;
const long long inf = 1e18 + 10;
vector<pair<long long, long long>> adj[maxn];
long long d[maxn], p[maxn], n, m;
map<pair<long long, long long>, pair<long long, long long>> mp;
void dij(long long s) {
for (long long i = 0; i < n; i++) d[i] = inf, p[i] = -1;
set<pair<long long, long long>> q;
q.insert({0, s});
d[s] = 0;
while (!q.empty()) {
long long v = q.begin()->second;
q.erase(q.begin());
for (auto e : adj[v]) {
long long u = e.first;
long long len = e.second;
if (d[v] + len <= d[u]) {
q.erase({d[u], u});
p[u] = v;
d[u] = d[v] + len;
q.insert({d[u], u});
}
}
}
}
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (long long i = 0; i < m; i++) {
long long u, v, w;
cin >> u >> v >> w;
u--, v--;
mp[make_pair(u, v)] = mp[make_pair(v, u)] = {i, w};
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
long long x;
cin >> x;
x--;
dij(x);
vector<long long> v;
long long ans = 0;
for (long long i = 0; i < n; i++) {
if (i == x) continue;
ans += mp[make_pair(p[i], i)].second;
v.push_back(mp[make_pair(p[i], i)].first);
}
cout << ans << "\n";
for (auto i : v) cout << i + 1 << ' ';
cout << "\n";
return 0;
}
| 2C++
| {
"input": [
"3 3\n1 2 1\n2 3 1\n1 3 2\n3\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 2\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1000000000\n2\n",
"1 0\n1\n",
"4 5\n1 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"2 1\n1 2 1000000000\n1\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 2 30\n2 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"4 4\n1 2 1\n1 3 1\n3 2 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 5\n2 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1001000000\n2\n",
"6 8\n1 4 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 110\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 3 50\n4 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 119\n4\n",
"6 8\n1 1 30\n1 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 3 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 111\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n2 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 14\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 2 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n1 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 35\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 1 60\n4\n",
"4 4\n1 2 1\n2 3 2\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n3 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 7\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 110\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n2 6 60\n4\n"
],
"output": [
"2\n1 2 ",
"4\n4 2 3 ",
"230\n1 4 6 5 7 ",
"1000000000\n1 ",
"0\n",
"3\n1 2 3 ",
"240\n2 4 7 6 8\n",
"1000000000\n1\n",
"3\n2 1 3\n",
"4\n4 1 3\n",
"220\n2 4 6 5 7\n",
"3\n1 2 3\n",
"250\n1 4 7 6 8\n",
"4\n4 1 2\n",
"207\n2 4 6 5 7\n",
"3\n3 2 4\n",
"216\n2 4 6 5 7\n",
"217\n2 4 6 5 7\n",
"227\n2 4 6 5 8\n",
"214\n1 4 3 6 7\n",
"1001000000\n1\n",
"160\n1 5 2 6 8\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"309\n2 4 3 5 7\n",
"5\n4 1 3\n",
"205\n2 4 6 5 8\n",
"240\n7 4 2 6 8\n",
"270\n2 4 3 5 7\n",
"227\n2 4 6 8 7\n",
"219\n2 4 3 5 8\n",
"240\n1 4 6 5 8\n",
"299\n1 4 6 5 8\n",
"170\n2 5 3 6 7\n",
"207\n2 5 4 6 7\n",
"227\n2 4 6 5 7\n",
"237\n1 4 6 5 8\n",
"178\n1 4 3 6 7\n",
"226\n2 4 6 5 8\n",
"199\n2 5 6 8 7\n",
"212\n2 4 6 8 7\n",
"207\n1 4 2 6 7\n",
"170\n8 1 2 6 3\n",
"4\n4 1 3\n",
"3\n2 1 3\n",
"207\n2 4 6 5 7\n",
"4\n4 1 3\n",
"207\n2 4 6 5 7\n",
"216\n2 4 6 5 7\n",
"207\n2 4 6 5 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"250\n1 4 7 6 8\n",
"216\n2 4 6 5 7\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"219\n2 4 3 5 8\n"
]
} | 2CODEFORCES
|
545_E. Paths and Trees_37972 | Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting, so she wanted to know its solution and decided to ask you about it. So, the problem statement is as follows.
Let's assume that we are given a connected weighted undirected graph G = (V, E) (here V is the set of vertices, E is the set of edges). The shortest-path tree from vertex u is such graph G1 = (V, E1) that is a tree with the set of edges E1 that is the subset of the set of edges of the initial graph E, and the lengths of the shortest paths from u to any vertex to G and to G1 are the same.
You are given a connected weighted undirected graph G and vertex u. Your task is to find the shortest-path tree of the given graph from vertex u, the total weight of whose edges is minimum possible.
Input
The first line contains two numbers, n and m (1 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of vertices and edges of the graph, respectively.
Next m lines contain three integers each, representing an edge — ui, vi, wi — the numbers of vertices connected by an edge and the weight of the edge (ui ≠ vi, 1 ≤ wi ≤ 109). It is guaranteed that graph is connected and that there is no more than one edge between any pair of vertices.
The last line of the input contains integer u (1 ≤ u ≤ n) — the number of the start vertex.
Output
In the first line print the minimum total weight of the edges of the tree.
In the next line print the indices of the edges that are included in the tree, separated by spaces. The edges are numbered starting from 1 in the order they follow in the input. You may print the numbers of the edges in any order.
If there are multiple answers, print any of them.
Examples
Input
3 3
1 2 1
2 3 1
1 3 2
3
Output
2
1 2
Input
4 4
1 2 1
2 3 1
3 4 1
4 1 2
4
Output
4
2 3 4
Note
In the first sample there are two possible shortest path trees:
* with edges 1 – 3 and 2 – 3 (the total weight is 3);
* with edges 1 – 2 and 2 – 3 (the total weight is 2);
And, for example, a tree with edges 1 – 2 and 1 – 3 won't be a shortest path tree for vertex 3, because the distance from vertex 3 to vertex 2 in this tree equals 3, and in the original graph it is 1. | import heapq
n, m = map(int, input().split())
g = [[] for _ in range(n + 1)]
for i in range(1, m + 1):
u, v, w = map(int, input().split())
g[u].append((i, v, w))
g[v].append((i, u, w))
src = int(input())
pq = [(0, 0, src, -1)]
mk = [0] * (n + 1)
t = []
s = 0
while pq:
d, w, u, e = heapq.heappop(pq)
if mk[u]:
continue
mk[u] = 1
s += w
t.append(e)
for e, v, w in g[u]:
if not mk[v]:
heapq.heappush(pq, (d + w, w, v, e))
print(s)
print(*t[1:])
| 3Python3
| {
"input": [
"3 3\n1 2 1\n2 3 1\n1 3 2\n3\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 2\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1000000000\n2\n",
"1 0\n1\n",
"4 5\n1 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"2 1\n1 2 1000000000\n1\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 2 30\n2 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"4 4\n1 2 1\n1 3 1\n3 2 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 5\n2 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1001000000\n2\n",
"6 8\n1 4 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 110\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 3 50\n4 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 119\n4\n",
"6 8\n1 1 30\n1 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 3 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 111\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n2 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 14\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 2 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n1 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 35\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 1 60\n4\n",
"4 4\n1 2 1\n2 3 2\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n3 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 7\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 110\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n2 6 60\n4\n"
],
"output": [
"2\n1 2 ",
"4\n4 2 3 ",
"230\n1 4 6 5 7 ",
"1000000000\n1 ",
"0\n",
"3\n1 2 3 ",
"240\n2 4 7 6 8\n",
"1000000000\n1\n",
"3\n2 1 3\n",
"4\n4 1 3\n",
"220\n2 4 6 5 7\n",
"3\n1 2 3\n",
"250\n1 4 7 6 8\n",
"4\n4 1 2\n",
"207\n2 4 6 5 7\n",
"3\n3 2 4\n",
"216\n2 4 6 5 7\n",
"217\n2 4 6 5 7\n",
"227\n2 4 6 5 8\n",
"214\n1 4 3 6 7\n",
"1001000000\n1\n",
"160\n1 5 2 6 8\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"309\n2 4 3 5 7\n",
"5\n4 1 3\n",
"205\n2 4 6 5 8\n",
"240\n7 4 2 6 8\n",
"270\n2 4 3 5 7\n",
"227\n2 4 6 8 7\n",
"219\n2 4 3 5 8\n",
"240\n1 4 6 5 8\n",
"299\n1 4 6 5 8\n",
"170\n2 5 3 6 7\n",
"207\n2 5 4 6 7\n",
"227\n2 4 6 5 7\n",
"237\n1 4 6 5 8\n",
"178\n1 4 3 6 7\n",
"226\n2 4 6 5 8\n",
"199\n2 5 6 8 7\n",
"212\n2 4 6 8 7\n",
"207\n1 4 2 6 7\n",
"170\n8 1 2 6 3\n",
"4\n4 1 3\n",
"3\n2 1 3\n",
"207\n2 4 6 5 7\n",
"4\n4 1 3\n",
"207\n2 4 6 5 7\n",
"216\n2 4 6 5 7\n",
"207\n2 4 6 5 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"250\n1 4 7 6 8\n",
"216\n2 4 6 5 7\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"219\n2 4 3 5 8\n"
]
} | 2CODEFORCES
|
545_E. Paths and Trees_37973 | Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting, so she wanted to know its solution and decided to ask you about it. So, the problem statement is as follows.
Let's assume that we are given a connected weighted undirected graph G = (V, E) (here V is the set of vertices, E is the set of edges). The shortest-path tree from vertex u is such graph G1 = (V, E1) that is a tree with the set of edges E1 that is the subset of the set of edges of the initial graph E, and the lengths of the shortest paths from u to any vertex to G and to G1 are the same.
You are given a connected weighted undirected graph G and vertex u. Your task is to find the shortest-path tree of the given graph from vertex u, the total weight of whose edges is minimum possible.
Input
The first line contains two numbers, n and m (1 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of vertices and edges of the graph, respectively.
Next m lines contain three integers each, representing an edge — ui, vi, wi — the numbers of vertices connected by an edge and the weight of the edge (ui ≠ vi, 1 ≤ wi ≤ 109). It is guaranteed that graph is connected and that there is no more than one edge between any pair of vertices.
The last line of the input contains integer u (1 ≤ u ≤ n) — the number of the start vertex.
Output
In the first line print the minimum total weight of the edges of the tree.
In the next line print the indices of the edges that are included in the tree, separated by spaces. The edges are numbered starting from 1 in the order they follow in the input. You may print the numbers of the edges in any order.
If there are multiple answers, print any of them.
Examples
Input
3 3
1 2 1
2 3 1
1 3 2
3
Output
2
1 2
Input
4 4
1 2 1
2 3 1
3 4 1
4 1 2
4
Output
4
2 3 4
Note
In the first sample there are two possible shortest path trees:
* with edges 1 – 3 and 2 – 3 (the total weight is 3);
* with edges 1 – 2 and 2 – 3 (the total weight is 2);
And, for example, a tree with edges 1 – 2 and 1 – 3 won't be a shortest path tree for vertex 3, because the distance from vertex 3 to vertex 2 in this tree equals 3, and in the original graph it is 1. | import java.io.*;
import java.util.*;
public class P303E {
public static void main(String args[]){
Reader s = new Reader();
int n = s.nextInt();
int m = s.nextInt();
List<Edge> li[] = new ArrayList[n];
for(int i=0;i<n;i++){
li[i] = new ArrayList<>();
}
for(int i=0;i<m;i++){
int x = s.nextInt() - 1;
int y = s.nextInt() - 1;
int w = s.nextInt();
li[x].add(new Edge(x,y,w,i+1));
li[y].add(new Edge(y,x,w,i+1));
}
int src = s.nextInt() - 1;
PriorityQueue<long[]> pq = new PriorityQueue<>(new Comparator<long[]>() {
@Override
public int compare(long[] o1, long[] o2) {
if(o1[1] == o2[1]){
if(o1[3]<o2[3]){
return -1;
}
return 1;
}
if(o1[1] <o2[1]){
return -1;
}
return 1;
}
});
//System.out.println(src);
pq.add(new long[]{src,0,-1,0});
boolean visited[] = new boolean[n];
long sum = 0;
List<Integer> ans = new ArrayList<>();
int y = 1;
while(y<=n){
long[] a = pq.poll();
// System.out.println((a[0]+1)+" "+a[1]+" "+a[2]+" "+a[3]);
if(visited[(int)a[0]]){
continue;
}
sum += a[3];
ans.add((int)a[2]);
visited[(int)a[0]] = true;
for(Edge edge:li[(int)a[0]]){
if(!visited[edge.des]) {
pq.add(new long[]{edge.des, edge.weight + a[1],edge.index,edge.weight});
}
}
y++;
}
System.out.println(sum);
for(int i=1;i<ans.size();i++){
System.out.print(ans.get(i)+" ");
}
}
static class Edge{
int src;
int des;
int weight;
int index ;
public Edge(int src, int des, int weight, int index) {
this.src = src;
this.des = des;
this.weight = weight;
this.index = index;
}
}
static class Reader {
private InputStream mIs;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
public Reader() {
this(System.in);
}
public Reader(InputStream is) {
mIs = is;
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = mIs.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public String nextLine() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isEndOfLine(c));
return res.toString();
}
public String next() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
double nextDouble()
{
return Double.parseDouble(next());
}
public long nextLong() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public boolean isEndOfLine(int c) {
return c == '\n' || c == '\r' || c == -1;
}
}
}
| 4JAVA
| {
"input": [
"3 3\n1 2 1\n2 3 1\n1 3 2\n3\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 2\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1000000000\n2\n",
"1 0\n1\n",
"4 5\n1 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"2 1\n1 2 1000000000\n1\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n2 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 2 30\n2 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"4 4\n1 2 1\n1 3 1\n3 2 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 5\n2 2 1\n1 3 1\n2 4 1\n3 4 1\n2 3 10\n1\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"2 1\n1 2 1001000000\n2\n",
"6 8\n1 4 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 110\n2 5 40\n5 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n1 3 50\n4 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 119\n4\n",
"6 8\n1 1 30\n1 3 20\n4 3 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 3 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 111\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n2 1 30\n1 3 20\n2 3 50\n4 2 101\n2 5 40\n3 5 6\n6 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n1 3 20\n2 3 24\n4 2 100\n2 5 40\n3 5 10\n3 6 14\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 2 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n1 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 35\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 1 60\n4\n",
"4 4\n1 2 1\n2 3 2\n3 4 1\n4 1 2\n4\n",
"4 4\n1 2 1\n1 3 1\n3 4 1\n4 1 3\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 80\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n5 6 60\n4\n",
"4 4\n1 2 1\n3 3 2\n3 4 1\n4 1 2\n4\n",
"6 8\n1 1 30\n1 3 7\n2 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 2 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 7\n3 3 50\n4 2 100\n2 5 40\n3 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 80\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 1 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 40\n1 3 7\n2 3 88\n4 2 100\n2 5 72\n3 5 10\n4 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n2 6 50\n4 2 100\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 7\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n3 5 6\n3 6 50\n5 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 50\n4 2 100\n2 5 40\n5 5 10\n2 6 50\n5 6 60\n4\n",
"6 8\n1 2 30\n2 3 20\n4 3 50\n4 2 110\n2 5 40\n3 5 10\n3 6 50\n4 6 60\n4\n",
"6 8\n1 1 30\n1 3 20\n2 3 20\n4 2 101\n2 5 18\n3 5 6\n6 6 50\n2 6 60\n4\n"
],
"output": [
"2\n1 2 ",
"4\n4 2 3 ",
"230\n1 4 6 5 7 ",
"1000000000\n1 ",
"0\n",
"3\n1 2 3 ",
"240\n2 4 7 6 8\n",
"1000000000\n1\n",
"3\n2 1 3\n",
"4\n4 1 3\n",
"220\n2 4 6 5 7\n",
"3\n1 2 3\n",
"250\n1 4 7 6 8\n",
"4\n4 1 2\n",
"207\n2 4 6 5 7\n",
"3\n3 2 4\n",
"216\n2 4 6 5 7\n",
"217\n2 4 6 5 7\n",
"227\n2 4 6 5 8\n",
"214\n1 4 3 6 7\n",
"1001000000\n1\n",
"160\n1 5 2 6 8\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"309\n2 4 3 5 7\n",
"5\n4 1 3\n",
"205\n2 4 6 5 8\n",
"240\n7 4 2 6 8\n",
"270\n2 4 3 5 7\n",
"227\n2 4 6 8 7\n",
"219\n2 4 3 5 8\n",
"240\n1 4 6 5 8\n",
"299\n1 4 6 5 8\n",
"170\n2 5 3 6 7\n",
"207\n2 5 4 6 7\n",
"227\n2 4 6 5 7\n",
"237\n1 4 6 5 8\n",
"178\n1 4 3 6 7\n",
"226\n2 4 6 5 8\n",
"199\n2 5 6 8 7\n",
"212\n2 4 6 8 7\n",
"207\n1 4 2 6 7\n",
"170\n8 1 2 6 3\n",
"4\n4 1 3\n",
"3\n2 1 3\n",
"207\n2 4 6 5 7\n",
"4\n4 1 3\n",
"207\n2 4 6 5 7\n",
"216\n2 4 6 5 7\n",
"207\n2 4 6 5 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"227\n2 4 6 8 7\n",
"250\n1 4 7 6 8\n",
"216\n2 4 6 5 7\n",
"260\n2 4 3 5 7\n",
"170\n1 2 3 6 8\n",
"219\n2 4 3 5 8\n"
]
} | 2CODEFORCES
|
572_B. Order Book_37974 | In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy or sell, and integer qi. This means that the participant is ready to buy or sell qi stocks at price pi for one stock. A value qi is also known as a volume of an order.
All orders with the same price p and direction d are merged into one aggregated order with price p and direction d. The volume of such order is a sum of volumes of the initial orders.
An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.
An order book of depth s contains s best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than s aggregated orders for some direction then all of them will be in the final order book.
You are given n stock exhange orders. Your task is to print order book of depth s for these orders.
Input
The input starts with two positive integers n and s (1 ≤ n ≤ 1000, 1 ≤ s ≤ 50), the number of orders and the book depth.
Next n lines contains a letter di (either 'B' or 'S'), an integer pi (0 ≤ pi ≤ 105) and an integer qi (1 ≤ qi ≤ 104) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order.
Output
Print no more than 2s lines with aggregated orders from order book of depth s. The output format for orders should be the same as in input.
Examples
Input
6 2
B 10 3
S 50 2
S 40 1
S 50 6
B 20 4
B 25 10
Output
S 50 8
S 40 1
B 25 10
B 20 4
Note
Denote (x, y) an order with price x and volume y. There are 3 aggregated buy orders (10, 3), (20, 4), (25, 10) and two sell orders (50, 8), (40, 1) in the sample.
You need to print no more than two best orders for each direction, so you shouldn't print the order (10 3) having the worst price among buy orders. | from collections import defaultdict
n, q = map(int, raw_input().split())
b = defaultdict(int)
s = defaultdict(int)
for i in xrange(n):
a = raw_input().split()
if a[0] == "B": b[int(a[1])] += int(a[2])
elif a[0] == "S": s[int(a[1])] += int(a[2])
v = sorted(s.keys())[:q][::-1]
for k in v: print "S", k, s[k]
v = sorted(b.keys(), reverse=True)[:q]
for k in v: print "B", k, b[k]
| 1Python2
| {
"input": [
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 4\nB 25 10\n",
"2 2\nS 1 1\nB 0 2\n",
"2 1\nS 1 1\nB 0 1\n",
"2 10\nB 0 1\nS 100000 1\n",
"2 50\nB 758 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 3\n",
"3 3\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"1 1\nS 95992 7257\n",
"2 1\nB 0 100\nS 1 100\n",
"1 50\nB 47828 7726\n",
"1 50\nS 72218 8095\n",
"2 1\nB 7523 5589\nS 69799 1711\n",
"2 50\nB 2 5\nB 0 1\n",
"2 1\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 1\nB 0 1\nB 0 1\n",
"1 1\nB 48259 991\n",
"2 10\nB 0 1\nS 1 1\n",
"2 50\nB 758 9290\nS 61452 3367\n",
"2 2\nB 1 3\nS 10 3\n",
"3 3\nB 5878 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 47828 11099\n",
"1 50\nS 72218 15546\n",
"2 50\nB 3 5\nB 0 1\n",
"2 2\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 2\nB 0 1\nB 0 1\n",
"1 1\nB 61409 991\n",
"2 50\nB 758 9290\nS 61452 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 67037 11099\n",
"1 50\nS 72218 10859\n",
"1 1\nB 95840 991\n",
"2 50\nB 758 9290\nS 32139 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 1905\n",
"1 50\nS 82701 10859\n",
"2 5\nB 3 4\nB 0 1\n",
"1 50\nS 79457 10859\n",
"2 5\nB 3 8\nB 0 1\n",
"2 1\nB 3 8\nB 0 1\n",
"1 3\nB 95840 1545\n",
"2 1\nS 2 1\nB 0 1\n",
"3 2\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"2 1\nB 0 110\nS 1 100\n",
"1 50\nB 86960 7726\n",
"1 2\nB 48259 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 5\nB 25 10\n",
"2 2\nB 1 3\nS 10 2\n",
"1 50\nB 79400 11099\n",
"3 3\nB 9182 2660\nS 23924 4895\nS 76276 1905\n",
"1 50\nB 67037 21268\n",
"2 5\nB 3 1\nB 0 1\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 3555\n",
"1 54\nB 67037 16846\n",
"1 50\nS 79457 12568\n",
"2 5\nB 3 13\nB 0 1\n",
"2 1\nB 4 8\nB 0 1\n",
"1 3\nB 57614 1545\n",
"2 1\nB 0 111\nS 1 100\n",
"1 2\nB 21299 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 3\nB 20 5\nB 25 10\n",
"3 3\nB 9182 3215\nS 23924 4895\nS 76276 1905\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 54293 3555\n",
"2 5\nB 3 16\nB 0 1\n",
"2 1\nB 2 8\nB 0 1\n",
"1 3\nB 8504 1545\n",
"1 2\nB 21299 551\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 25 3\nB 20 5\nB 25 10\n",
"2 1\nB 1 3\nS 10 4\n",
"3 3\nB 9182 5044\nS 23924 4895\nS 76276 1905\n",
"1 9\nB 67037 12270\n",
"2 2\nB 0 111\nS 1 110\n",
"2 1\nB 1 3\nS 4 4\n",
"3 3\nB 16671 5044\nS 23924 4895\nS 76276 1905\n",
"2 1\nB 1 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 1905\n",
"1 1\nB 8504 2115\n",
"2 1\nB 2 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 8504 4211\n",
"3 3\nB 5191 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 7534 4211\n",
"1 1\nB 11157 4211\n",
"1 1\nB 11157 7684\n",
"1 1\nB 8680 7684\n",
"1 1\nB 8680 8096\n",
"2 2\nS 1 1\nB 0 1\n",
"2 50\nB 590 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 1\n",
"2 5\nB 3 5\nB 0 1\n",
"1 54\nB 67037 11099\n",
"1 2\nB 95840 991\n",
"1 3\nB 95840 991\n",
"1 6\nB 95840 1545\n",
"1 27\nS 72218 10859\n",
"1 4\nB 95840 991\n",
"2 1\nB 1 3\nS 10 2\n",
"1 9\nB 67037 21268\n",
"1 9\nS 72218 10859\n",
"1 65\nS 79457 12568\n",
"2 2\nB 0 111\nS 1 100\n",
"1 6\nS 72218 10859\n",
"1 2\nB 8504 1545\n",
"1 3\nB 21299 551\n",
"1 1\nB 8504 1545\n",
"1 2\nB 8680 8096\n"
],
"output": [
"S 50 8\nS 40 1\nB 25 10\nB 20 4\n",
"S 1 1\nB 0 2\n",
"S 1 1\nB 0 1\n",
"S 100000 1\nB 0 1\n",
"S 86168 3367\nB 758 9290\n",
"S 10 3\nB 0 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 95992 7257\n",
"S 1 100\nB 0 100\n",
"B 47828 7726\n",
"S 72218 8095\n",
"S 69799 1711\nB 7523 5589\n",
"B 2 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 3\nB 0 3\n",
"B 48259 991\n",
"S 1 1\nB 0 1\n",
"S 61452 3367\nB 758 9290\n",
"S 10 3\nB 1 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 2660\n",
"B 47828 11099\n",
"S 72218 15546\n",
"B 3 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 4\nB 0 3\n",
"B 61409 991\n",
"S 61452 6680\nB 758 9290\n",
"S 76276 1905\nS 60238 4895\nB 9182 2660\n",
"B 67037 11099\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 32139 6680\nB 758 9290\n",
"S 73783 1905\nS 60238 4895\nB 9182 2660\n",
"S 82701 10859\n",
"B 3 4\nB 0 1\n",
"S 79457 10859\n",
"B 3 8\nB 0 1\n",
"B 3 8\n",
"B 95840 1545\n",
"S 2 1\nB 0 1\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 1 100\nB 0 110\n",
"B 86960 7726\n",
"B 48259 991\n",
"S 50 8\nS 40 1\nB 25 10\nB 20 5\n",
"S 10 2\nB 1 3\n",
"B 79400 11099\n",
"S 76276 1905\nS 23924 4895\nB 9182 2660\n",
"B 67037 21268\n",
"B 3 1\nB 0 1\n",
"S 73783 3555\nS 60238 4895\nB 9182 2660\n",
"B 67037 16846\n",
"S 79457 12568\n",
"B 3 13\nB 0 1\n",
"B 4 8\n",
"B 57614 1545\n",
"S 1 100\nB 0 111\n",
"B 21299 991\n",
"S 50 5\nS 40 1\nB 25 10\nB 20 5\n",
"S 76276 1905\nS 23924 4895\nB 9182 3215\n",
"S 60238 4895\nS 54293 3555\nB 9182 2660\n",
"B 3 16\nB 0 1\n",
"B 2 8\n",
"B 8504 1545\n",
"B 21299 551\n",
"S 40 1\nS 25 3\nB 25 10\nB 20 5\n",
"S 10 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 9182 5044\n",
"B 67037 12270\n",
"S 1 110\nB 0 111\n",
"S 4 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 16671 5044\n",
"S 4 4\nB 1 4\n",
"S 76276 1905\nS 23924 4895\nB 16671 5006\n",
"B 8504 2115\n",
"S 4 4\nB 2 4\n",
"S 76276 3800\nS 23924 4895\nB 16671 5006\n",
"B 8504 4211\n",
"S 76276 3800\nS 23924 4895\nB 5191 5006\n",
"B 7534 4211\n",
"B 11157 4211\n",
"B 11157 7684\n",
"B 8680 7684\n",
"B 8680 8096\n",
"S 1 1\nB 0 1\n",
"S 86168 3367\nB 590 9290\n",
"S 10 1\nB 0 3\n",
"B 3 5\nB 0 1\n",
"B 67037 11099\n",
"B 95840 991\n",
"B 95840 991\n",
"B 95840 1545\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 10 2\nB 1 3\n",
"B 67037 21268\n",
"S 72218 10859\n",
"S 79457 12568\n",
"S 1 100\nB 0 111\n",
"S 72218 10859\n",
"B 8504 1545\n",
"B 21299 551\n",
"B 8504 1545\n",
"B 8680 8096\n"
]
} | 2CODEFORCES
|
572_B. Order Book_37975 | In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy or sell, and integer qi. This means that the participant is ready to buy or sell qi stocks at price pi for one stock. A value qi is also known as a volume of an order.
All orders with the same price p and direction d are merged into one aggregated order with price p and direction d. The volume of such order is a sum of volumes of the initial orders.
An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.
An order book of depth s contains s best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than s aggregated orders for some direction then all of them will be in the final order book.
You are given n stock exhange orders. Your task is to print order book of depth s for these orders.
Input
The input starts with two positive integers n and s (1 ≤ n ≤ 1000, 1 ≤ s ≤ 50), the number of orders and the book depth.
Next n lines contains a letter di (either 'B' or 'S'), an integer pi (0 ≤ pi ≤ 105) and an integer qi (1 ≤ qi ≤ 104) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order.
Output
Print no more than 2s lines with aggregated orders from order book of depth s. The output format for orders should be the same as in input.
Examples
Input
6 2
B 10 3
S 50 2
S 40 1
S 50 6
B 20 4
B 25 10
Output
S 50 8
S 40 1
B 25 10
B 20 4
Note
Denote (x, y) an order with price x and volume y. There are 3 aggregated buy orders (10, 3), (20, 4), (25, 10) and two sell orders (50, 8), (40, 1) in the sample.
You need to print no more than two best orders for each direction, so you shouldn't print the order (10 3) having the worst price among buy orders. | #include <bits/stdc++.h>
using namespace std;
map<int, long long> mb;
map<int, long long> ms;
map<int, long long>::iterator it;
map<int, long long>::reverse_iterator it2;
vector<pair<int, long long> > v;
int main() {
int n, s, i, p, q;
char ch;
cin >> n >> s;
for (i = 1; i <= n; i++) {
cin >> ch;
scanf("%d %d", &p, &q);
if (ch == 'B') {
mb[p] += q;
} else {
ms[p] += q;
}
}
for (it = ms.begin(), i = 1; it != ms.end() && i <= s; it++, i++) {
v.push_back(make_pair(it->first, it->second));
}
for (i = i - 2; i >= 0; i--) {
printf("S %d %d\n", v[i].first, v[i].second);
}
for (it2 = mb.rbegin(), i = 1; it2 != mb.rend() && i <= s; it2++, i++) {
printf("B %d %d\n", it2->first, it2->second);
}
return 0;
}
| 2C++
| {
"input": [
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 4\nB 25 10\n",
"2 2\nS 1 1\nB 0 2\n",
"2 1\nS 1 1\nB 0 1\n",
"2 10\nB 0 1\nS 100000 1\n",
"2 50\nB 758 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 3\n",
"3 3\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"1 1\nS 95992 7257\n",
"2 1\nB 0 100\nS 1 100\n",
"1 50\nB 47828 7726\n",
"1 50\nS 72218 8095\n",
"2 1\nB 7523 5589\nS 69799 1711\n",
"2 50\nB 2 5\nB 0 1\n",
"2 1\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 1\nB 0 1\nB 0 1\n",
"1 1\nB 48259 991\n",
"2 10\nB 0 1\nS 1 1\n",
"2 50\nB 758 9290\nS 61452 3367\n",
"2 2\nB 1 3\nS 10 3\n",
"3 3\nB 5878 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 47828 11099\n",
"1 50\nS 72218 15546\n",
"2 50\nB 3 5\nB 0 1\n",
"2 2\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 2\nB 0 1\nB 0 1\n",
"1 1\nB 61409 991\n",
"2 50\nB 758 9290\nS 61452 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 67037 11099\n",
"1 50\nS 72218 10859\n",
"1 1\nB 95840 991\n",
"2 50\nB 758 9290\nS 32139 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 1905\n",
"1 50\nS 82701 10859\n",
"2 5\nB 3 4\nB 0 1\n",
"1 50\nS 79457 10859\n",
"2 5\nB 3 8\nB 0 1\n",
"2 1\nB 3 8\nB 0 1\n",
"1 3\nB 95840 1545\n",
"2 1\nS 2 1\nB 0 1\n",
"3 2\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"2 1\nB 0 110\nS 1 100\n",
"1 50\nB 86960 7726\n",
"1 2\nB 48259 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 5\nB 25 10\n",
"2 2\nB 1 3\nS 10 2\n",
"1 50\nB 79400 11099\n",
"3 3\nB 9182 2660\nS 23924 4895\nS 76276 1905\n",
"1 50\nB 67037 21268\n",
"2 5\nB 3 1\nB 0 1\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 3555\n",
"1 54\nB 67037 16846\n",
"1 50\nS 79457 12568\n",
"2 5\nB 3 13\nB 0 1\n",
"2 1\nB 4 8\nB 0 1\n",
"1 3\nB 57614 1545\n",
"2 1\nB 0 111\nS 1 100\n",
"1 2\nB 21299 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 3\nB 20 5\nB 25 10\n",
"3 3\nB 9182 3215\nS 23924 4895\nS 76276 1905\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 54293 3555\n",
"2 5\nB 3 16\nB 0 1\n",
"2 1\nB 2 8\nB 0 1\n",
"1 3\nB 8504 1545\n",
"1 2\nB 21299 551\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 25 3\nB 20 5\nB 25 10\n",
"2 1\nB 1 3\nS 10 4\n",
"3 3\nB 9182 5044\nS 23924 4895\nS 76276 1905\n",
"1 9\nB 67037 12270\n",
"2 2\nB 0 111\nS 1 110\n",
"2 1\nB 1 3\nS 4 4\n",
"3 3\nB 16671 5044\nS 23924 4895\nS 76276 1905\n",
"2 1\nB 1 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 1905\n",
"1 1\nB 8504 2115\n",
"2 1\nB 2 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 8504 4211\n",
"3 3\nB 5191 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 7534 4211\n",
"1 1\nB 11157 4211\n",
"1 1\nB 11157 7684\n",
"1 1\nB 8680 7684\n",
"1 1\nB 8680 8096\n",
"2 2\nS 1 1\nB 0 1\n",
"2 50\nB 590 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 1\n",
"2 5\nB 3 5\nB 0 1\n",
"1 54\nB 67037 11099\n",
"1 2\nB 95840 991\n",
"1 3\nB 95840 991\n",
"1 6\nB 95840 1545\n",
"1 27\nS 72218 10859\n",
"1 4\nB 95840 991\n",
"2 1\nB 1 3\nS 10 2\n",
"1 9\nB 67037 21268\n",
"1 9\nS 72218 10859\n",
"1 65\nS 79457 12568\n",
"2 2\nB 0 111\nS 1 100\n",
"1 6\nS 72218 10859\n",
"1 2\nB 8504 1545\n",
"1 3\nB 21299 551\n",
"1 1\nB 8504 1545\n",
"1 2\nB 8680 8096\n"
],
"output": [
"S 50 8\nS 40 1\nB 25 10\nB 20 4\n",
"S 1 1\nB 0 2\n",
"S 1 1\nB 0 1\n",
"S 100000 1\nB 0 1\n",
"S 86168 3367\nB 758 9290\n",
"S 10 3\nB 0 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 95992 7257\n",
"S 1 100\nB 0 100\n",
"B 47828 7726\n",
"S 72218 8095\n",
"S 69799 1711\nB 7523 5589\n",
"B 2 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 3\nB 0 3\n",
"B 48259 991\n",
"S 1 1\nB 0 1\n",
"S 61452 3367\nB 758 9290\n",
"S 10 3\nB 1 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 2660\n",
"B 47828 11099\n",
"S 72218 15546\n",
"B 3 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 4\nB 0 3\n",
"B 61409 991\n",
"S 61452 6680\nB 758 9290\n",
"S 76276 1905\nS 60238 4895\nB 9182 2660\n",
"B 67037 11099\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 32139 6680\nB 758 9290\n",
"S 73783 1905\nS 60238 4895\nB 9182 2660\n",
"S 82701 10859\n",
"B 3 4\nB 0 1\n",
"S 79457 10859\n",
"B 3 8\nB 0 1\n",
"B 3 8\n",
"B 95840 1545\n",
"S 2 1\nB 0 1\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 1 100\nB 0 110\n",
"B 86960 7726\n",
"B 48259 991\n",
"S 50 8\nS 40 1\nB 25 10\nB 20 5\n",
"S 10 2\nB 1 3\n",
"B 79400 11099\n",
"S 76276 1905\nS 23924 4895\nB 9182 2660\n",
"B 67037 21268\n",
"B 3 1\nB 0 1\n",
"S 73783 3555\nS 60238 4895\nB 9182 2660\n",
"B 67037 16846\n",
"S 79457 12568\n",
"B 3 13\nB 0 1\n",
"B 4 8\n",
"B 57614 1545\n",
"S 1 100\nB 0 111\n",
"B 21299 991\n",
"S 50 5\nS 40 1\nB 25 10\nB 20 5\n",
"S 76276 1905\nS 23924 4895\nB 9182 3215\n",
"S 60238 4895\nS 54293 3555\nB 9182 2660\n",
"B 3 16\nB 0 1\n",
"B 2 8\n",
"B 8504 1545\n",
"B 21299 551\n",
"S 40 1\nS 25 3\nB 25 10\nB 20 5\n",
"S 10 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 9182 5044\n",
"B 67037 12270\n",
"S 1 110\nB 0 111\n",
"S 4 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 16671 5044\n",
"S 4 4\nB 1 4\n",
"S 76276 1905\nS 23924 4895\nB 16671 5006\n",
"B 8504 2115\n",
"S 4 4\nB 2 4\n",
"S 76276 3800\nS 23924 4895\nB 16671 5006\n",
"B 8504 4211\n",
"S 76276 3800\nS 23924 4895\nB 5191 5006\n",
"B 7534 4211\n",
"B 11157 4211\n",
"B 11157 7684\n",
"B 8680 7684\n",
"B 8680 8096\n",
"S 1 1\nB 0 1\n",
"S 86168 3367\nB 590 9290\n",
"S 10 1\nB 0 3\n",
"B 3 5\nB 0 1\n",
"B 67037 11099\n",
"B 95840 991\n",
"B 95840 991\n",
"B 95840 1545\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 10 2\nB 1 3\n",
"B 67037 21268\n",
"S 72218 10859\n",
"S 79457 12568\n",
"S 1 100\nB 0 111\n",
"S 72218 10859\n",
"B 8504 1545\n",
"B 21299 551\n",
"B 8504 1545\n",
"B 8680 8096\n"
]
} | 2CODEFORCES
|
572_B. Order Book_37976 | In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy or sell, and integer qi. This means that the participant is ready to buy or sell qi stocks at price pi for one stock. A value qi is also known as a volume of an order.
All orders with the same price p and direction d are merged into one aggregated order with price p and direction d. The volume of such order is a sum of volumes of the initial orders.
An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.
An order book of depth s contains s best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than s aggregated orders for some direction then all of them will be in the final order book.
You are given n stock exhange orders. Your task is to print order book of depth s for these orders.
Input
The input starts with two positive integers n and s (1 ≤ n ≤ 1000, 1 ≤ s ≤ 50), the number of orders and the book depth.
Next n lines contains a letter di (either 'B' or 'S'), an integer pi (0 ≤ pi ≤ 105) and an integer qi (1 ≤ qi ≤ 104) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order.
Output
Print no more than 2s lines with aggregated orders from order book of depth s. The output format for orders should be the same as in input.
Examples
Input
6 2
B 10 3
S 50 2
S 40 1
S 50 6
B 20 4
B 25 10
Output
S 50 8
S 40 1
B 25 10
B 20 4
Note
Denote (x, y) an order with price x and volume y. There are 3 aggregated buy orders (10, 3), (20, 4), (25, 10) and two sell orders (50, 8), (40, 1) in the sample.
You need to print no more than two best orders for each direction, so you shouldn't print the order (10 3) having the worst price among buy orders. | n,s = [int(x) for x in input().split()]
buy_dict = {}
sell_dict = {}
for i in range(n):
chtype,pi,di = input().split()
pi = int(pi)
di = int(di)
if chtype=='B':
buy_dict[pi] = buy_dict.get(pi,0)+di
else:
sell_dict[pi] = sell_dict.get(pi,0)+di
buy_list = sorted(buy_dict.items(),reverse=True)[:s]
sell_list = reversed(sorted(sell_dict.items())[:s])
for pi,qi in sell_list:
print('S',pi,qi)
for pi,qi in buy_list:
print('B',pi,qi)
| 3Python3
| {
"input": [
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 4\nB 25 10\n",
"2 2\nS 1 1\nB 0 2\n",
"2 1\nS 1 1\nB 0 1\n",
"2 10\nB 0 1\nS 100000 1\n",
"2 50\nB 758 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 3\n",
"3 3\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"1 1\nS 95992 7257\n",
"2 1\nB 0 100\nS 1 100\n",
"1 50\nB 47828 7726\n",
"1 50\nS 72218 8095\n",
"2 1\nB 7523 5589\nS 69799 1711\n",
"2 50\nB 2 5\nB 0 1\n",
"2 1\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 1\nB 0 1\nB 0 1\n",
"1 1\nB 48259 991\n",
"2 10\nB 0 1\nS 1 1\n",
"2 50\nB 758 9290\nS 61452 3367\n",
"2 2\nB 1 3\nS 10 3\n",
"3 3\nB 5878 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 47828 11099\n",
"1 50\nS 72218 15546\n",
"2 50\nB 3 5\nB 0 1\n",
"2 2\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 2\nB 0 1\nB 0 1\n",
"1 1\nB 61409 991\n",
"2 50\nB 758 9290\nS 61452 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 67037 11099\n",
"1 50\nS 72218 10859\n",
"1 1\nB 95840 991\n",
"2 50\nB 758 9290\nS 32139 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 1905\n",
"1 50\nS 82701 10859\n",
"2 5\nB 3 4\nB 0 1\n",
"1 50\nS 79457 10859\n",
"2 5\nB 3 8\nB 0 1\n",
"2 1\nB 3 8\nB 0 1\n",
"1 3\nB 95840 1545\n",
"2 1\nS 2 1\nB 0 1\n",
"3 2\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"2 1\nB 0 110\nS 1 100\n",
"1 50\nB 86960 7726\n",
"1 2\nB 48259 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 5\nB 25 10\n",
"2 2\nB 1 3\nS 10 2\n",
"1 50\nB 79400 11099\n",
"3 3\nB 9182 2660\nS 23924 4895\nS 76276 1905\n",
"1 50\nB 67037 21268\n",
"2 5\nB 3 1\nB 0 1\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 3555\n",
"1 54\nB 67037 16846\n",
"1 50\nS 79457 12568\n",
"2 5\nB 3 13\nB 0 1\n",
"2 1\nB 4 8\nB 0 1\n",
"1 3\nB 57614 1545\n",
"2 1\nB 0 111\nS 1 100\n",
"1 2\nB 21299 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 3\nB 20 5\nB 25 10\n",
"3 3\nB 9182 3215\nS 23924 4895\nS 76276 1905\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 54293 3555\n",
"2 5\nB 3 16\nB 0 1\n",
"2 1\nB 2 8\nB 0 1\n",
"1 3\nB 8504 1545\n",
"1 2\nB 21299 551\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 25 3\nB 20 5\nB 25 10\n",
"2 1\nB 1 3\nS 10 4\n",
"3 3\nB 9182 5044\nS 23924 4895\nS 76276 1905\n",
"1 9\nB 67037 12270\n",
"2 2\nB 0 111\nS 1 110\n",
"2 1\nB 1 3\nS 4 4\n",
"3 3\nB 16671 5044\nS 23924 4895\nS 76276 1905\n",
"2 1\nB 1 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 1905\n",
"1 1\nB 8504 2115\n",
"2 1\nB 2 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 8504 4211\n",
"3 3\nB 5191 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 7534 4211\n",
"1 1\nB 11157 4211\n",
"1 1\nB 11157 7684\n",
"1 1\nB 8680 7684\n",
"1 1\nB 8680 8096\n",
"2 2\nS 1 1\nB 0 1\n",
"2 50\nB 590 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 1\n",
"2 5\nB 3 5\nB 0 1\n",
"1 54\nB 67037 11099\n",
"1 2\nB 95840 991\n",
"1 3\nB 95840 991\n",
"1 6\nB 95840 1545\n",
"1 27\nS 72218 10859\n",
"1 4\nB 95840 991\n",
"2 1\nB 1 3\nS 10 2\n",
"1 9\nB 67037 21268\n",
"1 9\nS 72218 10859\n",
"1 65\nS 79457 12568\n",
"2 2\nB 0 111\nS 1 100\n",
"1 6\nS 72218 10859\n",
"1 2\nB 8504 1545\n",
"1 3\nB 21299 551\n",
"1 1\nB 8504 1545\n",
"1 2\nB 8680 8096\n"
],
"output": [
"S 50 8\nS 40 1\nB 25 10\nB 20 4\n",
"S 1 1\nB 0 2\n",
"S 1 1\nB 0 1\n",
"S 100000 1\nB 0 1\n",
"S 86168 3367\nB 758 9290\n",
"S 10 3\nB 0 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 95992 7257\n",
"S 1 100\nB 0 100\n",
"B 47828 7726\n",
"S 72218 8095\n",
"S 69799 1711\nB 7523 5589\n",
"B 2 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 3\nB 0 3\n",
"B 48259 991\n",
"S 1 1\nB 0 1\n",
"S 61452 3367\nB 758 9290\n",
"S 10 3\nB 1 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 2660\n",
"B 47828 11099\n",
"S 72218 15546\n",
"B 3 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 4\nB 0 3\n",
"B 61409 991\n",
"S 61452 6680\nB 758 9290\n",
"S 76276 1905\nS 60238 4895\nB 9182 2660\n",
"B 67037 11099\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 32139 6680\nB 758 9290\n",
"S 73783 1905\nS 60238 4895\nB 9182 2660\n",
"S 82701 10859\n",
"B 3 4\nB 0 1\n",
"S 79457 10859\n",
"B 3 8\nB 0 1\n",
"B 3 8\n",
"B 95840 1545\n",
"S 2 1\nB 0 1\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 1 100\nB 0 110\n",
"B 86960 7726\n",
"B 48259 991\n",
"S 50 8\nS 40 1\nB 25 10\nB 20 5\n",
"S 10 2\nB 1 3\n",
"B 79400 11099\n",
"S 76276 1905\nS 23924 4895\nB 9182 2660\n",
"B 67037 21268\n",
"B 3 1\nB 0 1\n",
"S 73783 3555\nS 60238 4895\nB 9182 2660\n",
"B 67037 16846\n",
"S 79457 12568\n",
"B 3 13\nB 0 1\n",
"B 4 8\n",
"B 57614 1545\n",
"S 1 100\nB 0 111\n",
"B 21299 991\n",
"S 50 5\nS 40 1\nB 25 10\nB 20 5\n",
"S 76276 1905\nS 23924 4895\nB 9182 3215\n",
"S 60238 4895\nS 54293 3555\nB 9182 2660\n",
"B 3 16\nB 0 1\n",
"B 2 8\n",
"B 8504 1545\n",
"B 21299 551\n",
"S 40 1\nS 25 3\nB 25 10\nB 20 5\n",
"S 10 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 9182 5044\n",
"B 67037 12270\n",
"S 1 110\nB 0 111\n",
"S 4 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 16671 5044\n",
"S 4 4\nB 1 4\n",
"S 76276 1905\nS 23924 4895\nB 16671 5006\n",
"B 8504 2115\n",
"S 4 4\nB 2 4\n",
"S 76276 3800\nS 23924 4895\nB 16671 5006\n",
"B 8504 4211\n",
"S 76276 3800\nS 23924 4895\nB 5191 5006\n",
"B 7534 4211\n",
"B 11157 4211\n",
"B 11157 7684\n",
"B 8680 7684\n",
"B 8680 8096\n",
"S 1 1\nB 0 1\n",
"S 86168 3367\nB 590 9290\n",
"S 10 1\nB 0 3\n",
"B 3 5\nB 0 1\n",
"B 67037 11099\n",
"B 95840 991\n",
"B 95840 991\n",
"B 95840 1545\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 10 2\nB 1 3\n",
"B 67037 21268\n",
"S 72218 10859\n",
"S 79457 12568\n",
"S 1 100\nB 0 111\n",
"S 72218 10859\n",
"B 8504 1545\n",
"B 21299 551\n",
"B 8504 1545\n",
"B 8680 8096\n"
]
} | 2CODEFORCES
|
572_B. Order Book_37977 | In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy or sell, and integer qi. This means that the participant is ready to buy or sell qi stocks at price pi for one stock. A value qi is also known as a volume of an order.
All orders with the same price p and direction d are merged into one aggregated order with price p and direction d. The volume of such order is a sum of volumes of the initial orders.
An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.
An order book of depth s contains s best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than s aggregated orders for some direction then all of them will be in the final order book.
You are given n stock exhange orders. Your task is to print order book of depth s for these orders.
Input
The input starts with two positive integers n and s (1 ≤ n ≤ 1000, 1 ≤ s ≤ 50), the number of orders and the book depth.
Next n lines contains a letter di (either 'B' or 'S'), an integer pi (0 ≤ pi ≤ 105) and an integer qi (1 ≤ qi ≤ 104) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order.
Output
Print no more than 2s lines with aggregated orders from order book of depth s. The output format for orders should be the same as in input.
Examples
Input
6 2
B 10 3
S 50 2
S 40 1
S 50 6
B 20 4
B 25 10
Output
S 50 8
S 40 1
B 25 10
B 20 4
Note
Denote (x, y) an order with price x and volume y. There are 3 aggregated buy orders (10, 3), (20, 4), (25, 10) and two sell orders (50, 8), (40, 1) in the sample.
You need to print no more than two best orders for each direction, so you shouldn't print the order (10 3) having the worst price among buy orders. | import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Comparator;
import java.util.Iterator;
import java.util.Map;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.function.Function;
import java.util.function.ToDoubleFunction;
import java.util.function.ToIntFunction;
import java.util.function.ToLongFunction;
public class B
{
public static final Random RANDOM = new Random(System.currentTimeMillis());
private BufferedReader bufferedReader;
private StringTokenizer stringTokenizer;
private PrintWriter out;
public B()
{
this(new BufferedReader(new InputStreamReader(System.in)));
}
public B(BufferedReader bufferedReader)
{
this.bufferedReader = bufferedReader;
this.stringTokenizer = null;
this.out = new PrintWriter(new BufferedOutputStream(System.out));
}
public B(String file) throws FileNotFoundException
{
this(new BufferedReader(new InputStreamReader(new FileInputStream(file))));
}
private String next() throws IOException
{
while ((this.stringTokenizer == null) || (!this.stringTokenizer.hasMoreTokens()))
{
this.stringTokenizer = new StringTokenizer(this.bufferedReader.readLine());
}
return stringTokenizer.nextToken();
}
public int nextInt() throws IOException
{
return Integer.parseInt(next());
}
public double nextDouble() throws IOException
{
return Double.parseDouble(next());
}
public long nextLong() throws IOException
{
return Long.parseLong(next());
}
public char nextChar() throws IOException
{
return (char) bufferedReader.read();
}
public String nextLine() throws IOException
{
return this.bufferedReader.readLine();
}
public void close()
{
out.close();
}
public static void main(String[] args)
{
B template = new B();
try
{
template.solve();
}
catch (IOException exception)
{
exception.printStackTrace();
}
template.close();
}
public void solve() throws IOException
{
int n = nextInt();
int s = nextInt();
boolean[] d = new boolean[n];
int[] p = new int[n];
int[] q = new int[n];
for (int index = 0; index < n; index++)
{
d[index] = nextChar() == 'B';
p[index] = nextInt();
q[index] = nextInt();
}
Map<Integer, Integer> buy = new TreeMap<>(new Comparator<Integer>()
{
@Override
public int compare(Integer a, Integer b)
{
return -a.compareTo(b);
}
});
Map<Integer, Integer> sell = new TreeMap<>(new Comparator<Integer>()
{
@Override
public int compare(Integer a, Integer b)
{
return a.compareTo(b);
}
});
for (int index = 0; index < n; index++)
{
if (d[index])
{
Integer i = buy.get(p[index]);
if (i == null)
{
i = q[index];
}
else
{
i = i.intValue() + q[index];
}
buy.put(p[index], i);
}
else
{
Integer i = sell.get(p[index]);
if (i == null)
{
i = q[index];
}
else
{
i = i.intValue() + q[index];
}
sell.put(p[index], i);
}
}
Map<Integer, Integer> sellBest = new TreeMap<>(new Comparator<Integer>()
{
@Override
public int compare(Integer a, Integer b)
{
return -a.compareTo(b);
}
});
Iterator<Integer> iterator = sell.keySet().iterator();
for (int index = 0; iterator.hasNext() && index < s; index++)
{
Integer key = iterator.next();
sellBest.put(key, sell.get(key));
}
printBook(false, sellBest, s);
printBook(true, buy, s);
}
public void printBook(boolean buy, Map<Integer, Integer> book, int s)
{
Iterator<Integer> iterator = book.keySet().iterator();
for (int index = 0; iterator.hasNext() && index < s; index++)
{
Integer key = iterator.next();
this.out.println((buy ? "B" : "S") + " " + key + " " + book.get(key));
}
}
} | 4JAVA
| {
"input": [
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 4\nB 25 10\n",
"2 2\nS 1 1\nB 0 2\n",
"2 1\nS 1 1\nB 0 1\n",
"2 10\nB 0 1\nS 100000 1\n",
"2 50\nB 758 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 3\n",
"3 3\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"1 1\nS 95992 7257\n",
"2 1\nB 0 100\nS 1 100\n",
"1 50\nB 47828 7726\n",
"1 50\nS 72218 8095\n",
"2 1\nB 7523 5589\nS 69799 1711\n",
"2 50\nB 2 5\nB 0 1\n",
"2 1\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 1\nB 0 1\nB 0 1\n",
"1 1\nB 48259 991\n",
"2 10\nB 0 1\nS 1 1\n",
"2 50\nB 758 9290\nS 61452 3367\n",
"2 2\nB 1 3\nS 10 3\n",
"3 3\nB 5878 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 47828 11099\n",
"1 50\nS 72218 15546\n",
"2 50\nB 3 5\nB 0 1\n",
"2 2\nS 10 1\nB 0 1\n",
"6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 2\nB 0 1\nB 0 1\n",
"1 1\nB 61409 991\n",
"2 50\nB 758 9290\nS 61452 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 76276 1905\n",
"1 50\nB 67037 11099\n",
"1 50\nS 72218 10859\n",
"1 1\nB 95840 991\n",
"2 50\nB 758 9290\nS 32139 6680\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 1905\n",
"1 50\nS 82701 10859\n",
"2 5\nB 3 4\nB 0 1\n",
"1 50\nS 79457 10859\n",
"2 5\nB 3 8\nB 0 1\n",
"2 1\nB 3 8\nB 0 1\n",
"1 3\nB 95840 1545\n",
"2 1\nS 2 1\nB 0 1\n",
"3 2\nB 5878 1568\nS 60238 4895\nS 76276 1905\n",
"2 1\nB 0 110\nS 1 100\n",
"1 50\nB 86960 7726\n",
"1 2\nB 48259 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 5\nB 25 10\n",
"2 2\nB 1 3\nS 10 2\n",
"1 50\nB 79400 11099\n",
"3 3\nB 9182 2660\nS 23924 4895\nS 76276 1905\n",
"1 50\nB 67037 21268\n",
"2 5\nB 3 1\nB 0 1\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 73783 3555\n",
"1 54\nB 67037 16846\n",
"1 50\nS 79457 12568\n",
"2 5\nB 3 13\nB 0 1\n",
"2 1\nB 4 8\nB 0 1\n",
"1 3\nB 57614 1545\n",
"2 1\nB 0 111\nS 1 100\n",
"1 2\nB 21299 991\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 3\nB 20 5\nB 25 10\n",
"3 3\nB 9182 3215\nS 23924 4895\nS 76276 1905\n",
"3 3\nB 9182 2660\nS 60238 4895\nS 54293 3555\n",
"2 5\nB 3 16\nB 0 1\n",
"2 1\nB 2 8\nB 0 1\n",
"1 3\nB 8504 1545\n",
"1 2\nB 21299 551\n",
"6 2\nB 10 3\nS 50 2\nS 40 1\nS 25 3\nB 20 5\nB 25 10\n",
"2 1\nB 1 3\nS 10 4\n",
"3 3\nB 9182 5044\nS 23924 4895\nS 76276 1905\n",
"1 9\nB 67037 12270\n",
"2 2\nB 0 111\nS 1 110\n",
"2 1\nB 1 3\nS 4 4\n",
"3 3\nB 16671 5044\nS 23924 4895\nS 76276 1905\n",
"2 1\nB 1 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 1905\n",
"1 1\nB 8504 2115\n",
"2 1\nB 2 4\nS 4 4\n",
"3 3\nB 16671 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 8504 4211\n",
"3 3\nB 5191 5006\nS 23924 4895\nS 76276 3800\n",
"1 1\nB 7534 4211\n",
"1 1\nB 11157 4211\n",
"1 1\nB 11157 7684\n",
"1 1\nB 8680 7684\n",
"1 1\nB 8680 8096\n",
"2 2\nS 1 1\nB 0 1\n",
"2 50\nB 590 9290\nS 86168 3367\n",
"2 2\nB 0 3\nS 10 1\n",
"2 5\nB 3 5\nB 0 1\n",
"1 54\nB 67037 11099\n",
"1 2\nB 95840 991\n",
"1 3\nB 95840 991\n",
"1 6\nB 95840 1545\n",
"1 27\nS 72218 10859\n",
"1 4\nB 95840 991\n",
"2 1\nB 1 3\nS 10 2\n",
"1 9\nB 67037 21268\n",
"1 9\nS 72218 10859\n",
"1 65\nS 79457 12568\n",
"2 2\nB 0 111\nS 1 100\n",
"1 6\nS 72218 10859\n",
"1 2\nB 8504 1545\n",
"1 3\nB 21299 551\n",
"1 1\nB 8504 1545\n",
"1 2\nB 8680 8096\n"
],
"output": [
"S 50 8\nS 40 1\nB 25 10\nB 20 4\n",
"S 1 1\nB 0 2\n",
"S 1 1\nB 0 1\n",
"S 100000 1\nB 0 1\n",
"S 86168 3367\nB 758 9290\n",
"S 10 3\nB 0 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 95992 7257\n",
"S 1 100\nB 0 100\n",
"B 47828 7726\n",
"S 72218 8095\n",
"S 69799 1711\nB 7523 5589\n",
"B 2 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 3\nB 0 3\n",
"B 48259 991\n",
"S 1 1\nB 0 1\n",
"S 61452 3367\nB 758 9290\n",
"S 10 3\nB 1 3\n",
"S 76276 1905\nS 60238 4895\nB 5878 2660\n",
"B 47828 11099\n",
"S 72218 15546\n",
"B 3 5\nB 0 1\n",
"S 10 1\nB 0 1\n",
"S 1 4\nB 0 3\n",
"B 61409 991\n",
"S 61452 6680\nB 758 9290\n",
"S 76276 1905\nS 60238 4895\nB 9182 2660\n",
"B 67037 11099\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 32139 6680\nB 758 9290\n",
"S 73783 1905\nS 60238 4895\nB 9182 2660\n",
"S 82701 10859\n",
"B 3 4\nB 0 1\n",
"S 79457 10859\n",
"B 3 8\nB 0 1\n",
"B 3 8\n",
"B 95840 1545\n",
"S 2 1\nB 0 1\n",
"S 76276 1905\nS 60238 4895\nB 5878 1568\n",
"S 1 100\nB 0 110\n",
"B 86960 7726\n",
"B 48259 991\n",
"S 50 8\nS 40 1\nB 25 10\nB 20 5\n",
"S 10 2\nB 1 3\n",
"B 79400 11099\n",
"S 76276 1905\nS 23924 4895\nB 9182 2660\n",
"B 67037 21268\n",
"B 3 1\nB 0 1\n",
"S 73783 3555\nS 60238 4895\nB 9182 2660\n",
"B 67037 16846\n",
"S 79457 12568\n",
"B 3 13\nB 0 1\n",
"B 4 8\n",
"B 57614 1545\n",
"S 1 100\nB 0 111\n",
"B 21299 991\n",
"S 50 5\nS 40 1\nB 25 10\nB 20 5\n",
"S 76276 1905\nS 23924 4895\nB 9182 3215\n",
"S 60238 4895\nS 54293 3555\nB 9182 2660\n",
"B 3 16\nB 0 1\n",
"B 2 8\n",
"B 8504 1545\n",
"B 21299 551\n",
"S 40 1\nS 25 3\nB 25 10\nB 20 5\n",
"S 10 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 9182 5044\n",
"B 67037 12270\n",
"S 1 110\nB 0 111\n",
"S 4 4\nB 1 3\n",
"S 76276 1905\nS 23924 4895\nB 16671 5044\n",
"S 4 4\nB 1 4\n",
"S 76276 1905\nS 23924 4895\nB 16671 5006\n",
"B 8504 2115\n",
"S 4 4\nB 2 4\n",
"S 76276 3800\nS 23924 4895\nB 16671 5006\n",
"B 8504 4211\n",
"S 76276 3800\nS 23924 4895\nB 5191 5006\n",
"B 7534 4211\n",
"B 11157 4211\n",
"B 11157 7684\n",
"B 8680 7684\n",
"B 8680 8096\n",
"S 1 1\nB 0 1\n",
"S 86168 3367\nB 590 9290\n",
"S 10 1\nB 0 3\n",
"B 3 5\nB 0 1\n",
"B 67037 11099\n",
"B 95840 991\n",
"B 95840 991\n",
"B 95840 1545\n",
"S 72218 10859\n",
"B 95840 991\n",
"S 10 2\nB 1 3\n",
"B 67037 21268\n",
"S 72218 10859\n",
"S 79457 12568\n",
"S 1 100\nB 0 111\n",
"S 72218 10859\n",
"B 8504 1545\n",
"B 21299 551\n",
"B 8504 1545\n",
"B 8680 8096\n"
]
} | 2CODEFORCES
|
593_E. Strange Calculation and Cats_37978 | Gosha's universe is a table consisting of n rows and m columns. Both the rows and columns are numbered with consecutive integers starting with 1. We will use (r, c) to denote a cell located in the row r and column c.
Gosha is often invited somewhere. Every time he gets an invitation, he first calculates the number of ways to get to this place, and only then he goes. Gosha's house is located in the cell (1, 1).
At any moment of time, Gosha moves from the cell he is currently located in to a cell adjacent to it (two cells are adjacent if they share a common side). Of course, the movement is possible only if such a cell exists, i.e. Gosha will not go beyond the boundaries of the table. Thus, from the cell (r, c) he is able to make a move to one of the cells (r - 1, c), (r, c - 1), (r + 1, c), (r, c + 1). Also, Ghosha can skip a move and stay in the current cell (r, c).
Besides the love of strange calculations, Gosha is allergic to cats, so he never goes to the cell that has a cat in it. Gosha knows exactly where and when he will be invited and the schedule of cats travelling along the table. Formally, he has q records, the i-th of them has one of the following forms:
* 1, xi, yi, ti — Gosha is invited to come to cell (xi, yi) at the moment of time ti. It is guaranteed that there is no cat inside cell (xi, yi) at this moment of time.
* 2, xi, yi, ti — at the moment ti a cat appears in cell (xi, yi). It is guaranteed that no other cat is located in this cell (xi, yi) at that moment of time.
* 3, xi, yi, ti — at the moment ti a cat leaves cell (xi, yi). It is guaranteed that there is cat located in the cell (xi, yi).
Gosha plans to accept only one invitation, but he has not yet decided, which particular one. In order to make this decision, he asks you to calculate for each of the invitations i the number of ways to get to the cell (xi, yi) at the moment ti. For every invitation, assume that Gosha he starts moving from cell (1, 1) at the moment 1.
Moving between two neighboring cells takes Gosha exactly one unit of tim. In particular, this means that Gosha can come into the cell only if a cat sitting in it leaves the moment when Gosha begins his movement from the neighboring cell, and if none of the cats comes to the cell at the time when Gosha is in it.
Two ways to go from cell (1, 1) to cell (x, y) at time t are considered distinct if for at least one moment of time from 1 to t Gosha's positions are distinct for the two ways at this moment. Note, that during this travel Gosha is allowed to visit both (1, 1) and (x, y) multiple times. Since the number of ways can be quite large, print it modulo 109 + 7.
Input
The first line of the input contains three positive integers n, m and q (1 ≤ n·m ≤ 20, 1 ≤ q ≤ 10 000) — the number of rows and columns in the table and the number of events respectively.
Next q lines describe the events, each description contains four integers tpi, xi, yi and ti (1 ≤ tp ≤ 3, 1 ≤ x ≤ n, 1 ≤ y ≤ m, 2 ≤ t ≤ 109) — the type of the event (1 if Gosha gets an invitation, 2 if a cat comes to the cell and 3 if a cat leaves the cell), the coordinates of the cell where the action takes place and the moment of time at which the action takes place respectively.
It is guaranteed that the queries are given in the chronological order, i.e. ti < ti + 1.
Output
For each invitation i (that is, tpi = 1) calculate the number of ways to get to cell (xi, yi) at the moment of time ti. Respond to the invitations chronologically, that is, in the order they appear in the input.
Examples
Input
1 3 3
2 1 2 3
3 1 2 5
1 1 1 7
Output
5
Input
3 3 3
2 2 2 2
1 3 3 5
1 3 3 7
Output
2
42
Input
4 5 5
2 2 5 3
2 2 4 6
3 2 4 9
1 4 4 13
1 4 4 15
Output
490902
10598759
Note
Explanation of the first sample. Each picture specifies the number of ways to arrive at the cell at the appropriate time. (X stands for a cell blocked at this particular moment of time)
<image> Time moment 1. <image> Time moment 2. <image> Time moment 3. <image> Time moment 4. <image> Time moment 5. <image> Time moment 6. <image> Time moment 7. | #include <bits/stdc++.h>
using namespace std;
const int N = 22;
int n, m, q, last, vi[N][N];
int dx[5] = {0, -1, 1, 0, 0};
int dy[5] = {0, 0, 0, -1, 1};
inline void add(int &a, int b) {
a = ((a + b >= 1000000007) ? a + b - 1000000007 : a + b);
}
inline void del(int &a, int b) {
a = ((a - b < 0) ? a - b + 1000000007 : a - b);
}
inline void mul(int &a, int b) { a = 1ll * a * b % 1000000007; }
inline int id(int x, int y) { return (x - 1) * m + y; }
inline int read() {
int f = 1, x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = x * 10 + s - '0';
s = getchar();
}
return x * f;
}
struct matrix {
int n, a[N][N];
inline void clear() { memset(a, 0, sizeof(a)); }
inline void init() {
for (int i = 1; i <= n; i++) a[i][i] = 1;
}
inline void print() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
printf("\n");
}
}
} f;
matrix tr;
matrix operator*(matrix a, matrix b) {
matrix ans;
ans.n = a.n;
ans.clear();
for (int i = 1; i <= a.n; i++) {
for (int k = 1; k <= a.n; k++) {
for (int j = 1; j <= a.n; j++)
add(ans.a[i][j], 1ll * a.a[i][k] * b.a[k][j] % 1000000007);
}
}
return ans;
}
matrix m_pow(matrix a, int b) {
matrix ans;
ans.n = a.n;
ans.clear();
ans.init();
while (b) {
if (b & 1) ans = ans * a;
b >>= 1;
a = a * a;
}
return ans;
}
inline void get() {
tr.clear();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (vi[i][j]) continue;
tr.a[id(i, j)][id(i, j)] = 1;
for (int k = 1; k <= 4; k++) {
int x = i + dx[k], y = j + dy[k];
if (x <= 0 || y <= 0 || x > n || y > m || vi[x][y]) continue;
tr.a[id(i, j)][id(x, y)] = 1;
}
}
}
}
signed main() {
n = read();
m = read();
q = read();
last = 1;
f.n = tr.n = n * m;
f.a[1][1] = 1;
get();
while (q--) {
int op = read(), x = read(), y = read(), t = read();
f = f * m_pow(tr, t - last);
last = t;
if (op == 2) vi[x][y] = 1;
if (op == 3) vi[x][y] = 0;
if (op == 1) printf("%d\n", f.a[1][id(x, y)]);
get();
}
}
| 2C++
| {
"input": [
"3 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7\n",
"4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15\n",
"1 3 3\n2 1 2 3\n3 1 2 5\n1 1 1 7\n",
"1 20 2\n1 1 20 100000001\n1 1 20 1000000000\n",
"2 2 5\n2 1 1 8\n3 1 1 12345\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"3 3 1\n1 3 3 5\n",
"1 1 1\n1 1 1 2\n",
"1 20 10\n1 1 4 200\n1 1 11 278\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 300\n",
"20 1 10\n2 8 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 1 299\n2 19 1 300\n",
"2 2 3\n2 1 1 2\n1 2 2 3\n1 2 2 5\n",
"1 1 4\n2 1 1 2\n3 1 1 5\n1 1 1 7\n1 1 1 10\n",
"2 2 10\n1 2 2 185\n1 2 2 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300\n",
"1 1 10\n2 1 1 227\n3 1 1 238\n2 1 1 286\n3 1 1 292\n2 1 1 295\n3 1 1 296\n1 1 1 297\n2 1 1 298\n3 1 1 299\n1 1 1 300\n",
"1 2 3\n1 1 1 2\n1 1 2 5\n1 1 1 19\n",
"3 3 1\n1 3 3 2\n",
"2 2 10\n1 2 2 185\n1 2 1 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300\n",
"1 2 3\n1 1 2 2\n1 1 2 5\n1 1 1 19\n",
"4 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7\n",
"4 5 5\n2 1 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15\n",
"1 20 2\n1 1 20 100100001\n1 1 20 1000000000\n",
"2 2 5\n2 1 1 8\n3 1 1 1621\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"1 20 10\n1 1 4 200\n1 1 11 278\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 327\n",
"3 3 1\n1 2 3 4\n",
"2 2 5\n2 1 1 8\n3 1 1 587\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"1 20 10\n1 1 4 200\n1 1 11 257\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 327\n",
"4 3 3\n2 2 2 3\n1 3 3 5\n1 3 2 7\n",
"3 3 1\n1 3 3 8\n",
"20 1 10\n2 9 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 1 299\n2 19 1 300\n",
"2 2 3\n2 1 1 2\n1 2 2 3\n2 2 2 5\n",
"3 3 3\n2 2 2 3\n1 3 3 5\n1 3 3 7\n",
"1 3 3\n2 1 2 3\n3 1 2 4\n1 1 1 7\n",
"2 2 5\n2 1 1 8\n3 1 1 1621\n2 1 2 22345\n3 1 2 47490\n1 2 2 111115\n",
"3 5 1\n1 2 4 5\n",
"2 2 5\n2 1 1 8\n3 1 1 2839\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"20 1 10\n2 8 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 0 299\n2 19 1 300\n",
"4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 3 13\n1 4 4 15\n",
"3 2 10\n1 2 2 185\n1 2 1 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300\n",
"1 2 3\n1 1 2 2\n2 1 2 5\n1 1 1 19\n",
"4 3 3\n2 4 2 3\n1 3 3 5\n1 3 3 7\n",
"3 3 3\n2 2 3 3\n1 3 3 5\n1 3 3 7\n",
"2 2 5\n2 1 1 16\n3 1 1 1621\n2 1 2 22345\n3 1 2 47490\n1 2 2 111115\n",
"3 3 3\n2 2 1 3\n1 3 3 5\n1 3 3 7\n",
"2 3 5\n2 1 1 8\n3 1 1 12345\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"3 2 3\n2 1 1 2\n1 2 2 3\n1 2 2 5\n",
"3 3 1\n1 3 3 4\n",
"4 3 3\n2 2 2 3\n1 3 3 5\n1 3 3 7\n",
"3 3 1\n1 3 1 4\n",
"3 5 1\n1 2 3 4\n",
"3 5 1\n1 3 1 4\n",
"3 5 1\n1 2 4 4\n",
"3 3 1\n1 3 1 2\n",
"3 3 1\n1 3 2 4\n",
"3 3 1\n1 1 3 4\n",
"3 5 1\n1 2 3 3\n",
"3 5 1\n1 3 2 4\n",
"3 2 1\n1 3 1 2\n",
"3 3 1\n1 1 3 2\n",
"3 5 1\n1 2 5 3\n",
"1 3 1\n1 1 3 2\n"
],
"output": [
"2\n42\n",
"490902\n10598759\n",
"5\n",
"452548876\n224409846\n",
"703708091\n",
"6\n",
"1\n",
"272600817\n593383272\n555850892\n746491153\n78394828\n",
"26508505\n16907334\n673189879\n",
"2\n10\n",
"0\n0\n",
"990123599\n781690482\n617361700\n",
"0\n0\n",
"1\n8\n131072\n",
"0\n",
"990123599\n781690482\n617361700\n",
"1\n8\n131072\n",
"2\n49\n",
"493504\n10848642\n",
"592377496\n224409846\n",
"882163172\n",
"272600817\n593383272\n555850892\n746491153\n78394828\n",
"3\n",
"755569789\n",
"272600817\n80864048\n555850892\n746491153\n78394828\n",
"2\n74\n",
"630\n",
"121509061\n371860349\n6219080\n",
"2\n",
"2\n42\n",
"11\n",
"222123772\n",
"4\n",
"49125548\n",
"26508505\n16907334\n673189879\n",
"811964\n10598759\n",
"975963957\n722234318\n302837820\n",
"1\n8\n",
"6\n157\n",
"3\n69\n",
"441698033\n",
"6\n108\n",
"401181578\n",
"2\n14\n",
"0\n",
"2\n49\n",
"3\n",
"3\n",
"3\n",
"0\n",
"0\n",
"3\n",
"3\n",
"0\n",
"3\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
593_E. Strange Calculation and Cats_37979 | Gosha's universe is a table consisting of n rows and m columns. Both the rows and columns are numbered with consecutive integers starting with 1. We will use (r, c) to denote a cell located in the row r and column c.
Gosha is often invited somewhere. Every time he gets an invitation, he first calculates the number of ways to get to this place, and only then he goes. Gosha's house is located in the cell (1, 1).
At any moment of time, Gosha moves from the cell he is currently located in to a cell adjacent to it (two cells are adjacent if they share a common side). Of course, the movement is possible only if such a cell exists, i.e. Gosha will not go beyond the boundaries of the table. Thus, from the cell (r, c) he is able to make a move to one of the cells (r - 1, c), (r, c - 1), (r + 1, c), (r, c + 1). Also, Ghosha can skip a move and stay in the current cell (r, c).
Besides the love of strange calculations, Gosha is allergic to cats, so he never goes to the cell that has a cat in it. Gosha knows exactly where and when he will be invited and the schedule of cats travelling along the table. Formally, he has q records, the i-th of them has one of the following forms:
* 1, xi, yi, ti — Gosha is invited to come to cell (xi, yi) at the moment of time ti. It is guaranteed that there is no cat inside cell (xi, yi) at this moment of time.
* 2, xi, yi, ti — at the moment ti a cat appears in cell (xi, yi). It is guaranteed that no other cat is located in this cell (xi, yi) at that moment of time.
* 3, xi, yi, ti — at the moment ti a cat leaves cell (xi, yi). It is guaranteed that there is cat located in the cell (xi, yi).
Gosha plans to accept only one invitation, but he has not yet decided, which particular one. In order to make this decision, he asks you to calculate for each of the invitations i the number of ways to get to the cell (xi, yi) at the moment ti. For every invitation, assume that Gosha he starts moving from cell (1, 1) at the moment 1.
Moving between two neighboring cells takes Gosha exactly one unit of tim. In particular, this means that Gosha can come into the cell only if a cat sitting in it leaves the moment when Gosha begins his movement from the neighboring cell, and if none of the cats comes to the cell at the time when Gosha is in it.
Two ways to go from cell (1, 1) to cell (x, y) at time t are considered distinct if for at least one moment of time from 1 to t Gosha's positions are distinct for the two ways at this moment. Note, that during this travel Gosha is allowed to visit both (1, 1) and (x, y) multiple times. Since the number of ways can be quite large, print it modulo 109 + 7.
Input
The first line of the input contains three positive integers n, m and q (1 ≤ n·m ≤ 20, 1 ≤ q ≤ 10 000) — the number of rows and columns in the table and the number of events respectively.
Next q lines describe the events, each description contains four integers tpi, xi, yi and ti (1 ≤ tp ≤ 3, 1 ≤ x ≤ n, 1 ≤ y ≤ m, 2 ≤ t ≤ 109) — the type of the event (1 if Gosha gets an invitation, 2 if a cat comes to the cell and 3 if a cat leaves the cell), the coordinates of the cell where the action takes place and the moment of time at which the action takes place respectively.
It is guaranteed that the queries are given in the chronological order, i.e. ti < ti + 1.
Output
For each invitation i (that is, tpi = 1) calculate the number of ways to get to cell (xi, yi) at the moment of time ti. Respond to the invitations chronologically, that is, in the order they appear in the input.
Examples
Input
1 3 3
2 1 2 3
3 1 2 5
1 1 1 7
Output
5
Input
3 3 3
2 2 2 2
1 3 3 5
1 3 3 7
Output
2
42
Input
4 5 5
2 2 5 3
2 2 4 6
3 2 4 9
1 4 4 13
1 4 4 15
Output
490902
10598759
Note
Explanation of the first sample. Each picture specifies the number of ways to arrive at the cell at the appropriate time. (X stands for a cell blocked at this particular moment of time)
<image> Time moment 1. <image> Time moment 2. <image> Time moment 3. <image> Time moment 4. <image> Time moment 5. <image> Time moment 6. <image> Time moment 7. | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
TaskE solver = new TaskE();
solver.solve(1, in, out);
out.close();
}
static class TaskE {
private final int Mod = (int) 1e9 + 7;
final int[] dx = new int[]{0, 0, -1, 0, 1};
final int[] dy = new int[]{0, -1, 0, 1, 0};
public void solve(int testNumber, InputReader in, PrintWriter out) {
int n = in.nextInt(), m = in.nextInt(), q = in.nextInt();
int k = n * m;
int[] ways = new int[k];
ways[0] = 1;
int[][] cats = new int[n][m];
int last = 1;
while (q-- > 0) {
int type = in.nextInt();
int x = in.nextInt() - 1;
int y = in.nextInt() - 1;
int t = in.nextInt();
int[][] routes = specificMatrix(cats);
int time = t - last;
int[][] nways = identity(k);
while (time > 0) {
if ((time & 1) != 0) nways = mul(nways, routes);
routes = mul(routes, routes);
time /= 2;
}
int[] cways = new int[k];
for (int i = 0; i < k; ++i)
for (int j = 0; j < k; ++j)
cways[j] = (int) ((cways[j] +
(long) ways[i] * nways[i][j]) % Mod);
ways = cways;
switch (type) {
case 1:
out.println(ways[x * m + y]);
break;
case 2:
cats[x][y]++;
break;
case 3:
cats[x][y]--;
break;
}
last = t;
}
}
private int[][] mul(int[][] a, int[][] b) {
int n = a.length;
int[][] c = new int[n][n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
for (int k = 0; k < n; ++k)
c[i][j] = (int) ((c[i][j] +
(long) a[i][k] * b[k][j]) % Mod);
return c;
}
private int[][] identity(int n) {
int[][] result = new int[n][n];
for (int i = 0; i < n; ++i) result[i][i] = 1;
return result;
}
private int[][] specificMatrix(int[][] a) {
int n = a.length, m = a[0].length;
int k = n * m;
int[][] result = new int[k][k];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
int code1 = i * m + j;
if (a[i][j] != 0) continue;
for (int p = 0; p < 5; ++p) {
int ni = i + dx[p], nj = j + dy[p];
int code2 = ni * m + nj;
if (ni < 0 || ni >= n || nj < 0 || nj >= m) continue;
if (a[ni][nj] == 0) result[code1][code2] = 1;
}
}
}
return result;
}
}
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1)
throw new UnknownError();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new UnknownError();
}
if (numChars <= 0)
return -1;
}
return buf[curChar++];
}
public int nextInt() {
return Integer.parseInt(next());
}
public String next() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuffer res = new StringBuffer();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
private boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
}
}
| 4JAVA
| {
"input": [
"3 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7\n",
"4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15\n",
"1 3 3\n2 1 2 3\n3 1 2 5\n1 1 1 7\n",
"1 20 2\n1 1 20 100000001\n1 1 20 1000000000\n",
"2 2 5\n2 1 1 8\n3 1 1 12345\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"3 3 1\n1 3 3 5\n",
"1 1 1\n1 1 1 2\n",
"1 20 10\n1 1 4 200\n1 1 11 278\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 300\n",
"20 1 10\n2 8 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 1 299\n2 19 1 300\n",
"2 2 3\n2 1 1 2\n1 2 2 3\n1 2 2 5\n",
"1 1 4\n2 1 1 2\n3 1 1 5\n1 1 1 7\n1 1 1 10\n",
"2 2 10\n1 2 2 185\n1 2 2 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300\n",
"1 1 10\n2 1 1 227\n3 1 1 238\n2 1 1 286\n3 1 1 292\n2 1 1 295\n3 1 1 296\n1 1 1 297\n2 1 1 298\n3 1 1 299\n1 1 1 300\n",
"1 2 3\n1 1 1 2\n1 1 2 5\n1 1 1 19\n",
"3 3 1\n1 3 3 2\n",
"2 2 10\n1 2 2 185\n1 2 1 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300\n",
"1 2 3\n1 1 2 2\n1 1 2 5\n1 1 1 19\n",
"4 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7\n",
"4 5 5\n2 1 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15\n",
"1 20 2\n1 1 20 100100001\n1 1 20 1000000000\n",
"2 2 5\n2 1 1 8\n3 1 1 1621\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"1 20 10\n1 1 4 200\n1 1 11 278\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 327\n",
"3 3 1\n1 2 3 4\n",
"2 2 5\n2 1 1 8\n3 1 1 587\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"1 20 10\n1 1 4 200\n1 1 11 257\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 327\n",
"4 3 3\n2 2 2 3\n1 3 3 5\n1 3 2 7\n",
"3 3 1\n1 3 3 8\n",
"20 1 10\n2 9 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 1 299\n2 19 1 300\n",
"2 2 3\n2 1 1 2\n1 2 2 3\n2 2 2 5\n",
"3 3 3\n2 2 2 3\n1 3 3 5\n1 3 3 7\n",
"1 3 3\n2 1 2 3\n3 1 2 4\n1 1 1 7\n",
"2 2 5\n2 1 1 8\n3 1 1 1621\n2 1 2 22345\n3 1 2 47490\n1 2 2 111115\n",
"3 5 1\n1 2 4 5\n",
"2 2 5\n2 1 1 8\n3 1 1 2839\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"20 1 10\n2 8 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 0 299\n2 19 1 300\n",
"4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 3 13\n1 4 4 15\n",
"3 2 10\n1 2 2 185\n1 2 1 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300\n",
"1 2 3\n1 1 2 2\n2 1 2 5\n1 1 1 19\n",
"4 3 3\n2 4 2 3\n1 3 3 5\n1 3 3 7\n",
"3 3 3\n2 2 3 3\n1 3 3 5\n1 3 3 7\n",
"2 2 5\n2 1 1 16\n3 1 1 1621\n2 1 2 22345\n3 1 2 47490\n1 2 2 111115\n",
"3 3 3\n2 2 1 3\n1 3 3 5\n1 3 3 7\n",
"2 3 5\n2 1 1 8\n3 1 1 12345\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115\n",
"3 2 3\n2 1 1 2\n1 2 2 3\n1 2 2 5\n",
"3 3 1\n1 3 3 4\n",
"4 3 3\n2 2 2 3\n1 3 3 5\n1 3 3 7\n",
"3 3 1\n1 3 1 4\n",
"3 5 1\n1 2 3 4\n",
"3 5 1\n1 3 1 4\n",
"3 5 1\n1 2 4 4\n",
"3 3 1\n1 3 1 2\n",
"3 3 1\n1 3 2 4\n",
"3 3 1\n1 1 3 4\n",
"3 5 1\n1 2 3 3\n",
"3 5 1\n1 3 2 4\n",
"3 2 1\n1 3 1 2\n",
"3 3 1\n1 1 3 2\n",
"3 5 1\n1 2 5 3\n",
"1 3 1\n1 1 3 2\n"
],
"output": [
"2\n42\n",
"490902\n10598759\n",
"5\n",
"452548876\n224409846\n",
"703708091\n",
"6\n",
"1\n",
"272600817\n593383272\n555850892\n746491153\n78394828\n",
"26508505\n16907334\n673189879\n",
"2\n10\n",
"0\n0\n",
"990123599\n781690482\n617361700\n",
"0\n0\n",
"1\n8\n131072\n",
"0\n",
"990123599\n781690482\n617361700\n",
"1\n8\n131072\n",
"2\n49\n",
"493504\n10848642\n",
"592377496\n224409846\n",
"882163172\n",
"272600817\n593383272\n555850892\n746491153\n78394828\n",
"3\n",
"755569789\n",
"272600817\n80864048\n555850892\n746491153\n78394828\n",
"2\n74\n",
"630\n",
"121509061\n371860349\n6219080\n",
"2\n",
"2\n42\n",
"11\n",
"222123772\n",
"4\n",
"49125548\n",
"26508505\n16907334\n673189879\n",
"811964\n10598759\n",
"975963957\n722234318\n302837820\n",
"1\n8\n",
"6\n157\n",
"3\n69\n",
"441698033\n",
"6\n108\n",
"401181578\n",
"2\n14\n",
"0\n",
"2\n49\n",
"3\n",
"3\n",
"3\n",
"0\n",
"0\n",
"3\n",
"3\n",
"0\n",
"3\n",
"0\n",
"0\n",
"0\n",
"0\n"
]
} | 2CODEFORCES
|
615_C. Running Track_37980 | A boy named Ayrat lives on planet AMI-1511. Each inhabitant of this planet has a talent. Specifically, Ayrat loves running, moreover, just running is not enough for him. He is dreaming of making running a real art.
First, he wants to construct the running track with coating t. On planet AMI-1511 the coating of the track is the sequence of colored blocks, where each block is denoted as the small English letter. Therefore, every coating can be treated as a string.
Unfortunately, blocks aren't freely sold to non-business customers, but Ayrat found an infinite number of coatings s. Also, he has scissors and glue. Ayrat is going to buy some coatings s, then cut out from each of them exactly one continuous piece (substring) and glue it to the end of his track coating. Moreover, he may choose to flip this block before glueing it. Ayrat want's to know the minimum number of coating s he needs to buy in order to get the coating t for his running track. Of course, he also want's to know some way to achieve the answer.
Input
First line of the input contains the string s — the coating that is present in the shop. Second line contains the string t — the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small English letters and their length doesn't exceed 2100.
Output
The first line should contain the minimum needed number of coatings n or -1 if it's impossible to create the desired coating.
If the answer is not -1, then the following n lines should contain two integers xi and yi — numbers of ending blocks in the corresponding piece. If xi ≤ yi then this piece is used in the regular order, and if xi > yi piece is used in the reversed order. Print the pieces in the order they should be glued to get the string t.
Examples
Input
abc
cbaabc
Output
2
3 1
1 3
Input
aaabrytaaa
ayrat
Output
3
1 1
6 5
8 7
Input
ami
no
Output
-1
Note
In the first sample string "cbaabc" = "cba" + "abc".
In the second sample: "ayrat" = "a" + "yr" + "at". | s = raw_input()
t = raw_input()
rev = s[::-1]
t=t+"#"
ans=[]
temp=t[0]
n=len(s)
for i in xrange(1,len(t)):
cur = temp+t[i]
if cur in s or cur in rev:
temp=cur
else:
if temp in s:
start = s.find(temp)
ans.append((start+1,start+len(temp)))
elif temp in rev:
start = rev.find(temp)
ans.append((n-start,n-start-len(temp)+1))
else :
print -1
exit(0)
temp=t[i]
print len(ans)
for i in xrange(len(ans)):
print ans[i][0],ans[i][1] | 1Python2
| {
"input": [
"ami\nno\n",
"abc\ncbaabc\n",
"aaabrytaaa\nayrat\n",
"hhhhhhh\nhhhhhhh\n",
"ababaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"qwerty\nywertyrewqqq\n",
"aaaaaabaa\na\n",
"woohoowhenifeelheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"abaaaabaababbaaaaaabaa\nbaaaabaababaabababaaaa\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbbbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"azaza\nzazaz\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopasdfghjklzxcvbnm\n",
"klllklkllllkllllllkklkkkklklklklllkkkllklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"randb\nbandr\n",
"woohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"r\nb\n",
"aaaaaa\naaaaa\n",
"aaaaaa\naaaaaaa\n",
"qwerty\nytrewq\n",
"bbaabaaaabaaaaaabbaaaa\naaabaaaaaaababbbaaaaaa\n",
"imnothalfthemaniusedtobetheresashadowhangingovermeohyesterdaycamesuddenlywgk\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bbbbbb\na\n",
"ltfqmwlfkswpmxi\nfkswpmi\n",
"r\nr\n",
"mmlmllmllmlmlllmmmlmmmllmmlm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"jjjbjjbjbbbbbbjbjbbjbjbbbjbjbbjbbjbbjjbjbjjjbbbbjbjjjjbbbjbjjjjjbjbjbjjjbjjjjjjjjbbjbjbbjbbjbbbbbjjjbbjjbjjbbbbjbbjbbbbbjbbjjbjjbbjjjbjjbbbbjbjjbjbbjbbjbjbjbbbjjjjbjbjbbjbjjjjbbjbjbbbjjjjjbjjbjbjjjbjjjbbbjbjjbbbbbbbjjjjbbbbj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmjmmmjjmjmmmm\njmjmjmmjmmjjmj\n",
"hhghhhh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"ytrewq\nywertyrewqqq\n",
"aaaaaabaa\n`\n",
"abaaaabaababbaaaaaabaa\naaaaabaababaabababaaab\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnm\n",
"bdnar\nbandr\n",
"wpohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"qwerty\nqwerty\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaaababbbaaaaaa\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"ltfqmwlfkswpmxi\nfwskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjbbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjjbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmmmjmjjmmmjmm\njmjmjmmjmmjjmj\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaabaaa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaaa\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnn\n",
"bdnar\nbrnda\n",
"aaabaa\naaaaaaa\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaabbabbbaaaaaa\n",
"ltfqmwlfkswpmxi\nfxskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjjbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjbbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"hhghhgh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaababa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaba\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"r\nc\n",
"aaaaaa\nabaaa\n",
"aaaaaa\nabaaaaa\n",
"bbbcbb\na\n",
"r\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"ami\nnn\n",
"bbc\ncbaabc\n",
"aaabrytaaa\nazrat\n",
"ghghhhh\nhhhhhhh\n",
"ytrewr\nywertyrewqqq\n",
"aaaababaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemidnaeilillewoohoow\n",
"bcbccccbbccccbbcbbcbccbbccccbbbcbcccccccccbcbccccccccbcbcccbccccbbbccbcbcbbcbcbcccccbbccbbbcbcccccbcbbbccccbbbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllklllkkllkkklkkllllkkkklllklllkllkklklll\n",
"wpohoowellimieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"s\nc\n",
"aaaaaa\nabbaa\n",
"qwerty\nqwdrty\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynpwitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bcbcbb\na\n",
"s\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllnlmmmllmmlllmllmlmlll\n",
"mmmmjmjjmmmjmm\njmimjmmjmmjjmj\n",
"amj\nnn\n",
"bcc\ncbaabc\n",
"aaatyrbaaa\nazrat\n",
"ytrewr\nqqqwerytrewy\n",
"aaaacabaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemionaeilillewoohdow\n"
],
"output": [
"-1\n",
"2\n3 1\n1 3\n",
"3\n1 1\n6 5\n8 7\n",
"1\n1 7\n",
"4\n2 7\n2 2\n4 9\n4 12\n",
"5\n6 6\n2 6\n4 1\n1 1\n1 1\n",
"1\n1 1\n",
"-1\n",
"3\n2 12\n8 12\n1 6\n",
"-1\n",
"2\n2 5\n2 2\n",
"1\n26 1\n",
"-1\n",
"3\n5 5\n2 4\n1 1\n",
"22\n1 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n1 6\n15 19\n59 59\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"1\n1 5\n",
"2\n1 6\n1 1\n",
"1\n6 1\n",
"4\n7 16\n4 6\n1 2\n10 16\n",
"52\n7 8\n8 8\n2 2\n53 53\n5 5\n28 28\n4 4\n17 17\n23 23\n8 8\n29 30\n18 19\n12 13\n19 20\n18 18\n4 4\n9 9\n7 7\n28 28\n7 7\n37 37\n60 61\n3 4\n37 37\n1 1\n5 5\n8 8\n4 4\n4 4\n76 76\n30 32\n5 6\n4 4\n17 17\n41 41\n26 25\n11 12\n53 53\n28 26\n27 29\n21 22\n55 56\n60 61\n51 52\n1 1\n23 24\n8 8\n1 1\n47 46\n12 12\n42 43\n53 61\n",
"-1\n",
"2\n8 13\n15 15\n",
"1\n1 1\n",
"-1\n",
"26\n38 31\n143 149\n61 68\n144 136\n139 151\n102 108\n22 27\n105 95\n149 142\n73 80\n211 206\n189 180\n22 27\n198 192\n214 222\n98 104\n62 51\n188 181\n214 205\n201 209\n68 58\n180 173\n198 192\n202 211\n163 172\n47 39\n",
"4\n8 11\n3 5\n3 5\n7 10\n",
"2\n4 7\n4 6\n",
"5\n4 5\n4 7\n4 4\n4 9\n4 12\n",
"5\n1 1\n5 1\n3 6\n6 6\n6 6\n",
"-1\n",
"4\n15 22\n12 6\n12 8\n1 2\n",
"3\n26 16\n22 22\n14 1\n",
"3\n1 1\n4 2\n5 5\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"1\n1 6\n",
"4\n16 7\n12 14\n5 6\n6 12\n",
"52\n70 69\n5 5\n13 13\n4 4\n21 21\n19 19\n26 26\n10 10\n54 54\n5 5\n58 59\n11 12\n12 13\n7 8\n11 11\n26 26\n68 68\n14 14\n19 19\n14 14\n3 3\n17 16\n74 73\n3 3\n35 35\n21 21\n5 5\n26 26\n26 26\n1 1\n45 47\n72 71\n26 26\n10 10\n2 2\n51 52\n66 65\n4 4\n49 51\n48 50\n72 73\n22 21\n17 16\n26 25\n35 35\n54 53\n5 5\n35 35\n30 31\n7 7\n61 62\n24 16\n",
"4\n3 3\n11 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n41 46\n120 130\n76 83\n143 150\n14 19\n36 45\n41 46\n27 33\n4 12\n92 98\n163 174\n37 44\n11 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n7 4\n8 10\n8 10\n8 5\n",
"6\n4 5\n4 5\n4 5\n4 4\n4 9\n4 12\n",
"4\n2 5\n12 9\n7 12\n22 15\n",
"4\n26 16\n22 22\n14 2\n2 2\n",
"4\n1 1\n5 5\n3 2\n4 4\n",
"3\n1 3\n1 3\n1 1\n",
"3\n16 4\n5 6\n6 12\n",
"5\n3 3\n14 14\n10 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n65 70\n120 130\n76 83\n143 152\n120 127\n64 69\n65 70\n27 33\n4 12\n155 146\n166 174\n38 44\n10 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n1 2\n1 2\n1 2\n1 1\n",
"7\n4 5\n4 5\n4 5\n4 4\n4 9\n4 10\n4 5\n",
"5\n2 5\n12 9\n7 12\n22 17\n2 3\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"2\n4 7\n4 6\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n"
]
} | 2CODEFORCES
|
615_C. Running Track_37981 | A boy named Ayrat lives on planet AMI-1511. Each inhabitant of this planet has a talent. Specifically, Ayrat loves running, moreover, just running is not enough for him. He is dreaming of making running a real art.
First, he wants to construct the running track with coating t. On planet AMI-1511 the coating of the track is the sequence of colored blocks, where each block is denoted as the small English letter. Therefore, every coating can be treated as a string.
Unfortunately, blocks aren't freely sold to non-business customers, but Ayrat found an infinite number of coatings s. Also, he has scissors and glue. Ayrat is going to buy some coatings s, then cut out from each of them exactly one continuous piece (substring) and glue it to the end of his track coating. Moreover, he may choose to flip this block before glueing it. Ayrat want's to know the minimum number of coating s he needs to buy in order to get the coating t for his running track. Of course, he also want's to know some way to achieve the answer.
Input
First line of the input contains the string s — the coating that is present in the shop. Second line contains the string t — the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small English letters and their length doesn't exceed 2100.
Output
The first line should contain the minimum needed number of coatings n or -1 if it's impossible to create the desired coating.
If the answer is not -1, then the following n lines should contain two integers xi and yi — numbers of ending blocks in the corresponding piece. If xi ≤ yi then this piece is used in the regular order, and if xi > yi piece is used in the reversed order. Print the pieces in the order they should be glued to get the string t.
Examples
Input
abc
cbaabc
Output
2
3 1
1 3
Input
aaabrytaaa
ayrat
Output
3
1 1
6 5
8 7
Input
ami
no
Output
-1
Note
In the first sample string "cbaabc" = "cba" + "abc".
In the second sample: "ayrat" = "a" + "yr" + "at". | #include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
const int N = 2105;
int dp[N], lcp[N][N], lcpr[N][N], lmatch[N];
pair<int, int> subs[N];
int par[N];
string s, t;
int n, m;
void print(int idx) {
if (idx != 0) print(par[idx]);
cout << subs[idx].first + 1 << " " << subs[idx].second + 1 << "\n";
}
int main() {
cin >> s >> t;
n = s.size();
m = t.size();
for (int i = m - 1; i >= 0; --i) {
for (int j = n - 1; j >= 0; --j) {
if (t[i] != s[j])
lcp[i][j] = 0;
else
lcp[i][j] = lcp[i + 1][j + 1] + 1;
}
}
reverse(s.begin(), s.end());
for (int i = m - 1; i >= 0; --i) {
for (int j = n - 1; j >= 0; --j) {
if (t[i] != s[j])
lcpr[i][j] = 0;
else
lcpr[i][j] = lcpr[i + 1][j + 1] + 1;
}
}
for (int i = 0; i < m; ++i) {
int midx = max_element(lcp[i], lcp[i] + n) - lcp[i];
lmatch[i] = lcp[i][midx];
subs[i] = {midx, midx + lmatch[i] - 1};
midx = max_element(lcpr[i], lcpr[i] + n) - lcpr[i];
if (lmatch[i] < lcpr[i][midx]) {
lmatch[i] = lcpr[i][midx];
subs[i] = {n - 1 - midx, n - 1 - midx - lmatch[i] + 1};
}
}
fill(dp + 1, dp + m + 1, INF);
for (int i = 0; i < m; ++i) {
if (dp[i + lmatch[i]] > dp[i] + 1) {
dp[i + lmatch[i]] = dp[i] + 1;
par[i + lmatch[i]] = i;
}
}
if (dp[m] >= INF) {
puts("-1");
return 0;
}
cout << dp[m] << "\n";
print(par[m]);
return 0;
}
| 2C++
| {
"input": [
"ami\nno\n",
"abc\ncbaabc\n",
"aaabrytaaa\nayrat\n",
"hhhhhhh\nhhhhhhh\n",
"ababaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"qwerty\nywertyrewqqq\n",
"aaaaaabaa\na\n",
"woohoowhenifeelheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"abaaaabaababbaaaaaabaa\nbaaaabaababaabababaaaa\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbbbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"azaza\nzazaz\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopasdfghjklzxcvbnm\n",
"klllklkllllkllllllkklkkkklklklklllkkkllklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"randb\nbandr\n",
"woohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"r\nb\n",
"aaaaaa\naaaaa\n",
"aaaaaa\naaaaaaa\n",
"qwerty\nytrewq\n",
"bbaabaaaabaaaaaabbaaaa\naaabaaaaaaababbbaaaaaa\n",
"imnothalfthemaniusedtobetheresashadowhangingovermeohyesterdaycamesuddenlywgk\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bbbbbb\na\n",
"ltfqmwlfkswpmxi\nfkswpmi\n",
"r\nr\n",
"mmlmllmllmlmlllmmmlmmmllmmlm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"jjjbjjbjbbbbbbjbjbbjbjbbbjbjbbjbbjbbjjbjbjjjbbbbjbjjjjbbbjbjjjjjbjbjbjjjbjjjjjjjjbbjbjbbjbbjbbbbbjjjbbjjbjjbbbbjbbjbbbbbjbbjjbjjbbjjjbjjbbbbjbjjbjbbjbbjbjbjbbbjjjjbjbjbbjbjjjjbbjbjbbbjjjjjbjjbjbjjjbjjjbbbjbjjbbbbbbbjjjjbbbbj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmjmmmjjmjmmmm\njmjmjmmjmmjjmj\n",
"hhghhhh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"ytrewq\nywertyrewqqq\n",
"aaaaaabaa\n`\n",
"abaaaabaababbaaaaaabaa\naaaaabaababaabababaaab\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnm\n",
"bdnar\nbandr\n",
"wpohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"qwerty\nqwerty\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaaababbbaaaaaa\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"ltfqmwlfkswpmxi\nfwskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjbbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjjbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmmmjmjjmmmjmm\njmjmjmmjmmjjmj\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaabaaa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaaa\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnn\n",
"bdnar\nbrnda\n",
"aaabaa\naaaaaaa\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaabbabbbaaaaaa\n",
"ltfqmwlfkswpmxi\nfxskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjjbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjbbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"hhghhgh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaababa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaba\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"r\nc\n",
"aaaaaa\nabaaa\n",
"aaaaaa\nabaaaaa\n",
"bbbcbb\na\n",
"r\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"ami\nnn\n",
"bbc\ncbaabc\n",
"aaabrytaaa\nazrat\n",
"ghghhhh\nhhhhhhh\n",
"ytrewr\nywertyrewqqq\n",
"aaaababaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemidnaeilillewoohoow\n",
"bcbccccbbccccbbcbbcbccbbccccbbbcbcccccccccbcbccccccccbcbcccbccccbbbccbcbcbbcbcbcccccbbccbbbcbcccccbcbbbccccbbbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllklllkkllkkklkkllllkkkklllklllkllkklklll\n",
"wpohoowellimieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"s\nc\n",
"aaaaaa\nabbaa\n",
"qwerty\nqwdrty\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynpwitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bcbcbb\na\n",
"s\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllnlmmmllmmlllmllmlmlll\n",
"mmmmjmjjmmmjmm\njmimjmmjmmjjmj\n",
"amj\nnn\n",
"bcc\ncbaabc\n",
"aaatyrbaaa\nazrat\n",
"ytrewr\nqqqwerytrewy\n",
"aaaacabaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemionaeilillewoohdow\n"
],
"output": [
"-1\n",
"2\n3 1\n1 3\n",
"3\n1 1\n6 5\n8 7\n",
"1\n1 7\n",
"4\n2 7\n2 2\n4 9\n4 12\n",
"5\n6 6\n2 6\n4 1\n1 1\n1 1\n",
"1\n1 1\n",
"-1\n",
"3\n2 12\n8 12\n1 6\n",
"-1\n",
"2\n2 5\n2 2\n",
"1\n26 1\n",
"-1\n",
"3\n5 5\n2 4\n1 1\n",
"22\n1 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n1 6\n15 19\n59 59\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"1\n1 5\n",
"2\n1 6\n1 1\n",
"1\n6 1\n",
"4\n7 16\n4 6\n1 2\n10 16\n",
"52\n7 8\n8 8\n2 2\n53 53\n5 5\n28 28\n4 4\n17 17\n23 23\n8 8\n29 30\n18 19\n12 13\n19 20\n18 18\n4 4\n9 9\n7 7\n28 28\n7 7\n37 37\n60 61\n3 4\n37 37\n1 1\n5 5\n8 8\n4 4\n4 4\n76 76\n30 32\n5 6\n4 4\n17 17\n41 41\n26 25\n11 12\n53 53\n28 26\n27 29\n21 22\n55 56\n60 61\n51 52\n1 1\n23 24\n8 8\n1 1\n47 46\n12 12\n42 43\n53 61\n",
"-1\n",
"2\n8 13\n15 15\n",
"1\n1 1\n",
"-1\n",
"26\n38 31\n143 149\n61 68\n144 136\n139 151\n102 108\n22 27\n105 95\n149 142\n73 80\n211 206\n189 180\n22 27\n198 192\n214 222\n98 104\n62 51\n188 181\n214 205\n201 209\n68 58\n180 173\n198 192\n202 211\n163 172\n47 39\n",
"4\n8 11\n3 5\n3 5\n7 10\n",
"2\n4 7\n4 6\n",
"5\n4 5\n4 7\n4 4\n4 9\n4 12\n",
"5\n1 1\n5 1\n3 6\n6 6\n6 6\n",
"-1\n",
"4\n15 22\n12 6\n12 8\n1 2\n",
"3\n26 16\n22 22\n14 1\n",
"3\n1 1\n4 2\n5 5\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"1\n1 6\n",
"4\n16 7\n12 14\n5 6\n6 12\n",
"52\n70 69\n5 5\n13 13\n4 4\n21 21\n19 19\n26 26\n10 10\n54 54\n5 5\n58 59\n11 12\n12 13\n7 8\n11 11\n26 26\n68 68\n14 14\n19 19\n14 14\n3 3\n17 16\n74 73\n3 3\n35 35\n21 21\n5 5\n26 26\n26 26\n1 1\n45 47\n72 71\n26 26\n10 10\n2 2\n51 52\n66 65\n4 4\n49 51\n48 50\n72 73\n22 21\n17 16\n26 25\n35 35\n54 53\n5 5\n35 35\n30 31\n7 7\n61 62\n24 16\n",
"4\n3 3\n11 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n41 46\n120 130\n76 83\n143 150\n14 19\n36 45\n41 46\n27 33\n4 12\n92 98\n163 174\n37 44\n11 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n7 4\n8 10\n8 10\n8 5\n",
"6\n4 5\n4 5\n4 5\n4 4\n4 9\n4 12\n",
"4\n2 5\n12 9\n7 12\n22 15\n",
"4\n26 16\n22 22\n14 2\n2 2\n",
"4\n1 1\n5 5\n3 2\n4 4\n",
"3\n1 3\n1 3\n1 1\n",
"3\n16 4\n5 6\n6 12\n",
"5\n3 3\n14 14\n10 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n65 70\n120 130\n76 83\n143 152\n120 127\n64 69\n65 70\n27 33\n4 12\n155 146\n166 174\n38 44\n10 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n1 2\n1 2\n1 2\n1 1\n",
"7\n4 5\n4 5\n4 5\n4 4\n4 9\n4 10\n4 5\n",
"5\n2 5\n12 9\n7 12\n22 17\n2 3\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"2\n4 7\n4 6\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n"
]
} | 2CODEFORCES
|
615_C. Running Track_37982 | A boy named Ayrat lives on planet AMI-1511. Each inhabitant of this planet has a talent. Specifically, Ayrat loves running, moreover, just running is not enough for him. He is dreaming of making running a real art.
First, he wants to construct the running track with coating t. On planet AMI-1511 the coating of the track is the sequence of colored blocks, where each block is denoted as the small English letter. Therefore, every coating can be treated as a string.
Unfortunately, blocks aren't freely sold to non-business customers, but Ayrat found an infinite number of coatings s. Also, he has scissors and glue. Ayrat is going to buy some coatings s, then cut out from each of them exactly one continuous piece (substring) and glue it to the end of his track coating. Moreover, he may choose to flip this block before glueing it. Ayrat want's to know the minimum number of coating s he needs to buy in order to get the coating t for his running track. Of course, he also want's to know some way to achieve the answer.
Input
First line of the input contains the string s — the coating that is present in the shop. Second line contains the string t — the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small English letters and their length doesn't exceed 2100.
Output
The first line should contain the minimum needed number of coatings n or -1 if it's impossible to create the desired coating.
If the answer is not -1, then the following n lines should contain two integers xi and yi — numbers of ending blocks in the corresponding piece. If xi ≤ yi then this piece is used in the regular order, and if xi > yi piece is used in the reversed order. Print the pieces in the order they should be glued to get the string t.
Examples
Input
abc
cbaabc
Output
2
3 1
1 3
Input
aaabrytaaa
ayrat
Output
3
1 1
6 5
8 7
Input
ami
no
Output
-1
Note
In the first sample string "cbaabc" = "cba" + "abc".
In the second sample: "ayrat" = "a" + "yr" + "at". | def find_max_substr(t, s):
l, r = 0, len(t)
while l != r:
m = (l + r) // 2
if t[:m + 1] in s:
l = m + 1
else:
r = m
l1 = l
rs = s[::-1]
l, r = 0, len(t)
while l != r:
m = (l + r) // 2
if t[:m + 1] in rs:
l = m + 1
else:
r = m
l2 = l
if l1 >= l2:
return s.find(t[:l1]) + 1, s.find(t[:l1]) + l1
else:
return s.find(t[:l2][::-1]) + l2, s.find(t[:l2][::-1]) + 1
s = input()
t = input()
if not set(t).issubset(set(s)):
print(-1)
exit(0)
a = []
while t:
l, r = find_max_substr(t, s)
a.append((l, r))
t = t[abs(r - l) + 1:]
print(len(a))
for l, r in a:
print(l, r)
| 3Python3
| {
"input": [
"ami\nno\n",
"abc\ncbaabc\n",
"aaabrytaaa\nayrat\n",
"hhhhhhh\nhhhhhhh\n",
"ababaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"qwerty\nywertyrewqqq\n",
"aaaaaabaa\na\n",
"woohoowhenifeelheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"abaaaabaababbaaaaaabaa\nbaaaabaababaabababaaaa\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbbbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"azaza\nzazaz\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopasdfghjklzxcvbnm\n",
"klllklkllllkllllllkklkkkklklklklllkkkllklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"randb\nbandr\n",
"woohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"r\nb\n",
"aaaaaa\naaaaa\n",
"aaaaaa\naaaaaaa\n",
"qwerty\nytrewq\n",
"bbaabaaaabaaaaaabbaaaa\naaabaaaaaaababbbaaaaaa\n",
"imnothalfthemaniusedtobetheresashadowhangingovermeohyesterdaycamesuddenlywgk\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bbbbbb\na\n",
"ltfqmwlfkswpmxi\nfkswpmi\n",
"r\nr\n",
"mmlmllmllmlmlllmmmlmmmllmmlm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"jjjbjjbjbbbbbbjbjbbjbjbbbjbjbbjbbjbbjjbjbjjjbbbbjbjjjjbbbjbjjjjjbjbjbjjjbjjjjjjjjbbjbjbbjbbjbbbbbjjjbbjjbjjbbbbjbbjbbbbbjbbjjbjjbbjjjbjjbbbbjbjjbjbbjbbjbjbjbbbjjjjbjbjbbjbjjjjbbjbjbbbjjjjjbjjbjbjjjbjjjbbbjbjjbbbbbbbjjjjbbbbj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmjmmmjjmjmmmm\njmjmjmmjmmjjmj\n",
"hhghhhh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"ytrewq\nywertyrewqqq\n",
"aaaaaabaa\n`\n",
"abaaaabaababbaaaaaabaa\naaaaabaababaabababaaab\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnm\n",
"bdnar\nbandr\n",
"wpohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"qwerty\nqwerty\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaaababbbaaaaaa\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"ltfqmwlfkswpmxi\nfwskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjbbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjjbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmmmjmjjmmmjmm\njmjmjmmjmmjjmj\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaabaaa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaaa\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnn\n",
"bdnar\nbrnda\n",
"aaabaa\naaaaaaa\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaabbabbbaaaaaa\n",
"ltfqmwlfkswpmxi\nfxskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjjbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjbbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"hhghhgh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaababa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaba\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"r\nc\n",
"aaaaaa\nabaaa\n",
"aaaaaa\nabaaaaa\n",
"bbbcbb\na\n",
"r\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"ami\nnn\n",
"bbc\ncbaabc\n",
"aaabrytaaa\nazrat\n",
"ghghhhh\nhhhhhhh\n",
"ytrewr\nywertyrewqqq\n",
"aaaababaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemidnaeilillewoohoow\n",
"bcbccccbbccccbbcbbcbccbbccccbbbcbcccccccccbcbccccccccbcbcccbccccbbbccbcbcbbcbcbcccccbbccbbbcbcccccbcbbbccccbbbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllklllkkllkkklkkllllkkkklllklllkllkklklll\n",
"wpohoowellimieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"s\nc\n",
"aaaaaa\nabbaa\n",
"qwerty\nqwdrty\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynpwitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bcbcbb\na\n",
"s\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllnlmmmllmmlllmllmlmlll\n",
"mmmmjmjjmmmjmm\njmimjmmjmmjjmj\n",
"amj\nnn\n",
"bcc\ncbaabc\n",
"aaatyrbaaa\nazrat\n",
"ytrewr\nqqqwerytrewy\n",
"aaaacabaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemionaeilillewoohdow\n"
],
"output": [
"-1\n",
"2\n3 1\n1 3\n",
"3\n1 1\n6 5\n8 7\n",
"1\n1 7\n",
"4\n2 7\n2 2\n4 9\n4 12\n",
"5\n6 6\n2 6\n4 1\n1 1\n1 1\n",
"1\n1 1\n",
"-1\n",
"3\n2 12\n8 12\n1 6\n",
"-1\n",
"2\n2 5\n2 2\n",
"1\n26 1\n",
"-1\n",
"3\n5 5\n2 4\n1 1\n",
"22\n1 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n1 6\n15 19\n59 59\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"1\n1 5\n",
"2\n1 6\n1 1\n",
"1\n6 1\n",
"4\n7 16\n4 6\n1 2\n10 16\n",
"52\n7 8\n8 8\n2 2\n53 53\n5 5\n28 28\n4 4\n17 17\n23 23\n8 8\n29 30\n18 19\n12 13\n19 20\n18 18\n4 4\n9 9\n7 7\n28 28\n7 7\n37 37\n60 61\n3 4\n37 37\n1 1\n5 5\n8 8\n4 4\n4 4\n76 76\n30 32\n5 6\n4 4\n17 17\n41 41\n26 25\n11 12\n53 53\n28 26\n27 29\n21 22\n55 56\n60 61\n51 52\n1 1\n23 24\n8 8\n1 1\n47 46\n12 12\n42 43\n53 61\n",
"-1\n",
"2\n8 13\n15 15\n",
"1\n1 1\n",
"-1\n",
"26\n38 31\n143 149\n61 68\n144 136\n139 151\n102 108\n22 27\n105 95\n149 142\n73 80\n211 206\n189 180\n22 27\n198 192\n214 222\n98 104\n62 51\n188 181\n214 205\n201 209\n68 58\n180 173\n198 192\n202 211\n163 172\n47 39\n",
"4\n8 11\n3 5\n3 5\n7 10\n",
"2\n4 7\n4 6\n",
"5\n4 5\n4 7\n4 4\n4 9\n4 12\n",
"5\n1 1\n5 1\n3 6\n6 6\n6 6\n",
"-1\n",
"4\n15 22\n12 6\n12 8\n1 2\n",
"3\n26 16\n22 22\n14 1\n",
"3\n1 1\n4 2\n5 5\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"1\n1 6\n",
"4\n16 7\n12 14\n5 6\n6 12\n",
"52\n70 69\n5 5\n13 13\n4 4\n21 21\n19 19\n26 26\n10 10\n54 54\n5 5\n58 59\n11 12\n12 13\n7 8\n11 11\n26 26\n68 68\n14 14\n19 19\n14 14\n3 3\n17 16\n74 73\n3 3\n35 35\n21 21\n5 5\n26 26\n26 26\n1 1\n45 47\n72 71\n26 26\n10 10\n2 2\n51 52\n66 65\n4 4\n49 51\n48 50\n72 73\n22 21\n17 16\n26 25\n35 35\n54 53\n5 5\n35 35\n30 31\n7 7\n61 62\n24 16\n",
"4\n3 3\n11 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n41 46\n120 130\n76 83\n143 150\n14 19\n36 45\n41 46\n27 33\n4 12\n92 98\n163 174\n37 44\n11 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n7 4\n8 10\n8 10\n8 5\n",
"6\n4 5\n4 5\n4 5\n4 4\n4 9\n4 12\n",
"4\n2 5\n12 9\n7 12\n22 15\n",
"4\n26 16\n22 22\n14 2\n2 2\n",
"4\n1 1\n5 5\n3 2\n4 4\n",
"3\n1 3\n1 3\n1 1\n",
"3\n16 4\n5 6\n6 12\n",
"5\n3 3\n14 14\n10 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n65 70\n120 130\n76 83\n143 152\n120 127\n64 69\n65 70\n27 33\n4 12\n155 146\n166 174\n38 44\n10 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n1 2\n1 2\n1 2\n1 1\n",
"7\n4 5\n4 5\n4 5\n4 4\n4 9\n4 10\n4 5\n",
"5\n2 5\n12 9\n7 12\n22 17\n2 3\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"2\n4 7\n4 6\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n"
]
} | 2CODEFORCES
|
615_C. Running Track_37983 | A boy named Ayrat lives on planet AMI-1511. Each inhabitant of this planet has a talent. Specifically, Ayrat loves running, moreover, just running is not enough for him. He is dreaming of making running a real art.
First, he wants to construct the running track with coating t. On planet AMI-1511 the coating of the track is the sequence of colored blocks, where each block is denoted as the small English letter. Therefore, every coating can be treated as a string.
Unfortunately, blocks aren't freely sold to non-business customers, but Ayrat found an infinite number of coatings s. Also, he has scissors and glue. Ayrat is going to buy some coatings s, then cut out from each of them exactly one continuous piece (substring) and glue it to the end of his track coating. Moreover, he may choose to flip this block before glueing it. Ayrat want's to know the minimum number of coating s he needs to buy in order to get the coating t for his running track. Of course, he also want's to know some way to achieve the answer.
Input
First line of the input contains the string s — the coating that is present in the shop. Second line contains the string t — the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small English letters and their length doesn't exceed 2100.
Output
The first line should contain the minimum needed number of coatings n or -1 if it's impossible to create the desired coating.
If the answer is not -1, then the following n lines should contain two integers xi and yi — numbers of ending blocks in the corresponding piece. If xi ≤ yi then this piece is used in the regular order, and if xi > yi piece is used in the reversed order. Print the pieces in the order they should be glued to get the string t.
Examples
Input
abc
cbaabc
Output
2
3 1
1 3
Input
aaabrytaaa
ayrat
Output
3
1 1
6 5
8 7
Input
ami
no
Output
-1
Note
In the first sample string "cbaabc" = "cba" + "abc".
In the second sample: "ayrat" = "a" + "yr" + "at". | import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;
public class Main{
static PrintWriter out;
static InputReader ir;
static void solve(){
char[] s=ir.next().toCharArray();
char[] rs=new StringBuilder(String.valueOf(s)).reverse().toString().toCharArray();
char[] t=ir.next().toCharArray();
int n=s.length;
int m=t.length;
ArrayList<int[]> ans=new ArrayList<>();
for(int i=0;;){
int ma=0,pos=-1;
for(int j=0;j<n;j++){
int len;
for(len=0;i+len<m&&j+len<n&&t[i+len]==s[j+len];len++);
if(ma<len){
ma=len;
pos=j+1;
}
for(len=0;i+len<m&&j+len<n&&t[i+len]==rs[j+len];len++);
if(ma<len){
ma=len;
pos=j-n;
}
}
if(ma==0){
out.println(-1);
return;
}
if(pos>0) ans.add(new int[]{pos,pos+ma-1});
else ans.add(new int[]{-pos,-pos-ma+1});
i+=ma;
if(i==m) break;
}
out.println(ans.size());
for(int[] si : ans){
out.println(si[0]+" "+si[1]);
}
}
public static void main(String[] args) throws Exception{
ir=new InputReader(System.in);
out=new PrintWriter(System.out);
solve();
out.flush();
}
static class InputReader {
private InputStream in;
private byte[] buffer=new byte[1024];
private int curbuf;
private int lenbuf;
public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
public boolean hasNextByte() {
if(curbuf>=lenbuf){
curbuf= 0;
try{
lenbuf=in.read(buffer);
}catch(IOException e) {
throw new InputMismatchException();
}
if(lenbuf<=0) return false;
}
return true;
}
private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
public boolean hasNext(){skip(); return hasNextByte();}
public String next(){
if(!hasNext()) throw new NoSuchElementException();
StringBuilder sb=new StringBuilder();
int b=readByte();
while(!isSpaceChar(b)){
sb.appendCodePoint(b);
b=readByte();
}
return sb.toString();
}
public int nextInt() {
if(!hasNext()) throw new NoSuchElementException();
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
int res=0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}
public long nextLong() {
if(!hasNext()) throw new NoSuchElementException();
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
long res = 0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}
public double nextDouble(){return Double.parseDouble(next());}
public BigInteger nextBigInteger(){return new BigInteger(next());}
public int[] nextIntArray(int n){
int[] a=new int[n];
for(int i=0;i<n;i++) a[i]=nextInt();
return a;
}
public long[] nextLongArray(int n){
long[] a=new long[n];
for(int i=0;i<n;i++) a[i]=nextLong();
return a;
}
public char[][] nextCharMap(int n,int m){
char[][] map=new char[n][m];
for(int i=0;i<n;i++) map[i]=next().toCharArray();
return map;
}
}
} | 4JAVA
| {
"input": [
"ami\nno\n",
"abc\ncbaabc\n",
"aaabrytaaa\nayrat\n",
"hhhhhhh\nhhhhhhh\n",
"ababaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"qwerty\nywertyrewqqq\n",
"aaaaaabaa\na\n",
"woohoowhenifeelheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"abaaaabaababbaaaaaabaa\nbaaaabaababaabababaaaa\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbbbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"azaza\nzazaz\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopasdfghjklzxcvbnm\n",
"klllklkllllkllllllkklkkkklklklklllkkkllklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"randb\nbandr\n",
"woohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"r\nb\n",
"aaaaaa\naaaaa\n",
"aaaaaa\naaaaaaa\n",
"qwerty\nytrewq\n",
"bbaabaaaabaaaaaabbaaaa\naaabaaaaaaababbbaaaaaa\n",
"imnothalfthemaniusedtobetheresashadowhangingovermeohyesterdaycamesuddenlywgk\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bbbbbb\na\n",
"ltfqmwlfkswpmxi\nfkswpmi\n",
"r\nr\n",
"mmlmllmllmlmlllmmmlmmmllmmlm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"jjjbjjbjbbbbbbjbjbbjbjbbbjbjbbjbbjbbjjbjbjjjbbbbjbjjjjbbbjbjjjjjbjbjbjjjbjjjjjjjjbbjbjbbjbbjbbbbbjjjbbjjbjjbbbbjbbjbbbbbjbbjjbjjbbjjjbjjbbbbjbjjbjbbjbbjbjbjbbbjjjjbjbjbbjbjjjjbbjbjbbbjjjjjbjjbjbjjjbjjjbbbjbjjbbbbbbbjjjjbbbbj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmjmmmjjmjmmmm\njmjmjmmjmmjjmj\n",
"hhghhhh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa\n",
"ytrewq\nywertyrewqqq\n",
"aaaaaabaa\n`\n",
"abaaaabaababbaaaaaabaa\naaaaabaababaabababaaab\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnm\n",
"bdnar\nbandr\n",
"wpohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"qwerty\nqwerty\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaaababbbaaaaaa\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"ltfqmwlfkswpmxi\nfwskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjbbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjjbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"mmmmjmjjmmmjmm\njmjmjmmjmmjjmj\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaabaaa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaaa\n",
"mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopatdfghjklzxcvbnn\n",
"bdnar\nbrnda\n",
"aaabaa\naaaaaaa\n",
"aaaabbaaaaaabaaaabaabb\naaabaaaaaabbabbbaaaaaa\n",
"ltfqmwlfkswpmxi\nfxskpmi\n",
"jbbbbjjjjbbbbbbbjjbjbbbjjjbjjjbjbjjbjjjjjjbbjbjbbjjjjbjbbjbjbjjjjbbbjbjbjbbjbbjbjjbjbbbbjjbjjjbbjjbjjbbjbbbbbjbbjbbbbjjbjjbbjjjbbbbbjbbjbbjbjbbjjjjjjjbbjjjbjbjbjjjjjbjbbbjjjjbjbbbbjjjbjbjjbbjbbjbbjbjbbbjbjbbjbjbbbbbbjbjjbjjj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb\n",
"hhghhgh\nhhhhhhh\n",
"aaabaaaabaaaaaaaaaaaba\nbabababbaaaabbaaaababa\n",
"abaaaabaababbaaaaaabaa\nbaaabababaababaabaaaba\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou\n",
"bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll\n",
"r\nc\n",
"aaaaaa\nabaaa\n",
"aaaaaa\nabaaaaa\n",
"bbbcbb\na\n",
"r\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllmlmmmllmmlllmllmlmlll\n",
"ami\nnn\n",
"bbc\ncbaabc\n",
"aaabrytaaa\nazrat\n",
"ghghhhh\nhhhhhhh\n",
"ytrewr\nywertyrewqqq\n",
"aaaababaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemidnaeilillewoohoow\n",
"bcbccccbbccccbbcbbcbccbbccccbbbcbcccccccccbcbccccccccbcbcccbccccbbbccbcbcbbcbcbcccccbbccbbbcbcccccbcbbbccccbbbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbcbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb\n",
"klllklkllllkllllllkklkkkklklklklllkkklmklkklkklkllkllkkk\npkkkkklklklkkllllklllkkllkkklkkllllkkkklllklllkllkklklll\n",
"wpohoowellimieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles\n",
"s\nc\n",
"aaaaaa\nabbaa\n",
"qwerty\nqwdrty\n",
"kgwylneddusemacyadretseyhoemrevognignahwodahsaserehtebotdesuinamehtflahtonmi\nallmytroublesseemedsofarawaynpwitlooksasthoughtheyreheretostayohibelieveinyesterday\n",
"bcbcbb\na\n",
"s\nq\n",
"mlmmllmmmlmmmlllmlmllmllmlmm\nzllmlllnlmmmllmmlllmllmlmlll\n",
"mmmmjmjjmmmjmm\njmimjmmjmmjjmj\n",
"amj\nnn\n",
"bcc\ncbaabc\n",
"aaatyrbaaa\nazrat\n",
"ytrewr\nqqqwerytrewy\n",
"aaaacabaa\n`\n",
"woohoowhenifedlheavymetalwoohooandimpinsandimneedles\nuoyteemotdesaelpuoydeeniyhwerusrevenmitubemitehtllaysaemionaeilillewoohdow\n"
],
"output": [
"-1\n",
"2\n3 1\n1 3\n",
"3\n1 1\n6 5\n8 7\n",
"1\n1 7\n",
"4\n2 7\n2 2\n4 9\n4 12\n",
"5\n6 6\n2 6\n4 1\n1 1\n1 1\n",
"1\n1 1\n",
"-1\n",
"3\n2 12\n8 12\n1 6\n",
"-1\n",
"2\n2 5\n2 2\n",
"1\n26 1\n",
"-1\n",
"3\n5 5\n2 4\n1 1\n",
"22\n1 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n1 6\n15 19\n59 59\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"1\n1 5\n",
"2\n1 6\n1 1\n",
"1\n6 1\n",
"4\n7 16\n4 6\n1 2\n10 16\n",
"52\n7 8\n8 8\n2 2\n53 53\n5 5\n28 28\n4 4\n17 17\n23 23\n8 8\n29 30\n18 19\n12 13\n19 20\n18 18\n4 4\n9 9\n7 7\n28 28\n7 7\n37 37\n60 61\n3 4\n37 37\n1 1\n5 5\n8 8\n4 4\n4 4\n76 76\n30 32\n5 6\n4 4\n17 17\n41 41\n26 25\n11 12\n53 53\n28 26\n27 29\n21 22\n55 56\n60 61\n51 52\n1 1\n23 24\n8 8\n1 1\n47 46\n12 12\n42 43\n53 61\n",
"-1\n",
"2\n8 13\n15 15\n",
"1\n1 1\n",
"-1\n",
"26\n38 31\n143 149\n61 68\n144 136\n139 151\n102 108\n22 27\n105 95\n149 142\n73 80\n211 206\n189 180\n22 27\n198 192\n214 222\n98 104\n62 51\n188 181\n214 205\n201 209\n68 58\n180 173\n198 192\n202 211\n163 172\n47 39\n",
"4\n8 11\n3 5\n3 5\n7 10\n",
"2\n4 7\n4 6\n",
"5\n4 5\n4 7\n4 4\n4 9\n4 12\n",
"5\n1 1\n5 1\n3 6\n6 6\n6 6\n",
"-1\n",
"4\n15 22\n12 6\n12 8\n1 2\n",
"3\n26 16\n22 22\n14 1\n",
"3\n1 1\n4 2\n5 5\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"1\n1 6\n",
"4\n16 7\n12 14\n5 6\n6 12\n",
"52\n70 69\n5 5\n13 13\n4 4\n21 21\n19 19\n26 26\n10 10\n54 54\n5 5\n58 59\n11 12\n12 13\n7 8\n11 11\n26 26\n68 68\n14 14\n19 19\n14 14\n3 3\n17 16\n74 73\n3 3\n35 35\n21 21\n5 5\n26 26\n26 26\n1 1\n45 47\n72 71\n26 26\n10 10\n2 2\n51 52\n66 65\n4 4\n49 51\n48 50\n72 73\n22 21\n17 16\n26 25\n35 35\n54 53\n5 5\n35 35\n30 31\n7 7\n61 62\n24 16\n",
"4\n3 3\n11 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n41 46\n120 130\n76 83\n143 150\n14 19\n36 45\n41 46\n27 33\n4 12\n92 98\n163 174\n37 44\n11 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n7 4\n8 10\n8 10\n8 5\n",
"6\n4 5\n4 5\n4 5\n4 4\n4 9\n4 12\n",
"4\n2 5\n12 9\n7 12\n22 15\n",
"4\n26 16\n22 22\n14 2\n2 2\n",
"4\n1 1\n5 5\n3 2\n4 4\n",
"3\n1 3\n1 3\n1 1\n",
"3\n16 4\n5 6\n6 12\n",
"5\n3 3\n14 14\n10 9\n12 13\n15 15\n",
"26\n187 194\n52 58\n164 157\n81 89\n86 74\n96 102\n65 70\n120 130\n76 83\n143 152\n120 127\n64 69\n65 70\n27 33\n4 12\n155 146\n166 174\n38 44\n10 20\n24 16\n157 167\n45 52\n27 33\n23 14\n62 53\n178 186\n",
"4\n1 2\n1 2\n1 2\n1 1\n",
"7\n4 5\n4 5\n4 5\n4 4\n4 9\n4 10\n4 5\n",
"5\n2 5\n12 9\n7 12\n22 17\n2 3\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"2\n4 7\n4 6\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"24\n7 3\n6 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n7 3\n3 3\n15 19\n2 2\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n"
]
} | 2CODEFORCES
|
634_E. Preorder Test_37984 | For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes in the shape of a tree. Jacob has spent ai minutes building the i-th ball in the tree.
Jacob's teacher will evaluate his model and grade Jacob based on the effort he has put in. However, she does not have enough time to search his whole tree to determine this; Jacob knows that she will examine the first k nodes in a DFS-order traversal of the tree. She will then assign Jacob a grade equal to the minimum ai she finds among those k nodes.
Though Jacob does not have enough time to rebuild his model, he can choose the root node that his teacher starts from. Furthermore, he can rearrange the list of neighbors of each node in any order he likes. Help Jacob find the best grade he can get on this assignment.
A DFS-order traversal is an ordering of the nodes of a rooted tree, built by a recursive DFS-procedure initially called on the root of the tree. When called on a given node v, the procedure does the following:
1. Print v.
2. Traverse the list of neighbors of the node v in order and iteratively call DFS-procedure on each one. Do not call DFS-procedure on node u if you came to node v directly from u.
Input
The first line of the input contains two positive integers, n and k (2 ≤ n ≤ 200 000, 1 ≤ k ≤ n) — the number of balls in Jacob's tree and the number of balls the teacher will inspect.
The second line contains n integers, ai (1 ≤ ai ≤ 1 000 000), the time Jacob used to build the i-th ball.
Each of the next n - 1 lines contains two integers ui, vi (1 ≤ ui, vi ≤ n, ui ≠ vi) representing a connection in Jacob's tree between balls ui and vi.
Output
Print a single integer — the maximum grade Jacob can get by picking the right root of the tree and rearranging the list of neighbors.
Examples
Input
5 3
3 6 1 4 2
1 2
2 4
2 5
1 3
Output
3
Input
4 2
1 5 5 5
1 2
1 3
1 4
Output
1
Note
In the first sample, Jacob can root the tree at node 2 and order 2's neighbors in the order 4, 1, 5 (all other nodes have at most two neighbors). The resulting preorder traversal is 2, 4, 1, 3, 5, and the minimum ai of the first 3 nodes is 3.
In the second sample, it is clear that any preorder traversal will contain node 1 as either its first or second node, so Jacob cannot do better than a grade of 1. | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int in[maxn], in1[maxn];
int dp[maxn];
int dp1[maxn];
int dp2[maxn];
int s[maxn];
int vis[maxn];
int dp3[maxn];
vector<int> g[maxn];
int a[maxn];
int k;
int flag;
void dfs(int u, int pa) {
int p = g[u].size();
dp1[u] = 1;
vis[u] = 1;
for (int i = 0; i < p; i++) {
if (g[u][i] != pa) {
dfs(g[u][i], u);
dp1[u] = max(dp1[u], dp1[g[u][i]] + 1);
}
}
}
int pre[maxn], ou[maxn];
int nex[maxn];
void dfs1(int u, int pa) {
s[u] = 0;
if (in1[u] != in[u]) {
s[u] = 1;
}
int p = (int)g[u].size();
int ss = 0;
int s1 = 0;
int tot = 0;
int y = 0, q = 0;
for (int i = 0; i < p; i++) {
if (g[u][i] != pa) {
dfs1(g[u][i], u);
if (flag) return;
if (s[g[u][i]] == 0) {
ss += dp[g[u][i]];
} else {
s1 = max(s1, dp[g[u][i]]);
s[u] = 1;
y++;
q = g[u][i];
}
}
}
dp[u] = ss + s1 + 1;
dp3[u] = ss;
if (dp[u] >= k) {
flag = 1;
}
if (y == 1 && in[u] == in1[u])
nex[u] = q;
else
nex[u] = 0;
dp2[u] = dp[u];
tot = 0;
for (int i = 0; i < p; i++) {
if (g[u][i] != pa) {
if (s[g[u][i]] == 0) continue;
if (tot == 0)
pre[tot] = dp[g[u][i]];
else
pre[tot] = max(pre[tot - 1], dp[g[u][i]]);
tot++;
}
}
int w = tot;
ou[w] = 0;
for (int i = p - 1; i >= 0; i--) {
if (g[u][i] != pa) {
if (s[g[u][i]] == 0) continue;
w--;
ou[w] = max(ou[w + 1], dp[g[u][i]]);
}
}
int f = 0;
for (int i = 0; i < p; i++) {
if (g[u][i] != pa) {
if (s[g[u][i]] == 0) continue;
if (f == 0) {
dp2[u] = max(dp2[u], dp[g[u][i]] + ou[1] + ss + 1);
} else {
dp2[u] = max(dp2[u], dp[g[u][i]] + max(pre[f - 1], ou[f + 1]) + ss + 1);
}
dp2[u] = max(dp2[u], dp[g[u][i]] + ss + 1);
f++;
}
}
if (dp2[u] >= k) {
flag = 1;
return;
}
if (pa == -1) {
int p = u;
int s = 0;
while (nex[p]) {
s += dp3[p] + 1;
p = nex[p];
if (s + dp2[p] >= k) {
flag = 1;
return;
}
}
}
}
struct pi {
int a;
int b;
} pp[maxn];
int main() {
int i, n;
cin >> n >> k;
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
for (i = 0; i < n - 1; i++) {
scanf("%d%d", &pp[i].a, &pp[i].b);
in[pp[i].a]++;
in[pp[i].b]++;
}
int le = 1, ri = 1000000, mid;
while (le <= ri) {
mid = (le + ri) / 2;
for (i = 1; i <= n; i++) {
g[i].clear();
vis[i] = 0;
in1[i] = 0;
}
for (i = 0; i < n - 1; i++) {
if (a[pp[i].a] < mid || a[pp[i].b] < mid) continue;
g[pp[i].a].push_back(pp[i].b);
g[pp[i].b].push_back(pp[i].a);
in1[pp[i].a]++;
in1[pp[i].b]++;
}
flag = 0;
for (i = 1; i <= n; i++) {
if (a[i] < mid) continue;
if (!vis[i]) {
dfs(i, -1);
dfs1(i, -1);
if (flag) {
break;
}
}
}
if (flag)
le = mid + 1;
else
ri = mid - 1;
}
printf("%d\n", ri);
}
| 2C++
| {
"input": [
"4 2\n1 5 5 5\n1 2\n1 3\n1 4\n",
"5 3\n3 6 1 4 2\n1 2\n2 4\n2 5\n1 3\n",
"2 2\n1 1000000\n1 2\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n1 100000\n2 1\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"2 2\n2 1000000\n1 2\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 1304620 751129 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n0 100000\n2 1\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n10 1\n10 7\n10 8\n",
"4 2\n1 4 5 5\n1 2\n1 3\n1 4\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 1\n0 100100\n2 1\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 1\n0 000100\n2 1\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 232351\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n1 100010\n2 1\n",
"10 6\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 552409\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 1310060\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"2 2\n2 1010000\n1 2\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 2\n2 1000100\n1 2\n",
"10 10\n794273 814140 758469 932911 276337 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 666035 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 149331 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n1 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n9 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n104325 153357 265088 777795 24978 557321 702646 1304620 751129 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 312581 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"10 3\n703660 186846 317819 628672 131569 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n10 1\n10 7\n10 8\n",
"4 2\n1 1 5 5\n1 2\n1 3\n1 4\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n4 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 459825 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 232351\n6 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 186846 317819 1004549 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n9 3\n6 2\n7 1\n10 7\n10 8\n",
"10 3\n703660 312581 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n8 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n4 7\n2 1\n2 9\n5 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 1264167 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n1 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 1264167 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n4 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n1 4\n8 1\n10 7\n8 6\n2 9\n8 2\n3 5\n8 3\n10 8\n",
"2 2\n1 1000010\n1 2\n"
],
"output": [
"1",
"3",
"1",
"557321",
"100000",
"607860",
"252764",
"607860\n",
"2\n",
"557321\n",
"252764\n",
"702646\n",
"100000\n",
"480113\n",
"1\n",
"383577\n",
"100100\n",
"36820\n",
"100\n",
"265088\n",
"100010\n",
"698608\n",
"446635\n",
"744072\n",
"552409\n",
"607860\n",
"607860\n",
"2\n",
"252764\n",
"607860\n",
"2\n",
"36820\n",
"607860\n",
"252764\n",
"557321\n",
"607860\n",
"252764\n",
"702646\n",
"252764\n",
"607860\n",
"480113\n",
"1\n",
"383577\n",
"36820\n",
"265088\n",
"252764\n",
"252764\n",
"383577\n",
"446635\n",
"744072\n",
"446635\n",
"744072\n",
"1\n"
]
} | 2CODEFORCES
|
634_E. Preorder Test_37985 | For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes in the shape of a tree. Jacob has spent ai minutes building the i-th ball in the tree.
Jacob's teacher will evaluate his model and grade Jacob based on the effort he has put in. However, she does not have enough time to search his whole tree to determine this; Jacob knows that she will examine the first k nodes in a DFS-order traversal of the tree. She will then assign Jacob a grade equal to the minimum ai she finds among those k nodes.
Though Jacob does not have enough time to rebuild his model, he can choose the root node that his teacher starts from. Furthermore, he can rearrange the list of neighbors of each node in any order he likes. Help Jacob find the best grade he can get on this assignment.
A DFS-order traversal is an ordering of the nodes of a rooted tree, built by a recursive DFS-procedure initially called on the root of the tree. When called on a given node v, the procedure does the following:
1. Print v.
2. Traverse the list of neighbors of the node v in order and iteratively call DFS-procedure on each one. Do not call DFS-procedure on node u if you came to node v directly from u.
Input
The first line of the input contains two positive integers, n and k (2 ≤ n ≤ 200 000, 1 ≤ k ≤ n) — the number of balls in Jacob's tree and the number of balls the teacher will inspect.
The second line contains n integers, ai (1 ≤ ai ≤ 1 000 000), the time Jacob used to build the i-th ball.
Each of the next n - 1 lines contains two integers ui, vi (1 ≤ ui, vi ≤ n, ui ≠ vi) representing a connection in Jacob's tree between balls ui and vi.
Output
Print a single integer — the maximum grade Jacob can get by picking the right root of the tree and rearranging the list of neighbors.
Examples
Input
5 3
3 6 1 4 2
1 2
2 4
2 5
1 3
Output
3
Input
4 2
1 5 5 5
1 2
1 3
1 4
Output
1
Note
In the first sample, Jacob can root the tree at node 2 and order 2's neighbors in the order 4, 1, 5 (all other nodes have at most two neighbors). The resulting preorder traversal is 2, 4, 1, 3, 5, and the minimum ai of the first 3 nodes is 3.
In the second sample, it is clear that any preorder traversal will contain node 1 as either its first or second node, so Jacob cannot do better than a grade of 1. | import sys
input = sys.stdin.readline
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
g = [[] for _ in range(n)]
for i in range(n - 1):
u, v = map(int, input().split())
g[u-1].append(v-1)
g[v-1].append(u-1)
stack = [0]
done = [False] * n
par = [0] * n
order = []
while len(stack) > 0:
x = stack.pop()
done[x] = True
order.append(x)
for i in g[x]:
if done[i] == False:
par[i] = x
stack.append(i)
order = order[::-1]
sub = [0] * n
for i in order:
sub[i] = 1
for j in g[i]:
if par[j] == i:
sub[i] += sub[j]
def good(guess):
cnt = [0] * n
for i in order:
if a[i] < guess:
continue
cnt[i] = 1
opt = 0
for j in g[i]:
if par[j] == i:
if cnt[j] == sub[j]:
cnt[i] += cnt[j]
else:
opt = max(opt, cnt[j])
cnt[i] += opt
if cnt[0] >= k:
return True
up = [0] * n
for i in order[::-1]:
if a[i] < guess:
continue
opt, secondOpt = 0, 0
total = 1
for j in g[i]:
val, size = 0, 0
if par[j] == i:
val = cnt[j]
size = sub[j]
else:
val = up[i]
size = n - sub[i]
if val == size:
total += val
else:
if opt < val:
opt, secondOpt = val, opt
elif secondOpt < val:
secondOpt = val
for j in g[i]:
if par[j] == i:
up[j] = total
add = opt
if sub[j] == cnt[j]:
up[j] -= cnt[j]
elif cnt[j] == opt:
add = secondOpt
up[j] += add
for i in range(n):
if a[i] < guess:
continue
total, opt = 1, 0
for j in g[i]:
val, size = 0, 0
if par[j] == i:
val = cnt[j]
size = sub[j]
else:
val = up[i]
size = n - sub[i]
if val == size:
total += val
else:
opt = max(opt, val)
if total + opt >= k:
return True
return False
l, r = 0, max(a)
while l < r:
mid = (l + r + 1) // 2
if good(mid):
l = mid
else:
r = mid - 1
print(l) | 3Python3
| {
"input": [
"4 2\n1 5 5 5\n1 2\n1 3\n1 4\n",
"5 3\n3 6 1 4 2\n1 2\n2 4\n2 5\n1 3\n",
"2 2\n1 1000000\n1 2\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n1 100000\n2 1\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"2 2\n2 1000000\n1 2\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 1304620 751129 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n0 100000\n2 1\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n10 1\n10 7\n10 8\n",
"4 2\n1 4 5 5\n1 2\n1 3\n1 4\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 1\n0 100100\n2 1\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 1\n0 000100\n2 1\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 232351\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n1 100010\n2 1\n",
"10 6\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 552409\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 1310060\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"2 2\n2 1010000\n1 2\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 2\n2 1000100\n1 2\n",
"10 10\n794273 814140 758469 932911 276337 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 666035 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 149331 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n1 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n9 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n104325 153357 265088 777795 24978 557321 702646 1304620 751129 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 312581 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"10 3\n703660 186846 317819 628672 131569 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n10 1\n10 7\n10 8\n",
"4 2\n1 1 5 5\n1 2\n1 3\n1 4\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n4 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 459825 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 232351\n6 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 186846 317819 1004549 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n9 3\n6 2\n7 1\n10 7\n10 8\n",
"10 3\n703660 312581 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n8 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n4 7\n2 1\n2 9\n5 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 1264167 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n1 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 1264167 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n4 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n1 4\n8 1\n10 7\n8 6\n2 9\n8 2\n3 5\n8 3\n10 8\n",
"2 2\n1 1000010\n1 2\n"
],
"output": [
"1",
"3",
"1",
"557321",
"100000",
"607860",
"252764",
"607860\n",
"2\n",
"557321\n",
"252764\n",
"702646\n",
"100000\n",
"480113\n",
"1\n",
"383577\n",
"100100\n",
"36820\n",
"100\n",
"265088\n",
"100010\n",
"698608\n",
"446635\n",
"744072\n",
"552409\n",
"607860\n",
"607860\n",
"2\n",
"252764\n",
"607860\n",
"2\n",
"36820\n",
"607860\n",
"252764\n",
"557321\n",
"607860\n",
"252764\n",
"702646\n",
"252764\n",
"607860\n",
"480113\n",
"1\n",
"383577\n",
"36820\n",
"265088\n",
"252764\n",
"252764\n",
"383577\n",
"446635\n",
"744072\n",
"446635\n",
"744072\n",
"1\n"
]
} | 2CODEFORCES
|
634_E. Preorder Test_37986 | For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes in the shape of a tree. Jacob has spent ai minutes building the i-th ball in the tree.
Jacob's teacher will evaluate his model and grade Jacob based on the effort he has put in. However, she does not have enough time to search his whole tree to determine this; Jacob knows that she will examine the first k nodes in a DFS-order traversal of the tree. She will then assign Jacob a grade equal to the minimum ai she finds among those k nodes.
Though Jacob does not have enough time to rebuild his model, he can choose the root node that his teacher starts from. Furthermore, he can rearrange the list of neighbors of each node in any order he likes. Help Jacob find the best grade he can get on this assignment.
A DFS-order traversal is an ordering of the nodes of a rooted tree, built by a recursive DFS-procedure initially called on the root of the tree. When called on a given node v, the procedure does the following:
1. Print v.
2. Traverse the list of neighbors of the node v in order and iteratively call DFS-procedure on each one. Do not call DFS-procedure on node u if you came to node v directly from u.
Input
The first line of the input contains two positive integers, n and k (2 ≤ n ≤ 200 000, 1 ≤ k ≤ n) — the number of balls in Jacob's tree and the number of balls the teacher will inspect.
The second line contains n integers, ai (1 ≤ ai ≤ 1 000 000), the time Jacob used to build the i-th ball.
Each of the next n - 1 lines contains two integers ui, vi (1 ≤ ui, vi ≤ n, ui ≠ vi) representing a connection in Jacob's tree between balls ui and vi.
Output
Print a single integer — the maximum grade Jacob can get by picking the right root of the tree and rearranging the list of neighbors.
Examples
Input
5 3
3 6 1 4 2
1 2
2 4
2 5
1 3
Output
3
Input
4 2
1 5 5 5
1 2
1 3
1 4
Output
1
Note
In the first sample, Jacob can root the tree at node 2 and order 2's neighbors in the order 4, 1, 5 (all other nodes have at most two neighbors). The resulting preorder traversal is 2, 4, 1, 3, 5, and the minimum ai of the first 3 nodes is 3.
In the second sample, it is clear that any preorder traversal will contain node 1 as either its first or second node, so Jacob cannot do better than a grade of 1. | import java.io.*;
import java.util.*;
public class D_new {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
List<Integer>[] g;
int[] size;
int[] bad;
int[] dpDown;
int[] fullMax2;
int[] fullMax;
int[] fullWhoMax;
int[] dpFull;
int[] a;
int n;
int totBad;
int curBest;
void dfs(int v, int p, int least) {
size[v] = 1;
bad[v] = a[v] < least ? 1 : 0;
dpDown[v] = 0;
int maxDown = 0;
for (int to : g[v]) {
if (to == p) {
continue;
}
dfs(to, v, least);
if (bad[to] == 0) {
dpDown[v] += size[to];
} else {
maxDown = Math.max(maxDown, dpDown[to]);
}
size[v] += size[to];
bad[v] += bad[to];
}
if (a[v] < least) {
dpDown[v] = 0;
} else {
dpDown[v] += 1 + maxDown;
}
}
void dfs2(int v, int p, int least) {
dpFull[v] = 0;
fullMax[v] = 0;
fullMax2[v] = 0;
fullWhoMax[v] = -1;
for (int to : g[v]) {
if (to != p) {
if (bad[to] == 0) {
dpFull[v] += size[to];
continue;
}
if (dpDown[to] > fullMax[v]) {
fullMax2[v] = fullMax[v];
fullMax[v] = dpDown[to];
fullWhoMax[v] = to;
} else if (dpDown[to] > fullMax2[v]) {
fullMax2[v] = dpDown[to];
}
}
}
int upMax = 0;
if (p != -1) {
if (bad[v] == totBad) {
dpFull[v] += n - size[v];
} else if (a[p] >= least) {
if (bad[v] == 0) {
upMax = dpFull[p] - size[v];
} else if (v != fullWhoMax[p]) {
upMax = dpFull[p];
} else {
upMax = dpFull[p] - fullMax[p] + fullMax2[p];
}
}
}
if (upMax > fullMax[v]) {
fullMax2[v] = fullMax[v];
fullMax[v] = upMax;
fullWhoMax[v] = p;
} else if (upMax > fullMax2[v]) {
fullMax2[v] = upMax;
}
if (a[v] >= least) {
dpFull[v] += 1 + fullMax[v];
} else {
dpFull[v] = 0;
}
for (int to : g[v]) {
if (to != p) {
dfs2(to, v, least);
}
}
}
boolean can(int least, int need) {
totBad = 0;
for (int i = 0; i < n; i++) {
if (a[i] < least) {
totBad++;
}
}
dfs(0, -1, least);
dfs2(0, -1, least);
for (int i = 0; i < n; i++) {
if (dpFull[i] >= need) {
return true;
}
}
return false;
}
void solve() throws IOException {
n = nextInt();
int k = nextInt();
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
g = new List[n];
for (int i = 0; i < n; i++) {
g[i] = new ArrayList<>();
}
for (int i = 0; i < n - 1; i++) {
int v1 = nextInt() - 1;
int v2 = nextInt() - 1;
g[v1].add(v2);
g[v2].add(v1);
}
int low = 0;
int high = 1_000_001;
size = new int[n];
bad = new int[n];
dpDown = new int[n];
fullMax = new int[n];
fullMax2 = new int[n];
fullWhoMax = new int[n];
dpFull = new int[n];
while (high - low > 1) {
int mid = (low + high) >> 1;
if (can(mid, k)) {
low = mid;
} else {
high = mid;
}
}
out.println(low);
}
D_new() throws IOException {
br = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWriter(System.out);
solve();
out.close();
}
public static void main(String[] args) throws IOException {
new D_new();
}
String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (Exception e) {
eof = true;
return null;
}
}
return st.nextToken();
}
String nextString() {
try {
return br.readLine();
} catch (IOException e) {
eof = true;
return null;
}
}
int nextInt() throws IOException {
return Integer.parseInt(nextToken());
}
long nextLong() throws IOException {
return Long.parseLong(nextToken());
}
double nextDouble() throws IOException {
return Double.parseDouble(nextToken());
}
} | 4JAVA
| {
"input": [
"4 2\n1 5 5 5\n1 2\n1 3\n1 4\n",
"5 3\n3 6 1 4 2\n1 2\n2 4\n2 5\n1 3\n",
"2 2\n1 1000000\n1 2\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n1 100000\n2 1\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"2 2\n2 1000000\n1 2\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 1304620 751129 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n0 100000\n2 1\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n10 1\n10 7\n10 8\n",
"4 2\n1 4 5 5\n1 2\n1 3\n1 4\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 1\n0 100100\n2 1\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 1\n0 000100\n2 1\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 232351\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"2 1\n1 100010\n2 1\n",
"10 6\n794273 814140 758469 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 552409\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 652494 952171 1310060\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"2 2\n2 1010000\n1 2\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"2 2\n2 1000100\n1 2\n",
"10 10\n794273 814140 758469 932911 276337 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 607860 683826 987442 666035 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 149331 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n1 9\n3 10\n6 4\n9 6\n3 5\n",
"10 3\n703660 186846 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n9 3\n6 2\n7 1\n10 7\n10 8\n",
"10 4\n104325 153357 265088 777795 24978 557321 702646 1304620 751129 744072\n9 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 312581 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n9 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n794273 814140 758469 932911 607860 1310013 987442 652494 952171 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n6 5\n",
"10 3\n703660 186846 317819 628672 131569 58472 247014 480113 252764 860936\n10 6\n7 4\n10 9\n9 5\n6 3\n6 2\n10 1\n10 7\n10 8\n",
"4 2\n1 1 5 5\n1 2\n1 3\n1 4\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n4 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 814140 758469 932911 459825 1310013 987442 652494 952171 36820\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 4\n104325 153357 265088 777795 337716 557321 702646 734430 464449 232351\n6 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 3\n703660 186846 317819 1004549 74457 58472 247014 480113 252764 1263340\n10 6\n7 4\n10 9\n9 5\n9 3\n6 2\n7 1\n10 7\n10 8\n",
"10 3\n703660 312581 317819 628672 74457 58472 247014 480113 252764 1263340\n10 6\n6 4\n10 9\n8 5\n6 3\n6 2\n7 1\n10 7\n10 8\n",
"10 10\n383577 814140 1399186 932911 607860 683826 987442 652494 952171 698608\n1 3\n3 8\n4 7\n2 1\n2 9\n5 10\n6 4\n9 6\n3 5\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 1264167 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n3 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n1 4\n8 1\n10 7\n8 6\n7 9\n8 2\n3 5\n8 3\n10 8\n",
"10 10\n794273 446635 758469 932911 607860 683826 987442 666035 1264167 698608\n1 3\n3 8\n2 7\n2 1\n2 9\n3 10\n6 4\n9 6\n4 5\n",
"10 2\n14320 153357 265088 777795 337716 557321 702646 1304620 464449 744072\n1 4\n8 1\n10 7\n8 6\n2 9\n8 2\n3 5\n8 3\n10 8\n",
"2 2\n1 1000010\n1 2\n"
],
"output": [
"1",
"3",
"1",
"557321",
"100000",
"607860",
"252764",
"607860\n",
"2\n",
"557321\n",
"252764\n",
"702646\n",
"100000\n",
"480113\n",
"1\n",
"383577\n",
"100100\n",
"36820\n",
"100\n",
"265088\n",
"100010\n",
"698608\n",
"446635\n",
"744072\n",
"552409\n",
"607860\n",
"607860\n",
"2\n",
"252764\n",
"607860\n",
"2\n",
"36820\n",
"607860\n",
"252764\n",
"557321\n",
"607860\n",
"252764\n",
"702646\n",
"252764\n",
"607860\n",
"480113\n",
"1\n",
"383577\n",
"36820\n",
"265088\n",
"252764\n",
"252764\n",
"383577\n",
"446635\n",
"744072\n",
"446635\n",
"744072\n",
"1\n"
]
} | 2CODEFORCES
|
663_C. Graph Coloring_37987 | You are given an undirected graph that consists of n vertices and m edges. Initially, each edge is colored either red or blue. Each turn a player picks a single vertex and switches the color of all edges incident to it. That is, all red edges with an endpoint in this vertex change the color to blue, while all blue edges with an endpoint in this vertex change the color to red.
Find the minimum possible number of moves required to make the colors of all edges equal.
Input
The first line of the input contains two integers n and m (1 ≤ n, m ≤ 100 000) — the number of vertices and edges, respectively.
The following m lines provide the description of the edges, as the i-th of them contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the indices of the vertices connected by the i-th edge, and a character ci (<image>) providing the initial color of this edge. If ci equals 'R', then this edge is initially colored red. Otherwise, ci is equal to 'B' and this edge is initially colored blue. It's guaranteed that there are no self-loops and multiple edges.
Output
If there is no way to make the colors of all edges equal output - 1 in the only line of the output. Otherwise first output k — the minimum number of moves required to achieve the goal, then output k integers a1, a2, ..., ak, where ai is equal to the index of the vertex that should be used at the i-th move.
If there are multiple optimal sequences of moves, output any of them.
Examples
Input
3 3
1 2 B
3 1 R
3 2 B
Output
1
2
Input
6 5
1 3 R
2 3 R
3 4 B
4 5 R
4 6 R
Output
2
3 4
Input
4 5
1 2 R
1 3 R
2 3 B
3 4 B
1 4 B
Output
-1 | n, e = map(int, raw_input().strip().split())
adj1 = [[] for i in xrange(n)]
adj2 = [[] for i in xrange(n)]
for i in xrange(e):
a, b, c = raw_input().strip().split()
a = int(a) - 1
b = int(b) - 1
if c == 'B':
adj1[a].append((b, 0))
adj1[b].append((a, 0))
adj2[a].append((b, 1))
adj2[b].append((a, 1))
else:
adj1[a].append((b, 1))
adj1[b].append((a, 1))
adj2[a].append((b, 0))
adj2[b].append((a, 0))
def res(adj):
result = []
color = [-1]*n
for i in xrange(n):
if color[i] >= 0: continue
part = [[], []]
queue = [i]
color[i] = 0
part[color[i]].append(i)
f = 0
while f < len(queue):
i = queue[f]; f += 1
for j, c in adj[i]:
if color[j] >= 0:
if (color[i] == color[j]) != c:
return [0]*(n+1)
else:
color[j] = color[i] if c else not color[i]
part[color[j]].append(j)
queue.append(j)
result += min(part, key=lambda x: len(x))
return result
ans = min(res(adj1), res(adj2), key=lambda x: len(x))
if len(ans) <= n:
print len(ans)
print ' '.join(str(v+1) for v in ans)
else:
print -1
| 1Python2
| {
"input": [
"6 5\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"3 3\n1 2 B\n3 1 R\n3 2 B\n",
"4 5\n1 2 R\n1 3 R\n2 3 B\n3 4 B\n1 4 B\n",
"2 1\n1 2 B\n",
"3 3\n1 2 R\n1 3 R\n2 3 R\n",
"11 7\n1 2 B\n1 3 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"6 6\n1 2 R\n1 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"5 3\n1 2 B\n3 1 R\n3 2 B\n",
"5 3\n1 3 B\n3 1 R\n3 2 B\n",
"3 3\n1 2 R\n1 3 R\n2 1 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 9 R\n10 11 R\n",
"5 3\n1 2 B\n3 1 R\n3 3 B\n",
"14 7\n1 1 B\n1 4 R\n3 4 R\n3 7 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 3 R\n4 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"14 7\n1 3 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"9 3\n1 3 B\n3 1 R\n3 2 B\n",
"11 7\n1 2 B\n1 3 R\n1 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"3 3\n1 2 R\n1 3 R\n2 2 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"11 7\n1 2 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"5 3\n1 3 B\n3 1 R\n3 1 B\n",
"3 3\n1 1 R\n1 3 R\n2 1 R\n",
"11 7\n1 2 B\n1 3 R\n2 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"11 7\n1 3 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 3 R\n2 2 R\n4 9 R\n6 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 10 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n3 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n7 10 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n3 7 R\n6 7 R\n8 9 R\n9 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 A\n4 5 R\n7 10 R\n",
"6 1\n1 2 R\n1 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"6 5\n1 3 R\n2 3 R\n3 1 B\n4 5 R\n4 6 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 7 R\n9 11 R\n",
"9 3\n1 3 B\n3 1 R\n3 3 B\n",
"11 7\n1 2 B\n1 3 R\n1 2 R\n4 5 R\n6 7 R\n4 9 R\n10 11 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 3 R\n10 11 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n1 6 R\n",
"3 3\n1 1 R\n1 3 R\n2 2 R\n",
"11 7\n1 2 B\n1 5 R\n2 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n8 6 R\n",
"1 0\n1 0 R\n2 3 R\n3 4 B\n4 5 R\n4 10 R\n",
"1 0\n1 4 R\n2 3 R\n3 4 B\n4 5 R\n7 10 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 A\n4 5 R\n2 10 R\n",
"11 7\n1 2 B\n1 3 R\n4 2 R\n4 6 R\n6 7 R\n8 9 R\n10 11 R\n",
"6 1\n1 2 R\n2 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 9 R\n8 7 R\n9 11 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n1 8 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 0 R\n8 6 R\n",
"1 0\n1 0 R\n2 3 R\n0 4 B\n4 5 R\n4 10 R\n",
"1 0\n1 4 R\n2 3 R\n3 4 B\n4 0 R\n7 10 R\n"
],
"output": [
"2\n3 4 \n",
"1\n2 \n",
"-1\n",
"0\n\n",
"0\n\n",
"5\n3 4 6 8 10\n",
"-1\n",
"2\n2 3 \n",
"1\n2 \n",
"-1\n",
"0\n\n",
"3\n1 4 5 \n",
"1\n3 \n",
"3\n4 7 9 \n",
"2\n1 3 \n",
"3\n4 6 9 \n",
"2\n2 3 \n",
"-1\n",
"-1\n",
"0\n\n",
"0\n\n",
"1\n2 \n",
"-1\n",
"0\n\n",
"1\n2 \n",
"3\n1 4 5 \n",
"0\n\n",
"1\n2 \n",
"1\n2 \n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"0\n\n",
"-1\n",
"2\n2 3 \n",
"-1\n",
"-1\n",
"3\n1 4 5 \n",
"0\n\n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"0\n\n",
"0\n\n",
"0\n\n",
"2\n1 3 \n",
"0\n\n",
"2\n2 3 \n",
"0\n\n",
"0\n\n",
"0\n\n",
"0\n\n"
]
} | 2CODEFORCES
|
663_C. Graph Coloring_37988 | You are given an undirected graph that consists of n vertices and m edges. Initially, each edge is colored either red or blue. Each turn a player picks a single vertex and switches the color of all edges incident to it. That is, all red edges with an endpoint in this vertex change the color to blue, while all blue edges with an endpoint in this vertex change the color to red.
Find the minimum possible number of moves required to make the colors of all edges equal.
Input
The first line of the input contains two integers n and m (1 ≤ n, m ≤ 100 000) — the number of vertices and edges, respectively.
The following m lines provide the description of the edges, as the i-th of them contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the indices of the vertices connected by the i-th edge, and a character ci (<image>) providing the initial color of this edge. If ci equals 'R', then this edge is initially colored red. Otherwise, ci is equal to 'B' and this edge is initially colored blue. It's guaranteed that there are no self-loops and multiple edges.
Output
If there is no way to make the colors of all edges equal output - 1 in the only line of the output. Otherwise first output k — the minimum number of moves required to achieve the goal, then output k integers a1, a2, ..., ak, where ai is equal to the index of the vertex that should be used at the i-th move.
If there are multiple optimal sequences of moves, output any of them.
Examples
Input
3 3
1 2 B
3 1 R
3 2 B
Output
1
2
Input
6 5
1 3 R
2 3 R
3 4 B
4 5 R
4 6 R
Output
2
3 4
Input
4 5
1 2 R
1 3 R
2 3 B
3 4 B
1 4 B
Output
-1 | #include <bits/stdc++.h>
using namespace std;
int INT_MAX_VAL = (int)0x3F3F3F3F;
int INT_MIN_VAL = (int)-0x3F3F3F3F;
long long LONG_MAX_VAL = (long long)0x3F3F3F3F3F3F3F3F;
long long LONG_MIN_VAL = (long long)-0x3F3F3F3F3F3F3F3F;
int colors[500006];
vector<pair<int, char> > graph[500006];
int n, m;
int dfs(int v, char c, vector<int>& red, vector<int>& blue) {
for (auto& p : graph[v]) {
int w = p.first;
int use_color = (c == p.second) ? colors[v] : (3 - colors[v]);
if (colors[w] == 0) {
colors[w] = use_color;
if (use_color == 1) {
red.push_back(w);
} else {
blue.push_back(w);
}
dfs(w, c, red, blue);
} else if (colors[w] != use_color) {
return false;
}
}
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int v, w;
char c;
cin >> v >> w >> c;
graph[v].emplace_back(w, c);
graph[w].emplace_back(v, c);
}
bool is_result = false;
vector<int> result;
for (int z = 0; z < 2; ++z) {
bool is_good = true;
vector<int> current;
for (int i = 1; i <= n; ++i) colors[i] = 0;
for (int i = 1; i <= n; ++i) {
if (colors[i] == 0) {
vector<int> red = {i};
colors[i] = 1;
vector<int> blue;
bool res = dfs(i, (z == 0) ? 'B' : 'R', red, blue);
if (!res) {
is_good = false;
break;
}
if (red.size() > blue.size()) swap(red, blue);
for (auto p : red) current.push_back(p);
}
}
if (is_good) {
if (!is_result || result.size() > current.size()) {
result = current;
is_result = true;
}
}
}
if (is_result) {
cout << result.size() << '\n';
for (auto& a : result) {
cout << a << " ";
}
cout << '\n';
} else {
cout << -1 << '\n';
}
return 0;
}
| 2C++
| {
"input": [
"6 5\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"3 3\n1 2 B\n3 1 R\n3 2 B\n",
"4 5\n1 2 R\n1 3 R\n2 3 B\n3 4 B\n1 4 B\n",
"2 1\n1 2 B\n",
"3 3\n1 2 R\n1 3 R\n2 3 R\n",
"11 7\n1 2 B\n1 3 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"6 6\n1 2 R\n1 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"5 3\n1 2 B\n3 1 R\n3 2 B\n",
"5 3\n1 3 B\n3 1 R\n3 2 B\n",
"3 3\n1 2 R\n1 3 R\n2 1 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 9 R\n10 11 R\n",
"5 3\n1 2 B\n3 1 R\n3 3 B\n",
"14 7\n1 1 B\n1 4 R\n3 4 R\n3 7 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 3 R\n4 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"14 7\n1 3 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"9 3\n1 3 B\n3 1 R\n3 2 B\n",
"11 7\n1 2 B\n1 3 R\n1 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"3 3\n1 2 R\n1 3 R\n2 2 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"11 7\n1 2 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"5 3\n1 3 B\n3 1 R\n3 1 B\n",
"3 3\n1 1 R\n1 3 R\n2 1 R\n",
"11 7\n1 2 B\n1 3 R\n2 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"11 7\n1 3 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 3 R\n2 2 R\n4 9 R\n6 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 10 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n3 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n7 10 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n3 7 R\n6 7 R\n8 9 R\n9 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 A\n4 5 R\n7 10 R\n",
"6 1\n1 2 R\n1 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"6 5\n1 3 R\n2 3 R\n3 1 B\n4 5 R\n4 6 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 7 R\n9 11 R\n",
"9 3\n1 3 B\n3 1 R\n3 3 B\n",
"11 7\n1 2 B\n1 3 R\n1 2 R\n4 5 R\n6 7 R\n4 9 R\n10 11 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 3 R\n10 11 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n1 6 R\n",
"3 3\n1 1 R\n1 3 R\n2 2 R\n",
"11 7\n1 2 B\n1 5 R\n2 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n8 6 R\n",
"1 0\n1 0 R\n2 3 R\n3 4 B\n4 5 R\n4 10 R\n",
"1 0\n1 4 R\n2 3 R\n3 4 B\n4 5 R\n7 10 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 A\n4 5 R\n2 10 R\n",
"11 7\n1 2 B\n1 3 R\n4 2 R\n4 6 R\n6 7 R\n8 9 R\n10 11 R\n",
"6 1\n1 2 R\n2 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 9 R\n8 7 R\n9 11 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n1 8 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 0 R\n8 6 R\n",
"1 0\n1 0 R\n2 3 R\n0 4 B\n4 5 R\n4 10 R\n",
"1 0\n1 4 R\n2 3 R\n3 4 B\n4 0 R\n7 10 R\n"
],
"output": [
"2\n3 4 \n",
"1\n2 \n",
"-1\n",
"0\n\n",
"0\n\n",
"5\n3 4 6 8 10\n",
"-1\n",
"2\n2 3 \n",
"1\n2 \n",
"-1\n",
"0\n\n",
"3\n1 4 5 \n",
"1\n3 \n",
"3\n4 7 9 \n",
"2\n1 3 \n",
"3\n4 6 9 \n",
"2\n2 3 \n",
"-1\n",
"-1\n",
"0\n\n",
"0\n\n",
"1\n2 \n",
"-1\n",
"0\n\n",
"1\n2 \n",
"3\n1 4 5 \n",
"0\n\n",
"1\n2 \n",
"1\n2 \n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"0\n\n",
"-1\n",
"2\n2 3 \n",
"-1\n",
"-1\n",
"3\n1 4 5 \n",
"0\n\n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"0\n\n",
"0\n\n",
"0\n\n",
"2\n1 3 \n",
"0\n\n",
"2\n2 3 \n",
"0\n\n",
"0\n\n",
"0\n\n",
"0\n\n"
]
} | 2CODEFORCES
|
663_C. Graph Coloring_37989 | You are given an undirected graph that consists of n vertices and m edges. Initially, each edge is colored either red or blue. Each turn a player picks a single vertex and switches the color of all edges incident to it. That is, all red edges with an endpoint in this vertex change the color to blue, while all blue edges with an endpoint in this vertex change the color to red.
Find the minimum possible number of moves required to make the colors of all edges equal.
Input
The first line of the input contains two integers n and m (1 ≤ n, m ≤ 100 000) — the number of vertices and edges, respectively.
The following m lines provide the description of the edges, as the i-th of them contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the indices of the vertices connected by the i-th edge, and a character ci (<image>) providing the initial color of this edge. If ci equals 'R', then this edge is initially colored red. Otherwise, ci is equal to 'B' and this edge is initially colored blue. It's guaranteed that there are no self-loops and multiple edges.
Output
If there is no way to make the colors of all edges equal output - 1 in the only line of the output. Otherwise first output k — the minimum number of moves required to achieve the goal, then output k integers a1, a2, ..., ak, where ai is equal to the index of the vertex that should be used at the i-th move.
If there are multiple optimal sequences of moves, output any of them.
Examples
Input
3 3
1 2 B
3 1 R
3 2 B
Output
1
2
Input
6 5
1 3 R
2 3 R
3 4 B
4 5 R
4 6 R
Output
2
3 4
Input
4 5
1 2 R
1 3 R
2 3 B
3 4 B
1 4 B
Output
-1 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
GraphColoring solver = new GraphColoring();
solver.solve(1, in, out);
out.close();
}
static class GraphColoring {
ArrayList<Edge>[] edges = new ArrayList[100001];
int INF = 1000001;
boolean[][] has = new boolean[2][100001];
boolean works = true;
int c = 0;
int res = INF;
GraphColoring.State[][] included = new GraphColoring.State[2][100001];
ArrayList<Integer>[] ans = new ArrayList[]{new ArrayList<>(), new ArrayList<>()};
public void solve(int testNumber, InputReader in, PrintWriter out) {
int N = in.nextInt();
int M = in.nextInt();
for (int i = 0; i < N; i++) {
edges[i] = new ArrayList<>();
}
for (int i = 0; i < M; i++) {
int a = in.nextInt() - 1;
int b = in.nextInt() - 1;
int c = (in.next().charAt(0) == 'B' ? 1 : 0);
edges[a].add(new Edge(b, c));
edges[b].add(new Edge(a, c));
}
ArrayList<Integer> resArr = new ArrayList<>();
for (int i = 0; i < N; i++) {
for (Edge e : edges[i]) {
has[e.a][i] = true;
}
}
for (int col = 0; col <= 1; col++) {
c = 0;
included = new GraphColoring.State[2][N];
for (int j = 0; j < 2; j++) {
for (int i = 0; i < N; i++) {
included[j][i] = GraphColoring.State.none;
}
}
works = true;
ArrayList<Integer> total = new ArrayList<>();
for (int i = 0; i < N; i++) {
if (included[0][i] == GraphColoring.State.none) {
c = 0;
ans = new ArrayList[]{new ArrayList<>(), new ArrayList<>()};
included[0][i] = GraphColoring.State.include;
dfs(i, col, 0);
if (!works) {
break;
}
if (ans[0].size() < ans[1].size()) {
total.addAll(ans[0]);
} else {
total.addAll(ans[1]);
}
}
}
if (works) {
if (total.size() < res) {
resArr = (ArrayList<Integer>) total.clone();
res = total.size();
}
}
}
if (res == INF) {
out.println(-1);
} else {
print(out, resArr);
}
}
void print(PrintWriter out, ArrayList<Integer> arr) {
out.println(arr.size());
for (int i : arr) {
out.println(i + 1);
}
}
void dfs(int n, int col, int c) {
for (Edge e : edges[n]) {
if (e.a == col) {
if (included[c][e.to] != GraphColoring.State.none && included[c][e.to] != included[c][n]) {
works = false;
} else if (included[c][e.to] == GraphColoring.State.none) {
included[c][e.to] = included[c][n];
dfs(e.to, col, c);
}
} else {
if (included[c][e.to] != GraphColoring.State.none && included[c][e.to] == included[c][n]) {
works = false;
} else if (included[c][e.to] == GraphColoring.State.none) {
included[c][e.to] = change(included[c][n]);
dfs(e.to, col, c);
}
}
}
if (included[c][n] == GraphColoring.State.include) {
ans[0].add(n);
} else {
ans[1].add(n);
}
}
GraphColoring.State change(GraphColoring.State a) {
assert a != GraphColoring.State.none : "Weird state";
if (a == GraphColoring.State.include) {
return GraphColoring.State.notinclude;
}
return GraphColoring.State.include;
}
enum State {
none,
include,
notinclude,
;
}
class Edge {
int to;
int a;
Edge(int to, int a) {
this.to = to;
this.a = a;
}
}
}
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
| 4JAVA
| {
"input": [
"6 5\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"3 3\n1 2 B\n3 1 R\n3 2 B\n",
"4 5\n1 2 R\n1 3 R\n2 3 B\n3 4 B\n1 4 B\n",
"2 1\n1 2 B\n",
"3 3\n1 2 R\n1 3 R\n2 3 R\n",
"11 7\n1 2 B\n1 3 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"6 6\n1 2 R\n1 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"5 3\n1 2 B\n3 1 R\n3 2 B\n",
"5 3\n1 3 B\n3 1 R\n3 2 B\n",
"3 3\n1 2 R\n1 3 R\n2 1 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 9 R\n10 11 R\n",
"5 3\n1 2 B\n3 1 R\n3 3 B\n",
"14 7\n1 1 B\n1 4 R\n3 4 R\n3 7 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 3 R\n4 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"14 7\n1 3 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"9 3\n1 3 B\n3 1 R\n3 2 B\n",
"11 7\n1 2 B\n1 3 R\n1 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"3 3\n1 2 R\n1 3 R\n2 2 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"11 7\n1 2 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"5 3\n1 3 B\n3 1 R\n3 1 B\n",
"3 3\n1 1 R\n1 3 R\n2 1 R\n",
"11 7\n1 2 B\n1 3 R\n2 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"11 7\n1 3 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n4 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"11 7\n1 2 B\n1 3 R\n2 2 R\n4 9 R\n6 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 10 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n3 5 R\n6 7 R\n8 9 R\n9 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n7 10 R\n",
"14 7\n1 2 B\n1 4 R\n3 4 R\n3 7 R\n6 7 R\n8 9 R\n9 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 A\n4 5 R\n7 10 R\n",
"6 1\n1 2 R\n1 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"6 5\n1 3 R\n2 3 R\n3 1 B\n4 5 R\n4 6 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 7 R\n8 7 R\n9 11 R\n",
"9 3\n1 3 B\n3 1 R\n3 3 B\n",
"11 7\n1 2 B\n1 3 R\n1 2 R\n4 5 R\n6 7 R\n4 9 R\n10 11 R\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n2 7 R\n8 3 R\n10 11 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n1 6 R\n",
"3 3\n1 1 R\n1 3 R\n2 2 R\n",
"11 7\n1 2 B\n1 5 R\n2 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n8 6 R\n",
"1 0\n1 0 R\n2 3 R\n3 4 B\n4 5 R\n4 10 R\n",
"1 0\n1 4 R\n2 3 R\n3 4 B\n4 5 R\n7 10 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 A\n4 5 R\n2 10 R\n",
"11 7\n1 2 B\n1 3 R\n4 2 R\n4 6 R\n6 7 R\n8 9 R\n10 11 R\n",
"6 1\n1 2 R\n2 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n",
"11 7\n1 2 B\n1 4 R\n3 2 R\n4 5 R\n6 9 R\n8 7 R\n9 11 R\n",
"6 0\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n1 8 R\n",
"1 0\n1 3 R\n2 3 R\n3 4 B\n4 0 R\n8 6 R\n",
"1 0\n1 0 R\n2 3 R\n0 4 B\n4 5 R\n4 10 R\n",
"1 0\n1 4 R\n2 3 R\n3 4 B\n4 0 R\n7 10 R\n"
],
"output": [
"2\n3 4 \n",
"1\n2 \n",
"-1\n",
"0\n\n",
"0\n\n",
"5\n3 4 6 8 10\n",
"-1\n",
"2\n2 3 \n",
"1\n2 \n",
"-1\n",
"0\n\n",
"3\n1 4 5 \n",
"1\n3 \n",
"3\n4 7 9 \n",
"2\n1 3 \n",
"3\n4 6 9 \n",
"2\n2 3 \n",
"-1\n",
"-1\n",
"0\n\n",
"0\n\n",
"1\n2 \n",
"-1\n",
"0\n\n",
"1\n2 \n",
"3\n1 4 5 \n",
"0\n\n",
"1\n2 \n",
"1\n2 \n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"0\n\n",
"-1\n",
"2\n2 3 \n",
"-1\n",
"-1\n",
"3\n1 4 5 \n",
"0\n\n",
"0\n\n",
"1\n2 \n",
"0\n\n",
"0\n\n",
"0\n\n",
"0\n\n",
"2\n1 3 \n",
"0\n\n",
"2\n2 3 \n",
"0\n\n",
"0\n\n",
"0\n\n",
"0\n\n"
]
} | 2CODEFORCES
|
688_A. Opponents_37990 | Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.
Input
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) — the number of opponents and the number of days, respectively.
The i-th of the following d lines contains a string of length n consisting of characters '0' and '1'. The j-th character of this string is '0' if the j-th opponent is going to be absent on the i-th day.
Output
Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.
Examples
Input
2 2
10
00
Output
2
Input
4 1
0100
Output
1
Input
4 5
1101
1111
0110
1011
1111
Output
2
Note
In the first and the second samples, Arya will beat all present opponents each of the d days.
In the third sample, Arya will beat his opponents on days 1, 3 and 4 and his opponents will beat him on days 2 and 5. Thus, the maximum number of consecutive winning days is 2, which happens on days 3 and 4. | n,d = map(int, raw_input().split())
f = [0 for i in xrange(d)]
ans = 0
cnt = 0
for i in xrange(d):
s = raw_input()
if s.count('0'):
cnt += 1
else:
cnt = 0
ans = max(ans, cnt)
print ans | 1Python2
| {
"input": [
"4 5\n1101\n1111\n0110\n1011\n1111\n",
"2 2\n10\n00\n",
"4 1\n0100\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"100 1\n1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"2 2\n11\n10\n",
"100 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"10 10\n1100110010\n0000000001\n1011100111\n1111111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n11111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11111\n00111\n",
"1 100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n1\n0\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n1\n0\n0\n",
"10 7\n0000111001\n1111111111\n0110110001\n1111111111\n1111111111\n1000111100\n0110000111\n",
"3 2\n110\n110\n",
"1 1\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11110\n01101\n11111\n10001\n11111\n01001\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100101110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"10 6\n1111111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"1 1\n1\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1101111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"10 10\n1100110010\n0000000001\n1011100111\n1110111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"1 100\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11010\n01101\n11111\n10001\n11111\n01001\n",
"3 2\n111\n111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n11111\n",
"3 2\n110\n111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"3 2\n10\n00\n",
"2 1\n0100\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n10010\n10111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11111\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00010\n10111\n11111\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n10110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00000\n10111\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00000\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"101 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"5 8\n11111\n10110\n01001\n10111\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110001\n1101111111\n1111111111\n1000111100\n0110000111\n",
"2 1\n0\n",
"5 9\n11111\n11111\n11111\n11011\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1111\n",
"8 1\n0100\n",
"5 10\n01110\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001101000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10000\n",
"10 10\n0000110011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111110111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11101\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0111111111\n",
"5 8\n11011\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11011\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01000\n10101\n11111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"100 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1101\n",
"5 10\n01110\n10010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10110\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00010\n11101\n00111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10001\n",
"10 10\n0000110011\n0100001111\n1111111101\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111010111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11110\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11100\n01111\n",
"5 9\n11101\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n10111\n11111\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0110001001\n1101010110\n0111111111\n",
"5 10\n11011\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0101111111\n",
"5 8\n11011\n10111\n01000\n11111\n01110\n00000\n10111\n11111\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11011\n",
"5 8\n11111\n10101\n01000\n11111\n01100\n01000\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1110111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n10100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n10111\n",
"111 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0100111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"110 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001110\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1101\n0110\n1011\n1101\n"
],
"output": [
"2",
"2",
"1",
"49",
"0",
"1",
"2",
"1",
"1",
"3",
"2",
"3",
"0",
"1",
"100",
"6",
"2",
"2",
"1",
"6",
"1",
"1",
"4",
"1",
"0",
"40\n",
"2\n",
"3\n",
"5\n",
"1\n",
"52\n",
"7\n",
"4\n",
"97\n",
"6\n",
"0\n",
"37\n",
"43\n",
"3\n",
"1\n",
"2\n",
"5\n",
"2\n",
"2\n",
"1\n",
"3\n",
"3\n",
"5\n",
"2\n",
"5\n",
"2\n",
"3\n",
"2\n",
"2\n",
"3\n",
"7\n",
"3\n",
"3\n",
"3\n",
"3\n",
"40\n",
"1\n",
"3\n",
"1\n",
"5\n",
"1\n",
"2\n",
"1\n",
"2\n",
"1\n",
"6\n",
"2\n",
"1\n",
"3\n",
"4\n",
"5\n",
"1\n",
"52\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"3\n",
"7\n",
"2\n",
"7\n",
"3\n",
"4\n",
"3\n",
"3\n",
"1\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"3\n",
"3\n",
"4\n",
"5\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"2\n",
"7\n",
"3\n",
"7\n",
"3\n",
"4\n",
"3\n",
"40\n",
"3\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"5\n"
]
} | 2CODEFORCES
|
688_A. Opponents_37991 | Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.
Input
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) — the number of opponents and the number of days, respectively.
The i-th of the following d lines contains a string of length n consisting of characters '0' and '1'. The j-th character of this string is '0' if the j-th opponent is going to be absent on the i-th day.
Output
Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.
Examples
Input
2 2
10
00
Output
2
Input
4 1
0100
Output
1
Input
4 5
1101
1111
0110
1011
1111
Output
2
Note
In the first and the second samples, Arya will beat all present opponents each of the d days.
In the third sample, Arya will beat his opponents on days 1, 3 and 4 and his opponents will beat him on days 2 and 5. Thus, the maximum number of consecutive winning days is 2, which happens on days 3 and 4. | #include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int n, d, ans, hahaha[maxn];
char s[maxn];
bool pd[maxn];
int main() {
scanf("%d%d", &n, &d);
for (int i = 1; i <= d; i++) {
scanf("%s", s + 1);
for (int j = 1; j <= n; j++)
if (s[j] == '0') pd[i] = 1;
}
for (int i = 1; i <= d; i++) {
if (pd[i] && pd[i - 1])
hahaha[i] = hahaha[i - 1] + 1;
else if (pd[i] && !pd[i - 1])
hahaha[i] = 1;
else if (!pd[i])
hahaha[i] = 0;
}
for (int i = 1; i <= d; i++) ans = max(hahaha[i], ans);
cout << ans << endl;
return 0;
}
| 2C++
| {
"input": [
"4 5\n1101\n1111\n0110\n1011\n1111\n",
"2 2\n10\n00\n",
"4 1\n0100\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"100 1\n1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"2 2\n11\n10\n",
"100 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"10 10\n1100110010\n0000000001\n1011100111\n1111111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n11111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11111\n00111\n",
"1 100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n1\n0\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n1\n0\n0\n",
"10 7\n0000111001\n1111111111\n0110110001\n1111111111\n1111111111\n1000111100\n0110000111\n",
"3 2\n110\n110\n",
"1 1\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11110\n01101\n11111\n10001\n11111\n01001\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100101110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"10 6\n1111111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"1 1\n1\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1101111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"10 10\n1100110010\n0000000001\n1011100111\n1110111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"1 100\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11010\n01101\n11111\n10001\n11111\n01001\n",
"3 2\n111\n111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n11111\n",
"3 2\n110\n111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"3 2\n10\n00\n",
"2 1\n0100\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n10010\n10111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11111\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00010\n10111\n11111\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n10110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00000\n10111\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00000\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"101 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"5 8\n11111\n10110\n01001\n10111\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110001\n1101111111\n1111111111\n1000111100\n0110000111\n",
"2 1\n0\n",
"5 9\n11111\n11111\n11111\n11011\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1111\n",
"8 1\n0100\n",
"5 10\n01110\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001101000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10000\n",
"10 10\n0000110011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111110111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11101\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0111111111\n",
"5 8\n11011\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11011\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01000\n10101\n11111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"100 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1101\n",
"5 10\n01110\n10010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10110\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00010\n11101\n00111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10001\n",
"10 10\n0000110011\n0100001111\n1111111101\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111010111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11110\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11100\n01111\n",
"5 9\n11101\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n10111\n11111\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0110001001\n1101010110\n0111111111\n",
"5 10\n11011\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0101111111\n",
"5 8\n11011\n10111\n01000\n11111\n01110\n00000\n10111\n11111\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11011\n",
"5 8\n11111\n10101\n01000\n11111\n01100\n01000\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1110111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n10100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n10111\n",
"111 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0100111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"110 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001110\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1101\n0110\n1011\n1101\n"
],
"output": [
"2",
"2",
"1",
"49",
"0",
"1",
"2",
"1",
"1",
"3",
"2",
"3",
"0",
"1",
"100",
"6",
"2",
"2",
"1",
"6",
"1",
"1",
"4",
"1",
"0",
"40\n",
"2\n",
"3\n",
"5\n",
"1\n",
"52\n",
"7\n",
"4\n",
"97\n",
"6\n",
"0\n",
"37\n",
"43\n",
"3\n",
"1\n",
"2\n",
"5\n",
"2\n",
"2\n",
"1\n",
"3\n",
"3\n",
"5\n",
"2\n",
"5\n",
"2\n",
"3\n",
"2\n",
"2\n",
"3\n",
"7\n",
"3\n",
"3\n",
"3\n",
"3\n",
"40\n",
"1\n",
"3\n",
"1\n",
"5\n",
"1\n",
"2\n",
"1\n",
"2\n",
"1\n",
"6\n",
"2\n",
"1\n",
"3\n",
"4\n",
"5\n",
"1\n",
"52\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"3\n",
"7\n",
"2\n",
"7\n",
"3\n",
"4\n",
"3\n",
"3\n",
"1\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"3\n",
"3\n",
"4\n",
"5\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"2\n",
"7\n",
"3\n",
"7\n",
"3\n",
"4\n",
"3\n",
"40\n",
"3\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"5\n"
]
} | 2CODEFORCES
|
688_A. Opponents_37992 | Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.
Input
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) — the number of opponents and the number of days, respectively.
The i-th of the following d lines contains a string of length n consisting of characters '0' and '1'. The j-th character of this string is '0' if the j-th opponent is going to be absent on the i-th day.
Output
Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.
Examples
Input
2 2
10
00
Output
2
Input
4 1
0100
Output
1
Input
4 5
1101
1111
0110
1011
1111
Output
2
Note
In the first and the second samples, Arya will beat all present opponents each of the d days.
In the third sample, Arya will beat his opponents on days 1, 3 and 4 and his opponents will beat him on days 2 and 5. Thus, the maximum number of consecutive winning days is 2, which happens on days 3 and 4. | import math
from typing import Iterable, List
def solve(arr:Iterable[str], n: int) -> int:
curr = 0
res = 0
for v in arr:
if v == '1'*n:
curr = 0
else :
curr += 1
res = max(res , curr)
return res
def main():
n,d = map(int, input().split(' '))
arr = []
for i in range(d) :
x = input()
arr.append(x)
print(solve(arr,n))
main() | 3Python3
| {
"input": [
"4 5\n1101\n1111\n0110\n1011\n1111\n",
"2 2\n10\n00\n",
"4 1\n0100\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"100 1\n1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"2 2\n11\n10\n",
"100 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"10 10\n1100110010\n0000000001\n1011100111\n1111111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n11111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11111\n00111\n",
"1 100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n1\n0\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n1\n0\n0\n",
"10 7\n0000111001\n1111111111\n0110110001\n1111111111\n1111111111\n1000111100\n0110000111\n",
"3 2\n110\n110\n",
"1 1\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11110\n01101\n11111\n10001\n11111\n01001\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100101110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"10 6\n1111111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"1 1\n1\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1101111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"10 10\n1100110010\n0000000001\n1011100111\n1110111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"1 100\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11010\n01101\n11111\n10001\n11111\n01001\n",
"3 2\n111\n111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n11111\n",
"3 2\n110\n111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"3 2\n10\n00\n",
"2 1\n0100\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n10010\n10111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11111\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00010\n10111\n11111\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n10110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00000\n10111\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00000\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"101 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"5 8\n11111\n10110\n01001\n10111\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110001\n1101111111\n1111111111\n1000111100\n0110000111\n",
"2 1\n0\n",
"5 9\n11111\n11111\n11111\n11011\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1111\n",
"8 1\n0100\n",
"5 10\n01110\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001101000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10000\n",
"10 10\n0000110011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111110111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11101\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0111111111\n",
"5 8\n11011\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11011\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01000\n10101\n11111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"100 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1101\n",
"5 10\n01110\n10010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10110\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00010\n11101\n00111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10001\n",
"10 10\n0000110011\n0100001111\n1111111101\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111010111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11110\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11100\n01111\n",
"5 9\n11101\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n10111\n11111\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0110001001\n1101010110\n0111111111\n",
"5 10\n11011\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0101111111\n",
"5 8\n11011\n10111\n01000\n11111\n01110\n00000\n10111\n11111\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11011\n",
"5 8\n11111\n10101\n01000\n11111\n01100\n01000\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1110111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n10100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n10111\n",
"111 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0100111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"110 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001110\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1101\n0110\n1011\n1101\n"
],
"output": [
"2",
"2",
"1",
"49",
"0",
"1",
"2",
"1",
"1",
"3",
"2",
"3",
"0",
"1",
"100",
"6",
"2",
"2",
"1",
"6",
"1",
"1",
"4",
"1",
"0",
"40\n",
"2\n",
"3\n",
"5\n",
"1\n",
"52\n",
"7\n",
"4\n",
"97\n",
"6\n",
"0\n",
"37\n",
"43\n",
"3\n",
"1\n",
"2\n",
"5\n",
"2\n",
"2\n",
"1\n",
"3\n",
"3\n",
"5\n",
"2\n",
"5\n",
"2\n",
"3\n",
"2\n",
"2\n",
"3\n",
"7\n",
"3\n",
"3\n",
"3\n",
"3\n",
"40\n",
"1\n",
"3\n",
"1\n",
"5\n",
"1\n",
"2\n",
"1\n",
"2\n",
"1\n",
"6\n",
"2\n",
"1\n",
"3\n",
"4\n",
"5\n",
"1\n",
"52\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"3\n",
"7\n",
"2\n",
"7\n",
"3\n",
"4\n",
"3\n",
"3\n",
"1\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"3\n",
"3\n",
"4\n",
"5\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"2\n",
"7\n",
"3\n",
"7\n",
"3\n",
"4\n",
"3\n",
"40\n",
"3\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"5\n"
]
} | 2CODEFORCES
|
688_A. Opponents_37993 | Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.
Input
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) — the number of opponents and the number of days, respectively.
The i-th of the following d lines contains a string of length n consisting of characters '0' and '1'. The j-th character of this string is '0' if the j-th opponent is going to be absent on the i-th day.
Output
Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.
Examples
Input
2 2
10
00
Output
2
Input
4 1
0100
Output
1
Input
4 5
1101
1111
0110
1011
1111
Output
2
Note
In the first and the second samples, Arya will beat all present opponents each of the d days.
In the third sample, Arya will beat his opponents on days 1, 3 and 4 and his opponents will beat him on days 2 and 5. Thus, the maximum number of consecutive winning days is 2, which happens on days 3 and 4. | function constructOnes(n) {
var str = "";
for (var i = 0; i < n; i++) {
str += '1';
}
return str;
}
var input = readline().trim().split(' ').map(Number);
var n = input[0], d = input[1], result = [0], matchStr = constructOnes(n), consecutive = false;
for (var i = 0; i < d; i++) {
var str = readline().trim();
if (str != matchStr) {
if (consecutive) {
result[result.length-1]++;
} else {
result.push(1);
consecutive = true;
}
} else {
consecutive = false;
}
}
print(result.sort(function (a, b) {
return a-b;
}).pop());
| 4JAVA
| {
"input": [
"4 5\n1101\n1111\n0110\n1011\n1111\n",
"2 2\n10\n00\n",
"4 1\n0100\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"100 1\n1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"2 2\n11\n10\n",
"100 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"10 10\n1100110010\n0000000001\n1011100111\n1111111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n11111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11111\n00111\n",
"1 100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n1\n0\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n1\n0\n0\n",
"10 7\n0000111001\n1111111111\n0110110001\n1111111111\n1111111111\n1000111100\n0110000111\n",
"3 2\n110\n110\n",
"1 1\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11110\n01101\n11111\n10001\n11111\n01001\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100101110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"10 6\n1111111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"1 1\n1\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1101111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011100\n1111111111\n1111111111\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"10 10\n1100110010\n0000000001\n1011100111\n1110111111\n1111111111\n1111111111\n1100010110\n1111111111\n1001001010\n1111111111\n",
"1 100\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"5 10\n00110\n11000\n10010\n00010\n11010\n01101\n11111\n10001\n11111\n01001\n",
"3 2\n111\n111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n11111\n",
"3 2\n110\n111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111111111\n0000011010\n1111111111\n1111111111\n",
"3 2\n10\n00\n",
"2 1\n0100\n",
"5 10\n01111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n10010\n10111\n11111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11111\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00010\n10111\n11111\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n10110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01000\n11111\n01100\n00000\n10111\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01001\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1111111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00000\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"101 1\n1011011100000101000111110000110111010101110010010011110010001110100011001110110101111100100110000000\n",
"5 8\n11111\n10110\n01001\n10111\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000011001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110001\n1101111111\n1111111111\n1000111100\n0110000111\n",
"2 1\n0\n",
"5 9\n11111\n11111\n11111\n11011\n11100\n11111\n11111\n11111\n00000\n",
"100 1\n1110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1111111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1111\n",
"8 1\n0100\n",
"5 10\n01110\n00010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10111\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00000\n11101\n00111\n",
"100 1\n0011001100100010000011001101000001011101110110010001110001101100110011111101001011011001000010001101\n",
"1 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10000\n",
"10 10\n0000110011\n0100001111\n1111111111\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111110111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11101\n01111\n",
"5 9\n11111\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n11111\n11101\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010110\n0111111111\n",
"5 10\n11111\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0111111111\n",
"5 8\n11011\n10111\n01000\n11111\n01100\n00000\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n00001\n10111\n11011\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11111\n",
"5 8\n11111\n10111\n01000\n11111\n01100\n01000\n10101\n11111\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1111111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n11111\n",
"101 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0000111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"100 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001111\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1111\n0110\n1011\n1101\n",
"5 10\n01110\n10010\n11010\n11111\n11111\n00100\n11111\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n11111\n01100\n10010\n10110\n10111\n",
"5 9\n11111\n11101\n11111\n11111\n01010\n11010\n00010\n11101\n00111\n",
"5 9\n11111\n11111\n11111\n11111\n11100\n11111\n11111\n11110\n10001\n",
"10 10\n0000110011\n0100001111\n1111111101\n1100011111\n1111111111\n1000111000\n1111000010\n0111001001\n1101010110\n0111111111\n",
"10 6\n1110111111\n0100110101\n1111010111\n0000011010\n1111111111\n1111111111\n",
"5 10\n01011\n00010\n11110\n11111\n11111\n00100\n11110\n11111\n01000\n11111\n",
"5 9\n10111\n11101\n11111\n11111\n01010\n01010\n00000\n11100\n01111\n",
"5 9\n11101\n11101\n11111\n11111\n11000\n11111\n11111\n11110\n00000\n",
"5 9\n11111\n11111\n11101\n11111\n11000\n10111\n11111\n11110\n00000\n",
"10 10\n0000100001\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0110001001\n1101010110\n0111111111\n",
"5 10\n11011\n00010\n11010\n11111\n11111\n00100\n00110\n11111\n01000\n11111\n",
"10 10\n0100100011\n0100001111\n1111111111\n1100011111\n0111111111\n1000111000\n1111000110\n0111001001\n1101010100\n0101111111\n",
"5 8\n11011\n10111\n01000\n11111\n01110\n00000\n10111\n11111\n",
"5 8\n11111\n11111\n01000\n11111\n01100\n01001\n10111\n11011\n",
"5 8\n11111\n10101\n01000\n11111\n01100\n01000\n10101\n11111\n",
"1 100\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"10 10\n1111111111\n0001001000\n1111111111\n1110111111\n1110111111\n1000000100\n1111111111\n0000011101\n1111111111\n1111111111\n",
"5 10\n01111\n00001\n11010\n11111\n11111\n10100\n11110\n11111\n01000\n11111\n",
"5 8\n11111\n10110\n01001\n10011\n01100\n10010\n11111\n10111\n",
"111 1\n0011001100100010000010001100000001011101110110010001110001101100110011111101001011011001000010001111\n",
"10 7\n0100111001\n1111111111\n0110110101\n1101111111\n1111111111\n1000111100\n0110000111\n",
"110 1\n0110000011110101010111111100011001100000101101010110100111110000011100110110110101011100110110010011\n",
"10 10\n0000100011\n0100001110\n1111111111\n1100011111\n1110111110\n1000111000\n1111000010\n0111001001\n1101010110\n1111111111\n",
"4 5\n1100\n1101\n0110\n1011\n1101\n"
],
"output": [
"2",
"2",
"1",
"49",
"0",
"1",
"2",
"1",
"1",
"3",
"2",
"3",
"0",
"1",
"100",
"6",
"2",
"2",
"1",
"6",
"1",
"1",
"4",
"1",
"0",
"40\n",
"2\n",
"3\n",
"5\n",
"1\n",
"52\n",
"7\n",
"4\n",
"97\n",
"6\n",
"0\n",
"37\n",
"43\n",
"3\n",
"1\n",
"2\n",
"5\n",
"2\n",
"2\n",
"1\n",
"3\n",
"3\n",
"5\n",
"2\n",
"5\n",
"2\n",
"3\n",
"2\n",
"2\n",
"3\n",
"7\n",
"3\n",
"3\n",
"3\n",
"3\n",
"40\n",
"1\n",
"3\n",
"1\n",
"5\n",
"1\n",
"2\n",
"1\n",
"2\n",
"1\n",
"6\n",
"2\n",
"1\n",
"3\n",
"4\n",
"5\n",
"1\n",
"52\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"3\n",
"7\n",
"2\n",
"7\n",
"3\n",
"4\n",
"3\n",
"3\n",
"1\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"3\n",
"3\n",
"4\n",
"5\n",
"2\n",
"5\n",
"4\n",
"3\n",
"5\n",
"2\n",
"2\n",
"7\n",
"3\n",
"7\n",
"3\n",
"4\n",
"3\n",
"40\n",
"3\n",
"3\n",
"5\n",
"1\n",
"2\n",
"1\n",
"6\n",
"5\n"
]
} | 2CODEFORCES
|
70_E. Information Reform_37994 | Thought it is already the XXI century, the Mass Media isn't very popular in Walrusland. The cities get news from messengers who can only travel along roads. The network of roads in Walrusland is built so that it is possible to get to any city from any other one in exactly one way, and the roads' lengths are equal.
The North Pole governor decided to carry out an information reform. Several cities were decided to be chosen and made regional centers. Maintaining a region center takes k fishlars (which is a local currency) per year. It is assumed that a regional center always has information on the latest news.
For every city which is not a regional center, it was decided to appoint a regional center which will be responsible for keeping this city informed. In that case the maintenance costs will be equal to dlen fishlars per year, where len is the distance from a city to the corresponding regional center, measured in the number of roads along which one needs to go.
Your task is to minimize the costs to carry out the reform.
Input
The first line contains two given numbers n and k (1 ≤ n ≤ 180, 1 ≤ k ≤ 105).
The second line contains n - 1 integers di, numbered starting with 1 (di ≤ di + 1, 0 ≤ di ≤ 105).
Next n - 1 lines contain the pairs of cities connected by a road.
Output
On the first line print the minimum number of fishlars needed for a year's maintenance. On the second line print n numbers, where the i-th number will represent the number of the regional center, appointed to the i-th city. If the i-th city is a regional center itself, then you should print number i.
If there are several solutions to that problem, print any of them.
Examples
Input
8 10
2 5 9 11 15 19 20
1 4
1 3
1 7
4 6
2 8
2 3
3 5
Output
38
3 3 3 4 3 4 3 3 | #include <bits/stdc++.h>
using namespace std;
int n, c;
int a[205];
vector<int> e[205];
int d[205][205], f[205][205], p[205], b[205];
void dfs(int k, int fa) {
for (int i = 0; i < n; ++i) {
f[k][i] = a[d[k][i]] + c;
}
for (int i = 0; i < e[k].size(); ++i) {
int u = e[k][i];
if (fa == u) continue;
dfs(u, k);
for (int j = 0; j < n; ++j) {
f[k][j] += min(f[u][j] - c, f[u][p[u]]);
}
}
p[k] = 0;
for (int i = 1; i < n; ++i) {
if (f[k][i] < f[k][p[k]]) {
p[k] = i;
}
}
}
void print(int k, int fa, int ans) {
b[k] = ans + 1;
for (int i = 0; i < e[k].size(); ++i) {
int u = e[k][i];
if (fa == u) continue;
if (f[u][ans] - c < f[u][p[u]]) {
print(u, k, ans);
} else {
print(u, k, p[u]);
}
}
}
int main() {
scanf("%d%d", &n, &c);
for (int i = 1; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(d, 10, sizeof(d));
int x, y;
for (int i = 0; i < n - 1; ++i) {
scanf("%d%d", &x, &y);
--x;
--y;
e[x].push_back(y);
e[y].push_back(x);
d[x][y] = d[y][x] = 1;
}
for (int i = 0; i < n; ++i) {
d[i][i] = 0;
}
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
dfs(0, -1);
printf("%d\n", f[0][p[0]]);
print(0, -1, p[0]);
for (int i = 0; i < n; ++i) {
printf("%d ", b[i]);
}
return 0;
}
| 2C++
| {
"input": [
"8 10\n2 5 9 11 15 19 20\n1 4\n1 3\n1 7\n4 6\n2 8\n2 3\n3 5\n",
"6 10\n1 4 7 11 13\n4 6\n3 4\n3 5\n1 2\n2 4\n",
"6 10\n1 6 11 16 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"10 172\n67 157 223 307 383 451 510 587 684\n6 7\n4 6\n2 10\n1 6\n7 9\n1 5\n1 2\n3 4\n4 8\n",
"5 1000\n0 0 100 100\n1 2\n2 5\n5 3\n3 4\n",
"10 151\n70 78 159 212 281 369 431 440 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n45 55 115 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"1 1\n",
"10 287\n74 156 247 285 380 387 439 537 621\n1 9\n2 8\n1 7\n5 6\n2 7\n3 8\n1 4\n5 9\n1 10\n",
"3 1\n1 1\n1 2\n2 3\n",
"10 223\n45 71 127 173 239 296 344 444 465\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"20 1837\n94 187 208 280 299 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n7 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"9 1\n0 100 100 100 100 100 100 100\n1 2\n2 3\n2 4\n4 5\n5 6\n2 7\n7 8\n8 9\n",
"6 10\n2 4 5 9 13\n1 2\n1 5\n3 4\n1 4\n2 6\n",
"1 100000\n",
"6 10\n4 8 10 11 12\n3 6\n2 6\n3 5\n2 4\n1 6\n",
"6 10\n1 5 11 16 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"5 1010\n0 0 100 100\n1 2\n2 5\n5 3\n3 4\n",
"10 151\n70 78 159 212 281 369 431 440 444\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n45 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"1 0\n",
"10 223\n45 71 127 173 239 296 344 444 194\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"20 1837\n94 187 208 280 299 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n2 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"8 10\n2 5 9 11 15 19 20\n1 4\n1 3\n1 7\n7 6\n2 8\n2 3\n3 5\n",
"10 151\n132 78 159 212 281 369 431 440 444\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"6 10\n1 12 11 16 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"10 151\n70 78 159 212 281 369 753 440 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"3 1\n0 1\n1 2\n2 3\n",
"9 1\n0 000 100 100 100 100 100 100\n1 2\n2 3\n2 4\n4 5\n5 6\n2 7\n7 8\n8 9\n",
"10 195\n45 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"20 1837\n94 187 208 280 48 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n2 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"3 1\n0 0\n1 2\n2 3\n",
"10 195\n88 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 147\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 149\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 195\n45 55 115 143 168 172 249 327 414\n3 8\n5 10\n2 6\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"1 100100\n",
"6 10\n4 8 10 11 11\n3 6\n2 6\n3 5\n2 4\n1 6\n",
"10 195\n17 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"20 1837\n4 187 208 280 299 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n2 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"9 1\n0 000 100 100 100 100 100 100\n1 2\n2 3\n2 4\n4 5\n5 6\n2 7\n7 8\n1 9\n",
"10 223\n45 71 127 173 239 296 344 444 183\n4 6\n4 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"10 151\n70 78 159 212 281 369 753 176 444\n2 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n87 55 128 143 233 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 195\n88 27 128 143 233 172 275 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"8 10\n2 5 9 11 15 19 10\n1 4\n1 3\n1 7\n4 6\n2 8\n2 3\n3 5\n",
"10 223\n45 71 127 173 239 296 344 444 183\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"8 10\n2 5 9 11 15 19 14\n1 4\n1 3\n1 7\n7 6\n2 8\n2 3\n3 5\n",
"10 151\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n88 55 128 143 233 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 147\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 195\n88 55 128 143 233 172 275 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 195\n88 55 128 143 233 229 275 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 149\n70 78 159 333 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 151\n70 78 159 212 281 369 431 440 444\n1 6\n8 9\n1 4\n5 10\n7 8\n2 10\n2 8\n3 7\n1 10\n",
"10 223\n45 71 127 173 239 296 344 444 483\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"8 10\n2 5 14 11 15 19 20\n1 4\n1 3\n1 7\n4 6\n2 8\n2 3\n3 5\n",
"5 1010\n0 0 100 110\n1 2\n2 5\n5 3\n3 4\n",
"10 151\n70 78 159 212 281 31 431 440 444\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 151\n132 78 159 212 281 369 431 440 695\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"6 10\n1 12 11 32 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"10 147\n70 78 159 212 281 369 603 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 149\n70 78 159 212 281 66 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 195\n45 55 115 143 168 172 337 327 414\n3 8\n5 10\n2 6\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n"
],
"output": [
"38\n1 2 1 1 1 1 1 2 ",
"21\n4 4 4 4 4 4 \n",
"20\n2 2 2 2 2 2 \n",
"1075\n1 1 4 4 1 1 7 4 7 1 ",
"1000\n5 5 5 5 5 \n",
"878\n1 8 8 1 1 1 8 8 8 1 \n",
"770\n8 8 8 8 8 8 8 8 8 8 \n",
"1\n1 \n",
"1379\n1 8 8 1 5 5 1 8 5 1 \n",
"3\n1 2 3 \n",
"884\n10 10 10 4 4 4 10 4 4 10 \n",
"6100\n20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 \n",
"3\n2 2 2 5 5 5 8 8 8 \n",
"24\n1 1 1 1 1 1 \n",
"100000\n1 \n",
"38\n6 6 6 6 6 6 \n",
"19\n2 2 2 2 2 2\n",
"1010\n5 5 5 5 5\n",
"886\n1 8 8 8 1 1 8 8 8 1\n",
"780\n3 3 3 3 10 3 10 3 3 10\n",
"0\n1\n",
"884\n10 10 10 4 4 4 10 4 4 10\n",
"5702\n20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20\n",
"38\n1 2 2 1 2 1 1 2\n",
"1142\n1 8 8 8 1 1 8 8 1 1\n",
"24\n2 2 2 4 2 4\n",
"878\n1 8 8 1 1 1 8 8 8 1\n",
"1\n2 2 2\n",
"2\n4 4 4 4 4 4 7 7 7\n",
"713\n8 8 8 8 8 8 8 8 8 8\n",
"5011\n6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6\n",
"1\n1 1 1\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"870\n1 8 8 1 1 1 8 8 8 1\n",
"874\n1 8 8 1 1 1 8 8 8 1\n",
"770\n8 8 8 8 8 8 8 8 8 8\n",
"100100\n1\n",
"38\n6 6 6 6 6 6\n",
"640\n3 3 3 3 10 3 10 3 3 10\n",
"5432\n20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20\n",
"2\n2 2 2 4 4 4 2 2 2\n",
"910\n10 3 3 10 10 3 10 3 10 10\n",
"886\n1 8 8 1 1 8 8 8 8 1\n",
"859\n3 3 3 3 3 3 3 3 3 3\n",
"722\n3 3 3 3 3 3 3 3 3 3\n",
"38\n1 2 2 1 2 1 1 2\n",
"884\n10 10 10 4 4 4 10 4 4 10\n",
"38\n1 2 2 1 2 1 1 2\n",
"878\n1 8 8 1 1 1 8 8 8 1\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"870\n1 8 8 1 1 1 8 8 8 1\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"874\n1 8 8 1 1 1 8 8 8 1\n",
"878\n1 8 8 1 1 1 8 8 8 1\n",
"884\n10 10 10 4 4 4 10 4 4 10\n",
"38\n1 2 2 1 2 1 1 2\n",
"1010\n5 5 5 5 5\n",
"886\n1 8 8 8 1 1 8 8 8 1\n",
"1142\n1 8 8 8 1 1 8 8 1 1\n",
"24\n2 2 2 4 2 4\n",
"870\n1 8 8 1 1 1 8 8 8 1\n",
"874\n1 8 8 1 1 1 8 8 8 1\n",
"770\n8 8 8 8 8 8 8 8 8 8\n"
]
} | 2CODEFORCES
|
70_E. Information Reform_37995 | Thought it is already the XXI century, the Mass Media isn't very popular in Walrusland. The cities get news from messengers who can only travel along roads. The network of roads in Walrusland is built so that it is possible to get to any city from any other one in exactly one way, and the roads' lengths are equal.
The North Pole governor decided to carry out an information reform. Several cities were decided to be chosen and made regional centers. Maintaining a region center takes k fishlars (which is a local currency) per year. It is assumed that a regional center always has information on the latest news.
For every city which is not a regional center, it was decided to appoint a regional center which will be responsible for keeping this city informed. In that case the maintenance costs will be equal to dlen fishlars per year, where len is the distance from a city to the corresponding regional center, measured in the number of roads along which one needs to go.
Your task is to minimize the costs to carry out the reform.
Input
The first line contains two given numbers n and k (1 ≤ n ≤ 180, 1 ≤ k ≤ 105).
The second line contains n - 1 integers di, numbered starting with 1 (di ≤ di + 1, 0 ≤ di ≤ 105).
Next n - 1 lines contain the pairs of cities connected by a road.
Output
On the first line print the minimum number of fishlars needed for a year's maintenance. On the second line print n numbers, where the i-th number will represent the number of the regional center, appointed to the i-th city. If the i-th city is a regional center itself, then you should print number i.
If there are several solutions to that problem, print any of them.
Examples
Input
8 10
2 5 9 11 15 19 20
1 4
1 3
1 7
4 6
2 8
2 3
3 5
Output
38
3 3 3 4 3 4 3 3 | import java.io.*;
import java.util.*;
public class E{
long[][][]cached;
int[][][]by;
int[][]g;
long[]cost;
int K;
long inf=Integer.MAX_VALUE;
int n;
ArrayList<Integer>centers;
void solve()throws Exception
{
centers=new ArrayList<Integer>();
n=nextInt();
K=nextInt();
cost=new long[n+1];
cost[n]=inf;
for(int i=1;i<=n-1;i++)
cost[i]=nextInt();
int[]x=new int[n-1];
int[]y=new int[n-1];
int[]deg=new int[n];
for(int i=0;i<n-1;i++)
{
x[i]=nextInt()-1;
y[i]=nextInt()-1;
deg[x[i]]++;
deg[y[i]]++;
}
g=new int[n][];
for(int i=0;i<n;i++)
g[i]=new int[deg[i]];
int[]ind=new int[n];
for(int i=0;i<n-1;i++)
{
g[x[i]][ind[x[i]]++]=y[i];
g[y[i]][ind[y[i]]++]=x[i];
}
cached=new long[n][n+1][n+1];
for(int i=0;i<n;i++)
for(int j=0;j<=n;j++)
Arrays.fill(cached[i][j], -1);
long res=go(0, -1, n, n);
search(0, -1, n, n);
System.out.println(res);
int[]ans=new int[n];
for(int i=0;i<n;i++)
ans[i]=-1;
int[]d=new int[n];
for(int z: centers)
ans[z]=z;
Queue<Integer>q=new LinkedList<Integer>();
for(int z: centers)
q.add(z);
long c=centers.size()*K;
while(q.size()>0)
{
Queue<Integer>nq=new LinkedList<Integer>();
for(int z: q)
for(int t: g[z])
if(ans[t]==-1)
{
nq.add(t);
d[t]=d[z]+1;
c+=cost[d[t]];
ans[t]=ans[z];
}
q=nq;
}
if(c!=res)
throw new RuntimeException();
for(int i=0;i<n;i++)
System.out.println(ans[i]+1);
}
void search(int at,int par,int dist,int should)
{
long res=go(at, par, dist, should);
if(should==n)
{
long sum=cost[dist];
for(int x: g[at])
if(x!=par)
{
sum+=go(x,at,Math.min(dist+1, n),n);
}
if(sum==res)
{
for(int x: g[at])
if(x!=par)
{
search(x,at,Math.min(dist+1, n),n);
}
return ;
}
for(int s=0;s<n;s++)
{
long cur=go(at,par,dist,s);
if(cur==res)
{
search(at, par, dist, s);
return ;
}
}
}
else if(should==0)
{
centers.add(at);
for(int x: g[at])
if(x!=par)
{
search(x,at,1,n);
}
}
else
{
long sum=0;
for(int x: g[at])
if(x!=par)
{
sum+=go(x, at, Math.min(dist+1, should+1),n);
}
int what=-1;
for(int x: g[at])
if(x!=par)
{
long cur=sum;
cur-=go(x, at, Math.min(dist+1, should+1),n);
cur+=go(x, at, Math.min(dist+1,n),should-1);
cur+=cost[Math.min(dist,should)];
if(cur==res)
{
what=x;
}
}
for(int x: g[at])
if(x!=par)
{
if(x==what)
{
search(x, at, Math.min(dist+1,n),should-1);
}
else
{
search(x, at, Math.min(dist+1, should+1),n);
}
}
}
}
long go(int at,int par,int dist,int should)
{
if(cached[at][dist][should]!=-1)
return cached[at][dist][should];
long res=inf;
if(should==n)
{
long sum=cost[dist];
for(int s=0;s<n;s++)
{
long cur=go(at,par,dist,s);
res=Math.min(res, cur);
}
for(int x: g[at])
if(x!=par)
{
sum+=go(x,at,Math.min(dist+1, n),n);
}
res=Math.min(res, sum);
}
else if(should==0)
{
long cur=K;
for(int x: g[at])
if(x!=par)
{
cur+=go(x,at,1,n);
}
res=Math.min(res, cur);
}
else
{
long sum=0;
for(int x: g[at])
if(x!=par)
{
sum+=go(x, at, Math.min(dist+1, should+1),n);
}
for(int x: g[at])
if(x!=par)
{
long cur=sum;
cur-=go(x, at, Math.min(dist+1, should+1),n);
cur+=go(x, at, Math.min(dist+1,n),should-1);
cur+=cost[Math.min(dist,should)];
res=Math.min(res, cur);
}
}
return cached[at][dist][should]=res;
}
BufferedReader reader;
PrintWriter writer;
StringTokenizer stk;
void run()throws Exception
{
reader=new BufferedReader(new InputStreamReader(System.in));
stk=null;
writer=new PrintWriter(System.out);
solve();
reader.close();
writer.close();
}
int nextInt()throws Exception
{
return Integer.parseInt(nextToken());
}
long nextLong()throws Exception
{
return Long.parseLong(nextToken());
}
double nextDouble()throws Exception
{
return Double.parseDouble(nextToken());
}
String nextString()throws Exception
{
return nextToken();
}
String nextLine()throws Exception
{
return reader.readLine();
}
String nextToken()throws Exception
{
if(stk==null || !stk.hasMoreTokens())
{
stk=new StringTokenizer(nextLine());
return nextToken();
}
return stk.nextToken();
}
public static void main(String[]a) throws Exception
{
new E().run();
}
} | 4JAVA
| {
"input": [
"8 10\n2 5 9 11 15 19 20\n1 4\n1 3\n1 7\n4 6\n2 8\n2 3\n3 5\n",
"6 10\n1 4 7 11 13\n4 6\n3 4\n3 5\n1 2\n2 4\n",
"6 10\n1 6 11 16 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"10 172\n67 157 223 307 383 451 510 587 684\n6 7\n4 6\n2 10\n1 6\n7 9\n1 5\n1 2\n3 4\n4 8\n",
"5 1000\n0 0 100 100\n1 2\n2 5\n5 3\n3 4\n",
"10 151\n70 78 159 212 281 369 431 440 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n45 55 115 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"1 1\n",
"10 287\n74 156 247 285 380 387 439 537 621\n1 9\n2 8\n1 7\n5 6\n2 7\n3 8\n1 4\n5 9\n1 10\n",
"3 1\n1 1\n1 2\n2 3\n",
"10 223\n45 71 127 173 239 296 344 444 465\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"20 1837\n94 187 208 280 299 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n7 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"9 1\n0 100 100 100 100 100 100 100\n1 2\n2 3\n2 4\n4 5\n5 6\n2 7\n7 8\n8 9\n",
"6 10\n2 4 5 9 13\n1 2\n1 5\n3 4\n1 4\n2 6\n",
"1 100000\n",
"6 10\n4 8 10 11 12\n3 6\n2 6\n3 5\n2 4\n1 6\n",
"6 10\n1 5 11 16 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"5 1010\n0 0 100 100\n1 2\n2 5\n5 3\n3 4\n",
"10 151\n70 78 159 212 281 369 431 440 444\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n45 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"1 0\n",
"10 223\n45 71 127 173 239 296 344 444 194\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"20 1837\n94 187 208 280 299 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n2 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"8 10\n2 5 9 11 15 19 20\n1 4\n1 3\n1 7\n7 6\n2 8\n2 3\n3 5\n",
"10 151\n132 78 159 212 281 369 431 440 444\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"6 10\n1 12 11 16 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"10 151\n70 78 159 212 281 369 753 440 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"3 1\n0 1\n1 2\n2 3\n",
"9 1\n0 000 100 100 100 100 100 100\n1 2\n2 3\n2 4\n4 5\n5 6\n2 7\n7 8\n8 9\n",
"10 195\n45 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"20 1837\n94 187 208 280 48 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n2 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"3 1\n0 0\n1 2\n2 3\n",
"10 195\n88 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 147\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 149\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 195\n45 55 115 143 168 172 249 327 414\n3 8\n5 10\n2 6\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"1 100100\n",
"6 10\n4 8 10 11 11\n3 6\n2 6\n3 5\n2 4\n1 6\n",
"10 195\n17 55 128 143 168 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n",
"20 1837\n4 187 208 280 299 379 395 447 456 518 616 624 638 649 674 760 778 780 849\n3 14\n17 19\n12 20\n2 20\n7 16\n15 16\n6 20\n10 15\n1 11\n2 18\n2 9\n3 9\n6 17\n12 15\n8 19\n1 18\n5 17\n6 13\n3 4\n",
"9 1\n0 000 100 100 100 100 100 100\n1 2\n2 3\n2 4\n4 5\n5 6\n2 7\n7 8\n1 9\n",
"10 223\n45 71 127 173 239 296 344 444 183\n4 6\n4 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"10 151\n70 78 159 212 281 369 753 176 444\n2 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n87 55 128 143 233 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 195\n88 27 128 143 233 172 275 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"8 10\n2 5 9 11 15 19 10\n1 4\n1 3\n1 7\n4 6\n2 8\n2 3\n3 5\n",
"10 223\n45 71 127 173 239 296 344 444 183\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"8 10\n2 5 9 11 15 19 14\n1 4\n1 3\n1 7\n7 6\n2 8\n2 3\n3 5\n",
"10 151\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 195\n88 55 128 143 233 172 249 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 147\n70 78 159 212 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 195\n88 55 128 143 233 172 275 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 195\n88 55 128 143 233 229 275 327 414\n3 8\n5 10\n2 3\n1 9\n4 8\n3 9\n6 8\n8 10\n7 8\n",
"10 149\n70 78 159 333 281 369 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 151\n70 78 159 212 281 369 431 440 444\n1 6\n8 9\n1 4\n5 10\n7 8\n2 10\n2 8\n3 7\n1 10\n",
"10 223\n45 71 127 173 239 296 344 444 483\n4 6\n3 10\n2 3\n4 5\n3 8\n6 8\n4 9\n1 7\n1 10\n",
"8 10\n2 5 14 11 15 19 20\n1 4\n1 3\n1 7\n4 6\n2 8\n2 3\n3 5\n",
"5 1010\n0 0 100 110\n1 2\n2 5\n5 3\n3 4\n",
"10 151\n70 78 159 212 281 31 431 440 444\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"10 151\n132 78 159 212 281 369 431 440 695\n1 6\n8 9\n2 4\n5 10\n7 8\n9 10\n2 8\n3 7\n1 10\n",
"6 10\n1 12 11 32 20\n4 6\n2 3\n1 2\n2 4\n2 5\n",
"10 147\n70 78 159 212 281 369 603 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 149\n70 78 159 212 281 66 753 176 444\n1 6\n8 9\n1 4\n5 10\n7 8\n9 6\n2 8\n3 7\n1 10\n",
"10 195\n45 55 115 143 168 172 337 327 414\n3 8\n5 10\n2 6\n1 9\n4 8\n3 9\n6 8\n7 10\n7 8\n"
],
"output": [
"38\n1 2 1 1 1 1 1 2 ",
"21\n4 4 4 4 4 4 \n",
"20\n2 2 2 2 2 2 \n",
"1075\n1 1 4 4 1 1 7 4 7 1 ",
"1000\n5 5 5 5 5 \n",
"878\n1 8 8 1 1 1 8 8 8 1 \n",
"770\n8 8 8 8 8 8 8 8 8 8 \n",
"1\n1 \n",
"1379\n1 8 8 1 5 5 1 8 5 1 \n",
"3\n1 2 3 \n",
"884\n10 10 10 4 4 4 10 4 4 10 \n",
"6100\n20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 \n",
"3\n2 2 2 5 5 5 8 8 8 \n",
"24\n1 1 1 1 1 1 \n",
"100000\n1 \n",
"38\n6 6 6 6 6 6 \n",
"19\n2 2 2 2 2 2\n",
"1010\n5 5 5 5 5\n",
"886\n1 8 8 8 1 1 8 8 8 1\n",
"780\n3 3 3 3 10 3 10 3 3 10\n",
"0\n1\n",
"884\n10 10 10 4 4 4 10 4 4 10\n",
"5702\n20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20\n",
"38\n1 2 2 1 2 1 1 2\n",
"1142\n1 8 8 8 1 1 8 8 1 1\n",
"24\n2 2 2 4 2 4\n",
"878\n1 8 8 1 1 1 8 8 8 1\n",
"1\n2 2 2\n",
"2\n4 4 4 4 4 4 7 7 7\n",
"713\n8 8 8 8 8 8 8 8 8 8\n",
"5011\n6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6\n",
"1\n1 1 1\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"870\n1 8 8 1 1 1 8 8 8 1\n",
"874\n1 8 8 1 1 1 8 8 8 1\n",
"770\n8 8 8 8 8 8 8 8 8 8\n",
"100100\n1\n",
"38\n6 6 6 6 6 6\n",
"640\n3 3 3 3 10 3 10 3 3 10\n",
"5432\n20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20\n",
"2\n2 2 2 4 4 4 2 2 2\n",
"910\n10 3 3 10 10 3 10 3 10 10\n",
"886\n1 8 8 1 1 8 8 8 8 1\n",
"859\n3 3 3 3 3 3 3 3 3 3\n",
"722\n3 3 3 3 3 3 3 3 3 3\n",
"38\n1 2 2 1 2 1 1 2\n",
"884\n10 10 10 4 4 4 10 4 4 10\n",
"38\n1 2 2 1 2 1 1 2\n",
"878\n1 8 8 1 1 1 8 8 8 1\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"870\n1 8 8 1 1 1 8 8 8 1\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"862\n3 3 3 3 3 3 3 3 3 3\n",
"874\n1 8 8 1 1 1 8 8 8 1\n",
"878\n1 8 8 1 1 1 8 8 8 1\n",
"884\n10 10 10 4 4 4 10 4 4 10\n",
"38\n1 2 2 1 2 1 1 2\n",
"1010\n5 5 5 5 5\n",
"886\n1 8 8 8 1 1 8 8 8 1\n",
"1142\n1 8 8 8 1 1 8 8 1 1\n",
"24\n2 2 2 4 2 4\n",
"870\n1 8 8 1 1 1 8 8 8 1\n",
"874\n1 8 8 1 1 1 8 8 8 1\n",
"770\n8 8 8 8 8 8 8 8 8 8\n"
]
} | 2CODEFORCES
|
730_L. Expression Queries_37996 | A simplified arithmetic expression (SAE) is an arithmetic expression defined by the following grammar:
* <SAE> ::= <Number> | <SAE>+<SAE> | <SAE>*<SAE> | (<SAE>)
* <Number> ::= <Digit> | <Digit><Number>
* <Digit> ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
In other words it's a correct arithmetic expression that is allowed to contain brackets, numbers (possibly with leading zeros), multiplications and additions. For example expressions "(0+01)", "0" and "1*(0)" are simplified arithmetic expressions, but expressions "2-1", "+1" and "1+2)" are not.
Given a string s1s2...s|s| that represents a SAE; si denotes the i-th character of the string which can be either a digit ('0'-'9'), a plus sign ('+'), a multiplication sign ('*'), an opening round bracket '(' or a closing round bracket ')'.
A part slsl + 1...sr of this string is called a sub-expression if and only if it is a SAE.
You task is to answer m queries, each of which is a pair of integers li, ri (1 ≤ li ≤ ri ≤ |s|). For each query determine whether the corresponding part of the given string is a sub-expression and in case it's a sub-expression calculate its value modulo 1000000007 (109 + 7). The values should be calculated using standard operator priorities.
Input
The first line of the input contains non-empty string s (1 ≤ |s| ≤ 4·105) which represents a correct SAE. Each character of the string can be one of the following characters: '*', '+', '(', ')' or a digit ('0'-'9'). The expression might contain extra-huge numbers.
The second line contains an integer m (1 ≤ m ≤ 4·105) which is the number of queries. Each of the next m lines contains two space-separated integers li, ri (1 ≤ li ≤ ri ≤ |s|) — the i-th query.
Output
The i-th number of output should be the answer for the i-th query. If the i-th query corresponds to a valid sub-expression output the value of the sub-expression modulo 1000000007 (109 + 7). Otherwise output -1 as an answer for the query. Print numbers on separate lines.
Examples
Input
((1+2)*3+101*2)
6
8 14
1 6
2 10
11 14
5 5
4 5
Output
205
-1
10
2
2
-1
Input
(01)
1
1 4
Output
1 | #include <bits/stdc++.h>
using namespace std;
int n, q, l, r, st[400500], ct, bel[400500], pw[400500], su[400500], lb[400500],
rb[400500], as[400500], v1[400500], sl[400500], sr[400500], tp[400500],
vl[400500];
char s[400500];
struct qu1 {
int l, r, id;
};
vector<qu1> qu[400500];
int calc(int l, int r) {
return (su[r] - 1ll * su[l - 1] * pw[r - l + 1] % 1000000007 + 1000000007) %
1000000007;
}
struct sth {
int fg, v1, v2, v3;
};
struct node {
int l, r;
sth tp;
} e[400500 * 4];
sth doit(sth s1, sth s2, int fg) {
sth s3;
if (s1.fg && s2.fg && fg) {
s3.v1 = s3.v2 = 1ll * s1.v1 * s2.v2 % 1000000007;
s3.v3 = 0;
s3.fg = 1;
return s3;
}
s3.fg = 0;
if (s1.fg && fg)
s3.v1 = 1ll * s1.v1 * s2.v1 % 1000000007;
else
s3.v1 = s1.v1;
if (s2.fg && fg)
s3.v2 = 1ll * s1.v2 * s2.v2 % 1000000007;
else
s3.v2 = s2.v2;
s3.v3 = (s1.v3 + s2.v3) % 1000000007;
if (!s1.fg && !s2.fg && fg)
s3.v3 = (s3.v3 + 1ll * s1.v2 * s2.v1) % 1000000007;
else {
if (!s1.fg && (!s2.fg || !fg)) s3.v3 = (s3.v3 + s1.v2) % 1000000007;
if (!s2.fg && (!s1.fg || !fg)) s3.v3 = (s3.v3 + s2.v1) % 1000000007;
}
return s3;
}
void pushup(int x) {
int mid = (e[x].l + e[x].r) >> 1;
e[x].tp = doit(e[x << 1].tp, e[x << 1 | 1].tp, s[tp[mid + 1]] == '*');
}
void build(int x, int l, int r) {
e[x].l = l;
e[x].r = r;
if (l == r) {
e[x].tp = (sth){1, vl[l], vl[l], 0};
return;
}
int mid = (l + r) >> 1;
build(x << 1, l, mid);
build(x << 1 | 1, mid + 1, r);
pushup(x);
}
sth query(int x, int l, int r) {
if (e[x].l == l && e[x].r == r) return e[x].tp;
int mid = (e[x].l + e[x].r) >> 1;
if (mid >= r)
return query(x << 1, l, r);
else if (mid < l)
return query(x << 1 | 1, l, r);
else
return doit(query(x << 1, l, mid), query(x << 1 | 1, mid + 1, r),
s[tp[mid + 1]] == '*');
}
void solve(int l, int r) {
int ct = 0, ls = r;
for (int i = r - 1; i >= l; i--)
if (s[i] == ')')
solve(lb[i], i), i = lb[i];
else if (s[i] == '+' && s[i] == '-')
ls = i;
else
sr[i] = ls;
ls = l;
for (int i = l + 1; i <= r; i++)
if (s[i] == '(')
i = rb[i];
else if (s[i] == '+' || s[i] == '*')
tp[++ct] = i, ls = i;
else
sl[i] = ls;
tp[0] = l;
tp[ct + 1] = r;
for (int i = 0; i <= ct; i++)
if (s[tp[i] + 1] == '(')
vl[i] = v1[tp[i] + 1];
else
vl[i] = calc(tp[i] + 1, tp[i + 1] - 1);
build(1, 0, ct);
for (int i = 0; i < qu[l].size(); i++) {
int l1 = qu[l][i].l, r1 = qu[l][i].r, id = qu[l][i].id;
int l2 = lower_bound(tp, tp + ct + 1, l1) - tp,
r2 = lower_bound(tp, tp + ct + 1, r1) - tp;
if (l2 == r2) {
as[id] = calc(l1, r1);
if (s[tp[l2 - 1] + 1] == '(') as[id] = vl[l2 - 1];
continue;
}
int lv = calc(l1, tp[l2] - 1), rv = calc(tp[r2 - 1] + 1, r1);
if (s[tp[l2 - 1] + 1] == '(') lv = vl[l2 - 1];
if (s[tp[r2 - 1] + 1] == '(') rv = vl[r2 - 1];
if (l2 + 1 == r2) {
int fg = s[tp[l2]] == '*';
if (fg)
as[id] = 1ll * lv * rv % 1000000007;
else
as[id] = (lv + rv) % 1000000007;
continue;
}
sth v0 = query(1, l2, r2 - 2);
v0 = doit((sth){1, lv, lv, 0}, v0, s[tp[l2]] == '*');
v0 = doit(v0, (sth){1, rv, rv, 0}, s[tp[r2 - 1]] == '*');
as[id] =
v0.fg ? v0.v1 : (1ll * v0.v1 + (!v0.fg) * v0.v2 + v0.v3) % 1000000007;
}
sth v0 = query(1, 0, ct);
v1[l] = (1ll * v0.v1 + (!v0.fg) * v0.v2 + v0.v3) % 1000000007;
}
int main() {
scanf("%s", s + 2);
s[1] = '(';
n = strlen(s + 1) + 1;
s[n] = ')';
pw[0] = 1;
for (int i = 1; i <= n; i++) {
pw[i] = 10ll * pw[i - 1] % 1000000007;
su[i] = 10ll * su[i - 1] % 1000000007;
bel[i] = st[ct];
if (s[i] == '(')
st[++ct] = i;
else if (s[i] == ')')
rb[st[ct]] = i, lb[i] = st[ct], ct--, bel[i] = st[ct];
else if (s[i] >= '0' && s[i] <= '9')
su[i] = (su[i] + s[i] - '0') % 1000000007;
}
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
scanf("%d%d", &l, &r);
l++;
r++;
if (bel[l] != bel[r] || s[l] == '*' || s[l] == '+' || s[r] == '*' ||
s[r] == '+' || s[l] == ')' || s[r] == '(')
as[i] = -1;
else
qu[bel[l]].push_back((qu1){l, r, i});
}
solve(1, n);
for (int i = 1; i <= q; i++) printf("%d\n", as[i]);
}
| 2C++
| {
"input": [
"(01)\n1\n1 4\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 5\n4 5\n",
"1\n1\n1 1\n",
"104+12\n1\n2 5\n",
"(1)\n6\n1 1\n1 2\n1 3\n2 2\n2 3\n3 3\n",
"(1)\n4\n2 2\n1 2\n2 3\n1 3\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n1 31\n5 8\n3 14\n13 17\n10 30\n3 4\n3 7\n",
"(1)\n6\n1 1\n2 2\n1 3\n2 2\n2 3\n3 3\n",
"(1)\n4\n2 2\n1 2\n2 3\n1 2\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 5\n2 5\n",
"(1)\n4\n2 2\n2 2\n2 3\n1 1\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 31\n5 8\n3 14\n13 17\n10 30\n3 4\n3 7\n",
"(1)\n6\n1 1\n2 2\n2 3\n2 2\n2 3\n3 3\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 31\n5 8\n3 14\n13 17\n10 14\n3 4\n3 7\n",
"(1)\n6\n1 1\n2 2\n2 3\n1 2\n2 3\n3 3\n",
"((1+1)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 5\n1 4\n",
"((1+2)*3+101*2)\n6\n8 14\n2 2\n1 10\n11 14\n5 5\n2 5\n",
"((1+1)*3+101*2)\n6\n8 14\n1 6\n2 10\n14 14\n5 9\n1 4\n",
"((1+2)*3+101*2)\n6\n6 14\n2 2\n1 10\n11 14\n5 5\n2 5\n",
"104+12\n1\n3 5\n",
"(1)\n4\n2 2\n2 2\n2 3\n1 3\n",
"(435+234234*234234*(2134+2323))\n8\n3 30\n1 31\n5 8\n3 14\n13 17\n10 30\n3 4\n3 7\n",
"(01)\n1\n2 4\n",
"((1+2)*3+101*2)\n6\n3 14\n1 6\n2 10\n11 14\n5 5\n1 5\n",
"(1)\n6\n1 1\n1 2\n2 3\n2 2\n2 3\n2 3\n",
"((1+1)*3+101*2)\n6\n8 14\n1 6\n4 10\n14 14\n5 5\n1 4\n",
"((1+1)*3+001*2)\n6\n8 14\n1 6\n2 10\n14 14\n5 9\n1 4\n",
"(435+234234*234234*(2134+2323))\n8\n3 30\n1 10\n5 8\n3 14\n13 17\n10 30\n3 4\n3 7\n",
"(1)\n6\n1 2\n2 2\n1 3\n2 2\n1 3\n3 3\n",
"((1+1)*3+101*2)\n6\n14 14\n1 5\n2 10\n11 14\n5 5\n1 4\n",
"(1)\n6\n1 1\n1 2\n2 2\n2 2\n2 3\n2 3\n",
"204*12\n1\n3 5\n",
"(435+234234*234234*(2134+2323))\n8\n6 30\n1 10\n5 8\n3 14\n13 17\n10 30\n3 4\n3 7\n",
"(1)\n4\n1 2\n1 2\n2 3\n1 3\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 5\n5 5\n",
"(2)\n4\n2 2\n1 2\n2 3\n1 2\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 31\n5 8\n1 14\n13 17\n10 14\n3 4\n3 7\n",
"((1+2)*3+101*2)\n6\n8 14\n2 2\n1 10\n11 11\n5 5\n2 5\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 10\n1 7\n",
"((1+1)*3+101*2)\n6\n9 14\n1 5\n2 10\n11 14\n5 5\n1 4\n",
"(1)\n6\n1 1\n1 2\n2 3\n2 2\n2 3\n1 3\n",
"((1+2)*3+101*2)\n6\n6 14\n2 2\n1 7\n1 14\n5 5\n2 5\n",
"(435+234234*234234*(2134+2323))\n8\n3 30\n1 10\n5 8\n3 17\n13 17\n10 30\n3 4\n3 7\n",
"(1)\n6\n1 2\n2 2\n1 3\n1 2\n1 3\n3 3\n",
"((1+1)*3+101*2)\n6\n14 14\n1 5\n1 10\n11 14\n5 5\n1 4\n",
"(435+234234*234234*(2134+2323))\n8\n6 30\n1 10\n5 8\n3 14\n13 31\n10 30\n3 4\n3 7\n",
"((1+2)*3+101*2)\n6\n8 14\n2 6\n2 10\n11 14\n5 5\n5 5\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 23\n5 8\n5 14\n13 17\n10 30\n3 4\n3 7\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 31\n5 8\n1 14\n13 21\n10 14\n3 4\n3 7\n",
"((1+2)*4+101*2)\n6\n8 14\n2 2\n1 10\n11 11\n5 5\n2 5\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 23\n5 8\n5 14\n13 17\n8 30\n3 4\n3 7\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 2\n11 14\n6 10\n2 7\n",
"(435+234234*234234*(2134+2323))\n8\n2 21\n2 23\n5 8\n1 14\n13 17\n8 30\n3 4\n3 7\n",
"((1+2)*3+101*2)\n6\n10 14\n1 6\n2 2\n11 14\n6 10\n2 7\n",
"((1+2)*3+101*2)\n6\n10 14\n2 6\n2 2\n11 14\n6 10\n2 7\n",
"21+401\n1\n2 5\n",
"((1+2)*3+101*2)\n6\n8 14\n2 6\n2 10\n11 14\n5 5\n2 5\n",
"(1)\n4\n2 2\n1 2\n2 3\n1 1\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 5\n1 5\n",
"((1+2)*3+101*2)\n6\n8 14\n1 9\n2 10\n11 14\n5 5\n2 5\n",
"(1)\n4\n2 2\n2 2\n3 3\n1 1\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 5\n1 4\n",
"((1+2)*3+101*2)\n6\n8 14\n2 9\n2 10\n11 14\n5 5\n2 5\n",
"(1)\n6\n1 1\n2 2\n2 3\n2 2\n2 3\n2 3\n",
"((1+2)*3+101*2)\n6\n8 14\n2 2\n2 10\n11 14\n5 5\n2 5\n",
"((1+1)*3+101*2)\n6\n8 14\n1 6\n2 10\n14 14\n5 5\n1 4\n",
"(1)\n6\n1 2\n2 2\n1 3\n2 2\n2 3\n3 3\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n5 5\n1 7\n",
"((1+1)*3+101*2)\n6\n8 14\n1 5\n2 10\n11 14\n5 5\n1 4\n",
"((1+2)*3+101*2)\n6\n8 13\n2 2\n2 10\n11 14\n5 5\n2 5\n",
"((1+2)*3+101*2)\n6\n6 14\n2 2\n1 7\n11 14\n5 5\n2 5\n",
"204+12\n1\n3 5\n",
"((1+2)*3+101*2)\n6\n11 13\n2 2\n2 10\n11 14\n5 5\n2 5\n",
"((1+1)*3+101*2)\n6\n8 14\n1 6\n5 10\n14 14\n5 5\n1 4\n",
"((1+2)*3+101*2)\n6\n6 14\n2 2\n1 7\n11 14\n5 5\n4 5\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 23\n5 8\n3 14\n13 17\n10 30\n3 4\n3 7\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n1 10\n11 14\n5 5\n1 4\n",
"((1+2)*3+101*2)\n6\n8 14\n2 9\n2 10\n11 14\n5 5\n2 7\n",
"((1+1)*3+101*2)\n6\n8 14\n1 2\n2 10\n11 14\n5 5\n1 4\n",
"((1+2)*3+101*2)\n6\n8 14\n2 3\n2 10\n11 14\n5 5\n2 5\n",
"104+12\n1\n4 5\n",
"(1)\n6\n1 2\n2 3\n1 3\n2 2\n2 3\n3 3\n",
"((1+1)*3+101*2)\n6\n7 14\n1 6\n2 10\n14 14\n5 5\n1 4\n",
"((1+2)*3+101*2)\n6\n9 14\n2 2\n1 7\n11 14\n5 5\n4 5\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n6 10\n1 7\n",
"((1+2)*3+101*2)\n6\n8 14\n1 6\n2 10\n11 14\n6 10\n2 7\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 23\n5 8\n1 14\n13 17\n8 30\n3 4\n3 7\n",
"(435+234234*234234*(2134+2323))\n8\n2 21\n3 23\n5 8\n1 14\n13 17\n8 30\n3 4\n3 7\n",
"(435+234234*234234*(2134+2323))\n8\n2 30\n2 31\n5 9\n3 14\n13 17\n10 30\n3 4\n3 7\n",
"((1+2)*3+101*2)\n6\n8 14\n1 9\n2 9\n11 14\n5 5\n2 5\n"
],
"output": [
"1\n",
"205\n-1\n10\n2\n2\n-1\n",
"1\n",
"5\n",
"-1\n-1\n1\n1\n-1\n-1\n",
"1\n-1\n-1\n1\n",
"829320182\n829320182\n-1\n5387417\n23423\n495351647\n35\n58\n",
"-1\n1\n1\n1\n-1\n-1\n",
"1\n-1\n-1\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"1\n1\n-1\n-1\n",
"829320182\n-1\n-1\n5387417\n23423\n495351647\n35\n58\n",
"-1\n1\n-1\n1\n-1\n-1\n",
"829320182\n-1\n-1\n5387417\n23423\n782\n35\n58\n",
"-1\n1\n-1\n-1\n-1\n-1\n",
"205\n-1\n7\n2\n1\n-1\n",
"205\n-1\n-1\n2\n2\n-1\n",
"205\n-1\n7\n2\n-1\n-1\n",
"-1\n-1\n-1\n2\n2\n-1\n",
"5\n",
"1\n1\n-1\n1\n",
"829319782\n829320182\n-1\n5387417\n23423\n495351647\n35\n58\n",
"-1\n",
"-1\n-1\n10\n2\n2\n-1\n",
"-1\n-1\n-1\n1\n-1\n-1\n",
"205\n-1\n-1\n2\n1\n-1\n",
"5\n-1\n6\n2\n-1\n-1\n",
"829319782\n-1\n-1\n5387417\n23423\n495351647\n35\n58\n",
"-1\n1\n1\n1\n1\n-1\n",
"2\n-1\n7\n2\n1\n-1\n",
"-1\n-1\n1\n1\n-1\n-1\n",
"4\n",
"829319747\n-1\n-1\n5387417\n23423\n495351647\n35\n58\n",
"-1\n-1\n-1\n1\n",
"205\n-1\n10\n2\n2\n2\n",
"2\n-1\n-1\n-1\n",
"829320182\n-1\n-1\n-1\n23423\n782\n35\n58\n",
"205\n-1\n-1\n0\n2\n-1\n",
"205\n-1\n10\n2\n-1\n-1\n",
"-1\n-1\n7\n2\n1\n-1\n",
"-1\n-1\n-1\n1\n-1\n1\n",
"-1\n-1\n-1\n-1\n2\n-1\n",
"829319782\n-1\n-1\n486462982\n23423\n495351647\n35\n58\n",
"-1\n1\n1\n-1\n1\n-1\n",
"2\n-1\n-1\n2\n1\n-1\n",
"829319747\n-1\n-1\n5387417\n-1\n495351647\n35\n58\n",
"205\n3\n10\n2\n2\n2\n",
"829320182\n-1\n-1\n-1\n23423\n495351647\n35\n58\n",
"829320182\n-1\n-1\n-1\n-1\n782\n35\n58\n",
"206\n-1\n-1\n0\n2\n-1\n",
"829320182\n-1\n-1\n-1\n23423\n215260552\n35\n58\n",
"205\n-1\n-1\n2\n-1\n-1\n",
"-1\n-1\n-1\n-1\n23423\n215260552\n35\n58\n",
"202\n-1\n-1\n2\n-1\n-1\n",
"202\n3\n-1\n2\n-1\n-1\n",
"41\n",
"205\n3\n10\n2\n2\n-1\n",
"1\n-1\n-1\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"1\n1\n-1\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"-1\n1\n-1\n1\n-1\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"205\n-1\n7\n2\n1\n-1\n",
"-1\n1\n1\n1\n-1\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"205\n-1\n7\n2\n1\n-1\n",
"-1\n-1\n10\n2\n2\n-1\n",
"-1\n-1\n-1\n2\n2\n-1\n",
"5\n",
"-1\n-1\n10\n2\n2\n-1\n",
"205\n-1\n-1\n2\n1\n-1\n",
"-1\n-1\n-1\n2\n2\n-1\n",
"829320182\n-1\n-1\n5387417\n23423\n495351647\n35\n58\n",
"205\n-1\n-1\n2\n2\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"205\n-1\n7\n2\n1\n-1\n",
"205\n-1\n10\n2\n2\n-1\n",
"-1\n",
"-1\n-1\n1\n1\n-1\n-1\n",
"-1\n-1\n7\n2\n1\n-1\n",
"-1\n-1\n-1\n2\n2\n-1\n",
"205\n-1\n10\n2\n-1\n-1\n",
"205\n-1\n10\n2\n-1\n-1\n",
"829320182\n-1\n-1\n-1\n23423\n215260552\n35\n58\n",
"-1\n-1\n-1\n-1\n23423\n215260552\n35\n58\n",
"829320182\n-1\n-1\n5387417\n23423\n495351647\n35\n58\n",
"205\n-1\n-1\n2\n2\n-1\n"
]
} | 2CODEFORCES
|
755_B. PolandBall and Game_37997 | PolandBall is playing a game with EnemyBall. The rules are simple. Players have to say words in turns. You cannot say a word which was already said. PolandBall starts. The Ball which can't say a new word loses.
You're given two lists of words familiar to PolandBall and EnemyBall. Can you determine who wins the game, if both play optimally?
Input
The first input line contains two integers n and m (1 ≤ n, m ≤ 103) — number of words PolandBall and EnemyBall know, respectively.
Then n strings follow, one per line — words familiar to PolandBall.
Then m strings follow, one per line — words familiar to EnemyBall.
Note that one Ball cannot know a word more than once (strings are unique), but some words can be known by both players.
Each word is non-empty and consists of no more than 500 lowercase English alphabet letters.
Output
In a single line of print the answer — "YES" if PolandBall wins and "NO" otherwise. Both Balls play optimally.
Examples
Input
5 1
polandball
is
a
cool
character
nope
Output
YES
Input
2 2
kremowka
wadowicka
kremowka
wiedenska
Output
YES
Input
1 2
a
a
b
Output
NO
Note
In the first example PolandBall knows much more words and wins effortlessly.
In the second example if PolandBall says kremowka first, then EnemyBall cannot use that word anymore. EnemyBall can only say wiedenska. PolandBall says wadowicka and wins. | n, m = map(int, raw_input().split())
n_list = []
m_list = []
for i in xrange(n):
n_list.append(raw_input())
for j in xrange(m):
m_list.append(raw_input())
if n > m:
print 'YES'
elif m > n:
print 'NO'
else:
if (len(set(n_list+m_list)) % 2) == 0:
print 'NO'
else:
print 'YES' | 1Python2
| {
"input": [
"2 2\nkremowka\nwadowicka\nkremowka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\ncharacter\nnope\n",
"1 2\na\na\nb\n",
"3 2\na\nb\nc\nd\ne\n",
"6 5\na\nb\nc\nd\ne\nf\nf\ne\nd\nz\ny\n",
"1 1\naa\naa\n",
"2 2\na\nb\nb\nc\n",
"3 3\nab\nbc\ncd\ncd\ndf\nfg\n",
"2 1\na\nb\na\n",
"2 1\nc\na\na\n",
"3 3\nc\na\nb\na\nd\ng\n",
"6 5\na\nb\nb\nd\ne\nf\nf\ne\nd\nz\ny\n",
"1 1\naa\nab\n",
"3 3\nab\nbc\ncd\ndc\ndf\nfg\n",
"3 3\nc\na\nb\nb\nd\ng\n",
"2 2\nkremowak\nwadowicka\nkremowka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\nretcarahc\nnope\n",
"6 5\na\nb\na\nd\ne\nf\nf\ne\nd\nz\ny\n",
"2 2\nkremowak\nwadowicka\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncool\nretc`rahc\nnope\n",
"2 2\nkremowak\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncool\nretc`rahc\nnopd\n",
"2 2\nlremowak\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\nocol\nretc`rahc\nnopd\n",
"2 2\nlremowak\nakciwodax\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\n`\nocol\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\n`\nloco\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\nloco\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\nlcoo\nretc`rahc\nnopd\n",
"3 2\na\nb\nd\nd\ne\n",
"6 5\na\nb\nc\nd\ne\nf\nf\ne\nd\n{\ny\n",
"1 1\n`a\naa\n",
"2 1\nb\na\na\n",
"2 2\nkremowka\nwadowicka\nakwomerk\nwiedenska\n",
"1 2\na\na\nc\n",
"1 1\naa\nba\n",
"3 3\nab\nbc\ncd\ndd\ndf\nfg\n",
"2 2\nkremowak\nwadowicka\nkrempwka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\nretcasahc\nnope\n",
"6 5\na\nb\n`\nd\ne\nf\nf\ne\nd\nz\ny\n",
"5 1\npolandball\nsi\na\ncool\nretc`rahc\nnope\n",
"5 1\npolandball\nsi\na\ncool\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwodaw\nkremowka\nwiedanske\n",
"2 2\nlremowak\nakciwodax\nkremowka\nwiedansek\n",
"5 1\npolandball\nhs\na\nocol\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\ncolo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnopd\n",
"1 1\na`\naa\n",
"3 3\nab\nbc\ndc\ndd\ndf\nfg\n",
"5 1\npolandball\nit\na\ncool\nretcasahc\nnope\n",
"6 5\n`\nb\n`\nd\ne\nf\nf\ne\nd\nz\ny\n",
"5 1\npolandball\nsi\n`\ncool\nretc`rahc\nnope\n",
"5 1\npolandball\nsi\nb\ncool\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwodax\nkremowka\nwiedansek\n",
"5 1\npolandball\nhs\na\nocol\nretc`rahc\nnope\n",
"5 1\npolandball\nis\na\ncnlo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnope\n",
"3 3\nab\nbc\ndc\ndd\ndf\ngf\n",
"6 5\n`\nb\n`\nd\ne\nf\nf\ne\nd\nz\nz\n",
"5 1\npolandball\nsi\n`\ncool\nretc`rahc\nnooe\n",
"5 1\npolandball\nsi\nb\nlooc\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwpdax\nkremowka\nwiedansek\n",
"5 1\nllabdnalop\nis\na\ncnlo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnoep\n",
"3 3\nac\nbc\ndc\ndd\ndf\ngf\n",
"5 1\npolandball\nsi\n`\ncool\nterc`rahc\nnooe\n",
"5 1\npolandball\nsi\nb\nlooc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\npeon\n",
"5 1\npolandball\nsi\n`\ncool\nchar`cret\nnooe\n",
"5 1\npolandball\nsi\nc\nlooc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcpo\nretc`rahc\npeon\n",
"5 1\npolandball\nsi\n`\nlooc\nchar`cret\nnooe\n",
"5 1\npolandball\nsi\nc\nlpoc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nopcl\nretc`rahc\npeon\n",
"5 1\npolandblal\nsi\nc\nlpoc\nretb`rahc\nnopd\n",
"5 1\npolandblal\nsi\nc\nlpoc\nretb`rahc\nnood\n",
"3 2\n`\nb\nc\nd\ne\n",
"2 2\na\nb\nb\nd\n",
"2 1\na\nc\na\n",
"2 2\nkremowka\nwadowicka\nkkemowra\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\ncharacter\nepon\n",
"6 5\na\nb\nb\nd\ne\nf\nf\ne\nd\nz\nx\n",
"3 3\nab\nbc\ncd\ndb\ndf\nfg\n",
"3 3\nc\na\nb\nb\nd\nh\n",
"5 1\npolandball\nis\na\ncool\nretcarahc\nepon\n",
"2 2\nkremowak\nwadawicko\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\nlooc\nretc`rahc\nnope\n",
"2 2\nkremokaw\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncloo\nretc`rahc\nnopd\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n"
]
} | 2CODEFORCES
|
755_B. PolandBall and Game_37998 | PolandBall is playing a game with EnemyBall. The rules are simple. Players have to say words in turns. You cannot say a word which was already said. PolandBall starts. The Ball which can't say a new word loses.
You're given two lists of words familiar to PolandBall and EnemyBall. Can you determine who wins the game, if both play optimally?
Input
The first input line contains two integers n and m (1 ≤ n, m ≤ 103) — number of words PolandBall and EnemyBall know, respectively.
Then n strings follow, one per line — words familiar to PolandBall.
Then m strings follow, one per line — words familiar to EnemyBall.
Note that one Ball cannot know a word more than once (strings are unique), but some words can be known by both players.
Each word is non-empty and consists of no more than 500 lowercase English alphabet letters.
Output
In a single line of print the answer — "YES" if PolandBall wins and "NO" otherwise. Both Balls play optimally.
Examples
Input
5 1
polandball
is
a
cool
character
nope
Output
YES
Input
2 2
kremowka
wadowicka
kremowka
wiedenska
Output
YES
Input
1 2
a
a
b
Output
NO
Note
In the first example PolandBall knows much more words and wins effortlessly.
In the second example if PolandBall says kremowka first, then EnemyBall cannot use that word anymore. EnemyBall can only say wiedenska. PolandBall says wadowicka and wins. | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
string st1[1005], st2[1005];
for (int i = 1; i <= n; i++) cin >> st1[i];
for (int i = 1; i <= m; i++) cin >> st2[i];
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (st1[i] == st2[j]) ans++;
n -= ans / 2;
m -= ans / 2;
if (ans % 2) m--;
if (n > m)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
| 2C++
| {
"input": [
"2 2\nkremowka\nwadowicka\nkremowka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\ncharacter\nnope\n",
"1 2\na\na\nb\n",
"3 2\na\nb\nc\nd\ne\n",
"6 5\na\nb\nc\nd\ne\nf\nf\ne\nd\nz\ny\n",
"1 1\naa\naa\n",
"2 2\na\nb\nb\nc\n",
"3 3\nab\nbc\ncd\ncd\ndf\nfg\n",
"2 1\na\nb\na\n",
"2 1\nc\na\na\n",
"3 3\nc\na\nb\na\nd\ng\n",
"6 5\na\nb\nb\nd\ne\nf\nf\ne\nd\nz\ny\n",
"1 1\naa\nab\n",
"3 3\nab\nbc\ncd\ndc\ndf\nfg\n",
"3 3\nc\na\nb\nb\nd\ng\n",
"2 2\nkremowak\nwadowicka\nkremowka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\nretcarahc\nnope\n",
"6 5\na\nb\na\nd\ne\nf\nf\ne\nd\nz\ny\n",
"2 2\nkremowak\nwadowicka\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncool\nretc`rahc\nnope\n",
"2 2\nkremowak\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncool\nretc`rahc\nnopd\n",
"2 2\nlremowak\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\nocol\nretc`rahc\nnopd\n",
"2 2\nlremowak\nakciwodax\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\n`\nocol\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\n`\nloco\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\nloco\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\nlcoo\nretc`rahc\nnopd\n",
"3 2\na\nb\nd\nd\ne\n",
"6 5\na\nb\nc\nd\ne\nf\nf\ne\nd\n{\ny\n",
"1 1\n`a\naa\n",
"2 1\nb\na\na\n",
"2 2\nkremowka\nwadowicka\nakwomerk\nwiedenska\n",
"1 2\na\na\nc\n",
"1 1\naa\nba\n",
"3 3\nab\nbc\ncd\ndd\ndf\nfg\n",
"2 2\nkremowak\nwadowicka\nkrempwka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\nretcasahc\nnope\n",
"6 5\na\nb\n`\nd\ne\nf\nf\ne\nd\nz\ny\n",
"5 1\npolandball\nsi\na\ncool\nretc`rahc\nnope\n",
"5 1\npolandball\nsi\na\ncool\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwodaw\nkremowka\nwiedanske\n",
"2 2\nlremowak\nakciwodax\nkremowka\nwiedansek\n",
"5 1\npolandball\nhs\na\nocol\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\ncolo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnopd\n",
"1 1\na`\naa\n",
"3 3\nab\nbc\ndc\ndd\ndf\nfg\n",
"5 1\npolandball\nit\na\ncool\nretcasahc\nnope\n",
"6 5\n`\nb\n`\nd\ne\nf\nf\ne\nd\nz\ny\n",
"5 1\npolandball\nsi\n`\ncool\nretc`rahc\nnope\n",
"5 1\npolandball\nsi\nb\ncool\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwodax\nkremowka\nwiedansek\n",
"5 1\npolandball\nhs\na\nocol\nretc`rahc\nnope\n",
"5 1\npolandball\nis\na\ncnlo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnope\n",
"3 3\nab\nbc\ndc\ndd\ndf\ngf\n",
"6 5\n`\nb\n`\nd\ne\nf\nf\ne\nd\nz\nz\n",
"5 1\npolandball\nsi\n`\ncool\nretc`rahc\nnooe\n",
"5 1\npolandball\nsi\nb\nlooc\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwpdax\nkremowka\nwiedansek\n",
"5 1\nllabdnalop\nis\na\ncnlo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnoep\n",
"3 3\nac\nbc\ndc\ndd\ndf\ngf\n",
"5 1\npolandball\nsi\n`\ncool\nterc`rahc\nnooe\n",
"5 1\npolandball\nsi\nb\nlooc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\npeon\n",
"5 1\npolandball\nsi\n`\ncool\nchar`cret\nnooe\n",
"5 1\npolandball\nsi\nc\nlooc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcpo\nretc`rahc\npeon\n",
"5 1\npolandball\nsi\n`\nlooc\nchar`cret\nnooe\n",
"5 1\npolandball\nsi\nc\nlpoc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nopcl\nretc`rahc\npeon\n",
"5 1\npolandblal\nsi\nc\nlpoc\nretb`rahc\nnopd\n",
"5 1\npolandblal\nsi\nc\nlpoc\nretb`rahc\nnood\n",
"3 2\n`\nb\nc\nd\ne\n",
"2 2\na\nb\nb\nd\n",
"2 1\na\nc\na\n",
"2 2\nkremowka\nwadowicka\nkkemowra\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\ncharacter\nepon\n",
"6 5\na\nb\nb\nd\ne\nf\nf\ne\nd\nz\nx\n",
"3 3\nab\nbc\ncd\ndb\ndf\nfg\n",
"3 3\nc\na\nb\nb\nd\nh\n",
"5 1\npolandball\nis\na\ncool\nretcarahc\nepon\n",
"2 2\nkremowak\nwadawicko\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\nlooc\nretc`rahc\nnope\n",
"2 2\nkremokaw\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncloo\nretc`rahc\nnopd\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n"
]
} | 2CODEFORCES
|
755_B. PolandBall and Game_37999 | PolandBall is playing a game with EnemyBall. The rules are simple. Players have to say words in turns. You cannot say a word which was already said. PolandBall starts. The Ball which can't say a new word loses.
You're given two lists of words familiar to PolandBall and EnemyBall. Can you determine who wins the game, if both play optimally?
Input
The first input line contains two integers n and m (1 ≤ n, m ≤ 103) — number of words PolandBall and EnemyBall know, respectively.
Then n strings follow, one per line — words familiar to PolandBall.
Then m strings follow, one per line — words familiar to EnemyBall.
Note that one Ball cannot know a word more than once (strings are unique), but some words can be known by both players.
Each word is non-empty and consists of no more than 500 lowercase English alphabet letters.
Output
In a single line of print the answer — "YES" if PolandBall wins and "NO" otherwise. Both Balls play optimally.
Examples
Input
5 1
polandball
is
a
cool
character
nope
Output
YES
Input
2 2
kremowka
wadowicka
kremowka
wiedenska
Output
YES
Input
1 2
a
a
b
Output
NO
Note
In the first example PolandBall knows much more words and wins effortlessly.
In the second example if PolandBall says kremowka first, then EnemyBall cannot use that word anymore. EnemyBall can only say wiedenska. PolandBall says wadowicka and wins. | import sys
input = sys.stdin.readline
n, m = input().split()
n = int(n)
m = int(m)
polW = []
eneW = []
turnsP = 0
turnsE = 0
same = 0
for i in range(n):
polW.append(input())
turnsP+=1
for i in range(m):
word = input()
if word in polW:
turnsP-=1
same+=1
else:
turnsE+=1
if same%2==1:
if turnsP >= turnsE:
print("YES")
else:
print("NO")
else:
if turnsP > turnsE:
print("YES")
else:
print("NO")
| 3Python3
| {
"input": [
"2 2\nkremowka\nwadowicka\nkremowka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\ncharacter\nnope\n",
"1 2\na\na\nb\n",
"3 2\na\nb\nc\nd\ne\n",
"6 5\na\nb\nc\nd\ne\nf\nf\ne\nd\nz\ny\n",
"1 1\naa\naa\n",
"2 2\na\nb\nb\nc\n",
"3 3\nab\nbc\ncd\ncd\ndf\nfg\n",
"2 1\na\nb\na\n",
"2 1\nc\na\na\n",
"3 3\nc\na\nb\na\nd\ng\n",
"6 5\na\nb\nb\nd\ne\nf\nf\ne\nd\nz\ny\n",
"1 1\naa\nab\n",
"3 3\nab\nbc\ncd\ndc\ndf\nfg\n",
"3 3\nc\na\nb\nb\nd\ng\n",
"2 2\nkremowak\nwadowicka\nkremowka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\nretcarahc\nnope\n",
"6 5\na\nb\na\nd\ne\nf\nf\ne\nd\nz\ny\n",
"2 2\nkremowak\nwadowicka\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncool\nretc`rahc\nnope\n",
"2 2\nkremowak\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncool\nretc`rahc\nnopd\n",
"2 2\nlremowak\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\nocol\nretc`rahc\nnopd\n",
"2 2\nlremowak\nakciwodax\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\n`\nocol\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\n`\nloco\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\nloco\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\nlcoo\nretc`rahc\nnopd\n",
"3 2\na\nb\nd\nd\ne\n",
"6 5\na\nb\nc\nd\ne\nf\nf\ne\nd\n{\ny\n",
"1 1\n`a\naa\n",
"2 1\nb\na\na\n",
"2 2\nkremowka\nwadowicka\nakwomerk\nwiedenska\n",
"1 2\na\na\nc\n",
"1 1\naa\nba\n",
"3 3\nab\nbc\ncd\ndd\ndf\nfg\n",
"2 2\nkremowak\nwadowicka\nkrempwka\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\nretcasahc\nnope\n",
"6 5\na\nb\n`\nd\ne\nf\nf\ne\nd\nz\ny\n",
"5 1\npolandball\nsi\na\ncool\nretc`rahc\nnope\n",
"5 1\npolandball\nsi\na\ncool\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwodaw\nkremowka\nwiedanske\n",
"2 2\nlremowak\nakciwodax\nkremowka\nwiedansek\n",
"5 1\npolandball\nhs\na\nocol\nretc`rahc\nnopd\n",
"5 1\npolandball\nis\na\ncolo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnopd\n",
"1 1\na`\naa\n",
"3 3\nab\nbc\ndc\ndd\ndf\nfg\n",
"5 1\npolandball\nit\na\ncool\nretcasahc\nnope\n",
"6 5\n`\nb\n`\nd\ne\nf\nf\ne\nd\nz\ny\n",
"5 1\npolandball\nsi\n`\ncool\nretc`rahc\nnope\n",
"5 1\npolandball\nsi\nb\ncool\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwodax\nkremowka\nwiedansek\n",
"5 1\npolandball\nhs\na\nocol\nretc`rahc\nnope\n",
"5 1\npolandball\nis\na\ncnlo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnope\n",
"3 3\nab\nbc\ndc\ndd\ndf\ngf\n",
"6 5\n`\nb\n`\nd\ne\nf\nf\ne\nd\nz\nz\n",
"5 1\npolandball\nsi\n`\ncool\nretc`rahc\nnooe\n",
"5 1\npolandball\nsi\nb\nlooc\nretc`rahc\nnopd\n",
"2 2\nkawomerl\nakciwpdax\nkremowka\nwiedansek\n",
"5 1\nllabdnalop\nis\na\ncnlo\nretc`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\nnoep\n",
"3 3\nac\nbc\ndc\ndd\ndf\ngf\n",
"5 1\npolandball\nsi\n`\ncool\nterc`rahc\nnooe\n",
"5 1\npolandball\nsi\nb\nlooc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcoo\nretc`rahc\npeon\n",
"5 1\npolandball\nsi\n`\ncool\nchar`cret\nnooe\n",
"5 1\npolandball\nsi\nc\nlooc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nlcpo\nretc`rahc\npeon\n",
"5 1\npolandball\nsi\n`\nlooc\nchar`cret\nnooe\n",
"5 1\npolandball\nsi\nc\nlpoc\nretb`rahc\nnopd\n",
"5 1\npplandball\nis\na\nopcl\nretc`rahc\npeon\n",
"5 1\npolandblal\nsi\nc\nlpoc\nretb`rahc\nnopd\n",
"5 1\npolandblal\nsi\nc\nlpoc\nretb`rahc\nnood\n",
"3 2\n`\nb\nc\nd\ne\n",
"2 2\na\nb\nb\nd\n",
"2 1\na\nc\na\n",
"2 2\nkremowka\nwadowicka\nkkemowra\nwiedenska\n",
"5 1\npolandball\nis\na\ncool\ncharacter\nepon\n",
"6 5\na\nb\nb\nd\ne\nf\nf\ne\nd\nz\nx\n",
"3 3\nab\nbc\ncd\ndb\ndf\nfg\n",
"3 3\nc\na\nb\nb\nd\nh\n",
"5 1\npolandball\nis\na\ncool\nretcarahc\nepon\n",
"2 2\nkremowak\nwadawicko\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\nlooc\nretc`rahc\nnope\n",
"2 2\nkremokaw\nakciwodaw\nkremowka\nwiedanske\n",
"5 1\npolandball\nis\na\ncloo\nretc`rahc\nnopd\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"YES\n",
"NO\n",
"YES\n",
"NO\n",
"YES\n"
]
} | 2CODEFORCES
|