text stringlengths 1.02k 43.5k | conversation_id int64 853 107k | embedding list | cluster int64 24 24 |
|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A process RAM is a sequence of bytes that are indexed from 1 to n. Polycarpus's program contains such instructions as "memset", that is, the operations of filling memory cells on a segment with some value. The details are: the code only contains m instructions that look like "set13 a_i l_i". Instruction i fills a continuous memory segment of length li, starting from cell number ai, (that it cells with numbers ai, ai + 1, ..., ai + li - 1) with values 13.
In Polycarpus's code, the optimizer's task is to remove the maximum number of instructions from his code in such a way that the remaining instructions set value 13 in all the memory bytes that got this value from the code before the optimization. Also, the value 13 should be set only in the memory bytes that got this value from the code before the optimization. Your task is to implement the optimizer for such program.
Input
The first line contains integers n and m (1 ≤ n ≤ 2·106, 1 ≤ m ≤ 2·105) — the number of bytes (memory cells) and the number of instructions in Polycarpus's code. Then m lines follow, each line contains a pair of integers ai, li (1 ≤ ai ≤ n, 1 ≤ li ≤ n - ai + 1).
Output
Print in the first line the sought maximum number of instructions that can be removed from the code. In the second line print the numbers of the instructions. The instructions are numbered from 1 to m in the order they appeared in the input. If there are multiple solutions, print any of them.
Examples
Input
10 4
3 3
3 1
4 1
9 2
Output
2
2 3
Input
1 1
1 1
Output
0
Submitted Solution:
```
#!/usr/bin/env python3
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(m)]
res = []
def inside(s, a):
for k in range(a[0], a[0] + a[1]):
if s[k-1] == 0:
return False
return True
for i in range(m):
cov = [0 for i in range(n)]
for j in range(m):
if i != j and j not in res:
for k in range(a[j][0], a[j][0] + a[j][1]):
cov[k - 1] = 1
if inside(cov, a[i]):
res.append(i)
print(len(res))
for i in res:
print(i + 1, end=' ')
```
No
| 89,599 | [
0.12359619140625,
0.160400390625,
-0.017059326171875,
0.11883544921875,
-0.43359375,
-0.1842041015625,
-0.462890625,
-0.07232666015625,
0.1063232421875,
0.392333984375,
0.4677734375,
0.0190582275390625,
0.361572265625,
-0.87841796875,
-0.4287109375,
0.171875,
-0.6943359375,
-0.7646... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A process RAM is a sequence of bytes that are indexed from 1 to n. Polycarpus's program contains such instructions as "memset", that is, the operations of filling memory cells on a segment with some value. The details are: the code only contains m instructions that look like "set13 a_i l_i". Instruction i fills a continuous memory segment of length li, starting from cell number ai, (that it cells with numbers ai, ai + 1, ..., ai + li - 1) with values 13.
In Polycarpus's code, the optimizer's task is to remove the maximum number of instructions from his code in such a way that the remaining instructions set value 13 in all the memory bytes that got this value from the code before the optimization. Also, the value 13 should be set only in the memory bytes that got this value from the code before the optimization. Your task is to implement the optimizer for such program.
Input
The first line contains integers n and m (1 ≤ n ≤ 2·106, 1 ≤ m ≤ 2·105) — the number of bytes (memory cells) and the number of instructions in Polycarpus's code. Then m lines follow, each line contains a pair of integers ai, li (1 ≤ ai ≤ n, 1 ≤ li ≤ n - ai + 1).
Output
Print in the first line the sought maximum number of instructions that can be removed from the code. In the second line print the numbers of the instructions. The instructions are numbered from 1 to m in the order they appeared in the input. If there are multiple solutions, print any of them.
Examples
Input
10 4
3 3
3 1
4 1
9 2
Output
2
2 3
Input
1 1
1 1
Output
0
Submitted Solution:
```
#!/usr/bin/env python3
def is_inside(a, b):
if a[0] > b[0] and a[0]+a[1] < b[0]+b[1]:
return True
return False
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(m)]
res = []
for i in range(m):
for j in range(m):
if i != j and i not in res and is_inside(a[i], a[j]):
res.append(i)
print(len(res))
for i in res:
print(i + 1, end=' ')
```
No
| 89,600 | [
0.140869140625,
0.13916015625,
0.0017976760864257812,
0.125244140625,
-0.399658203125,
-0.1639404296875,
-0.46337890625,
-0.08441162109375,
0.1168212890625,
0.406982421875,
0.4658203125,
0.02777099609375,
0.369384765625,
-0.87158203125,
-0.443115234375,
0.1455078125,
-0.70068359375,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A process RAM is a sequence of bytes that are indexed from 1 to n. Polycarpus's program contains such instructions as "memset", that is, the operations of filling memory cells on a segment with some value. The details are: the code only contains m instructions that look like "set13 a_i l_i". Instruction i fills a continuous memory segment of length li, starting from cell number ai, (that it cells with numbers ai, ai + 1, ..., ai + li - 1) with values 13.
In Polycarpus's code, the optimizer's task is to remove the maximum number of instructions from his code in such a way that the remaining instructions set value 13 in all the memory bytes that got this value from the code before the optimization. Also, the value 13 should be set only in the memory bytes that got this value from the code before the optimization. Your task is to implement the optimizer for such program.
Input
The first line contains integers n and m (1 ≤ n ≤ 2·106, 1 ≤ m ≤ 2·105) — the number of bytes (memory cells) and the number of instructions in Polycarpus's code. Then m lines follow, each line contains a pair of integers ai, li (1 ≤ ai ≤ n, 1 ≤ li ≤ n - ai + 1).
Output
Print in the first line the sought maximum number of instructions that can be removed from the code. In the second line print the numbers of the instructions. The instructions are numbered from 1 to m in the order they appeared in the input. If there are multiple solutions, print any of them.
Examples
Input
10 4
3 3
3 1
4 1
9 2
Output
2
2 3
Input
1 1
1 1
Output
0
Submitted Solution:
```
#!/usr/bin/env python3
def is_inside(a, b):
if a[0] >= b[0] and a[0]+a[1] <= b[0]+b[1]:
return True
return False
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(m)]
res = []
for i in range(m):
for j in range(m):
if i != j and j not in res and is_inside(a[i], a[j]):
res.append(i)
print(len(res))
for i in res:
print(i + 1, end=' ')
```
No
| 89,601 | [
0.1470947265625,
0.138671875,
0.00923919677734375,
0.12152099609375,
-0.40869140625,
-0.1630859375,
-0.465087890625,
-0.086181640625,
0.11309814453125,
0.413330078125,
0.45361328125,
0.0306396484375,
0.370849609375,
-0.87890625,
-0.443359375,
0.140625,
-0.703125,
-0.69873046875,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A process RAM is a sequence of bytes that are indexed from 1 to n. Polycarpus's program contains such instructions as "memset", that is, the operations of filling memory cells on a segment with some value. The details are: the code only contains m instructions that look like "set13 a_i l_i". Instruction i fills a continuous memory segment of length li, starting from cell number ai, (that it cells with numbers ai, ai + 1, ..., ai + li - 1) with values 13.
In Polycarpus's code, the optimizer's task is to remove the maximum number of instructions from his code in such a way that the remaining instructions set value 13 in all the memory bytes that got this value from the code before the optimization. Also, the value 13 should be set only in the memory bytes that got this value from the code before the optimization. Your task is to implement the optimizer for such program.
Input
The first line contains integers n and m (1 ≤ n ≤ 2·106, 1 ≤ m ≤ 2·105) — the number of bytes (memory cells) and the number of instructions in Polycarpus's code. Then m lines follow, each line contains a pair of integers ai, li (1 ≤ ai ≤ n, 1 ≤ li ≤ n - ai + 1).
Output
Print in the first line the sought maximum number of instructions that can be removed from the code. In the second line print the numbers of the instructions. The instructions are numbered from 1 to m in the order they appeared in the input. If there are multiple solutions, print any of them.
Examples
Input
10 4
3 3
3 1
4 1
9 2
Output
2
2 3
Input
1 1
1 1
Output
0
Submitted Solution:
```
#!/usr/bin/env python3
def is_inside(a, b):
if a[0] >= b[0] and a[0]+a[1] <= b[0]+b[1]:
return True
return False
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(m)]
res = []
for i in range(m):
for j in range(m):
if i != j and j not in res and is_inside(a[i], a[j]):
res.append(i)
break
print(len(res))
for i in res:
print(i + 1, end=' ')
```
No
| 89,602 | [
0.1470947265625,
0.138671875,
0.00923919677734375,
0.12152099609375,
-0.40869140625,
-0.1630859375,
-0.465087890625,
-0.086181640625,
0.11309814453125,
0.413330078125,
0.45361328125,
0.0306396484375,
0.370849609375,
-0.87890625,
-0.443359375,
0.140625,
-0.703125,
-0.69873046875,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a regular customer at the restaurant "Ber Patio". He likes having lunches there.
"Ber Patio" has special discount program for regular customers. A customer can collect bonuses and partially cover expenses in the restaurant.
Let's assume a customer currently has b bonuses and she has to pay r burles for a lunch. In this case the customer can use bonuses (1 bonus = 1 burle) to reduce the payment. She can cover at most half of the payment using bonuses. However, 1 bonus will be added to the customer's bonus balance per each 10 burles she paid.
Formally:
1. a customer can choose any number x of bonuses to use (<image>)),
2. the customer's bonus balance is reduced by x,
3. the customer pays r - x burles,
4. the customer's bonus balance is increased by ⌊(r - x) / 10⌋ (i.e. integer division rounded down is used).
Initially, there are b bonuses on Polycarp's account. Polycarp is going to have a lunch in "Ber Patio" for the next n days. He estimated the values a1, a2, ..., an, where ai is the number of burles in a receipt for the i-th day. The sum over all receipts doesn't exceed 105 burles.
Write a program to find the minimum number of burles Polycarp has to spend and an optimal strategy to use bonuses.
Input
The first line contains two integer numbers n and b (1 ≤ n ≤ 5000, 0 ≤ b ≤ 105) — number of days and initial number of bonuses Polycarp has.
The second line contains the integer sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the amount of burles in the i-th day's receipt.
It is guaranteed that the sum of all receipts does not exceed 105 burles.
Output
On the first line, print the expected minimal number of burles to pay for all n receipts.
On the second line, print the sequence of integer numbers b1, b2, ..., bn, where bi is the number of bonuses to use on the i-th day. If there are multiple solutions, print any of them.
Examples
Input
3 21
12 75 52
Output
110
2 5 22
Input
3 39
58 64 33
Output
107
28 4 16
Submitted Solution:
```
def div2(item):
if item < 10:
return item//2
else:
bod = (item - item%10)//2
if bod%10 == 0:
return bod + item%10 - 10
else:
return bod + item%10//2
def com(b, v):
if b<v:
return b
else:
return v
Finput = input().split()
b = int(Finput[1])
days = list(map(int, input().split()))
total = sum(days)
b_used = ''
cost = 0
for item in days:
total -= item
if b >= total//2:
used = com(b, div2(item))
else:
used = com(b, item%10)
b_used += str(used) + " "
b = b - used + (item - used)//10
cost += item - used
print(cost)
print(b_used.strip())
```
No
| 89,755 | [
0.3818359375,
0.13134765625,
0.0028438568115234375,
-0.1005859375,
-0.52294921875,
-0.2384033203125,
-0.128662109375,
0.2255859375,
-0.06903076171875,
0.70751953125,
0.833984375,
-0.02032470703125,
0.23974609375,
-0.53466796875,
-0.385498046875,
0.2469482421875,
-0.515625,
-0.65527... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a regular customer at the restaurant "Ber Patio". He likes having lunches there.
"Ber Patio" has special discount program for regular customers. A customer can collect bonuses and partially cover expenses in the restaurant.
Let's assume a customer currently has b bonuses and she has to pay r burles for a lunch. In this case the customer can use bonuses (1 bonus = 1 burle) to reduce the payment. She can cover at most half of the payment using bonuses. However, 1 bonus will be added to the customer's bonus balance per each 10 burles she paid.
Formally:
1. a customer can choose any number x of bonuses to use (<image>)),
2. the customer's bonus balance is reduced by x,
3. the customer pays r - x burles,
4. the customer's bonus balance is increased by ⌊(r - x) / 10⌋ (i.e. integer division rounded down is used).
Initially, there are b bonuses on Polycarp's account. Polycarp is going to have a lunch in "Ber Patio" for the next n days. He estimated the values a1, a2, ..., an, where ai is the number of burles in a receipt for the i-th day. The sum over all receipts doesn't exceed 105 burles.
Write a program to find the minimum number of burles Polycarp has to spend and an optimal strategy to use bonuses.
Input
The first line contains two integer numbers n and b (1 ≤ n ≤ 5000, 0 ≤ b ≤ 105) — number of days and initial number of bonuses Polycarp has.
The second line contains the integer sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the amount of burles in the i-th day's receipt.
It is guaranteed that the sum of all receipts does not exceed 105 burles.
Output
On the first line, print the expected minimal number of burles to pay for all n receipts.
On the second line, print the sequence of integer numbers b1, b2, ..., bn, where bi is the number of bonuses to use on the i-th day. If there are multiple solutions, print any of them.
Examples
Input
3 21
12 75 52
Output
110
2 5 22
Input
3 39
58 64 33
Output
107
28 4 16
Submitted Solution:
```
def div2(item):
bod = (item - item%10)//2
if bod%10 == 0:
return bod + item%10 - 10
else:
return bod + item%10//2
def com(b, v):
if b<v:
return b
else:
return v
Finput = input().split()
b = int(Finput[1])
days = list(map(int, input().split()))
total = sum(days)
b_used = ''
cost = 0
for item in days:
total -= item
if b >= total//2:
used = com(b, div2(item))
else:
used = com(b, item%10)
b_used += str(used) + " "
b = b - used + (item - used)//10
cost += item - used
print(cost)
print(b_used.strip())
```
No
| 89,756 | [
0.3818359375,
0.13134765625,
0.0028438568115234375,
-0.1005859375,
-0.52294921875,
-0.2384033203125,
-0.128662109375,
0.2255859375,
-0.06903076171875,
0.70751953125,
0.833984375,
-0.02032470703125,
0.23974609375,
-0.53466796875,
-0.385498046875,
0.2469482421875,
-0.515625,
-0.65527... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a regular customer at the restaurant "Ber Patio". He likes having lunches there.
"Ber Patio" has special discount program for regular customers. A customer can collect bonuses and partially cover expenses in the restaurant.
Let's assume a customer currently has b bonuses and she has to pay r burles for a lunch. In this case the customer can use bonuses (1 bonus = 1 burle) to reduce the payment. She can cover at most half of the payment using bonuses. However, 1 bonus will be added to the customer's bonus balance per each 10 burles she paid.
Formally:
1. a customer can choose any number x of bonuses to use (<image>)),
2. the customer's bonus balance is reduced by x,
3. the customer pays r - x burles,
4. the customer's bonus balance is increased by ⌊(r - x) / 10⌋ (i.e. integer division rounded down is used).
Initially, there are b bonuses on Polycarp's account. Polycarp is going to have a lunch in "Ber Patio" for the next n days. He estimated the values a1, a2, ..., an, where ai is the number of burles in a receipt for the i-th day. The sum over all receipts doesn't exceed 105 burles.
Write a program to find the minimum number of burles Polycarp has to spend and an optimal strategy to use bonuses.
Input
The first line contains two integer numbers n and b (1 ≤ n ≤ 5000, 0 ≤ b ≤ 105) — number of days and initial number of bonuses Polycarp has.
The second line contains the integer sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the amount of burles in the i-th day's receipt.
It is guaranteed that the sum of all receipts does not exceed 105 burles.
Output
On the first line, print the expected minimal number of burles to pay for all n receipts.
On the second line, print the sequence of integer numbers b1, b2, ..., bn, where bi is the number of bonuses to use on the i-th day. If there are multiple solutions, print any of them.
Examples
Input
3 21
12 75 52
Output
110
2 5 22
Input
3 39
58 64 33
Output
107
28 4 16
Submitted Solution:
```
def div2(item):
if item < 10:
return item//2
else:
LD1 = item%10
item1 = item//2
LD2 = item1%10
if LD1 == LD2:
return item1
elif LD1 > LD2:
return item1-(10-(LD1-LD2))
else:
return item1 - (LD2-LD1)
def com(b, v):
if b<v:
return b
else:
return v
Finput = input().split()
b = int(Finput[1])
days = list(map(int, input().split()))
total = sum(days)
b_used = ''
cost = 0
for item in days:
total -= item
if item == days[len(days)-1]:
used = com(b,item//2)
elif b >= total//2:
used = com(b, div2(item))
else:
used = com(b, item%10)
b_used += str(used) + " "
b = b - used + (item - used)//10
cost += item - used
print(cost)
print(b_used.strip())
```
No
| 89,757 | [
0.3818359375,
0.13134765625,
0.0028438568115234375,
-0.1005859375,
-0.52294921875,
-0.2384033203125,
-0.128662109375,
0.2255859375,
-0.06903076171875,
0.70751953125,
0.833984375,
-0.02032470703125,
0.23974609375,
-0.53466796875,
-0.385498046875,
0.2469482421875,
-0.515625,
-0.65527... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a regular customer at the restaurant "Ber Patio". He likes having lunches there.
"Ber Patio" has special discount program for regular customers. A customer can collect bonuses and partially cover expenses in the restaurant.
Let's assume a customer currently has b bonuses and she has to pay r burles for a lunch. In this case the customer can use bonuses (1 bonus = 1 burle) to reduce the payment. She can cover at most half of the payment using bonuses. However, 1 bonus will be added to the customer's bonus balance per each 10 burles she paid.
Formally:
1. a customer can choose any number x of bonuses to use (<image>)),
2. the customer's bonus balance is reduced by x,
3. the customer pays r - x burles,
4. the customer's bonus balance is increased by ⌊(r - x) / 10⌋ (i.e. integer division rounded down is used).
Initially, there are b bonuses on Polycarp's account. Polycarp is going to have a lunch in "Ber Patio" for the next n days. He estimated the values a1, a2, ..., an, where ai is the number of burles in a receipt for the i-th day. The sum over all receipts doesn't exceed 105 burles.
Write a program to find the minimum number of burles Polycarp has to spend and an optimal strategy to use bonuses.
Input
The first line contains two integer numbers n and b (1 ≤ n ≤ 5000, 0 ≤ b ≤ 105) — number of days and initial number of bonuses Polycarp has.
The second line contains the integer sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the amount of burles in the i-th day's receipt.
It is guaranteed that the sum of all receipts does not exceed 105 burles.
Output
On the first line, print the expected minimal number of burles to pay for all n receipts.
On the second line, print the sequence of integer numbers b1, b2, ..., bn, where bi is the number of bonuses to use on the i-th day. If there are multiple solutions, print any of them.
Examples
Input
3 21
12 75 52
Output
110
2 5 22
Input
3 39
58 64 33
Output
107
28 4 16
Submitted Solution:
```
def div2(item):
if item < 10:
return item
else:
bod = (item - item%10)//2
if bod%10 == 0:
return bod + item%10 - 10
else:
return bod + item%10//2
def com(b, v):
if b<v:
return b
else:
return v
Finput = input().split()
b = int(Finput[1])
days = list(map(int, input().split()))
total = sum(days)
b_used = ''
cost = 0
for item in days:
total -= item
if b >= total//2:
used = com(b, div2(item))
else:
used = com(b, item%10)
b_used += str(used) + " "
b = b - used + (item - used)//10
cost += item - used
print(cost)
print(b_used.strip())
```
No
| 89,758 | [
0.3818359375,
0.13134765625,
0.0028438568115234375,
-0.1005859375,
-0.52294921875,
-0.2384033203125,
-0.128662109375,
0.2255859375,
-0.06903076171875,
0.70751953125,
0.833984375,
-0.02032470703125,
0.23974609375,
-0.53466796875,
-0.385498046875,
0.2469482421875,
-0.515625,
-0.65527... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
from collections import deque, Counter, OrderedDict
from heapq import nsmallest, nlargest, heapify, heappop ,heappush, heapreplace
from math import ceil,floor,log,log2,sqrt,gcd,factorial,pow,pi
from bisect import bisect_left,bisect_right
def binNumber(n,size=4):
return bin(n)[2:].zfill(size)
def iar():
return list(map(int,input().split()))
def ini():
return int(input())
def isp():
return map(int,input().split())
def sti():
return str(input())
def par(a):
print(' '.join(list(map(str,a))))
def tdl(outerListSize,innerListSize,defaultValue = 0):
return [[defaultValue]*innerListSize for i in range(outerListSize)]
def sts(s):
s = list(s)
s.sort()
return ''.join(s)
def bis(a, x):
i = bisect_left(a, x)
if i != len(a) and a[i] == x:
return [i,True]
else:
return [-1,False]
class pair:
def __init__(self,f,s):
self.fi = f
self.se = s
def __lt__(self,other):
return (self.fi,self.se) < (other.fi,other.se)
# ========= /\ /| |====/|
# | / \ | | / |
# | /____\ | | / |
# | / \ | | / |
# ========= / \ ===== |/====|
# code
if __name__ == "__main__":
n = ini()
s1 = sti()
s2 = sti()
c = [0]*4
p = [[],[],[],[]]
for i in range(n):
if s1[i] == '0' and s2[i] == '0':
c[0] += 1
p[0].append(i+1)
if s1[i] == '0' and s2[i] == '1':
c[1] += 1
p[1].append(i+1)
if s1[i] == '1' and s2[i] == '0':
c[2] += 1
p[2].append(i+1)
if s1[i] == '1' and s2[i] == '1':
c[3] += 1
p[3].append(i+1)
for a in range(c[0]+1):
for b in range(c[1]+1):
d = c[3]+c[1] - n//2 + a
e = n//2 - a - b - d
#print(e,d)
if e > c[2] or d > c[3]:
continue
if d >= 0 and e >= 0:
for i in range(a):
print(p[0][i],end=" ")
for i in range(b):
print(p[1][i],end=" ")
for i in range(e):
print(p[2][i],end=" ")
for i in range(d):
print(p[3][i],end=" ")
quit()
print(-1)
```
| 90,166 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
# map(int, input().split())
# list(map(int, input().split()))
# for _ in range(int(input())):
n = int(input())
c = list(map(int, list(input())))
a = list(map(int, list(input())))
p = [0,0,0,0]
# 00,10,01,11
ind = [[],[],[],[]]
for i in range(n):
if c[i] and a[i]:
p[3] += 1
ind[3].append(i)
elif c[i]:
p[1] += 1
ind[1].append(i)
elif a[i]:
p[2] += 1
ind[2].append(i)
else:
p[0] += 1
ind[0].append(i)
first = [0,p[1],0,0]
second = [0,0,p[2],0]
def trans(i, n):
first[i] += n
second[i] -= n
if p[2] > p[1]:
d = p[2] - p[1]
first[2] += d
second[2] -= d
else:
d = p[1] - p[2]
first[1] -= d
second[1] += d
d = p[3]
while d>0:
if first[1]+first[3] > second[2]+second[3]:
second[3] += 1
d -= 1
else:
first[3] += 1
d -= 1
dif = first[1]+first[3] - (second[2]+second[3])
if dif > 0:
if first[2] > 0:
trans(2,-1)
elif first[1] > 0:
trans(1,-1)
elif first[3] > 0 and second[1] > 0:
trans(3,-1)
trans(1,1)
else:
print(-1)
quit()
elif dif < 0:
if second[1] > 0:
trans(1,1)
elif second[2] > 0:
trans(2,2)
elif second[3] > 0 and first[2] > 0:
trans(3,1)
trans(2,-1)
else:
print(-1)
quit()
d = p[0]
while d>0:
if sum(first) > sum(second):
second[0] += 1
d -= 1
else:
first[0] += 1
d -= 1
while sum(first) > sum(second):
if first[1]>0 and first[2]>0 and second[3]>0:
trans(1,-1)
trans(2,-1)
trans(3,1)
elif first[2]>1 and second[3] > 0:
trans(2,-1)
trans(2,-1)
trans(3,1)
else:
print(-1)
quit()
while sum(first) < sum(second):
if second[1]>0 and second[2]>0 and first[3]>0:
trans(1,1)
trans(2,1)
trans(3,-1)
elif second[1]>1 and first[3] > 0:
trans(1,1)
trans(1,1)
trans(3,-1)
else:
print(-1)
quit()
ans = []
for i in range(4):
for j in range(first[i]):
ans.append(ind[i][j])
print(' '.join([str(x+1) for x in ans]))
```
| 90,167 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
n = int(input())
n2 = n // 2
c = input()
a = input()
cl = []
ac = []
uni = []
par = []
res = []
for i in range(0, n):
if c[i] == "1":
if a[i]=="0":
cl.append(i+1)
else:
uni.append(i+1)
else:
if a[i]=="0":
par.append(i+1)
else:
ac.append(i+1)
lcl = len(cl)
lac = len(ac)
lpar = len(par)
luni = len(uni)
if lcl > n2 or lac > n2 or (lcl == 0 and lac == 0 and luni % 2 == 1):
print(-1)
else:
if luni + lpar - abs(lac - lcl) < 0:
print(-1)
else:
#Выравниваем массивы
if luni - abs(lac - lcl) < 0:
nmin = lpar
if nmin > abs(lac-lcl):
nmin = abs(lac-lcl)
if lcl < lac:
cl = cl + ac[lcl:lcl+nmin:1]
lcl = lcl + nmin
lpar = lpar-nmin
else:
if lcl > lac:
cl = cl[0:lcl-nmin:1] + par[0:nmin:1]
lac = lac + nmin
par = par[nmin:]
lpar = lpar-nmin
x = 0
if lcl < lac:
for i in range(0, lac-lcl):
cl.append(uni[i])
x = lac-lcl
if (luni - abs(lac - lcl)) % 2 == 1:
if lac > 0:
cl.append(ac[0])
else:
cl = cl[1:]
cl.append(uni[luni-1])
cl.append(par[lpar-1])
luni = luni-1
lpar = lpar-1
n4 = (luni - abs(lac - lcl)) // 2
for i in range(x, x+n4):
cl.append(uni[i])
n5 = lpar // 2
for i in range(0, n5):
cl.append(par[i])
print(*cl)
```
| 90,168 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
from sys import stdin,stdout
from math import gcd,sqrt,factorial,pi,inf
from collections import deque,defaultdict
from bisect import bisect,bisect_left
from time import time
from itertools import permutations as per
from heapq import heapify,heappush,heappop,heappushpop
input=stdin.readline
R=lambda:map(int,input().split())
I=lambda:int(input())
S=lambda:input().rstrip('\r\n')
L=lambda:list(R())
P=lambda x:stdout.write(str(x)+'\n')
lcm=lambda x,y:(x*y)//gcd(x,y)
nCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N
inv=lambda x:pow(x,N-2,N)
sm=lambda x:(x**2+x)//2
N=10**9+7
n=I()
g={(0,0):[],(1,0):[],(1,1):[],(0,1):[]}
for i,x,y in zip(range(n),S(),S()):
g[int(x),int(y)]+=i+1,
w=len(g[(0,0)])
x=len(g[(0,1)])
y=len(g[(1,1)])
z=len(g[(1,0)])
for b in range(len(g[(0,1)])+1):
for d in range(len(g[(1,1)])+1):
c=x+y-(b+2*d)
a=n//2-(b+d+c)
if w>=a>=0 and z>=c>=0:
print(*g[(0,0)][:a]+g[(1,1)][:d]+g[(1,0)][:c]+g[(0,1)][:b])
exit()
print(-1)
```
| 90,169 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
import sys
import random
N = int(input())
C = list(map(int, input()))
A = list(map(int, input()))
# N = random.randint(20, 40) * 2
# C = [random.randint(0, 1) for i in range(N)]
# A = [random.randint(0, 1) for i in range(N)]
def build_solution(i, j, x, y):
I = (0, 0)
J = (0, 1)
X = (1, 0)
Y = (1, 1)
ans = []
for q in range(N):
p = (C[q], A[q])
if i and p == I:
i -= 1
ans.append(q+1)
elif j and p == J:
j -= 1
ans.append(q+1)
elif x and p == X:
x -= 1
ans.append(q+1)
elif y and p == Y:
y -= 1
ans.append(q+1)
return map(str, ans)
a = b = c = d = 0
for i in range(N):
if C[i] == 0:
if A[i] == 0:
a += 1
else:
b += 1
else:
if A[i] == 0:
c += 1
else:
d += 1
# print(C)
# print(A)
# print(a, b, c, d, "N/2=", N//2)
for i in range(0, a+1):
y = - N//2 + i + b + d
if y < 0:
continue
min_j = max(0, N//2 - i - c - y)
max_j = min(b + 1, N //2 + 1)
# print(i, y, '[', min_j, max_j, ']')
for j in range(min_j, max_j):
x = N//2 - i - j - y
if x < 0:
break
# print("Check ", i, j, 'x, y:', x, y)
if not ((0 <= x <= c) and (0 <= y <= d)):
continue
# print('SOL', i, j, x, y)
sol = build_solution(i, j, x, y)
print(' '.join(sol))
exit(0)
print(-1)
# 1) loop over N
# 2) pick best actor on every iteration
# 3) try to minimize diff between teams
# if len(first) == len(second) and first.score == second.score:
# print(' '.join(map(lambda x: str(x+1), first)))
# else:
# print(-1)
# a, b, c, d = 13 5 2 1, N = 20
# i, j, x, y, SUM = 10
# i = 0
# j = 0
```
| 90,170 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
def find_sol1(result,num_dict):
ans_list = []
#print("result",result)
for i in range(num_dict['a']+1):
for j in range(num_dict['d']+1):
if i - j == result:
ans_list.append((i,j))
return ans_list
def find_sol2(N,num_dict,ans_list):
for a,d in ans_list:
for i in range(num_dict['b'] + 1):
for j in range(num_dict['c'] + 1):
if i + j + a + d == N//2:
b = i;c = j
return a,b,c,d
return -1,-1,-1,-1
if __name__ == '__main__':
N = int(input().strip())
clown = [int(i) for i in input().strip()]
acro = [int(i) for i in input().strip()]
num_dict = {'a':0,'b':0,'c':0,'d':0}
for i in range(N):
if clown[i] == 0 and acro[i] == 0:
num_dict['a']+=1
elif clown[i] == 1 and acro[i] == 0:
num_dict['b']+=1
elif clown[i] == 0 and acro[i] == 1:
num_dict['c']+=1
else:
num_dict['d']+=1
a,b,c,d= 0,0,0,0
result = N//2 - num_dict['c'] - num_dict['d']
ans_list = find_sol1(result,num_dict)
#print(a,b,c,d)
if ans_list == []:
print(-1)
else:
a,b,c,d = find_sol2(N,num_dict,ans_list)
if a == -1:
print(-1)
else:
ans = []
for i in range(N):
if clown[i] == 0 and acro[i] == 0:
if a > 0:
ans.append(i + 1)
a -= 1
elif clown[i] == 1 and acro[i] == 0:
if b > 0:
ans.append(i + 1)
b -= 1
elif clown[i] == 0 and acro[i] == 1:
if c > 0:
ans.append(i + 1)
c -= 1
else:
if d > 0:
ans.append(i + 1)
d -= 1
print(' '.join(str(i) for i in ans))
```
| 90,171 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
n = int(input())
s1 = input()
s2 = input()
w,x,y,z = 0,0,0,0
W,X,Y,Z = [],[],[],[]
for i in range(n):
s = s1[i] + s2[i]
if s == '00':
w += 1
W.append(i)
elif s == '11':
x += 1
X.append(i)
elif s =='10':
y += 1
Y.append(i)
else:
z += 1
Z.append(i)
can = False
res_count = []
for i in range(x+1):
for j in range(n//2+1):
req1,left1 = j - i, y - j + i
if req1 < 0:
continue
if y < req1 :
continue
req2 = j - (x - i)
left2 = z - req2
if req2 < 0 or z < req2 :
continue
if req2 + left1 + (x-i) > n//2 or req1 + left2 + i > n//2:
continue
w_req = n//2 - i - req1-left2
if w_req > w :
continue
res_count = [i,req1,left2]
can = True
break
if can : break
if not can:
print(-1)
exit(0)
res = []
for i in range(res_count[0]):
res.append(X[i]+1)
for i in range(res_count[1]):
res.append(Y[i]+1)
for i in range(res_count[2]):
res.append(Z[i]+1)
for i in range(n//2-len(res)):
res.append(W[i]+1)
res.sort()
print(' '.join(map(str,res)))
```
| 90,172 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Tags: brute force, greedy, math, strings
Correct Solution:
```
import sys
n=int(input())
s=input()
s1=input()
a=0
b=0
c=0
d=0
an=[]
for i in range(n):
if s[i]=='0' and s1[i]=='0':
a+=1
elif s[i]=='1' and s1[i]=='0':
b+=1
elif s[i]=='0' and s1[i]=='1':
c+=1
else:
d+=1
x=0
y=0
z=0
w=0
t=0
#print(a,b,c,d)
for i in range(a+1):
for j in range(d+1):
if (n//2)-i-j==c+d-2*j and n//2-i-j>=0 and n//2-i-j<=b+c:
x=i
y=min(b,n//2-i-j)
z=n//2-i-j-y
w=j
t=1
break
if t==0:
print(-1)
sys.exit()
for i in range(n):
if s[i]=='0' and s1[i]=='0' and x>0:
an.append(i+1)
x-=1
elif s[i]=='1' and s1[i]=='0' and y>0:
an.append(i+1)
y-=1
elif s[i]=='0' and s1[i]=='1' and z>0:
an.append(i+1)
z-=1
elif s[i]=='1' and s1[i]=='1' and w>0:
an.append(i+1)
w-=1
print(*an,sep=" ")
```
| 90,173 | [
0.391357421875,
-0.09429931640625,
0.1610107421875,
-0.09613037109375,
-0.07037353515625,
-0.68994140625,
-0.2091064453125,
0.04425048828125,
0.0794677734375,
0.97509765625,
0.77490234375,
-0.2646484375,
0.5322265625,
-0.8046875,
-0.38818359375,
0.859375,
-0.560546875,
-0.579101562... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
import sys
N = int(input())
n = N//2
A = input()
B = input()
C = [(a == '1') * 2 + (b == '1') for a, b in zip(A, B)]
w = C.count(0)
x = C.count(1)
y = C.count(2)
z = N - w - x - y
Ans = []
for i in range(x + 1):
for j in range(y + 1):
z1 = (x + z - i - j)
if z1 % 2:
continue
z1 //= 2
if not 0 <= z1 <= z:
continue
w1 = n - i - j - z1
if not 0 <= w1 <= w:
continue
cnt = [w1, i, j, z1]
ans = []
for k, a, b in zip(range(1, N+1), A, B):
if cnt[(a == '1') * 2 + (b == '1')] > 0:
cnt[(a == '1') * 2 + (b == '1')] -= 1
Ans.append(k)
print(*Ans)
sys.exit()
print(-1)
```
Yes
| 90,174 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
"""
4
0011
0101
"""
def calc(s, n, d):
cnts = [len(v) for v in d.values()]
half = n // 2
for a in range(0, cnts[0] + 1):
for b in range(0, cnts[1] + 1):
c = n - 2*a - b - s
d = a + s - half
if 0 <= c <= cnts[2] and 0 <= d <= cnts[3] and a + b + c + d == half and b + c + 2*d == s:
return True, a, b, c, d
return False,
def main():
n = int(input())
c_arr = list(map(int, list(input())))
a_arr = list(map(int, list(input())))
s = 0
kinds = [(0, 0), (0, 1), (1, 0), (1, 1)]
d = {kind: [] for kind in kinds}
for i in range(n):
if a_arr[i] == 1:
s += 1
d[(c_arr[i], a_arr[i])].append(i)
result, *params = calc(s, n, d)
if not result:
print(-1)
else:
ans = []
for i, kind in enumerate(kinds):
for j in range(params[i]):
ix = d[kind][j]
ans.append(str(ix + 1))
print(' '.join(ans))
if __name__ == '__main__':
main()
```
Yes
| 90,175 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
from sys import stdin, stdout
#T = int(input())
#s = input()
N = int(input())
#N,K = [int(x) for x in stdin.readline().split()]
#arr = [int(x) for x in stdin.readline().split()]
clown = input()
acro = input()
clown = list(clown)
acro = list(acro)
k1 = 0
k2 = 0
k3 = 0
k4 = 0
for i in range(N):
if clown[i]=='0' and acro[i]=='0':
k1 += 1
if clown[i]=='0' and acro[i]=='1':
k2 += 1
if clown[i]=='1' and acro[i]=='0':
k3 += 1
if clown[i]=='1' and acro[i]=='1':
k4 += 1
a = 0
b = 0
c = 0
d = 0
target = k1 + k3 - k2 - k4
if target%2==1:
print(-1)
quit()
if target<0:
a = 0
d = -target//2
else:
a = target//2
d = 0
valid = 0
for i in range(10000):
if a<=k1 and d<=k4:
#print(a,d)
# b+c = N//2 - a - d, find combination of b+c
b = N//2 - a - d
c = 0
while b>=0 and c>=0:
if b<=k2 and c<=k3:
# valid !!!
#print(a,b,c,d)
for j in range(N):
if clown[j]=='0' and acro[j]=='0' and a>0:
print(j+1,end=' ')
a -= 1
if clown[j]=='0' and acro[j]=='1' and b>0:
print(j+1,end=' ')
b -= 1
if clown[j]=='1' and acro[j]=='0' and c>0:
print(j+1,end=' ')
c -= 1
if clown[j]=='1' and acro[j]=='1' and d>0:
print(j+1,end=' ')
d -= 1
quit()
b -= 1
c += 1
else:
break
a += 1
d += 1
print(-1)
```
Yes
| 90,176 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
"""
4
0011
0101
"""
def calc(s, n, d):
cnts = [len(v) for v in d.values()]
half = n // 2
for a in range(0, cnts[0] + 1):
for b in range(0, cnts[1] + 1):
c = n - 2*a - b - s
d = a + s - half
if 0 <= c <= cnts[2] and 0 <= d <= cnts[3] and a + b + c + d == half and b + c + 2*d == s:
return True, a, b, c, d
return False,
def main():
n = int(input())
c_arr = list(map(int, list(input())))
a_arr = list(map(int, list(input())))
s = 0
kinds = [(0, 0), (0, 1), (1, 0), (1, 1)]
d = {kind: [] for kind in kinds}
for i in range(n):
if a_arr[i] == 1:
s += 1
d[(c_arr[i], a_arr[i])].append(i)
result, *params = calc(s, n, d)
if not result:
print(-1)
else:
flags = [False] * n
for i, kind in enumerate(kinds):
for j in range(params[i]):
ix = d[kind][j]
flags[ix] = True
for i in range(n):
if flags[i]:
print(i + 1, end=' ')
if __name__ == '__main__':
main()
```
Yes
| 90,177 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
n = int(input())
p = [[int(i), 0] for i in input()]
p00 = [[], []]
p01 = [[], []]
p11 = [[], []]
p10 = [[] ,[]]
indx = 0
for i, j in enumerate(list(input())):
p[i][1] = int(j)
if i>=n//2:
indx = 1
if p[i] == [0, 0]:
p00[indx].append(i)
if p[i] == [0, 1]:
p01[indx].append(i)
if p[i] == [1, 0]:
p10[indx].append(i)
if p[i] == [1, 1]:
p11[indx].append(i)
s1 = len(p11[0])+len(p10[0])
s2 = len(p11[1])+len(p01[1])
if s1 > s2:
p00[0], p00[1] = p00[1], p00[0]
p10[0], p10[1] = p10[1], p10[0]
p01[0], p01[1] = p01[1], p01[0]
p11[0], p11[1] = p11[1], p11[0]
s1, s2 = s2, s1
for i in range(100000):
while s1 <= s2-2 and len(p00[0])>0 and len(p11[1])>0:
p00[1].append(p00[0].pop())
p11[0].append(p11[1].pop())
s1 = len(p11[0])+len(p10[0])
s2 = len(p11[1])+len(p01[1])
if i == 100000:
print(s1,s2)
while s1 < s2 and len(p01[0])>0 and len(p11[1])>0:
p01[1].append(p01[0].pop())
p11[0].append(p11[1].pop())
s1 = len(p11[0])+len(p10[0])
s2 = len(p11[1])+len(p01[1])
if i == 100000:
print(s1,s2)
while s1 < s2 and len(p10[0])>0 and len(p11[1])>0:
p10[1].append(p10[0].pop())
p11[0].append(p11[1].pop())
s1 = len(p11[0])+len(p10[0])
s2 = len(p11[1])+len(p01[1])
if i == 100000:
print(s1,s2)
while s1 < s2 and len(p00[0])>0 and len(p10[1])>0:
p00[1].append(p00[0].pop())
p10[0].append(p10[1].pop())
s1 = len(p11[0])+len(p10[0])
s2 = len(p11[1])+len(p01[1])
if i == 100000:
print(s1,s2)
while s1 < s2 and len(p00[0])>0 and len(p01[1])>0:
p00[1].append(p00[0].pop())
p01[0].append(p01[1].pop())
s1 = len(p11[0])+len(p10[0])
s2 = len(p11[1])+len(p01[1])
if i == 100000:
print(s1,s2)
if s1 > s2:
p00[0], p00[1] = p00[1], p00[0]
p10[0], p10[1] = p10[1], p10[0]
p01[0], p01[1] = p01[1], p01[0]
p11[0], p11[1] = p11[1], p11[0]
s1, s2 = s2, s1
if n==5000:
#pass
print(s1, s2, len(p00[0]), len(p01[0]), len(p10[0]), len(p11[0]),len(p00[1]), len(p01[1]), len(p10[1]), len(p11[1]))
if s1==s2:
res = []
res += p00[0]
res += p01[0]
res += p10[0]
res += p11[0]
for i in res:
print(i + 1, end=' ')
print()
import sys
sys.exit(0)
print(-1)
```
No
| 90,178 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
a,b,c=0,0,0
n,s,t=int(input()),input(),input()
for i in range(n):
if s[i]==t[i]:
a+=1
elif s[i]=='1':
c+=1
else:
b+=1
if a+c<b or a+b<c or (a+c-b)%2==1:
print(-1)
exit(0)
cnt=(a+c-b)/2
for i in range(n):
if s[i]==t[i]:
if cnt>0:
print(i,end=" ")
cnt-=1
elif s[i]==1:
print(i,end=" ")
```
No
| 90,179 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
n=int(input())
a=input()
b=input()
init=sum(int(c) for c in b)-sum(int(c) for c in a)
mp={-1: [], 0: [], 1: []}
for i in range(n):
c=int(b[i])-int(a[i])
mp[c]+=[i+1]
need=n//2
ans=[]
while init<0:
if not mp[1]:
print(-1)
exit()
ans+=[mp[1].pop()]
need-=1
while init>0:
if not mp[-1]:
print(-1)
exit()
ans+=[mp[-1].pop()]
need-=1
if need<0:
print(-1)
exit()
if need%2>0:
if not mp[0]:
print(-1)
exit()
ans+=[mp[0].pop()]
o=min(len(mp[-1]), len(mp[1]))
while need>0 and o>0:
ans+=[mp[-1].pop(), mp[1].pop()]
need-=2
o-=1
if len(mp[0])<need:
print(-1)
exit()
while need>0:
ans+=[mp[0].pop()]
need-=1
print(*ans)
```
No
| 90,180 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then c_i = 1, otherwise c_i = 0), and whether they can perform as an acrobat (if yes, then a_i = 1, otherwise a_i = 0).
Split the artists into two performances in such a way that:
* each artist plays in exactly one performance,
* the number of artists in the two performances is equal (i.e. equal to n/2),
* the number of artists that can perform as clowns in the first performance is the same as the number of artists that can perform as acrobats in the second performance.
Input
The first line contains a single integer n (2 ≤ n ≤ 5 000, n is even) — the number of artists in the troupe.
The second line contains n digits c_1 c_2 … c_n, the i-th of which is equal to 1 if the i-th artist can perform as a clown, and 0 otherwise.
The third line contains n digits a_1 a_2 … a_n, the i-th of which is equal to 1, if the i-th artist can perform as an acrobat, and 0 otherwise.
Output
Print n/2 distinct integers — the indices of the artists that should play in the first performance.
If there are multiple answers, print any.
If there is no solution, print a single integer -1.
Examples
Input
4
0011
0101
Output
1 4
Input
6
000000
111111
Output
-1
Input
4
0011
1100
Output
4 3
Input
8
00100101
01111100
Output
1 2 3 6
Note
In the first example, one of the possible divisions into two performances is as follows: in the first performance artists 1 and 4 should take part. Then the number of artists in the first performance who can perform as clowns is equal to 1. And the number of artists in the second performance who can perform as acrobats is 1 as well.
In the second example, the division is not possible.
In the third example, one of the possible divisions is as follows: in the first performance artists 3 and 4 should take part. Then in the first performance there are 2 artists who can perform as clowns. And the number of artists in the second performance who can perform as acrobats is 2 as well.
Submitted Solution:
```
n = int(input())
s1 = input()
s2 = input()
c = s1.count('1')
a = s2.count('1')
ca = sum(1 for i in range(n) if s1[i] == '1' and s2[i] == '1')
c -= ca
a -= ca
if c > n//2 or a > n//2:
print(-1)
else:
p = lambda x: print(x + 1, end=' ')
v = n//2 - a
# print(n, n//2, v, ca)
for i in range(n):
if s1[i] == s2[i]:
if v > 0:
v -= 1
p(i)
elif s2[i] == '1':
p(i)
```
No
| 90,181 | [
0.45263671875,
-0.04534912109375,
0.1365966796875,
-0.1112060546875,
-0.1439208984375,
-0.54638671875,
-0.306640625,
0.08917236328125,
0.038604736328125,
0.89208984375,
0.72021484375,
-0.232177734375,
0.491455078125,
-0.78125,
-0.32568359375,
0.75634765625,
-0.55078125,
-0.51611328... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
"""
#If FastIO not needed, use this and don't forget to strip
#import sys, math
#input = sys.stdin.readline
"""
import os
import sys
from io import BytesIO, IOBase
import heapq as h
from bisect import bisect_left, bisect_right
import time
from types import GeneratorType
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
import os
self.os = os
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 = self.os.read(self._fd, max(self.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 = self.os.read(self._fd, max(self.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:
self.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")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
from collections import defaultdict as dd, deque as dq, Counter as dc
import math, string
start_time = time.time()
def getInts():
return [int(s) for s in input().split()]
def getInt():
return int(input())
def getStrs():
return [s for s in input().split()]
def getStr():
return input()
def listStr():
return list(input())
def getMat(n):
return [getInts() for _ in range(n)]
def isInt(s):
return '0' <= s[0] <= '9'
MOD = 10**9 + 7
"""
"""
def bootstrap(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
def solve():
x = input()
N, M = getInts()
graph = dd(set)
for m in range(M):
U, V = getInts()
U -= 1
V -= 1
graph[U].add(V)
D = [0]*N
def bfs(node):
queue = dq([])
queue.append((node,0))
visited = set()
visited.add(node)
while queue:
node, level = queue.popleft()
for neigh in graph[node]:
if neigh not in visited:
D[neigh] = level+1
visited.add(neigh)
queue.append((neigh,level+1))
bfs(0)
visited = set()
ans = [0]*N
@bootstrap
def dfs(node):
visited.add(node)
ans[node] = D[node]
for neigh in graph[node]:
if neigh not in visited and D[node] < D[neigh]:
yield dfs(neigh)
if D[node] < D[neigh]:
ans[node] = min(ans[node],ans[neigh])
else:
ans[node] = min(ans[node],D[neigh])
yield
dfs(0)
print(*ans)
return
for _ in range(getInt()):
#print(solve())
solve()
#print(time.time()-start_time)
```
| 90,348 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
import math,sys
#from itertools import permutations, combinations;import heapq,random;
from collections import defaultdict,deque
import bisect as bi
def yes():print('YES')
def no():print('NO')
#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
def I():return (int(sys.stdin.readline()))
def In():return(map(int,sys.stdin.readline().split()))
def Sn():return sys.stdin.readline().strip()
#sys.setrecursionlimit(1500)
def dict(a):
d={}
for x in a:
if d.get(x,-1)!=-1:
d[x]+=1
else:
d[x]=1
return d
def find_gt(a, x):
'Find leftmost value greater than x'
i = bi.bisect_left(a, x)
if i != len(a):
return i
else:
return -1
from types import GeneratorType
def bootstrap(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
@bootstrap
def dfs(d,visit,node,dp,high):
visit[node]=True
dp[node]=high[node]
for x in d[node]:
if not visit[x] and (high[node]<high[x]):
yield (dfs(d,visit,x,dp,high))
if high[node]<high[x]:
dp[node]=min(dp[node],dp[x])
else:
dp[node]=min(dp[node],high[x])
yield
def main():
try:
Extra=Sn()
d=defaultdict(list)
n,m=In()
for i in range(m):
a,b=In();d[a].append(b)
high=[-1]*(n+1);q=deque([1]);high[1]=0
while q:
node=q.popleft()
for x in d[node]:
if high[x]==-1:
high[x]=high[node]+1
q.append(x)
dp=[0]*(n+1)
# print(high)
visit=[False]*(n+1)
dfs(d,visit,1,dp,high)
print(*dp[1:])
except:
pass
M = 998244353
P = 1000000007
if __name__ == '__main__':
for _ in range(I()):main()
#for _ in range(1):main()
#End#
# ******************* All The Best ******************* #
```
| 90,349 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
import sys
def input():
return sys.stdin.readline().strip()
def mint():
return int(input())
def mints():
return map(int, input().split())
for i in range(mint()):
input()
n, m = mints()
n2 = n*2
e = [[] for i in range(n)]
eb = [[] for i in range(n)]
for i in range(m):
u, v = mints()
e[u-1].append(v-1)
eb[v-1].append(u-1)
q = [0]
d = [None]*n
d[0] = 0
i = 0
while i < len(q):
x = q[i]
i += 1
for v in e[x]:
if d[v] is None:
d[v] = d[x] + 1
q.append(v)
idx = [None]*n
for i in range(n):
idx[i] = (d[i], i)
idx.sort()
q = []
i = 0
was = [[None]*n for _ in range(2)]
ans = [int(2e9)]*n
for _, id in idx:
dd = d[id]
for s in range(2):
if was[s][id] is None:
was[s][id] = (-1,-1)
q.append((id,s))
ans[id] = min(ans[id],dd)
while i < len(q):
x, s = q[i]
i += 1
for v in eb[x]:
if d[x] > d[v]:
if was[s][v] is None:
q.append((v,s))
was[s][v] = (x, s)
ans[v] = min(ans[v],dd)
elif s == 1:
if was[0][v] is None:
q.append((v,0))
was[0][v] = (x, s)
ans[v] = min(ans[v],dd)
print(' '.join(map(str,ans)))
```
| 90,350 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
from queue import Queue
class Node:
def __init__(self, idx, d = -1):
self.d = d
self.idx = idx
self.par = []
t = int(input())
for _ in range(t):
dkk = input()
c, eds = tuple([int(x) for x in input().split()])
adl = [[] for i in range(c + 1)]
for z in range(eds):
u, v = tuple([int(x) for x in input().split()])
adl[u - 1].append(v - 1)
nodes = [Node(i) for i in range(c)]
q = Queue()
q.put(0)
ans = [10 ** 9] * c
ans[0] = nodes[0].d = 0
def rewind(x, dis):
if ans[x] > dis:
ans[x] = dis
else:
return
for sdd in nodes[x].par:
rewind(sdd, dis)
while q.qsize():
front = q.get()
# print('fr', front)
for e in adl[front]:
# print('e', e)
if nodes[e].d == -1:
q.put(e)
nodes[e].d = nodes[front].d + 1
nodes[e].par.append(front)
ans[e] = min(ans[e], nodes[e].d)
elif nodes[e].d > nodes[front].d:
nodes[e].par.append(front)
ans[e] = min(ans[e], nodes[e].d)
else:
rewind(front, nodes[e].d)
for e in ans:
print(e, end=' ')
print()
```
| 90,351 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
import sys
input=sys.stdin.buffer.readline #FOR READING PURE INTEGER INPUTS (space separation ok)
from queue import deque
from types import GeneratorType
def bootstrap(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
def multiLineArrayOfArraysPrint(arr):
print('\n'.join([' '.join([str(x) for x in y]) for y in arr]))
@bootstrap
def dp(node,nMove2): #return the min d value possible starting from node with at most nMove2 move 2s
# print('node:{} nMove2:{}'.format(node,nMove2))
if memo[node][nMove2]==None:
ans=d[node]
for nex in adj[node]:
if d[node]<d[nex]: #nMove doesnt change
ans=min(ans, (yield dp(nex,nMove2)))
else: #nMove2 increases by 1
if nMove2+1<=1:
ans=min(ans, (yield dp(nex,nMove2+1)))
memo[node][nMove2]=ans
yield memo[node][nMove2]
t=int(input())
allAns=[]
for _ in range(t):
input() # for the empty line
n,m=[int(x) for x in input().split()]
adj=[[] for _ in range(n+1)]
for __ in range(m):
u,v=[int(x) for x in input().split()]
adj[u].append(v)
d=[0 for _ in range(n+1)]
visited=[False for _ in range(n+1)]
q=deque() #[road,distance from capital]
q.append([1,0])
while q:
road,distance=q.popleft()
if visited[road]==True:
continue
d[road]=distance
visited[road]=True
for nex in adj[road]:
if visited[nex]==False:
q.append([nex,distance+1])
memo=[[None,None] for __ in range(n+1)]
ans=[]
for i in range(1,n+1):
ans.append(dp(i,0))
allAns.append(ans)
multiLineArrayOfArraysPrint(allAns)
```
| 90,352 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
# https://codeforces.com/problemset/problem/1472/G
from collections import defaultdict, deque
import sys
input = sys.stdin.readline
def get_distances(graph):
q = deque()
q.append(1)
q.append(None)
d, distances = 0, {}
while len(q) > 1:
u = q.popleft()
if u is None:
d += 1
q.append(None)
continue
if u in distances:
continue
distances[u] = d
for v in graph[u]:
if v not in distances:
q.append(v)
return distances
def bfs(starting_vertex, graph, visited, dists):
q = deque()
q.append((starting_vertex, None))
q.append((None, None))
d, nodes_at_d = 0, defaultdict(list)
while len(q) > 1:
u, parent = q.popleft()
if u is None:
d += 1
q.append((None, None))
continue
nodes_at_d[d].append((u, parent))
if u in visited:
continue
visited.add(u)
for v in graph[u]:
if v not in visited:
q.append((v, u))
else:
dists[u] = min(dists[u], dists[v])
while d >= 0:
for u, parent in nodes_at_d[d]:
if parent is not None:
dists[parent] = min(dists[parent], dists[u])
d -= 1
t = int(input())
for _ in range(t):
_ = input()
n, m = (int(i) for i in input().split(' '))
graph = defaultdict(list)
for _ in range(m):
u, v = (int(i) for i in input().split(' '))
graph[u].append(v)
dists = get_distances(graph)
new_graph = defaultdict(list)
for u in graph:
while graph[u]:
v = graph[u].pop()
if dists[v] > dists[u]:
new_graph[u].append(v)
new_graph[u+n].append(v+n)
else:
new_graph[u].append(v+n)
for u in range(1, n + 1):
dists[u + n] = dists[u]
visited = set()
bfs(1, new_graph, visited, dists)
for u in range(1, n + 1):
print(min(dists[u], dists[u + n]), end=' ')
print()
```
| 90,353 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
from collections import deque
class Graph(object):
"""docstring for Graph"""
def __init__(self,n,d): # Number of nodes and d is True if directed
self.n = n
self.graph = [[] for i in range(n)]
self.parent = [-1 for i in range(n)]
self.directed = d
def addEdge(self,x,y):
self.graph[x].append(y)
if not self.directed:
self.graph[y].append(x)
def bfs(self, root): # NORMAL BFS
queue = [root]
queue = deque(queue)
vis = [0]*self.n
dist = [0]*self.n
while len(queue)!=0:
element = queue.popleft()
vis[element] = 1
for i in self.graph[element]:
if vis[i]==0:
queue.append(i)
self.parent[i] = element
dist[i] = dist[element] + 1
vis[i] = 1
return dist
def dfs(self, root, minn): # Iterative DFS
ans = [i for i in minn]
stack=[root]
vis=[0]*self.n
stack2=[]
while len(stack)!=0: # INITIAL TRAVERSAL
element = stack.pop()
if vis[element]:
continue
vis[element] = 1
stack2.append(element)
for i in self.graph[element]:
if vis[i]==0:
self.parent[i] = element
stack.append(i)
# print (stack2)
while len(stack2)!=0: # BACKTRACING. Modify the loop according to the question
element = stack2.pop()
m = minn[element]
for i in self.graph[element]:
if i!=self.parent[element]:
m = min(m, ans[i])
ans[element] = m
return ans
def shortestpath(self, source, dest): # Calculate Shortest Path between two nodes
self.bfs(source)
path = [dest]
while self.parent[path[-1]]!=-1:
path.append(parent[path[-1]])
return path[::-1]
def detect_cycle(self):
indeg = [0]*self.n
for i in range(self.n):
for j in self.graph[i]:
indeg[j] += 1
q = deque()
vis = 0
for i in range(self.n):
if indeg[i]==0:
q.append(i)
while len(q)!=0:
e = q.popleft()
vis += 1
for i in self.graph[e]:
indeg[i] -= 1
if indeg[i]==0:
q.append(i)
if vis!=self.n:
return True
return False
def reroot(self, root, ans):
stack = [root]
vis = [0]*n
while len(stack)!=0:
e = stack[-1]
if vis[e]:
stack.pop()
# Reverse_The_Change()
continue
vis[e] = 1
for i in graph[e]:
if not vis[e]:
stack.append(i)
if self.parent[e]==-1:
continue
# Change_The_Answers()
def eulertour(self, root):
stack=[root]
t = []
while len(stack)!=0:
element = stack[-1]
if vis[element]:
t.append(stack.pop())
continue
t.append(element)
vis[element] = 1
for i in self.graph[element]:
if not vis[i]:
stack.append(i)
return t
for nt in range(int(input())):
input()
n, m = map(int, input().split())
adj = [[] for xy in range(n)]
for xy in range(m):
u, v = map(lambda x: int(x) - 1, input().split())
adj[u].append(v)
dis = [-1] * n
dis[0] = 0
que = [0]
for i in range(n):
u = que[i]
for v in adj[u]:
if dis[v] == -1:
dis[v] = dis[u] + 1
que.append(v)
ans = [0] * n
for u in sorted([i for i in range(n)], key=lambda x: dis[x], reverse=True):
ans[u] = dis[u]
for v in adj[u]:
if dis[u] >= dis[v]:
ans[u] = min(ans[u], dis[v])
else:
ans[u] = min(ans[u], ans[v])
print(*ans)
```
| 90,354 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Tags: dfs and similar, dp, graphs, shortest paths
Correct Solution:
```
from collections import deque
import os
import sys
from io import BytesIO, IOBase
from types import GeneratorType
from collections import defaultdict
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")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
sys.setrecursionlimit(2*10**5)
def bootstrap(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
@bootstrap
def dfs(u):
vis[u]=1
for j in adj[u]:
if dist[u]>=dist[j]:
continue
if not vis[j]:
yield dfs(j)
ans[u]=min(ans[u],ans[j])
yield
t=int(input())
for i in range(t):
p=input()
n,m=map(int,input().split())
adj=[[] for j in range(n+1)]
for j in range(m):
u,v=map(int,input().split())
adj[u].append(v)
dist=[float("inf")]*(n+1)
dist[1]=0
q=deque()
q.append(1)
vis=[0]*(n+1)
vis[1]=1
while(q):
u=q.popleft()
for j in adj[u]:
if not vis[j]:
dist[j]=1+dist[u]
vis[j]=1
q.append(j)
ans=[float("inf")]*(n+1)
for j in range(1,n+1):
vis[j]=0
ans[j]=dist[j]
for v in adj[j]:
ans[j]=min(ans[j],dist[v])
for i in range(1,n+1):
if not vis[i]:
dfs(i)
ans.pop(0)
print(*ans)
```
| 90,355 | [
0.26904296875,
0.3212890625,
0.37548828125,
0.1590576171875,
-0.445068359375,
-0.34228515625,
-0.19873046875,
-0.103515625,
0.08917236328125,
0.86181640625,
0.7646484375,
-0.15966796875,
0.254638671875,
-0.79443359375,
-0.763671875,
0.09442138671875,
-0.73046875,
-0.47314453125,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
import sys
from collections import deque
input = sys.stdin.buffer.readline
for _ in range(int(input())):
unko = input()
n,m = map(int,input().split())
pre_edge = [[] for i in range(n)]
for i in range(m):
u,v = map(int,input().split())
pre_edge[u-1].append(v-1)
deq = deque([0])
dist = [10**17 for i in range(n)]
dist[0] = 0
edge = [[] for i in range(n)]
while deq:
v = deq.popleft()
for nv in pre_edge[v]:
if dist[nv] > dist[v] + 1:
dist[nv] = dist[v] + 1
edge[v].append(nv)
deq.append(nv)
#print(dist)
dist_sort = [[] for i in range(n)]
for i in range(n):
dist_sort[dist[i]].append(i)
ans = [dist[i] for i in range(n)]
for d in range(n-1,-1,-1):
for v in dist_sort[d]:
for nv in pre_edge[v]:
if dist[nv] > dist[v]:
ans[v] = min(ans[v],ans[nv])
else:
ans[v] = min(dist[nv],ans[v])
print(*ans)
```
Yes
| 90,356 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
def __init__(self, file):
self.newlines = 0
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")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline()
# --------------------------------------------------------------------
def RL(): return map(int, sys.stdin.readline().split())
def RLL(): return list(map(int, sys.stdin.readline().split()))
def N(): return int(input())
def S(): return input().strip()
def print_list(l): print(' '.join(map(str, l)))
# sys.setrecursionlimit(200000)
# import random
# from functools import reduce
# from functools import lru_cache
# from heapq import *
# from collections import deque as dq
# from math import ceil
# import bisect as bs
# from collections import Counter
# from collections import defaultdict as dc
for i in range(N()):
input()
n, m = RL()
dic = [[] for _ in range(n)]
for _ in range(m):
u, v = RL()
dic[u - 1].append(v - 1)
dist = [-1] * n
dist[0] = 0
now = [0]
k = 1
while now:
nex = []
for u in now:
for v in dic[u]:
if dist[v] == -1:
dist[v] = k
nex.append(v)
now = nex
k += 1
deep = sorted([i for i in range(n)], key=lambda x:dist[x], reverse=True)
res = [n] * n
for u in deep:
res[u] = dist[u]
for v in dic[u]:
t = dist[v] if dist[v] <= dist[u] else res[v]
if t < res[u]: res[u] = t
print_list(res)
```
Yes
| 90,357 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import heapq
INF=10**9
def Dijkstra(graph, start):
dist=[INF]*len(graph)
parent=[INF]*len(graph)
queue=[(0, start)]
while queue:
path_len, v=heapq.heappop(queue)
if dist[v]==INF:
dist[v]=path_len
for w in graph[v]:
if dist[w[0]]==INF:
parent[w[0]]=v
heapq.heappush(queue, (dist[v]+w[1], w[0]))
return (dist,parent)
t=int(input())
for _ in range(t):
input()
n,m=map(int,input().split())
graph=[]
for i in range(n):
graph.append([])
edges=[]
for i in range(m):
x,y=map(int,input().split())
graph[x-1].append([y-1,1])
edges.append([x-1,y-1])
dist,parent=Dijkstra(graph,0)
visited=set()
mindist=[INF]*n
for i in range(n):
mindist[i]=dist[i]
for j in graph[i]:
mindist[i]=min(mindist[i],dist[j[0]])
graph2=[]
for i in range(n):
graph2.append([])
edges2=[]
for edge in edges:
x=edge[0]
y=edge[1]
if dist[y]>dist[x]:
graph2[x].append(y)
edges2.append([x,y])
vertices=[]
for i in range(n):
vertices.append([dist[i],i])
vertices.sort()
vertices.reverse()
for i in range(n):
index=vertices[i][1]
for j in graph2[index]:
mindist[index]=min(mindist[index],mindist[j])
for i in range(n):
mindist[i]=str(mindist[i])
print(' '.join(mindist))
```
Yes
| 90,358 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
import sys
input = sys.stdin.readline
from collections import deque
class Graph:
def __init__(self, N, M=False):
self.V = N
if M: self.E = M
self.edge = [[] for _ in range(self.V)]
self.visited = [False]*self.V
def add_edges(self, ind=1, bi=False):
self.edges = [0]*self.E
for i in range(self.E):
a,b = map(int, input().split())
a -= ind; b -= ind
self.edge[a].append(b)
self.edges[i] = (a,b)
if bi: self.edge[b].append(a)
def add_edge(self, a, b, bi=False):
self.edge[a].append(b)
if bi: self.edge[b].append(a)
def bfs(self, start):
d = deque([start])
self.min_cost = [-1]*self.V; self.min_cost[start]=0
while len(d)>0:
v = d.popleft()
for w in self.edge[v]:
if self.min_cost[w]==-1:
self.min_cost[w]=self.min_cost[v]+1
d.append(w)
return
def dfs(self, start, cost, N):
stack = deque([start])
self.visited[start] = True
ans[start] = min(ans[start], cost)
while stack:
v = stack.pop()
for u in self.edge[v]:
if self.visited[u]: continue
stack.append(u)
self.visited[u] = True
ans[u%N] = min(ans[u%N], cost)
T = int(input())
for t in range(T):
input()
N, M = map(int, input().split())
G = Graph(N,M)
G.add_edges(ind=1, bi=False)
G.bfs(0)
costs = []
for i,cos in enumerate(G.min_cost):
costs.append((cos,i))
costs.sort()
G2 = Graph(N*2)
for a,b in G.edges:
if G.min_cost[b]>G.min_cost[a]:
G2.add_edge(b,a); G2.add_edge(N+b,N+a)
else:
G2.add_edge(b,a+N)
ans = [N]*N
for cos,i in costs:
G2.dfs(i, cos, N)
print(*ans, sep=' ')
```
Yes
| 90,359 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
for _ in range(int(input())):
input()
n, m = list(map(int,input().split()))
q = [[int(i) for i in input().split()] for j in range(m)]
tree = {i: [] for i in range(1, n+1)}
rTree = {i: [] for i in range(1, n+1)}
for i in q:
tree[i[0]].append(i[1])
rTree[i[1]].append(i[0])
weight = {i: n for i in range(1, n+1)}
weight[1] = 0
r = [1]
pas = set()
while r!= []:
i = r.pop()
if i not in pas:
pas.add(i)
for j in tree[i]:
r.append(j)
weight[j] = min(weight[j], weight[i]+1)
print(tree)
tree = weight.copy()
print(tree)
r = [1]
t= 1
pas = set()
while r!= []:
i = r.pop()
if i not in pas:
pas.add(i)
for j in rTree[i]:
if j!= 1:
r.append(j)
if tree[j]> tree[i]:
if t == 1:
weight[j] = weight[i]
else:
weight[j] = tree[i]
elif t == 1:
weight[j] = weight[i]
t-= 1
for i in range(1,n+1):
print(weight[i], end = " ")
print()
```
No
| 90,360 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
from collections import defaultdict as dd,deque as dq
import sys
import bisect
input=sys.stdin.readline
t=int(input())
inf=10**6
def bfs(dis,d,n):
vis=[0]*(n+1)
q=dq([1])
dis[1]=0
while q:
u=q.pop()
val=dis[u]
for i in d[u]:
if(dis[i]>val+1):
dis[i]=val+1
q.append(i)
while t:
d=dd(list)
rd=dd(list)
_=input().split()
n,m=map(int,input().split())
dis=[inf]*(n+1)
dis1=[inf]*(n+1)
for i in range(m):
u,v=map(int,input().split())
d[u].append(v)
rd[v].append(u)
bfs(dis,d,n)
bfs(dis1,rd,n)
res=[0]*(n+1)
#print(*dis)
#print(*dis1)
for i in range(1,n+1):
res[i]=dis[i]
for j in d[i]:
#print(i,j)
if(dis1[j]-1<dis[j] and dis[j]>dis[i]):
res[i]=dis1[j]-1
res[i]=min(res[i],dis[j])
res[i]=max(res[i],0)
print(res[i],end=" ")
print()
t-=1
```
No
| 90,361 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
import sys
from collections import deque as dq
input = sys.stdin.readline
for _ in range(int(input())):
input()
n, m = map(int, input().split())
e = [[] for _ in range(n + 1)]
re = [[] for _ in range(n + 1)]
for _ in range(m):
u, v = map(int, input().split())
e[u].append(v)
re[v].append(u)
Q = dq([1])
d = [n] * (n + 1)
d[1] = 0
while len(Q):
x = Q.popleft()
for y in e[x]:
if d[y] > d[x] + 1:
d[y] = d[x] + 1
Q.append(y)
dp = [d[: ] for _ in range(2)]
vis = [0] * (n + 1)
s = [x for _, x in sorted([(d[i], i) for i in range(n)], reverse = True)]
#print(s)
while len(s):
x = s.pop()
for y in re[x]:
if vis[y]: continue
if d[y] >= d[x] and dp[1][y] > dp[0][x]:
dp[1][y] = dp[0][x]
s.append(y)
vis[y] = 1
if d[y] < d[x]:
if dp[1][y] > dp[1][x]: dp[1][y] = dp[1][x]
if dp[0][y] > dp[0][x]: dp[0][y] = dp[0][x]
s.append(y)
vis[y] = 1
#print(s, dp, x)
res = [min(dp[0][i], dp[1][i]) for i in range(1, n + 1)]
print(*res)
```
No
| 90,362 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Berland. The city numbered 1 is the capital. Some pairs of cities are connected by a one-way road of length 1.
Before the trip, Polycarp for each city found out the value of d_i — the shortest distance from the capital (the 1-st city) to the i-th city.
Polycarp begins his journey in the city with number s and, being in the i-th city, chooses one of the following actions:
1. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i < d_j;
2. Travel from the i-th city to the j-th city if there is a road from the i-th city to the j-th and d_i ≥ d_j;
3. Stop traveling.
Since the government of Berland does not want all people to come to the capital, so Polycarp no more than once can take the second action from the list. in other words, he can perform the second action 0 or 1 time during his journey. Polycarp, on the other hand, wants to be as close to the capital as possible.
<image>
For example, if n = 6 and the cities are connected, as in the picture above, then Polycarp could have made the following travels (not all possible options):
* 2 → 5 → 1 → 2 → 5;
* 3 → 6 → 2;
* 1 → 3 → 6 → 2 → 5.
Polycarp wants for each starting city i to find out how close he can get to the capital. More formally: he wants to find the minimal value of d_j that Polycarp can get from the city i to the city j according to the rules described above.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
Each test case is preceded by an empty line.
The first line of each test case contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and m (1 ≤ m ≤ 2 ⋅ 10^5) — number of cities and roads, respectively.
This is followed by m lines describing the roads. Each road is characterized by two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the numbers of cities connected by a one-way road.
It is guaranteed that the sums of n and m over all test cases do not exceed 2 ⋅ 10^5.
It is guaranteed that for each pair of different cities (u, v) there is at most one road from u to v (but a pair of roads from u to v and from v to u — is valid).
It is guaranteed that there is a path from the capital to all cities.
Output
For each test case, on a separate line output n numbers, the i-th of which is equal to the minimum possible distance from the capital to the city where Polycarp ended his journey.
Example
Input
3
6 7
1 2
1 3
2 5
2 4
5 1
3 6
6 2
2 2
1 2
2 1
6 8
1 2
1 5
2 6
6 1
2 3
3 4
4 2
5 4
Output
0 0 1 2 0 1
0 0
0 0 2 1 1 0
Submitted Solution:
```
import sys
input = sys.stdin.readline
from collections import *
def bfs():
q = deque([0])
dist = [-1]*n
dist[0] = 0
while q:
v = q.popleft()
for nv in G[v]:
if dist[nv]==-1:
dist[nv] = dist[v]+1
q.append(nv)
return dist
for _ in range(int(input())):
input()
n, m = map(int, input().split())
G = [[] for _ in range(n)]
edges = []
for _ in range(m):
u, v = map(int, input().split())
G[u-1].append(v-1)
edges.append((u-1, v-1))
dist = bfs()
m = [dist[v] for v in range(n)]
for v in range(n):
for nv in G[v]:
m[v] = min(m[v], dist[nv])
ins = [0]*n
outs = defaultdict(list)
for u, v in edges:
if dist[u]<dist[v]:
ins[v] += 1
outs[u].append(v)
q = deque([v for v in range(n)])
order = []
while q:
v = q.popleft()
order.append(v)
for nv in outs[v]:
ins[nv] -= 1
if ins[nv]==0:
q.append(nv)
for v in order[::-1]:
for nv in outs[v]:
m[v] = min(m[v], m[nv])
print(*m)
```
No
| 90,363 | [
0.369873046875,
0.413818359375,
0.339111328125,
0.1302490234375,
-0.5185546875,
-0.1988525390625,
-0.277587890625,
-0.0391845703125,
0.108154296875,
0.87841796875,
0.6259765625,
-0.06353759765625,
0.2340087890625,
-0.70458984375,
-0.76416015625,
0.024993896484375,
-0.7255859375,
-0... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
from collections import Counter
n, m = map(int, input().split())
g = [[] for _ in range(n)]
for i in range(m):
x, y = map(int, input().split())
g[x - 1].append(y - 1)
g[y - 1].append(x - 1)
bus = ([2] * (n - 2)) + ([1] * 2)
star = [1] * (n - 1) + [n - 1]
lns = [len(lst) for lst in g]
if lns == [2] * n:
print("ring topology")
elif Counter(lns) == Counter(bus):
print("bus topology")
elif Counter(lns) == Counter(star):
print("star topology")
else:
print("unknown topology")
```
| 90,435 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
from collections import defaultdict
I = lambda: map(int, input().split())
degrees = defaultdict(int)
n, m = I()
for _ in range(m):
u, v = I()
degrees[u] += 1
degrees[v] += 1
values = set(degrees.values())
answer = 'unknown'
if values == {2}:
answer = 'ring'
elif values == {1, 2}:
answer = 'bus'
elif values == {1, m}:
answer = 'star'
print(answer, 'topology')
```
| 90,436 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
n, m = map(int, input().split())
graph = {
i: [] for i in range(1, n+1)
}
for i in range(m):
start, end = map(int, input().split())
graph[start].append(end)
graph[end].append(start)
length_array = []
for i in graph:
length_array.append(len(graph[i]))
if min(length_array) == max(length_array) and max(length_array) == 2:
print('ring topology')
elif length_array.count(1) == 2 and length_array.count(2) == n - 2:
print('bus topology')
elif max(length_array) == m and m == n - 1:
print('star topology')
else:
print('unknown topology')
```
| 90,437 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
n, m = [int(i) for i in input().split()]
s = []
for i in range(n + 1):
s.append([])
for i in range(m):
x, y = [int(i) for i in input().split()]
s[x].append(y)
s[y].append(x)
sbool = [False] * (n + 1)
v2 = 0
v1 = 0
other = 0
def dfs(new):
global sbool, s, v2, v1, other
sbool[new] = True
if len(s[new]) == 1:
v1 += 1
elif len(s[new]) == 2:
v2 += 1
else:
other += 1
for i in range(1, n + 1):
dfs(i)
if v1 == 2 and v2 == n - 2:
print('bus topology')
elif v1 == n - 1 and other == 1:
print('star topology')
elif v2 == n:
print('ring topology')
else:
print('unknown topology')
```
| 90,438 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
n, m = [int(i) for i in input().split()]
graf = [[] for i in range(n + 1)]
for i in range(m):
k1, k2 = [int(i) for i in input().split()]
graf[k1].append(k2)
graf[k2].append(k1)
seks = [0, 0, 0]
for i in range(1, n + 1):
if len(graf[i]) == 1 or len(graf[i]) == 2:
seks[len(graf[i])] += 1
else:
seks[0] += 1
if seks[0] == 0 and seks[1] == 2:
print('bus topology')
elif seks[0] == seks[1] == 0:
print('ring topology')
elif seks[0] == 1 and seks[2] == 0:
print('star topology')
else:
print('unknown topology')
```
| 90,439 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
n, m = map(int, input().split())
d = dict()
maxi = 0
maxv = 0
for _ in range(m):
a, b = map(int, input().split())
if a - 1 in d:
d[a - 1] += 1
else:
d[a - 1] = 1
if b - 1 in d:
d[b - 1] += 1
else:
d[b - 1] = 1
if d[a - 1] > maxv:
maxv = d[a - 1]
maxi = a - 1
if d[b - 1] > maxv:
maxv = d[b - 1]
maxi = b - 1
if m + 1 == n:
if maxv == m:
print('star topology')
elif maxv == 2:
print('bus topology')
else:
print('unknown topology')
elif m == n:
if maxv == 2:
print('ring topology')
else:
print('unknown topology')
else:
print('unknown topology')
```
| 90,440 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
n,m = map(int,input().split())
v = []
def chek_star(v):
t = 0
for i in v:
if i != 1:
t+=1
if t == 1:
return True
return False
for i in range(n):
v.append(0)
for i in range(m):
t1,t2 = map(int,input().split())
v[t1-1]+=1
v[t2-1]+=1
if max(v) == 2 and min(v) == 2:
print("ring topology")
elif set(v) == set([1,2]):
print("bus topology")
elif set(v) == set([1,max(v)]) and chek_star(v):
print("star topology")
else:
print("unknown topology")
```
| 90,441 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Tags: graphs, implementation
Correct Solution:
```
# brute force baby
from sys import stdin
node,edge = map(int,input().split())
capt = [0]*node
for l in stdin.readlines():
a,b = map(int,l.split())
capt[a-1] +=1; capt[b-1] += 1
if capt.count(1) == node - 1:
print('star topology')
elif capt.count(2) == node:
print('ring topology')
elif capt.count(1) == 2 and capt.count(2) == node - 2:
print('bus topology')
else:
print('unknown topology')
```
| 90,442 | [
0.1810302734375,
0.08160400390625,
0.3251953125,
0.2410888671875,
0.08575439453125,
-0.359130859375,
-0.279541015625,
0.046966552734375,
0.30224609375,
0.82421875,
0.5732421875,
-0.2493896484375,
0.307861328125,
-0.92333984375,
-0.6357421875,
0.258544921875,
-0.53857421875,
-0.6113... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
from functools import reduce
def add(a,b):
return a+b
n,m = [int(x) for x in input().split()]
neigh = [[] for x in range(n)]
for i in range(m):
x,y = [int(a) for a in input().split()]
neigh[x-1].append(y)
neigh[y-1].append(x)
oneneigh, twoneigh, nneigh = 0,0,0
for i in neigh:
if len(i) == 1:
oneneigh += 1
elif len(i) == 2:
twoneigh += 1
else:
nneigh += 1
if twoneigh == n:
print('ring topology')
elif oneneigh == 2 and twoneigh == n-2:
print('bus topology')
elif nneigh == 1 and oneneigh == m:
print('star topology')
else:
print('unknown topology')
```
Yes
| 90,443 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
n,m = map(int, input().split())
db = [[] for i in range(n)]
for i in range(m):
x,y = map(int, input().split())
db[x-1].append(y)
db[y-1].append(x)
one = 0
two = 0
mx = 0
for i in range(n):
ln = len(db[i])
if ln == 1:
one += 1
elif ln == 2:
two += 1
mx = max(mx,ln)
if one == 2 and two == n-2:
print("bus topology")
elif two == n:
print("ring topology")
elif one == n-1 and mx == n-1:
print("star topology")
else:
print("unknown topology")
```
Yes
| 90,444 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
n,m = map(int, input().split())
adj = [[] for i in range(n+1)]
for i in range(m):
a,b = map(int, input().split())
adj[a].append(b)
adj[b].append(a)
edgeCount = [0]
for i in range(1,n+1):
edgeCount.append(len(adj[i]))
edgeCountCount = [0 for i in range(n+1)]
for i in edgeCount:
edgeCountCount[i] += 1
if edgeCountCount[1] == 2 and edgeCountCount[2] == n-2:
print('bus topology')
elif edgeCountCount[2] == m:
print('ring topology')
elif edgeCountCount[1] == m and edgeCountCount[m] == 1:
print('star topology')
else:
print('unknown topology')
```
Yes
| 90,445 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
n,m=map(int,input().split())
graph={}
for i in range(1,n+1):
graph[i]=[]
for i in range(m):
u,v=map(int,input().split())
graph[u].append(v)
graph[v].append(u)
c=0
d=0
#print(graph)
for i in range(1,n+1):
if len(graph[i])==1:
c=c+1
elif len(graph[i])>=2:
d=d+1
if m==n-1 and c==2 and d==n-2:
print("bus topology")
elif c==0 and d==n and m==n:
print("ring topology")
elif c==n-1 and d==1:
print("star topology")
else:
print("unknown topology")
```
Yes
| 90,446 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
from collections import defaultdict
I = lambda: list(map(int, input().split()))
degrees = defaultdict(int)
for _ in range(I()[1]):
u, v = I()
degrees[u] += 1
degrees[v] += 1
values = set(degrees.values())
if values == {1, 2}:
print('bus topology')
elif values == {2}:
print('ring topology')
elif len(values) == 2 and 1 in values:
print('star topology')
else:
print('unknown topology')
```
No
| 90,447 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
from collections import defaultdict
n, m = map(int, input().split())
h = defaultdict(set)
nums = [0] * n
for i in range(m):
u, v = map(int, input().split())
h[u].add(v)
h[v].add(u)
full = 0
one = 0
two = 0
for key, value in h.items():
if len(value) == n - 1: full += 1
if len(value) == 1: one += 1
if len(value) == 2: two += 1
if full == 1 and full + one == n:
print('star topology')
elif two == n:
print('ring topology')
elif two == n - 2 and one == 2:
print('bus topology')
else:
print('unkown topology')
```
No
| 90,448 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
n, m = [int(i) for i in input().split()]
nodes = []
edges = []
x = 0
for i in range(m):
nums = [int(i) for i in input().split()]
nodes.append(nums[0])
edges.append(nums[1])
if sum(nodes) == len(nodes):
print('star topology')
elif sum(nodes) == sum(edges):
print('ring topology')
elif x == 0:
for i in range(m):
if nodes[i] + 1 == edges[i]:
x += 1
if x == m:
print('bus topology')
else:
print('unknown topology')
```
No
| 90,449 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem uses a simplified network topology model, please read the problem statement carefully and use it as a formal document as you develop the solution.
Polycarpus continues working as a system administrator in a large corporation. The computer network of this corporation consists of n computers, some of them are connected by a cable. The computers are indexed by integers from 1 to n. It's known that any two computers connected by cable directly or through other computers
Polycarpus decided to find out the network's topology. A network topology is the way of describing the network configuration, the scheme that shows the location and the connections of network devices.
Polycarpus knows three main network topologies: bus, ring and star. A bus is the topology that represents a shared cable with all computers connected with it. In the ring topology the cable connects each computer only with two other ones. A star is the topology where all computers of a network are connected to the single central node.
Let's represent each of these network topologies as a connected non-directed graph. A bus is a connected graph that is the only path, that is, the graph where all nodes are connected with two other ones except for some two nodes that are the beginning and the end of the path. A ring is a connected graph, where all nodes are connected with two other ones. A star is a connected graph, where a single central node is singled out and connected with all other nodes. For clarifications, see the picture.
<image> (1) — bus, (2) — ring, (3) — star
You've got a connected non-directed graph that characterizes the computer network in Polycarpus' corporation. Help him find out, which topology type the given network is. If that is impossible to do, say that the network's topology is unknown.
Input
The first line contains two space-separated integers n and m (4 ≤ n ≤ 105; 3 ≤ m ≤ 105) — the number of nodes and edges in the graph, correspondingly. Next m lines contain the description of the graph's edges. The i-th line contains a space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n) — the numbers of nodes that are connected by the i-the edge.
It is guaranteed that the given graph is connected. There is at most one edge between any two nodes. No edge connects a node with itself.
Output
In a single line print the network topology name of the given graph. If the answer is the bus, print "bus topology" (without the quotes), if the answer is the ring, print "ring topology" (without the quotes), if the answer is the star, print "star topology" (without the quotes). If no answer fits, print "unknown topology" (without the quotes).
Examples
Input
4 3
1 2
2 3
3 4
Output
bus topology
Input
4 4
1 2
2 3
3 4
4 1
Output
ring topology
Input
4 3
1 2
1 3
1 4
Output
star topology
Input
4 4
1 2
2 3
3 1
1 4
Output
unknown topology
Submitted Solution:
```
n, m = map(int, input().split())
s = [set() for _ in range(n+1)]
for _ in range(m):
a, b = map(int, input().split())
s[a].add(b)
s[b].add(a)
x = set()
for i in range(1, n+1):
if len(s[i]) == 1:
x.add(i)
if len(x) == 0:
print("ring topology")
elif x == {1, n}:
print("bus topology")
elif len(x) == m:
print("star topology")
else:
print("unknown topology")
```
No
| 90,450 | [
0.2210693359375,
0.1009521484375,
0.30224609375,
0.2037353515625,
-0.0173187255859375,
-0.197998046875,
-0.34814453125,
0.05596923828125,
0.27587890625,
0.90380859375,
0.5380859375,
-0.07147216796875,
0.317138671875,
-0.8828125,
-0.55615234375,
0.31884765625,
-0.50390625,
-0.625976... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python3
[n, w] = map(int, input().strip().split())
ais = list(map(int, input().strip().split()))
ni = list(range(n))
ni.sort(key=lambda i: ais[i], reverse=True)
vis = [-((-a) // 2) for a in ais] # ceil
s = sum(vis)
if s > w:
print (-1)
else:
w -= s
for i in ni:
d = ais[i] - vis[i]
d = min(d, w)
vis[i] += d
w -= d
if w == 0:
break
print (' '.join(map(str, vis)))
```
| 91,349 | [
0.1439208984375,
0.20068359375,
0.462158203125,
0.08245849609375,
-0.41552734375,
-0.63525390625,
-0.169677734375,
0.55126953125,
0.087890625,
0.5947265625,
0.52392578125,
-0.057373046875,
0.1793212890625,
-0.69921875,
-0.6201171875,
0.3125,
-0.373291015625,
-0.60693359375,
-0.22... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
from collections import deque
import math
n,k=map(int,input().split())
arr=list(map(int,input().split()))
q=deque()
v=[False]*n
for i in range(n):
var=int(math.ceil(arr[i]/2))
if k>=var:
q.append(var)
k-=var
else:
print(-1)
exit()
#print(q)
for _ in range(n):
m=0
ind=0
for i in range(n):
if v[i]==True:
continue
else:
if arr[i]>m:
ind=i
m = max(m, arr[i])
v[ind] = True
if k>=(arr[ind]-q[ind]):
k-=arr[ind]-q[ind]
q[ind]=arr[ind]
#print(q)
else:
q[ind]+=k
print(*q)
exit()
print(*q)
```
| 91,350 | [
0.193359375,
0.2080078125,
0.4765625,
0.07806396484375,
-0.415771484375,
-0.5693359375,
-0.1119384765625,
0.490234375,
0.1610107421875,
0.6865234375,
0.60009765625,
-0.00830078125,
0.21875,
-0.7177734375,
-0.56591796875,
0.402099609375,
-0.36328125,
-0.6435546875,
-0.274658203125... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n, w = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
a_index = [(x, i) for i, x in enumerate(a)]
a_index.sort(reverse=True)
res = [0] * len(a)
for x, i in a_index:
need = (x+1) // 2
res[i] = need
w -= need
if w < 0:
print(-1)
exit(0)
if w > 0:
for x, i in a_index:
if w == 0:
break
need = min(w, x-res[i])
res[i] += need
w -= need
print(res[0], end="")
for i in range(1, len(res)):
print(" " + str(res[i]), end="")
print()
```
| 91,351 | [
0.197509765625,
0.1302490234375,
0.5029296875,
0.12353515625,
-0.425537109375,
-0.591796875,
-0.11273193359375,
0.53564453125,
0.1375732421875,
0.69384765625,
0.572265625,
-0.07427978515625,
0.2200927734375,
-0.80126953125,
-0.5908203125,
0.411376953125,
-0.437255859375,
-0.6943359... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
from sys import stdin, stdout
from math import ceil
n, w = map(int, stdin.readline().split())
values = list(map(int, stdin.readline().split()))
fill = [0 for i in range(n)]
for i in range(n):
values[i] = (values[i], i)
values.sort()
label = 1
for i in range(n - 1, -1, -1):
if ceil(values[i][0] / 2) <= w:
fill[i] = ceil(values[i][0] / 2)
w -= ceil(values[i][0] / 2)
else:
label = 0
if not label:
stdout.write(str('-1'))
else:
for i in range(n - 1, -1, -1):
cnt = min(w, values[i][0] - fill[i])
fill[i] += min(w, values[i][0] - fill[i])
w -= cnt
ans = [0 for i in range(n)]
if w:
stdout.write('-1')
else:
for i in range(n):
ans[values[i][1]] = fill[i]
stdout.write(' '.join(list(map(str, ans))))
```
| 91,352 | [
0.12432861328125,
0.13427734375,
0.55419921875,
0.1641845703125,
-0.467041015625,
-0.60400390625,
-0.146484375,
0.53271484375,
0.0701904296875,
0.6162109375,
0.459228515625,
-0.042999267578125,
0.232666015625,
-0.67138671875,
-0.54931640625,
0.319580078125,
-0.40234375,
-0.69824218... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
desc = input().split()
num = int(desc[0])
w = int(desc[1])
cups = list(map(int, input().split()))
halfsums = 0
resmilk = []
maxel = cups[0]
maxin = 0
maxls = []
for i in range(num):
if cups[i] > maxel:
maxel = cups[i]
maxin = i
if cups[i] % 2 == 0:
thiscup = cups[i]//2
else:
thiscup = (cups[i]//2) + 1
halfsums += thiscup
resmilk.append(thiscup)
if halfsums > w:
print(-1)
else:
while(halfsums != w):
if cups[maxin] - resmilk[maxin] < w - halfsums:
halfsums += cups[maxin] - resmilk[maxin]
resmilk[maxin] = cups[maxin]
maxls.append(maxin)
for i in range(num):
if i not in maxls:
maxin = i
maxel = cups[i]
break
for i in range(num):
if i not in maxls and cups[i] > maxel:
maxin = i
maxel = cups[i]
else:
resmilk[maxin] += w - halfsums
halfsums = w
for e in resmilk:
print(e, end=' ')
```
| 91,353 | [
0.1920166015625,
0.16064453125,
0.57275390625,
0.150146484375,
-0.412353515625,
-0.6494140625,
-0.10675048828125,
0.5283203125,
0.0655517578125,
0.6484375,
0.54541015625,
-0.01088714599609375,
0.241943359375,
-0.7685546875,
-0.5654296875,
0.465576171875,
-0.426025390625,
-0.703125,... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
#Mamma don't raises quitter.................................................
from collections import deque as de
import math
from math import sqrt as sq
from math import floor as fl
from math import ceil as ce
from sys import stdin, stdout
import re
from collections import Counter as cnt
from functools import reduce
from itertools import groupby as gb
#from fractions import Fraction as fr
from bisect import bisect_left as bl, bisect_right as br
def factors(n):
return set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))
class My_stack():
def __init__(self):
self.data = []
def my_push(self, x):
return (self.data.append(x))
def my_pop(self):
return (self.data.pop())
def my_peak(self):
return (self.data[-1])
def my_contains(self, x):
return (self.data.count(x))
def my_show_all(self):
return (self.data)
def isEmpty(self):
return len(self.data)==0
arrStack = My_stack()
#decimal to binary
def decimalToBinary(n):
return bin(n).replace("0b", "")
#binary to decimal
def binarytodecimal(n):
return int(n,2)
def isPrime(n) :
if (n <= 1) :
return False
if (n <= 3) :
return True
if (n % 2 == 0 or n % 3 == 0) :
return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
def get_prime_factors(number):
prime_factors = []
while number % 2 == 0:
prime_factors.append(2)
number = number / 2
for i in range(3, int(math.sqrt(number)) + 1, 2):
while number % i == 0:
prime_factors.append(int(i))
number = number / i
if number > 2:
prime_factors.append(int(number))
return prime_factors
def get_frequency(list):
dic={}
for ele in list:
if ele in dic:
dic[ele] += 1
else:
dic[ele] = 1
return dic
def Log2(x):
return (math.log10(x) /
math.log10(2));
# Function to get product of digits
def getProduct(n):
product = 1
while (n != 0):
product = product * (n % 10)
n = n // 10
return product
#function to find LCM of two numbers
def lcm(x,y):
lcm = (x*y)//math.gcd(x,y)
return lcm
def isPowerOfTwo(n):
return (math.ceil(Log2(n)) == math.floor(Log2(n)));
#to check whether the given sorted sequnce is forming an AP or not....
def checkisap(list):
d=list[1]-list[0]
for i in range(2,len(list)):
temp=list[i]-list[i-1]
if temp !=d:
return False
return True
#seive of erathanos
def primes_method5(n):
out ={}
sieve = [True] * (n+1)
for p in range(2, n+1):
if (sieve[p]):
out[p]=1
for i in range(p, n+1, p):
sieve[i] = False
return out
#function to get the sum of digits
def getSum(n):
strr = str(n)
list_of_number = list(map(int, strr.strip()))
return sum(list_of_number)
#ceil function gives wrong answer after 10^17 so i have to create my own :)
# because i don't want to doubt on my solution of 900-1000 problem set.
def ceildiv(x,y):
return (x+y-1)//y
def di():return map(int, input().split())
def ii():return int(input())
def li():return list(map(int, input().split()))
def si():return list(map(str, input()))
def indict():
dic = {}
for index, value in enumerate(input().split()):
dic[int(value)] = int(index)+1
return dic
def frqdict():
# by default it is for integer input. :)
dic={}
for index, value in enumerate(input()):
if value not in dic:
dic[value] =1
else:
dic[value] +=1
return dic
#inp = open("input.txt","r")
#out = open("output.txt","w")
#Here we go......................
#practice like your never won
#perform like you never lost
n,w=di()
a=[]
fuls=0
halfs=0
for index,value in enumerate(input().split()):
fuls+=int(value)
halfs+=ce(int(value)/2)
a.append(int(value))
if w < halfs:
print(-1)
else:
if w==halfs:
for i in range(n):
print(ce(a[i]/2), end=" ")
elif w==fuls:
print(*a, sep=" ")
else:
ans=[]
for i in range(n):
ans.append([a[i],ce(a[i]/2),i])
ans.sort(reverse=True)
diff=w-halfs
ch=1
ans2=[]
for i in range(n):
if ch:
halfele = ans[i][1]
fulfele = ans[i][0]
elediff=fulfele-halfele
if diff > elediff :
diff-=elediff
ans[i][1]=fulfele
elif diff ==elediff:
ans[i][1]=fulfele
ch=0
else:
ans[i][1]+=diff
ch=0
ans2.append([ans[i][2], ans[i][1]])
ans2.sort()
for i in range(n):
print(ans2[i][1], end=" ")
```
| 91,354 | [
0.228515625,
0.13671875,
0.5107421875,
0.105712890625,
-0.402099609375,
-0.65673828125,
-0.2042236328125,
0.48583984375,
0.116455078125,
0.6376953125,
0.5322265625,
-0.038970947265625,
0.232666015625,
-0.67578125,
-0.482421875,
0.408935546875,
-0.416748046875,
-0.7333984375,
-0.3... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n, w = [int(inp) for inp in input().split()]
cap = [int(a) for a in input().split(" ")]
val = [0] * n
for i in range(n):
cap[i] = (cap[i], i)
cap.sort()
cap.reverse()
for i in range(n):
val[i] = cap[i][0]//2 + int(cap[i][0] % 2 != 0)
w -= val[i]
if w < 0:
print(-1)
exit()
for i in range(n):
v = min(w, cap[i][0] - val[i])
val[i] += v
w -= v
res = [0] * n
for i in range(n):
res[cap[i][1]] = val[i]
for r in res:
print(r, end=" ")
```
| 91,355 | [
0.1884765625,
0.0948486328125,
0.5439453125,
0.1387939453125,
-0.379150390625,
-0.60400390625,
-0.05596923828125,
0.44970703125,
0.08953857421875,
0.68701171875,
0.6162109375,
-0.061004638671875,
0.2052001953125,
-0.7822265625,
-0.505859375,
0.36572265625,
-0.368896484375,
-0.64941... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
import sys,math
Tests=1
for _ in range(Tests):
n,w=map(int,sys.stdin.readline().split())
a=list(map(int,sys.stdin.readline().split()))
s=0
for i in range(n):
s+=(a[i]+1)//2
if w<s:
print(-1)
else:
ans=[0]*n
for i in range(n):
ans[i]=(a[i]+1)//2
w-=s
while(w>0):
ind=a.index(max(a))
t=min(w,a[ind]-ans[ind])
ans[ind]+=t
w-=t
a[ind]=0
print(*ans)
```
| 91,356 | [
0.1812744140625,
0.118896484375,
0.53125,
0.1295166015625,
-0.41943359375,
-0.6806640625,
-0.08221435546875,
0.4912109375,
0.09722900390625,
0.68896484375,
0.52880859375,
-0.05145263671875,
0.233642578125,
-0.75048828125,
-0.58251953125,
0.369140625,
-0.405517578125,
-0.6806640625,... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
n, w = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [(x + 1) // 2 for x in a]
w -= sum(b)
if w > 0:
a = [(a[i], i) for i in range(n)]
a.sort(reverse=True)
for i in range(n):
x = min(a[i][0] - b[a[i][1]], w)
w -= x
b[a[i][1]] += x
if w == 0:
break
if w >= 0:
print(*b)
else:
print(-1)
```
Yes
| 91,357 | [
0.18994140625,
0.10015869140625,
0.4267578125,
0.11480712890625,
-0.464111328125,
-0.48388671875,
-0.2027587890625,
0.58740234375,
0.085693359375,
0.64599609375,
0.486328125,
0.041839599609375,
0.1759033203125,
-0.63916015625,
-0.54833984375,
0.346435546875,
-0.453125,
-0.701171875... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
import math
n, w = map(int, input().split())
volumes = []
possible = True
teacups = [0] * n
vals = list(map(int, input().split()))
for i in range(n):
poured = math.ceil(vals[i] / 2)
w -= poured
if w < 0:
possible = False
break
volumes.append((vals[i], i))
teacups[i] = poured
if not possible:
print(-1)
else:
svolumes = sorted(volumes, reverse=True)
for j in svolumes:
extra = j[0] - teacups[volumes.index(j)]
if w - extra < 0:
teacups[j[1]] += w
break
w -= extra
teacups[j[1]] += extra
print(' '.join(str(t) for t in teacups))
```
Yes
| 91,358 | [
0.2237548828125,
0.1146240234375,
0.453857421875,
0.135986328125,
-0.47802734375,
-0.4951171875,
-0.176513671875,
0.5595703125,
0.091796875,
0.64990234375,
0.51953125,
0.05841064453125,
0.185546875,
-0.62255859375,
-0.5517578125,
0.38134765625,
-0.445556640625,
-0.69189453125,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
import math
n, w = [int(x) for x in input().split()]
s = input().split()
a = sorted([[int(s[x]), x] for x in range(n)], key=lambda x: x[0], reverse=True)
b = [[math.ceil(x[0]/2), x[1]] for x in a]
sm = sum([x[0] for x in b])
if sm > w:
print(-1)
else:
w -= sm
i = 0
while w:
if b[i][0] < a[i][0]:
b[i][0] += 1
w -= 1
else:
i += 1
for i in [x[0] for x in sorted(b, key=lambda x: x[1])]:
print(i, end=' ')
```
Yes
| 91,359 | [
0.2276611328125,
0.11578369140625,
0.44873046875,
0.1314697265625,
-0.467529296875,
-0.483154296875,
-0.1890869140625,
0.57470703125,
0.10797119140625,
0.65234375,
0.51123046875,
0.051361083984375,
0.154541015625,
-0.625,
-0.54638671875,
0.348876953125,
-0.4052734375,
-0.7006835937... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
# Author: Boonnithi Jiaramaneepinit
# Python Interpreter Version: Python 3.5.2
#
# Note: Educational Codeforces Round 21
import math
def fillTea(water, cups):
curW = water
for i in range(len(cups)):
curW -= math.ceil(cups[i]/2)
cups[i] = [cups[i], i, math.ceil(cups[i]/2)]
cups = sorted(cups, key=lambda l:l[0], reverse=True)
if curW < 0:
return ['-1']
# eqLeft = math.floor(curW/len(cups))
# uneqLeft = curW % len(cups)
# print(curW, cups)
# for i in range(len(cups)):
# if i < uneqLeft:
# cups[i][2] += 1
# cups[i][2] = cups[i][2] + eqLeft
curCup = 0
while curW > 0:
curP = min(cups[curCup][0] - cups[curCup][2], curW)
cups[curCup][2] += curP
curW -= curP
curCup += 1
cups = sorted(cups, key=lambda l:l[1], reverse=False)
for i in range(len(cups)):
cups[i] = str(cups[i][2])
# print(curW, cups)
if curW < 0:
return ['-1']
return cups
'''
3 20
22 2 1
'''
if __name__ == '__main__':
[n, w] = [int(x) for x in input().split()]
cups = [int(x) for x in input().split()]
# [n, w] = [3, 20]
# cups = [22, 2, 1]
print(' '.join(fillTea(w, cups)))
```
Yes
| 91,360 | [
0.234619140625,
0.07513427734375,
0.4443359375,
0.0997314453125,
-0.52490234375,
-0.496826171875,
-0.152587890625,
0.5986328125,
0.10693359375,
0.58056640625,
0.478515625,
-0.0090484619140625,
0.1397705078125,
-0.52197265625,
-0.59375,
0.34912109375,
-0.38720703125,
-0.73095703125,... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
n, w = map(int, input().split())
a = list(map(int, input().split()))
b = [(ai + 1) // 2 for ai in a]
r = w - sum(b)
if r < 0:
print(-1)
else:
ind = sorted(range(n), key=lambda i: a[i], reverse=True)
for i in ind:
if r <= a[i] - b[i]:
b[i] += r
break
b[i] = a[i]
r -= a[i] - b[i]
print(*b)
```
No
| 91,361 | [
0.197265625,
0.132568359375,
0.4326171875,
0.101806640625,
-0.481201171875,
-0.50732421875,
-0.1998291015625,
0.5693359375,
0.09100341796875,
0.6318359375,
0.484130859375,
0.05029296875,
0.157958984375,
-0.6376953125,
-0.55224609375,
0.32080078125,
-0.440185546875,
-0.6875,
-0.16... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
q, w = map(int, input().split())
s = list(map(int, input().split()))
p = list(map(lambda x: ((x + (x % 2)) // 2), s))
lp = sum(p)
o = 0
if lp > w:
print(-1)
else:
k = (w - lp) // len(p)
p = list(map(lambda x: x + k, p))
h = sorted(p, reverse=True)
w -= lp
w %= len(p)
while w > 0:
k = p.index(h[o])
h[o] += 1
p[k] += 1
if p[k] == s[k]:
o += 1
w -= 1
print(*p)
```
No
| 91,362 | [
0.19873046875,
0.1263427734375,
0.443603515625,
0.10150146484375,
-0.48291015625,
-0.5107421875,
-0.221923828125,
0.57763671875,
0.08843994140625,
0.6083984375,
0.474365234375,
0.047271728515625,
0.1702880859375,
-0.61279296875,
-0.5458984375,
0.343505859375,
-0.424072265625,
-0.70... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
import math
n, w = map(int, input().split())
arr = list(map(int, input().split()))
minNeed = 0
ans = []
for i in range(n):
minNeed += math.ceil(arr[i]/2)
ans.append(math.ceil(arr[i]/2))
if minNeed > w:
print(-1)
else:
ans[arr.index(max(arr))] += (w - minNeed)
print(*ans)
```
No
| 91,363 | [
0.2047119140625,
0.1595458984375,
0.401123046875,
0.134765625,
-0.466552734375,
-0.513671875,
-0.1893310546875,
0.55810546875,
0.0640869140625,
0.61572265625,
0.52294921875,
0.00943756103515625,
0.114990234375,
-0.62255859375,
-0.59765625,
0.3349609375,
-0.463623046875,
-0.6953125,... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, ..., an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + ... + an). Polycarp wants to pour tea in cups in such a way that:
* Every cup will contain tea for at least half of its volume
* Every cup will contain integer number of milliliters of tea
* All the tea from the teapot will be poured into cups
* All friends will be satisfied.
Friend with cup i won't be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.
For each cup output how many milliliters of tea should be poured in it. If it's impossible to pour all the tea and satisfy all conditions then output -1.
Input
The first line contains two integer numbers n and w (1 ≤ n ≤ 100, <image>).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 100).
Output
Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them.
If it's impossible to pour all the tea and satisfy all conditions then output -1.
Examples
Input
2 10
8 7
Output
6 4
Input
4 4
1 1 1 1
Output
1 1 1 1
Input
3 10
9 8 10
Output
-1
Note
In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.
Submitted Solution:
```
n,totaltea=map(int,input().split())
ar=list(map(int,input().split()))
ans=[0]*n
for i in range(n):ans[i]=(ar[i]+1)//2
if sum(ans)>totaltea:print(-1)
else:
for i in range(n):
ar[i]=[ar[i],i]
ar=sorted(ar)[::-1]
remain=totaltea-sum(ans)
for i in range(n):
if remain==40:break
k=min(remain,ar[i][0]-ans[ar[i][1]])
ans[ar[i][1]]+=k
remain-=k
if remain!=0:print(-1)
else:print(*ans)
```
No
| 91,364 | [
0.2252197265625,
0.175537109375,
0.443603515625,
0.054534912109375,
-0.482421875,
-0.5068359375,
-0.211181640625,
0.552734375,
0.0958251953125,
0.62939453125,
0.46826171875,
0.05712890625,
0.1427001953125,
-0.6083984375,
-0.51513671875,
0.310302734375,
-0.43505859375,
-0.6762695312... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
for i in range(int(input())):
n, a, b = map(int, input().split())
print(min(n * a, n // 2 * b + a * ((n + 1) // 2 - n // 2)))
```
| 91,745 | [
0.205810546875,
0.409912109375,
0.0419921875,
0.1474609375,
-0.615234375,
-0.056304931640625,
0.150146484375,
0.103271484375,
0.291748046875,
0.904296875,
1.0029296875,
-0.302490234375,
-0.2410888671875,
-0.5146484375,
-0.58154296875,
0.306396484375,
-0.4599609375,
-0.55322265625,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
q = int(input())
for i in range(q):
n, a, b = list(map(int, input().split()))
if 2 * a <= b:
print(n * a)
else:
print((n // 2) * b + (n % 2) * a)
```
| 91,746 | [
0.181884765625,
0.412841796875,
0.038421630859375,
0.12152099609375,
-0.62841796875,
-0.06353759765625,
0.1585693359375,
0.10479736328125,
0.295166015625,
0.92822265625,
0.99951171875,
-0.28662109375,
-0.236572265625,
-0.55224609375,
-0.572265625,
0.282470703125,
-0.486328125,
-0.5... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
q=int(input())
for i in range(q):
l=list(map(int,input().split()))
n=l[0]
a=l[1]
b=l[2]
if 2*a<=b:
print(a*n)
else:
print((n//2)*b+(n%2)*a)
```
| 91,747 | [
0.18408203125,
0.416259765625,
0.03564453125,
0.1319580078125,
-0.61767578125,
-0.059478759765625,
0.177001953125,
0.10015869140625,
0.30517578125,
0.9287109375,
1.013671875,
-0.290771484375,
-0.2274169921875,
-0.5595703125,
-0.5673828125,
0.2939453125,
-0.487060546875,
-0.56445312... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
q = int(input())
ans = []
for i in range(q):
summ = 0
n , a , b = map(int , input().split())
if a * 2 < b : x = 2 * a
else : x = b
summ += (n // 2) * x
if (n % 2) : summ += a
ans += [str(summ)]
print("\n".join(ans))
```
| 91,748 | [
0.2054443359375,
0.425048828125,
0.06707763671875,
0.1107177734375,
-0.603515625,
-0.08184814453125,
0.150390625,
0.10015869140625,
0.2900390625,
0.91748046875,
1.0048828125,
-0.296630859375,
-0.240234375,
-0.5244140625,
-0.5791015625,
0.30517578125,
-0.488525390625,
-0.56640625,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
amount = int(input())
for i in range(amount):
n,a,b = [int(s) for s in input().split()]
if 2 * a <= b:
print(n * a)
else:
print(a * (n % 2) + (n // 2) * b)
```
| 91,749 | [
0.178955078125,
0.42236328125,
0.033843994140625,
0.115234375,
-0.62353515625,
-0.0697021484375,
0.1875,
0.09539794921875,
0.307373046875,
0.92041015625,
1.0078125,
-0.28271484375,
-0.2193603515625,
-0.54248046875,
-0.58251953125,
0.27685546875,
-0.485107421875,
-0.57666015625,
-... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
def run(n1, a1, b1):
if 2 * a1 < b1:
res = n1 * a1
else:
res = b1 * int(n1 / 2) + a1 * (n1 % 2)
return res
q = int(input())
for i in range(0, q):
s = input()
n = int(s.split(" ")[0])
a = int(s.split(" ")[1])
b = int(s.split(" ")[2])
print(run(n, a, b))
```
| 91,750 | [
0.21484375,
0.429443359375,
0.040771484375,
0.1102294921875,
-0.61865234375,
-0.06353759765625,
0.1597900390625,
0.08770751953125,
0.303466796875,
0.92333984375,
0.99169921875,
-0.294677734375,
-0.25634765625,
-0.5361328125,
-0.58251953125,
0.296875,
-0.493408203125,
-0.5625,
-0.... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
for _ in range(int(input())):
n,a,b=map(int, input().split())
print(min((n//2)*b+(n%2)*a,a*n))
```
| 91,751 | [
0.206298828125,
0.406982421875,
0.043609619140625,
0.1507568359375,
-0.61328125,
-0.06292724609375,
0.1541748046875,
0.1036376953125,
0.29296875,
0.9150390625,
1,
-0.297119140625,
-0.2315673828125,
-0.5244140625,
-0.57177734375,
0.31103515625,
-0.461181640625,
-0.552734375,
-0.64... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Tags: math
Correct Solution:
```
import sys
def main(n, a, b):
d = b - 2*a
if d < 0:
return n//2*b + n%2*a
else:
return n*a
if __name__ == "__main__":
first = True
for line in sys.stdin:
if first:
first = False
continue
l = line.strip().split(' ')
l = [int(x) for x in l]
print(main(l[0], l[1], l[2]))
```
| 91,752 | [
0.1953125,
0.39794921875,
0.07696533203125,
0.11785888671875,
-0.634765625,
-0.0555419921875,
0.1177978515625,
0.070556640625,
0.302490234375,
0.90185546875,
0.96923828125,
-0.295654296875,
-0.2177734375,
-0.5224609375,
-0.5791015625,
0.323974609375,
-0.4892578125,
-0.568359375,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
def A():
q = int(input())
for i in range(q):
n , a , b = map(int , input().split())
if(2*a<b):
print(n*a)
continue
else:
print(n//2*b+(n%2)*a)
A()
```
Yes
| 91,753 | [
0.228515625,
0.4013671875,
-0.04315185546875,
0.044769287109375,
-0.70654296875,
0.0230255126953125,
0.031463623046875,
0.201416015625,
0.258056640625,
0.9541015625,
0.92431640625,
-0.263427734375,
-0.2066650390625,
-0.59033203125,
-0.5615234375,
0.2198486328125,
-0.51318359375,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
q = int(input())
ans = []
for i in range(q):
n,a,b = map(int, input().split())
costs = []
costs.append(n*a)
costs.append(((n//2)*b) + ((n % 2) * a))
ans.append(min(costs))
for i in range(q):
print(ans[i],end="\n")
```
Yes
| 91,754 | [
0.2086181640625,
0.40966796875,
-0.038360595703125,
0.06915283203125,
-0.66845703125,
-0.00428009033203125,
0.0303497314453125,
0.1888427734375,
0.251708984375,
0.94287109375,
0.92919921875,
-0.27783203125,
-0.2432861328125,
-0.587890625,
-0.5576171875,
0.2322998046875,
-0.517578125,... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
n=int(input())
for i in range(n):
n,a,b=map(int,input().split())
k=min(2*a,b)
print((n//2)*k+(n%2)*a)
```
Yes
| 91,755 | [
0.2225341796875,
0.4111328125,
-0.04815673828125,
0.061737060546875,
-0.6845703125,
0.011474609375,
0.026824951171875,
0.1932373046875,
0.2447509765625,
0.93212890625,
0.92724609375,
-0.2783203125,
-0.241455078125,
-0.60205078125,
-0.55810546875,
0.2236328125,
-0.488037109375,
-0.6... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
def mi():
return map(int, input().split())
'''
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
'''
for _ in range(int(input())):
n,a,b = mi()
if 2*a<b:
print (n*a)
else:
print ((n//2)*b+(n%2)*a)
```
Yes
| 91,756 | [
0.234619140625,
0.408935546875,
-0.025146484375,
0.034271240234375,
-0.71435546875,
0.009124755859375,
0.0285797119140625,
0.1876220703125,
0.269775390625,
0.9423828125,
0.92919921875,
-0.25244140625,
-0.2032470703125,
-0.56591796875,
-0.552734375,
0.2359619140625,
-0.49560546875,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
q = int(input())
for i in' '*q:
n, a, b = map(int, input().split())
print(min(a * n, n // 2 * b if n // 2 else n // 2 * b + a))
```
No
| 91,757 | [
0.218505859375,
0.412353515625,
-0.040496826171875,
0.0853271484375,
-0.6767578125,
0.00878143310546875,
0.0372314453125,
0.194091796875,
0.2415771484375,
0.92724609375,
0.9248046875,
-0.272216796875,
-0.24169921875,
-0.6005859375,
-0.56591796875,
0.224365234375,
-0.49609375,
-0.60... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
for i in range(int(input())):
b = list(map(int, input().split()))
if b[0] % 2 == 0: print(b[0]*b[1]) if b[1] <= b[2]//2 else print(b[0]*(b[2]//2))
else: print(b[1]+(b[0]-1)* min(b[1], b[2]//2))
```
No
| 91,758 | [
0.2215576171875,
0.397705078125,
-0.0202789306640625,
0.050689697265625,
-0.689453125,
0.01666259765625,
0.0386962890625,
0.1947021484375,
0.2548828125,
0.9482421875,
0.94091796875,
-0.280029296875,
-0.2166748046875,
-0.58349609375,
-0.56298828125,
0.2105712890625,
-0.5078125,
-0.5... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
def water_problem():
query_num = eval(input())
output_buffer = []
for i in range(query_num):
water_liter, price1liter, price2liter = input().split(' ')
water_liter, price1liter, price2liter = eval(water_liter), eval(price1liter), eval(price2liter)
if price2liter / 2 >= price1liter:
num_of_1liter, num_of_2liter = water_liter, 0
else:
num_of_2liter = water_liter // 2
num_of_1liter = water_liter % 2
output_buffer.append(str(num_of_1liter) + ' ' + str(num_of_2liter))
for output in output_buffer:
print(output)
return
if __name__ == '__main__':
water_problem()
```
No
| 91,759 | [
0.2025146484375,
0.426513671875,
-0.0305633544921875,
0.0465087890625,
-0.70751953125,
0.0301361083984375,
0.0643310546875,
0.212890625,
0.28515625,
0.91259765625,
0.91015625,
-0.276611328125,
-0.1590576171875,
-0.54833984375,
-0.56298828125,
0.22705078125,
-0.48681640625,
-0.58789... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wants to cook a soup. To do it, he needs to buy exactly n liters of water.
There are only two types of water bottles in the nearby shop — 1-liter bottles and 2-liter bottles. There are infinitely many bottles of these two types in the shop.
The bottle of the first type costs a burles and the bottle of the second type costs b burles correspondingly.
Polycarp wants to spend as few money as possible. Your task is to find the minimum amount of money (in burles) Polycarp needs to buy exactly n liters of water in the nearby shop if the bottle of the first type costs a burles and the bottle of the second type costs b burles.
You also have to answer q independent queries.
Input
The first line of the input contains one integer q (1 ≤ q ≤ 500) — the number of queries.
The next q lines contain queries. The i-th query is given as three space-separated integers n_i, a_i and b_i (1 ≤ n_i ≤ 10^{12}, 1 ≤ a_i, b_i ≤ 1000) — how many liters Polycarp needs in the i-th query, the cost (in burles) of the bottle of the first type in the i-th query and the cost (in burles) of the bottle of the second type in the i-th query, respectively.
Output
Print q integers. The i-th integer should be equal to the minimum amount of money (in burles) Polycarp needs to buy exactly n_i liters of water in the nearby shop if the bottle of the first type costs a_i burles and the bottle of the second type costs b_i burles.
Example
Input
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88
Output
10
9
1000
42000000000000
Submitted Solution:
```
q = int(input())
n=[];a=[];b=[]
for i in range(q):
t1,t2,t3 = map(int, input().split())
n.append(t1)
a.append(t2)
b.append(t3)
for i in range(q):
ans=0
if 2*a[i] < b[i]:
ans=n[i]*a[i]
else:
if n[i]%2==0:
ans=n[i]*b[i]/2
else:
ans=n[i]//2*b[i]+a[i]
print(ans)
```
No
| 91,760 | [
0.231201171875,
0.403076171875,
-0.03253173828125,
0.06378173828125,
-0.7021484375,
0.00879669189453125,
0.0198822021484375,
0.1856689453125,
0.2529296875,
0.953125,
0.90625,
-0.2607421875,
-0.250732421875,
-0.5732421875,
-0.55810546875,
0.218994140625,
-0.50439453125,
-0.586425781... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
n = int(input())
if n == 1 or n & 1 == 0: print(-1)
else:
t = list(map(int, input().split()))
s, k = 0, n // 2 - 1
for i in range(n - 1, 1, -2):
p = max(t[i], t[i - 1])
t[k] = max(0, t[k] - p)
s += p
k -= 1
print(s + t[0])
```
| 92,945 | [
0.57177734375,
0.51171875,
0.291015625,
0.141357421875,
-0.373779296875,
-0.57177734375,
-0.57275390625,
-0.04925537109375,
-0.0511474609375,
0.363037109375,
0.7314453125,
0.05804443359375,
-0.046905517578125,
-0.67578125,
-0.37451171875,
-0.11175537109375,
-0.6591796875,
-0.747558... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
t = int(input())
line = input()
lis = line.split()
lis = [int(i) for i in lis]
if t==1 or t%2==0 :
print("-1")
quit()
count = 0
i = t
while i >= 4 :
if i%2 == 1 :
p = i-1
q = int(p/2)
count = count + lis[i-1]
lis[p-1] = lis[p-1] - lis[i-1]
if lis[p-1] < 0 :
lis[p-1] = 0
lis[q-1] = lis[q-1] - lis[i-1]
if lis[q-1] < 0 :
lis[q-1] = 0
lis[i-1] = 0
else :
p = i+1
q = int(i/2)
count = count + lis[i-1]
lis[p-1] = lis[p-1] - lis[i-1]
if lis[p-1] < 0 :
lis[p-1] = 0
lis[q-1] = lis[q-1] - lis[i-1]
if lis[q-1] < 0 :
lis[q-1] = 0
lis[i-1] = 0
i = i-1
m = max(lis[0], lis[1], lis[2])
count = count + m
print(count)
```
| 92,946 | [
0.55859375,
0.50048828125,
0.316650390625,
0.169677734375,
-0.3662109375,
-0.60595703125,
-0.55517578125,
-0.043304443359375,
-0.05169677734375,
0.374755859375,
0.72265625,
0.06658935546875,
-0.042205810546875,
-0.68408203125,
-0.390869140625,
-0.1146240234375,
-0.64404296875,
-0.7... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
'''
Auther: ghoshashis545 Ashis Ghosh
College: Jalpaiguri Govt Enggineering College
'''
from os import path
from io import BytesIO, IOBase
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,Counter,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def bo(i):
return ord(i)-ord('0')
file = 1
def ceil(a,b):
return (a+b-1)//b
def solve():
# for _ in range(1,ii()+1):
n = ii()
a = li()
if n == 1 or n%2==0:
print('-1')
return
cnt = 0
for i in range(n//2-1,-1,-1):
x = max(a[2*i+1],a[2*i+2])
cnt += x
a[i] = max(0,a[i]-x)
print(cnt + a[0])
if __name__ =="__main__":
if(file):
if path.exists('input.txt'):
sys.stdin=open('input.txt', 'r')
sys.stdout=open('output.txt','w')
else:
input=sys.stdin.readline
solve()
```
| 92,947 | [
0.5439453125,
0.51708984375,
0.30517578125,
0.18310546875,
-0.4189453125,
-0.57421875,
-0.5224609375,
-0.08587646484375,
-0.06939697265625,
0.413818359375,
0.7314453125,
0.0582275390625,
-0.06298828125,
-0.68896484375,
-0.385009765625,
-0.10107421875,
-0.66552734375,
-0.77587890625... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
n=int(input())
if n==1 or n%2==0:
print(-1)
exit()
A=[0]*(n+1)
A[1:n+1]=list(map(int,input().split()))
ans=0
for i in range(n,0,-1):
if(A[i]<=0):continue
x=int(i/2)
A[x]-=A[i]
ans+=A[i]
if i%2==1:
A[i-1]-=A[i]
A[i]=0
print(ans)
```
| 92,948 | [
0.57275390625,
0.51220703125,
0.281982421875,
0.1434326171875,
-0.3583984375,
-0.57958984375,
-0.57275390625,
-0.047454833984375,
-0.045745849609375,
0.35498046875,
0.73779296875,
0.0584716796875,
-0.053619384765625,
-0.68359375,
-0.369873046875,
-0.104248046875,
-0.6611328125,
-0.... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
n, s = int(input()), 0
a = [0] + list(map(int, input().split()))
if n % 2 == 0 or n == 1:
print(-1)
else:
for i in range(n, 1, -2):
mx = max(a[i], a[i - 1])
s += mx
a[i // 2] = max(0, a[i // 2] - mx)
print(s + a[1])
```
| 92,949 | [
0.55126953125,
0.529296875,
0.289306640625,
0.1417236328125,
-0.37646484375,
-0.57861328125,
-0.5634765625,
-0.041778564453125,
-0.056732177734375,
0.360107421875,
0.73828125,
0.0626220703125,
-0.07086181640625,
-0.68408203125,
-0.3740234375,
-0.09088134765625,
-0.65478515625,
-0.7... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
n = int(input())
A = [int(i) for i in input().split()]
if n == 1 or n % 2 == 0:
print(-1)
exit()
ans = 0
for i in range(n-1, 3, -2):
diff = max(A[i], A[i-1])
ans += diff
A[(i-1)//2] -= diff
A[(i-1)//2] = max(0, A[(i-1)//2])
ans += max(A[:3])
print(ans)
```
| 92,950 | [
0.56884765625,
0.50732421875,
0.2861328125,
0.15673828125,
-0.362060546875,
-0.5751953125,
-0.56396484375,
-0.056976318359375,
-0.044891357421875,
0.371826171875,
0.73828125,
0.05364990234375,
-0.06134033203125,
-0.701171875,
-0.375732421875,
-0.11419677734375,
-0.6572265625,
-0.76... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
#!/usr/bin/python3
n = int(input())
a = [0] + list(map(int, input().split()))
if len(a) < 3 or n % 2 == 0:
print(-1)
else:
ans = 0
for x in range(n // 2, 0, -1):
d = max(0, a[2 * x], a[2 * x + 1])
ans += d
a[x] -= d
print(ans + max(0, a[1]))
```
| 92,951 | [
0.560546875,
0.51904296875,
0.267822265625,
0.1278076171875,
-0.383544921875,
-0.5810546875,
-0.5361328125,
-0.035125732421875,
-0.053497314453125,
0.364013671875,
0.7060546875,
0.040191650390625,
-0.058441162109375,
-0.67724609375,
-0.376953125,
-0.102294921875,
-0.66064453125,
-0... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Tags: greedy
Correct Solution:
```
n=int(input())
if n==1 or n%2==0:
print(-1)
exit()
A=[0]*(n+1)
A[1:n+1]=list(map(int,input().split()))
ans=0
for i in range(n,0,-1):
if(A[i]<=0):continue
x=int(i/2)
A[x]-=A[i]
ans+=A[i]
if i%2==1:
A[i-1]-=A[i]
A[i]=0
print(ans)
# Made By Mostafa_Khaled
```
| 92,952 | [
0.57275390625,
0.51220703125,
0.281982421875,
0.1434326171875,
-0.3583984375,
-0.57958984375,
-0.57275390625,
-0.047454833984375,
-0.045745849609375,
0.35498046875,
0.73779296875,
0.0584716796875,
-0.053619384765625,
-0.68359375,
-0.369873046875,
-0.104248046875,
-0.6611328125,
-0.... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Submitted Solution:
```
# it was stupid to think using brute intuitions, like pick first or last greedily,
# greddy must follow observation, so you also had the observation that have to do it from last
# instead you picked in random all order, those greedy after thought solutions never work!,its not cp
n=int(input())
if n==1 or n%2==0:
# print("ghe")
print(-1)
exit(0)
a=list(map(int,input().split(' ')))
# so the last element, has to be made 0, greedily, first, so by induction, it has proof,
a=[0]+a
# this is very ine elegant implementation
ans=0
for j in range(n,0,-1):
if j%2==1:
i=(j-1)//2
ans+=a[2*i+1]
mina=min(a[i],a[2*i],a[2*i+1])
a[i],a[2*i],a[2*i+1]=a[i]-mina,a[2*i]-mina,a[2*i+1]-mina
if a[2*i+1]>0:
nonzero=0
if a[i]>0:
a[i]=max(0,a[i]-a[2*i+1])
else:
a[2*i]=max(0,a[2*i]-a[2*i+1])
a[2*i+1]=0
else:
i=(j)//2
if 2*i+1>n:
# print("hemlo")
print(-1)
exit(0)
ans+=a[2*i]
mina=min(a[i],a[2*i],a[2*i+1])
a[i],a[2*i],a[2*i+1]=a[i]-mina,a[2*i]-mina,a[2*i+1]-mina
if a[2*i]>0:
a[i]=max(0,a[i]-a[2*i])
a[2*i]=0
# print(a)/
if any(a):
print(-1)
else:
print(ans)
```
Yes
| 92,953 | [
0.5732421875,
0.52001953125,
0.1951904296875,
0.21142578125,
-0.51025390625,
-0.450439453125,
-0.5625,
0.06524658203125,
-0.01094818115234375,
0.4716796875,
0.80126953125,
0.072021484375,
-0.078369140625,
-0.63037109375,
-0.378173828125,
-0.1470947265625,
-0.54248046875,
-0.7504882... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Submitted Solution:
```
import math
a_sum = 0
n = int(input())
a = [0]+[int(i) for i in input().split()]
if n%2 ==0 or n==1:
print(-1)
exit()
else:
i = n
while i>3:
if a[i] >= a[i-1]:
if a[i]>0:
a_sum += a[i]
a[(i - 1) // 2] = a[(i - 1) // 2] - a[i]
else:
if a[i-1]>0:
a_sum += a[i-1]
a[(i - 1) // 2] = a[(i - 1) // 2] - a[i - 1]
a[n] =0
a[n-1]=0
i -= 1
i-=1
a_max = a[3]
if a[2]> a[3]:
a_max = a[2]
if a[1]>a_max:
a_max = a[1]
if a_max>0:
a_sum+=a_max
print(a_sum)
exit()
```
Yes
| 92,954 | [
0.55419921875,
0.501953125,
0.2027587890625,
0.1761474609375,
-0.426025390625,
-0.412841796875,
-0.58056640625,
0.017974853515625,
-0.03125,
0.389404296875,
0.82568359375,
0.08538818359375,
-0.10211181640625,
-0.68603515625,
-0.396484375,
-0.1517333984375,
-0.6630859375,
-0.7089843... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Submitted Solution:
```
#!/usr/bin/python3
n = int(input())
a = [0] + list(map(int, input().split()))
if len(a) < 3 or n % 2 == 0:
print(-1)
else:
ans = 0
for x in range(n // 2, 0, -1):
d = max(a[2 * x], a[2 * x + 1])
if d > 0:
ans += d
a[x] -= d
print(ans)
```
No
| 92,955 | [
0.55859375,
0.487060546875,
0.197021484375,
0.172607421875,
-0.459228515625,
-0.401611328125,
-0.583984375,
0.027374267578125,
-0.02294921875,
0.408203125,
0.796875,
0.070556640625,
-0.10504150390625,
-0.671875,
-0.40625,
-0.1575927734375,
-0.65380859375,
-0.7041015625,
-0.859863... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.
Polycarpus and Vasily move in turns. Polycarpus moves first. During a move a player is allowed to choose a positive integer x (2·x + 1 ≤ n) and take a coin from each chest with numbers x, 2·x, 2·x + 1. It may turn out that some chest has no coins, in this case the player doesn't take a coin from this chest. The game finishes when all chests get emptied.
Polycarpus isn't a greedy scrooge. Polycarpys is a lazy slob. So he wonders in what minimum number of moves the game can finish. Help Polycarpus, determine the minimum number of moves in which the game can finish. Note that Polycarpus counts not only his moves, he also counts Vasily's moves.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of chests with coins. The second line contains a sequence of space-separated integers: a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai is the number of coins in the chest number i at the beginning of the game.
Output
Print a single integer — the minimum number of moves needed to finish the game. If no sequence of turns leads to finishing the game, print -1.
Examples
Input
1
1
Output
-1
Input
3
1 2 3
Output
3
Note
In the first test case there isn't a single move that can be made. That's why the players won't be able to empty the chests.
In the second sample there is only one possible move x = 1. This move should be repeated at least 3 times to empty the third chest.
Submitted Solution:
```
t = int(input())
line = input()
ar = line.split()
ar = [int(i) for i in ar]
ar = sorted(ar)
f = int((t-1)/2)
p = (2*f)+1
count = 0
i = p
while i > 0 and f != 0 :
if sum(ar) == 0 :
break
j = t-1
while j >= 0 :
if ar[j] >= i :
count = count + int(ar[j]/i)
ar[j] = ar[j]%i
j = j-1
i = i-1
if sum(ar) == 0 :
print(count)
else :
print(-1)
```
No
| 92,956 | [
0.544921875,
0.4736328125,
0.22314453125,
0.177490234375,
-0.445556640625,
-0.426025390625,
-0.60546875,
0.01873779296875,
-0.0220489501953125,
0.4033203125,
0.80224609375,
0.08203125,
-0.10174560546875,
-0.6865234375,
-0.4072265625,
-0.15966796875,
-0.650390625,
-0.7236328125,
-... | 24 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.