message stringlengths 2 48.6k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his left hand, and the tallest student in each column to lift up his right hand. What is the height of the student whose both hands are up ? The student will become a target for professor’s questions.
Given the size of the class, and the height of the students in the class, you have to print the height of the student who has both his hands up in the class.
Input
The input will consist of several cases. the first line of each case will be n(0 < n < 100), the number of rows and columns in the class. It will then be followed by a n-by-n matrix, each row of the matrix appearing on a single line. Note that the elements of the matrix may not be necessarily distinct. The input will be terminated by the case n = 0.
Output
For each input case, you have to print the height of the student in the class whose both hands are up. If there is no such student, then print 0 for that case.
Example
Input
3
1 2 3
4 5 6
7 8 9
3
1 2 3
7 8 9
4 5 6
0
Output
7
7
Submitted Solution:
```
# coding: utf-8
import numpy as np
# Here your code !
while True:
n = int(input())
flag=0
if n==0: break
map = [[0 for i in range(100)] for j in range(100)]
a = [[int(i) for i in input().split()] for i in range(n)]
np.array(a)
maxar = (np.argmax(a, axis = 0))#(X, 0.1.2)????????§
minar = (np.argmin(a, axis = 1))#(0.1.2, X)???????°?
for i in range(n):
map[i][minar[i]]+=1
map[maxar[i]][i]+=1
for i in range(n):
for j in range(n):
if map[i][j]>=2:
print(a[i][j])
flag=1
if flag==0:
print (0)
``` | instruction | 0 | 50,435 | 8 | 100,870 |
No | output | 1 | 50,435 | 8 | 100,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his left hand, and the tallest student in each column to lift up his right hand. What is the height of the student whose both hands are up ? The student will become a target for professor’s questions.
Given the size of the class, and the height of the students in the class, you have to print the height of the student who has both his hands up in the class.
Input
The input will consist of several cases. the first line of each case will be n(0 < n < 100), the number of rows and columns in the class. It will then be followed by a n-by-n matrix, each row of the matrix appearing on a single line. Note that the elements of the matrix may not be necessarily distinct. The input will be terminated by the case n = 0.
Output
For each input case, you have to print the height of the student in the class whose both hands are up. If there is no such student, then print 0 for that case.
Example
Input
3
1 2 3
4 5 6
7 8 9
3
1 2 3
7 8 9
4 5 6
0
Output
7
7
Submitted Solution:
```
# coding: utf-8
import numpy as np
# Here your code !
while True:
n = int(input())
if n==0: break
map = [[0 for i in range(100)] for j in range(100)]
a = [[int(i) for i in input().split()] for i in range(n)]
np.array(a)
minar = (np.argmin(a, axis = 0))#(0.1.2, X)???????°?
maxar = (np.argmax(a, axis = 1))#(X, 0.1.2)????????§
print(maxar)
print(minar)
for i in range(n):
map[i][minar[i]]+=1
map[maxar[i]][i]+=1
for i in range(n):
for j in range(n):
if map[i][j]>=2: print(a[i][j])
``` | instruction | 0 | 50,436 | 8 | 100,872 |
No | output | 1 | 50,436 | 8 | 100,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his left hand, and the tallest student in each column to lift up his right hand. What is the height of the student whose both hands are up ? The student will become a target for professor’s questions.
Given the size of the class, and the height of the students in the class, you have to print the height of the student who has both his hands up in the class.
Input
The input will consist of several cases. the first line of each case will be n(0 < n < 100), the number of rows and columns in the class. It will then be followed by a n-by-n matrix, each row of the matrix appearing on a single line. Note that the elements of the matrix may not be necessarily distinct. The input will be terminated by the case n = 0.
Output
For each input case, you have to print the height of the student in the class whose both hands are up. If there is no such student, then print 0 for that case.
Example
Input
3
1 2 3
4 5 6
7 8 9
3
1 2 3
7 8 9
4 5 6
0
Output
7
7
Submitted Solution:
```
# coding: utf-8
import numpy as np
# Here your code !
while True:
n = int(input())
flag=0
if n==0: break
map = [[0 for i in range(100)] for j in range(100)]
a = [[int(i) for i in input().split()] for i in range(n)]
np.array(a)
maxar = (np.argmax(a, axis = 0))#(X, 0.1.2)????????§
minar = (np.argmin(a, axis = 1))#(0.1.2, X)???????°?
for i in range(n):
map[i][minar[i]]+=1
map[maxar[i]][i]+=1
for i in range(n):
for j in range(n):
if map[i][j]>=2:
print(a[i][j])
flag=1
break
if flag==0:
print ('0')
``` | instruction | 0 | 50,437 | 8 | 100,874 |
No | output | 1 | 50,437 | 8 | 100,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his left hand, and the tallest student in each column to lift up his right hand. What is the height of the student whose both hands are up ? The student will become a target for professor’s questions.
Given the size of the class, and the height of the students in the class, you have to print the height of the student who has both his hands up in the class.
Input
The input will consist of several cases. the first line of each case will be n(0 < n < 100), the number of rows and columns in the class. It will then be followed by a n-by-n matrix, each row of the matrix appearing on a single line. Note that the elements of the matrix may not be necessarily distinct. The input will be terminated by the case n = 0.
Output
For each input case, you have to print the height of the student in the class whose both hands are up. If there is no such student, then print 0 for that case.
Example
Input
3
1 2 3
4 5 6
7 8 9
3
1 2 3
7 8 9
4 5 6
0
Output
7
7
Submitted Solution:
```
import sys
while True:
n = int(sys.stdin.readline().rstrip())
if n == 0:
break;
students = []
for i in range(n):
students.append(sys.stdin.readline().rstrip().split(' '))
s_list=[[min(row)==s for s in row] for row in students]
t_list=[[max(col)==s for s in col] for col in zip(*students)]
ret = 0
for i,data in enumerate(zip(s_list, zip(*t_list))):
for j,d in enumerate(zip(*data)):
if all(d):
ret = students[i][j]
break;
print(ret)
``` | instruction | 0 | 50,438 | 8 | 100,876 |
No | output | 1 | 50,438 | 8 | 100,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjured a cunning plan: he will glue all the spiders together and attach them to the ceiling. Besides, Petya knows that the lower the spiders will hang, the more mum is going to like it and then she won't throw his favourite toys away. Help Petya carry out the plan.
A spider consists of k beads tied together by k - 1 threads. Each thread connects two different beads, at that any pair of beads that make up a spider is either directly connected by a thread, or is connected via some chain of threads and beads.
Petya may glue spiders together directly gluing their beads. The length of each thread equals 1. The sizes of the beads can be neglected. That's why we can consider that gluing spiders happens by identifying some of the beads (see the picture). Besides, the construction resulting from the gluing process should also represent a spider, that is, it should have the given features.
After Petya glues all spiders together, he measures the length of the resulting toy. The distance between a pair of beads is identified as the total length of the threads that connect these two beads. The length of the resulting construction is the largest distance between all pairs of beads. Petya wants to make the spider whose length is as much as possible.
<image> <image>
The picture two shows two spiders from the second sample. We can glue to the bead number 2 of the first spider the bead number 1 of the second spider. The threads in the spiders that form the sequence of threads of maximum lengths are highlighted on the picture.
Input
The first input file line contains one integer n (1 ≤ n ≤ 100) — the number of spiders. Next n lines contain the descriptions of each spider: integer ni (2 ≤ ni ≤ 100) — the number of beads, then ni - 1 pairs of numbers denoting the numbers of the beads connected by threads. The beads that make up each spider are numbered from 1 to ni.
Output
Print a single number — the length of the required construction.
Examples
Input
1
3 1 2 2 3
Output
2
Input
2
3 1 2 1 3
4 1 2 2 3 2 4
Output
4
Input
2
5 1 2 2 3 3 4 3 5
7 3 4 1 2 2 4 4 6 2 7 6 5
Output
7
Submitted Solution:
```
from collections import defaultdict,deque
with open('input.txt') as f:
lines = f.readlines()
f.close()
max_length = 0
def bfs(graph,bead,visited,local_maximum):
q = deque()
q.append((0,bead)) #previous threads connected to current bead,bead
while q:
prev_threads,bead = q.popleft()
local_maximum = max(local_maximum,prev_threads) #maximum number of connected threads sofar
for neighbours in graph[bead]:
if neighbours not in visited:
visited.add(neighbours)
q.append((prev_threads + 1,neighbours))
return local_maximum
for line in lines[1:]:
visited = set()
local_maximum = 0 #for each bfs per spider max number of ancestors for a bead
current_maximum = 0 # max of bfs result
graph = defaultdict(list)
line = line.rstrip("\n").split(" ") #removing newline
index = 1
while index < len(line):
graph[line[index]].append(line[index + 1]) #building graph per spider
index += 2
#finding the maximum possible length per spider
for i in range(1,len(line)):
bead = line[i]
if bead not in visited:
visited.add(bead)
current_maximum = max(current_maximum,bfs(graph,bead,visited,local_maximum))
max_length = max_length + current_maximum #
max_length = max_length + int(lines[0].rstrip("\n")) - 1
f = open("output.txt", "a")
f.write(f'{max_length}')
f.close()
``` | instruction | 0 | 50,582 | 8 | 101,164 |
No | output | 1 | 50,582 | 8 | 101,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjured a cunning plan: he will glue all the spiders together and attach them to the ceiling. Besides, Petya knows that the lower the spiders will hang, the more mum is going to like it and then she won't throw his favourite toys away. Help Petya carry out the plan.
A spider consists of k beads tied together by k - 1 threads. Each thread connects two different beads, at that any pair of beads that make up a spider is either directly connected by a thread, or is connected via some chain of threads and beads.
Petya may glue spiders together directly gluing their beads. The length of each thread equals 1. The sizes of the beads can be neglected. That's why we can consider that gluing spiders happens by identifying some of the beads (see the picture). Besides, the construction resulting from the gluing process should also represent a spider, that is, it should have the given features.
After Petya glues all spiders together, he measures the length of the resulting toy. The distance between a pair of beads is identified as the total length of the threads that connect these two beads. The length of the resulting construction is the largest distance between all pairs of beads. Petya wants to make the spider whose length is as much as possible.
<image> <image>
The picture two shows two spiders from the second sample. We can glue to the bead number 2 of the first spider the bead number 1 of the second spider. The threads in the spiders that form the sequence of threads of maximum lengths are highlighted on the picture.
Input
The first input file line contains one integer n (1 ≤ n ≤ 100) — the number of spiders. Next n lines contain the descriptions of each spider: integer ni (2 ≤ ni ≤ 100) — the number of beads, then ni - 1 pairs of numbers denoting the numbers of the beads connected by threads. The beads that make up each spider are numbered from 1 to ni.
Output
Print a single number — the length of the required construction.
Examples
Input
1
3 1 2 2 3
Output
2
Input
2
3 1 2 1 3
4 1 2 2 3 2 4
Output
4
Input
2
5 1 2 2 3 3 4 3 5
7 3 4 1 2 2 4 4 6 2 7 6 5
Output
7
Submitted Solution:
```
from collections import defaultdict,deque
with open('input.txt') as f:
lines = f.readlines()
f.close()
max_length = 0
def bfs(graph,bead,visited,local_maximum):
q = deque()
q.append((0,bead)) #previous threads connected to current bead,bead
while q:
prev_threads,bead = q.popleft()
local_maximum = max(local_maximum,prev_threads) #maximum number of connected threads sofar
for neighbours in graph[bead]:
if neighbours not in visited:
visited.add(neighbours)
q.append((prev_threads + 1,neighbours))
return local_maximum
for line in lines[1:]:
visited = set()
local_maximum = 0 #for each bfs per spider max number of ancestors for a bead
current_maximum = 0 # max of bfs result
graph = defaultdict(list)
line = line.rstrip("\n").split(" ") #removing newline
index = 1
while index < len(line):
graph[line[index]].append(line[index + 1]) #building graph per spider
index += 2
#finding the maximum possible length per spider
for i in range(1,len(line)):
bead = line[i]
if bead not in visited:
visited.add(bead)
current_maximum = max(current_maximum,bfs(graph,bead,visited,local_maximum))
max_length = max_length + current_maximum #
f = open("output.txt", "a")
f.write(f'{max_length}')
f.close()
``` | instruction | 0 | 50,583 | 8 | 101,166 |
No | output | 1 | 50,583 | 8 | 101,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjured a cunning plan: he will glue all the spiders together and attach them to the ceiling. Besides, Petya knows that the lower the spiders will hang, the more mum is going to like it and then she won't throw his favourite toys away. Help Petya carry out the plan.
A spider consists of k beads tied together by k - 1 threads. Each thread connects two different beads, at that any pair of beads that make up a spider is either directly connected by a thread, or is connected via some chain of threads and beads.
Petya may glue spiders together directly gluing their beads. The length of each thread equals 1. The sizes of the beads can be neglected. That's why we can consider that gluing spiders happens by identifying some of the beads (see the picture). Besides, the construction resulting from the gluing process should also represent a spider, that is, it should have the given features.
After Petya glues all spiders together, he measures the length of the resulting toy. The distance between a pair of beads is identified as the total length of the threads that connect these two beads. The length of the resulting construction is the largest distance between all pairs of beads. Petya wants to make the spider whose length is as much as possible.
<image> <image>
The picture two shows two spiders from the second sample. We can glue to the bead number 2 of the first spider the bead number 1 of the second spider. The threads in the spiders that form the sequence of threads of maximum lengths are highlighted on the picture.
Input
The first input file line contains one integer n (1 ≤ n ≤ 100) — the number of spiders. Next n lines contain the descriptions of each spider: integer ni (2 ≤ ni ≤ 100) — the number of beads, then ni - 1 pairs of numbers denoting the numbers of the beads connected by threads. The beads that make up each spider are numbered from 1 to ni.
Output
Print a single number — the length of the required construction.
Examples
Input
1
3 1 2 2 3
Output
2
Input
2
3 1 2 1 3
4 1 2 2 3 2 4
Output
4
Input
2
5 1 2 2 3 3 4 3 5
7 3 4 1 2 2 4 4 6 2 7 6 5
Output
7
Submitted Solution:
```
import sys
sys.stdin = open("input.txt","r")
sys.stdout = open("output.txt","w")
from collections import defaultdict
def DFS(d,x,t,visited):
visited[x] = 1
if len(d[x]) == 1:
return t
z = float("-inf")
for i in d[x]:
if visited[i] == 1:
continue
z = max(z,DFS(d,i,t+1,visited))
return z
t = int(input())
ans = 0
for i in range(t):
l = list(map(int,input().split()))
l = list(l[1:])
d = defaultdict(list)
for j in range(0,len(l),2):
d[l[j]].append(l[j+1])
d[l[j+1]].append(l[j])
visited = {j:0 for j in range(1,max(l)+1)}
flag = None
for j in d:
if len(d[j]) == 2:
x = j
flag = 0
break
if flag == None:
for j in d:
if len(d[j]) == 3:
x = j
flag = 1
break
t = 0
# print(x)
if flag == 1:
visited[x] = 1
r1 = DFS(d,d[x][0],t,visited)
r2 = DFS(d,d[x][1],t,visited)
r3 = DFS(d,d[x][2],t,visited)
z = []
z.append(r1)
z.append(r2)
z.append(r3)
ans = ans + z[1] + z[2] + 2
elif flag == 0:
visited[x] = 1
ans = ans + DFS(d,d[x][0],t,visited) + DFS(d,d[x][1],t,visited) + 2
else:
ans = ans + 1
print(ans)
``` | instruction | 0 | 50,584 | 8 | 101,168 |
No | output | 1 | 50,584 | 8 | 101,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjured a cunning plan: he will glue all the spiders together and attach them to the ceiling. Besides, Petya knows that the lower the spiders will hang, the more mum is going to like it and then she won't throw his favourite toys away. Help Petya carry out the plan.
A spider consists of k beads tied together by k - 1 threads. Each thread connects two different beads, at that any pair of beads that make up a spider is either directly connected by a thread, or is connected via some chain of threads and beads.
Petya may glue spiders together directly gluing their beads. The length of each thread equals 1. The sizes of the beads can be neglected. That's why we can consider that gluing spiders happens by identifying some of the beads (see the picture). Besides, the construction resulting from the gluing process should also represent a spider, that is, it should have the given features.
After Petya glues all spiders together, he measures the length of the resulting toy. The distance between a pair of beads is identified as the total length of the threads that connect these two beads. The length of the resulting construction is the largest distance between all pairs of beads. Petya wants to make the spider whose length is as much as possible.
<image> <image>
The picture two shows two spiders from the second sample. We can glue to the bead number 2 of the first spider the bead number 1 of the second spider. The threads in the spiders that form the sequence of threads of maximum lengths are highlighted on the picture.
Input
The first input file line contains one integer n (1 ≤ n ≤ 100) — the number of spiders. Next n lines contain the descriptions of each spider: integer ni (2 ≤ ni ≤ 100) — the number of beads, then ni - 1 pairs of numbers denoting the numbers of the beads connected by threads. The beads that make up each spider are numbered from 1 to ni.
Output
Print a single number — the length of the required construction.
Examples
Input
1
3 1 2 2 3
Output
2
Input
2
3 1 2 1 3
4 1 2 2 3 2 4
Output
4
Input
2
5 1 2 2 3 3 4 3 5
7 3 4 1 2 2 4 4 6 2 7 6 5
Output
7
Submitted Solution:
```
def findDist(node,tree,visited):
maxDist = 1
maxSeen = 1
cds = []
for child in tree[node]:
if child not in visited:
visited.add(child)
childDist,childSeen = findDist(child,tree,visited)
maxDist = max(maxDist,childDist + 1)
maxSeen = max(maxSeen,childSeen)
cds.append(childDist)
if len(cds) > 1:
cds.sort()
maxSeen = max(maxSeen,cds[0] + cds[1] + 1)
maxSeen = max(maxSeen,maxDist)
# print(f'node = {node}, maxDist = {maxDist},maxSeen = {maxSeen}')
return maxDist,max(maxSeen,maxDist)
def solve(spiders):
dist = 0
for spider in spiders:
N = spider[0]
edges = []
for i in range(1,len(spider),2):
edges.append([spider[i],spider[i + 1]])
tree = {}
for e in range(1,N + 1):
tree[e] = set()
for e in edges:
tree[e[0]].add(e[1])
tree[e[1]].add(e[0])
# print(tree)
visited = set()
visited.add(1)
x,y = findDist(1,tree,visited)
dist += y - 1
return dist
def main():
f = open("input.txt", "r")
t = int(f.readline())
spiders = []
# t = int(input())
spiders = []
for _ in range(t):
d = f.readline()
d = [int(i) for i in d.split()]
spiders.append(d)
ans = str(solve(spiders))
file1 = open("output.txt", "w") # write mode
file1.write(ans)
file1.close()
main()
``` | instruction | 0 | 50,585 | 8 | 101,170 |
No | output | 1 | 50,585 | 8 | 101,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,843 | 8 | 101,686 |
Tags: brute force, implementation
Correct Solution:
```
n,k = map(int,input().split())
A = list(map(int,input().split()))
best = n
best_ind = -1
for i in range(1,1001):
X = [i + k*j for j in range(n)]
cnt = 0
for j in range(n):
if X[j]!=A[j]:
cnt += 1
if cnt < best:
best_ind = i
best = min(best,cnt)
ans = [best_ind + i*k for i in range(n)]
print(best)
for i in range(n):
if ans[i]<A[i]:
print("- " + str(i+1) + " " + str(-(-A[i]+ans[i])))
elif ans[i]>A[i]:
print("+ " + str(i+1) + " " + str(-(A[i]-ans[i])))
else:
continue
``` | output | 1 | 50,843 | 8 | 101,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,844 | 8 | 101,688 |
Tags: brute force, implementation
Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
max_p = n
max_i = -1
for i in range(n):
p = 0
if a[i] - k * i >= 1:
for j in range(n):
if j < i:
if a[j] != a[i] - k * (i - j):
p += 1
else:
if a[j] != a[i] + k * (j - i):
p += 1
if p < max_p:
max_p = p
max_i = i
print(max_p)
for i in range(n):
if i < max_i:
if a[i] < a[max_i] - k * (max_i - i):
print('+', i + 1, a[max_i] - k * (max_i - i) - a[i])
else:
if a[i] > a[max_i] - k * (max_i - i):
print('-', i + 1, a[i] - (a[max_i] - k * (max_i - i)))
else:
if i > max_i:
if a[i] < a[max_i] + k * (i - max_i):
print('+', i + 1, a[max_i] + k * (i - max_i) - a[i])
else:
if a[i] > a[max_i] + k * (i - max_i):
print('-', i + 1, a[i] - (a[max_i] + k * (i - max_i)))
``` | output | 1 | 50,844 | 8 | 101,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,845 | 8 | 101,690 |
Tags: brute force, implementation
Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
vis = [False] * n
answer = 0
for i in range(n):
t = 0
if not vis[i]:
for j in range(i, n):
if not vis[j]:
temp = a[j] - ((j - i) * k)
x = temp - a[i]
if x == 0:
t += 1
vis[j] = True
if temp <= 0:
vis[j] = True
if t > answer:
answer = t
poi = i
val = a[i]
print(n - answer)
if answer != n:
for i in range(n):
x = a[i] - val - ((i - poi) * k)
if x == 0:
continue
elif x > 0:
print('{} {} {}'.format('-', i + 1, x))
elif x < 0:
print('{} {} {}'.format('+', i + 1, -x))
``` | output | 1 | 50,845 | 8 | 101,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,846 | 8 | 101,692 |
Tags: brute force, implementation
Correct Solution:
```
n,k=map(int,input().split())
L=list(map(int,input().split()))
a=min(L)
b=max(L)
ans=10**10
F=[]
for s in range(1,1001):
x=0
E=[]
for i in range(n):
if(abs((s+i*k)-L[i])):
x+=1
E.append(i)
if(x<ans):
ans=x
F=list(E)+[s]
print(ans)
s=F[-1]
for i in range(ans):
if(L[F[i]]<s+F[i]*k):
print("+",end=" ")
else:
print("-",end=" ")
print(F[i]+1,abs((L[F[i]])-(s+F[i]*k)))
``` | output | 1 | 50,846 | 8 | 101,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,847 | 8 | 101,694 |
Tags: brute force, implementation
Correct Solution:
```
a,b=map(int,input().split())
l=list(map(int,input().split()))
m=10000000000
s = 0
p=0
for i in range(1,1001):
x=0
for j in range(0,a):
h=i+j*b
if l[j]==h:
x=x+1
if x>=s:
p=i
s=x
print(a-s)
for i in range(0,a):
s=""
if p+i*b-l[i]==0:
continue
elif p+i*b-l[i]>0:
s="+ "+str(i+1)+" "+str(abs(p+i*b-l[i]))
else:
s="- "+str(i+1)+" "+str(abs(p+i*b-l[i]))
print(s)
``` | output | 1 | 50,847 | 8 | 101,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,848 | 8 | 101,696 |
Tags: brute force, implementation
Correct Solution:
```
n, k = map(int, input().split())
arr = [int(z) for z in input().split()]
cap = 1001
potentialfirst=[]
ops = []
for pot in range(1,cap):
cnt = 0
r = []
for i in range(n):
if arr[i] != pot+i*k: cnt += 1
if arr[i] < pot+i*k:
r.append(['+', str(i+1), str(abs(arr[i] - (pot+i*k)))])
elif arr[i] > pot+i*k:
r.append(['-', str(i + 1), str(abs(arr[i] - (pot+i*k)))])
potentialfirst.append(cnt)
ops.append(r)
ind = potentialfirst.index(min(potentialfirst))
print(potentialfirst[ind])
for i in ops[ind]:
print(' '.join(i))
``` | output | 1 | 50,848 | 8 | 101,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,849 | 8 | 101,698 |
Tags: brute force, implementation
Correct Solution:
```
def check_bounds(start):
return heights[start]-start*k >= 1
n,k = map(int,input().split())
heights = list(map(int,input().split()))
seq_start = -1
lon_seq = [0]*n
max_len = 0
cur_seq= [0]*n
cur_len=0
for i,a in enumerate(heights):
cur_seq=[0]*n
cur_len=0
if check_bounds(i):
for j,b in enumerate(heights):
if b == a+(j-i)*k:
cur_seq[j]=1
cur_len+=1
if cur_len>max_len:
lon_seq=cur_seq
max_len=cur_len
seq_start=i
print(n-max_len)
for i,a in enumerate(heights):
if lon_seq[i] != 1:
diff=a-(heights[seq_start]+(i-seq_start)*k)
if diff>0:
print('{0} {1} {2}'.format('-',i+1,abs(diff)))
else:
print('{0} {1} {2}'.format('+',i+1,abs(diff)))
``` | output | 1 | 50,849 | 8 | 101,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0 | instruction | 0 | 50,850 | 8 | 101,700 |
Tags: brute force, implementation
Correct Solution:
```
string=str(input())
astring=str(input())+' '
word=''
alist=[]
n=int(string[:string.index(' ')])
k=int(string[string.index(' ')+1:])
for char in astring:
if char!=' ':
word+=char
else:
alist.append(int(word))
word=''
minchange=n
mina=1000
for a in range(1,1001):
blist=[x*k+a for x in range(0,n)]
change=0
for i in range(0,n):
if alist[i]!=blist[i]:
change+=1
if change>=minchange:
break
if change<minchange:
minchange=change
mina=a
blist=[x*k+mina for x in range(0,n)]
changelist=[]
for i in range(0,n):
if alist[i]>blist[i]:
changelist.append('- '+str(i+1)+' '+str(alist[i]-blist[i]))
elif alist[i]<blist[i]:
changelist.append('+ '+str(i+1)+' '+str(blist[i]-alist[i]))
print(minchange)
if minchange>0:
for change in changelist:
print(change)
``` | output | 1 | 50,850 | 8 | 101,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
def main():
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
d = {}
best, best_first = 0, -1
for i, v in enumerate(a):
good_first = v - k * i
if good_first >= 1:
if good_first not in d:
d[good_first] = 0
d[good_first] += 1
if d[good_first] > best:
best = d[good_first]
best_first = good_first
print(n - best)
for i, v in enumerate(a):
diff = best_first - (v - k * i)
if diff > 0:
print('+', i + 1, diff)
elif diff < 0:
print('-', i + 1, -diff)
main()
``` | instruction | 0 | 50,851 | 8 | 101,702 |
Yes | output | 1 | 50,851 | 8 | 101,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
n, k = map(int, input().split())
t = list(map(int, input().split()))
p = [0] * 1001
x = y = d = 0
for h in t:
s = h - d
if s > 0:
p[s] += 1
if p[s] > x: x, y = p[s], s
d += k
d = 0
for i, h in enumerate(t):
t[i] = y - h + d
d += k
t = ['- ' + str(i) + ' ' + str(-s) if s < 0 else '+ ' + str(i) + ' ' + str(s) for i, s in enumerate(t, 1) if s]
print(n - x)
print('\n'.join(t))
``` | instruction | 0 | 50,852 | 8 | 101,704 |
Yes | output | 1 | 50,852 | 8 | 101,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
from itertools import groupby
R = lambda:map(int, input().split())
n, k = R()
a = list(R())
b = sorted(a[i] - k * i for i in range(1, n))
c = [(len(list(g[1])), g[0]) for g in groupby(b) if g[0] > 0]
if len(c) > 0:
m = max(x for x, y in c)
c = [x for x in c if x[0] == m]
else:
c = [(0, a[0])]
d = 0
for i in range(len(c)):
if c[i][1] == a[0]:
d = i
print(n - c[d][0] - 1)
break
else:
print(n - c[d][0])
for i in range(n):
ai = c[d][1] + k * i
if ai > a[i]:
print("+ {} {}".format(i + 1, ai - a[i]))
elif ai < a[i]:
print("- {} {}".format(i + 1, a[i] - ai))
``` | instruction | 0 | 50,853 | 8 | 101,706 |
Yes | output | 1 | 50,853 | 8 | 101,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
n,k=map(int,input().split())
a=list(map(int,input().split()))
n=len(a)
ans=0
s=0
for i in range(1,1001):
cc=0
for j in range(0,n):
cc+=int(a[j]==i+j*k)
if cc>ans:
ans=cc
s=i
print(n-ans)
to=s
for j in range(0,n):
if a[j]>to:
print('-',j+1,a[j]-to)
if a[j]<to:
print('+',j+1,-a[j]+to)
to+=k
# Made By Mostafa_Khaled
``` | instruction | 0 | 50,854 | 8 | 101,708 |
Yes | output | 1 | 50,854 | 8 | 101,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
n, k = map(int, input().split())
trees = map(int, input().split())
deltas = [tree - i*k for i, tree in enumerate(trees)]
freqs = [0] * n
for delta in deltas:
if delta >= 0:
freqs[delta] += 1
d = freqs.index(max(freqs))
print(sum(((delta != d) for delta in deltas)))
for i, delta in enumerate(deltas):
if delta > d:
print("- %d %d" % (i+1, delta - d))
elif delta < d:
print("+ %d %d" % (i+1, d - delta))
``` | instruction | 0 | 50,855 | 8 | 101,710 |
No | output | 1 | 50,855 | 8 | 101,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
n , k = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
l = [l[i]-i for i in range(len(l))]
d = {}
for i in l:
try:
d[i] += 1
except:
d[i] = 1
mv , mo = 0,0
for i,j in d.items():
if j > mo:
mo = j
mv = i
print(len(l)-mo)
for i,j in enumerate(l):
if j > mv:
print('-',i+1,j-mv)
elif j < mv:
print('+',i+1,mv-j)
``` | instruction | 0 | 50,856 | 8 | 101,712 |
No | output | 1 | 50,856 | 8 | 101,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
x=input("").split(' ')
x=[int(y) for y in x]
n=x[0]
b=x[1]
dumby=[]
real=[]
asdf=""
operations=0
minoperations=100001
trees=input("").split(' ')
trees=[int(g) for g in trees]
for g in range (0,len(trees)):
for y in range (0, len(trees)):
if (b*(y-g)+trees[g]!=trees[y]):
if (trees[y]-(b*(y-g)+trees[g])<0):
asdf=asdf+"+ "
asdf=asdf+str(y+1)
asdf=asdf+" "
asdf=asdf+str(-(trees[y]-(b*(y-g)+trees[g])))
else:
asdf=asdf+"- "
asdf=asdf+str(y+1)
asdf=asdf+" "
asdf=asdf+str((trees[y]-(b*(y-g)+trees[g])))
dumby.append(asdf)
asdf=""
if (operations<minoperations):
minoperations=operations
for g in range (0, len(dumby)):
real.append(dumby[g])
asdf=""
dumby=[]
operations=operations+1
print(minoperations)
for g in range (0, len(real)):
print(real[g])
``` | instruction | 0 | 50,857 | 8 | 101,714 |
No | output | 1 | 50,857 | 8 | 101,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.
Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
Input
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
Output
In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.
If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".
If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
Examples
Input
4 1
1 2 1 5
Output
2
+ 3 2
- 4 1
Input
4 1
1 2 3 4
Output
0
Submitted Solution:
```
n,k=map(int,input().split())
a=list(map(int,input().split()))
l=a[:]
c=[]
for i in range(n-1):
if l[i+1]-l[i]>k:
c.append("- "+str(i+2)+" "+str(l[i+1]-l[i]-k))
elif a[i+1]-a[i]<k:
c.append("+ "+str(i+2)+" "+str(k-l[i+1]+l[i]))
l[i+1]=l[i]+k
l=[]
for i in range(n-2,-1,-1):
if a[i+1]-a[i]>k:
l.append("- "+str(i+2)+" "+str(a[i+1]-a[i]-k))
elif a[i+1]-a[i]<k:
l.append("+ "+str(i+2)+" "+str(k-a[i+1]+a[i]))
a[i+1]=a[i]+k
if len(c)<=len(l):
for i in c:
print(i)
else:
l.reverse()
for i in l:
print(i)
``` | instruction | 0 | 50,858 | 8 | 101,716 |
No | output | 1 | 50,858 | 8 | 101,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a pillar i Marmot can jump on a pillar j only if i < j and |hi - hj| ≥ d, where |x| is the absolute value of the number x.
Now Marmot is asking you find out a jump sequence with maximal length and print it.
Input
The first line contains two integers n and d (1 ≤ n ≤ 105, 0 ≤ d ≤ 109).
The second line contains n numbers h1, h2, ..., hn (1 ≤ hi ≤ 1015).
Output
The first line should contain one integer k, the maximal length of a jump sequence.
The second line should contain k integers i1, i2, ..., ik (1 ≤ i1 < i2 < ... < ik ≤ n), representing the pillars' indices from the maximal length jump sequence.
If there is more than one maximal length jump sequence, print any.
Examples
Input
5 2
1 3 6 7 4
Output
4
1 2 3 5
Input
10 3
2 1 3 6 9 11 7 3 20 18
Output
6
1 4 6 7 8 9
Note
In the first example Marmot chooses the pillars 1, 2, 3, 5 with the heights 1, 3, 6, 4. Another jump sequence of length 4 is 1, 2, 4, 5.
Submitted Solution:
```
#code
n,k = [int(j) for j in input().split()]
a = [int(j) for j in input().split()]
l = [0 for _ in range(n)]
l[0] = 1
ans = []
for i in range(0,n):
for j in range(i+1,n):
if l[i]>0 and abs(a[i]-a[j])>=k:
l[j] = max(l[j],l[i]+1)
# print(l)
m = max(l)
print(m)
ind = l.index(max(l))
ans.append(ind+1)
for i in range(ind-1,-1,-1):
if l[i]==m-1 and abs(a[ind]-a[i])>=k:
m-=1
ind = i
ans.append(i+1)
for i in range(len(ans)-1,-1,-1):
print(ans[i],end=" ")
``` | instruction | 0 | 50,878 | 8 | 101,756 |
No | output | 1 | 50,878 | 8 | 101,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a pillar i Marmot can jump on a pillar j only if i < j and |hi - hj| ≥ d, where |x| is the absolute value of the number x.
Now Marmot is asking you find out a jump sequence with maximal length and print it.
Input
The first line contains two integers n and d (1 ≤ n ≤ 105, 0 ≤ d ≤ 109).
The second line contains n numbers h1, h2, ..., hn (1 ≤ hi ≤ 1015).
Output
The first line should contain one integer k, the maximal length of a jump sequence.
The second line should contain k integers i1, i2, ..., ik (1 ≤ i1 < i2 < ... < ik ≤ n), representing the pillars' indices from the maximal length jump sequence.
If there is more than one maximal length jump sequence, print any.
Examples
Input
5 2
1 3 6 7 4
Output
4
1 2 3 5
Input
10 3
2 1 3 6 9 11 7 3 20 18
Output
6
1 4 6 7 8 9
Note
In the first example Marmot chooses the pillars 1, 2, 3, 5 with the heights 1, 3, 6, 4. Another jump sequence of length 4 is 1, 2, 4, 5.
Submitted Solution:
```
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0]*n
dp[0] = 1
for i in range(1, n):
for j in range(i):
if (abs(a[i] - a[j]) >= k):
dp[i] = max(dp[i], dp[j] + 1)
print(max(dp))
j = dp.index(max(dp))
ans = [j+1]
while (j >= 0):
t = j
print(j, t)
while j>=0 and dp[t]-1 != dp[j] and abs(a[t] - a[j]) < k:
j -= 1
if (j>= 0):
ans.append(j+1)
# print(dp)
ans.reverse()
# print(ans)
print(" ".join(map(str, ans)))
``` | instruction | 0 | 50,879 | 8 | 101,758 |
No | output | 1 | 50,879 | 8 | 101,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a pillar i Marmot can jump on a pillar j only if i < j and |hi - hj| ≥ d, where |x| is the absolute value of the number x.
Now Marmot is asking you find out a jump sequence with maximal length and print it.
Input
The first line contains two integers n and d (1 ≤ n ≤ 105, 0 ≤ d ≤ 109).
The second line contains n numbers h1, h2, ..., hn (1 ≤ hi ≤ 1015).
Output
The first line should contain one integer k, the maximal length of a jump sequence.
The second line should contain k integers i1, i2, ..., ik (1 ≤ i1 < i2 < ... < ik ≤ n), representing the pillars' indices from the maximal length jump sequence.
If there is more than one maximal length jump sequence, print any.
Examples
Input
5 2
1 3 6 7 4
Output
4
1 2 3 5
Input
10 3
2 1 3 6 9 11 7 3 20 18
Output
6
1 4 6 7 8 9
Note
In the first example Marmot chooses the pillars 1, 2, 3, 5 with the heights 1, 3, 6, 4. Another jump sequence of length 4 is 1, 2, 4, 5.
Submitted Solution:
```
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0]*n
dp[0] = 1
for i in range(1, n):
for j in range(i):
if (abs(a[i] - a[j]) >= k):
dp[i] = max(dp[i], dp[j] + 1)
print(max(dp))
j = dp.index(max(dp))
ans = [j+1]
while (j >= 0):
t = j
# print(j, t)
while j>=0 and dp[t]-1 != dp[j] and abs(a[t] - a[j]) < k:
j -= 1
if (j>= 0):
ans.append(j+1)
# print(dp)
ans.reverse()
# print(ans)
print(" ".join(map(str, ans)))
``` | instruction | 0 | 50,880 | 8 | 101,760 |
No | output | 1 | 50,880 | 8 | 101,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a pillar i Marmot can jump on a pillar j only if i < j and |hi - hj| ≥ d, where |x| is the absolute value of the number x.
Now Marmot is asking you find out a jump sequence with maximal length and print it.
Input
The first line contains two integers n and d (1 ≤ n ≤ 105, 0 ≤ d ≤ 109).
The second line contains n numbers h1, h2, ..., hn (1 ≤ hi ≤ 1015).
Output
The first line should contain one integer k, the maximal length of a jump sequence.
The second line should contain k integers i1, i2, ..., ik (1 ≤ i1 < i2 < ... < ik ≤ n), representing the pillars' indices from the maximal length jump sequence.
If there is more than one maximal length jump sequence, print any.
Examples
Input
5 2
1 3 6 7 4
Output
4
1 2 3 5
Input
10 3
2 1 3 6 9 11 7 3 20 18
Output
6
1 4 6 7 8 9
Note
In the first example Marmot chooses the pillars 1, 2, 3, 5 with the heights 1, 3, 6, 4. Another jump sequence of length 4 is 1, 2, 4, 5.
Submitted Solution:
```
num1, num2 = input().split()
n = int(num1)
d = int(num2)
arrPH = list(map(int, input().split(' ')))
info = [ [0]*2 for _ in range(len(arrPH)) ]
for i in range(len(arrPH)-2, -1, -1):
candidate = []
for j in range(i+1, len(arrPH)):
if abs(arrPH[i] - arrPH[j]) >= d:
candidate.append([info[j][0], j])
candidate.sort(key=lambda x:x[0], reverse=True)
if len(candidate) > 0:
info[i][0] = candidate[0][0] + 1
info[i][1] = candidate[0][1]
k = info[0][0]
idx = 0
print(k+1)
idxList = []
for i in range(k):
print(idx+1, end=" ")
idx = info[idx][1]
print(idx+1)
``` | instruction | 0 | 50,881 | 8 | 101,762 |
No | output | 1 | 50,881 | 8 | 101,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which she was on a stairs.
The stairs consists of n steps. The steps are numbered from bottom to top, it means that the lowest step has number 1, and the highest step has number n. Above each of them there is a pointer with the direction (up or down) Olga should move from this step. As soon as Olga goes to the next step, the direction of the pointer (above the step she leaves) changes. It means that the direction "up" changes to "down", the direction "down" — to the direction "up".
Olga always moves to the next step in the direction which is shown on the pointer above the step.
If Olga moves beyond the stairs, she will fall and wake up. Moving beyond the stairs is a moving down from the first step or moving up from the last one (it means the n-th) step.
In one second Olga moves one step up or down according to the direction of the pointer which is located above the step on which Olga had been at the beginning of the second.
For each step find the duration of the dream if Olga was at this step at the beginning of the dream.
Olga's fall also takes one second, so if she was on the first step and went down, she would wake up in the next second.
Input
The first line contains single integer n (1 ≤ n ≤ 106) — the number of steps on the stairs.
The second line contains a string s with the length n — it denotes the initial direction of pointers on the stairs. The i-th character of string s denotes the direction of the pointer above i-th step, and is either 'U' (it means that this pointer is directed up), or 'D' (it means this pointed is directed down).
The pointers are given in order from bottom to top.
Output
Print n numbers, the i-th of which is equal either to the duration of Olga's dream or to - 1 if Olga never goes beyond the stairs, if in the beginning of sleep she was on the i-th step.
Examples
Input
3
UUD
Output
5 6 3
Input
10
UUDUDUUDDU
Output
5 12 23 34 36 27 18 11 6 1 | instruction | 0 | 50,974 | 8 | 101,948 |
Tags: constructive algorithms, data structures, math, two pointers
Correct Solution:
```
n=int(input())
string = input()
q1,q2,B,C=[],[],[],[]
A=0
for i in range(n):
if string[i] == "D":
q1.append(i)
else:
q2.append(n-1-i)
for i in range(len(q1)):
A+=(q1[i]-i)*2+1
B.append(A)
A=0
temp = []
for i in range(len(q2)):
A+=(q2[len(q2)-1-i]-i)*2+1
C.append(A)
C.reverse()
B=list(map(str,B+C))
print(" ".join(B))
``` | output | 1 | 50,974 | 8 | 101,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which she was on a stairs.
The stairs consists of n steps. The steps are numbered from bottom to top, it means that the lowest step has number 1, and the highest step has number n. Above each of them there is a pointer with the direction (up or down) Olga should move from this step. As soon as Olga goes to the next step, the direction of the pointer (above the step she leaves) changes. It means that the direction "up" changes to "down", the direction "down" — to the direction "up".
Olga always moves to the next step in the direction which is shown on the pointer above the step.
If Olga moves beyond the stairs, she will fall and wake up. Moving beyond the stairs is a moving down from the first step or moving up from the last one (it means the n-th) step.
In one second Olga moves one step up or down according to the direction of the pointer which is located above the step on which Olga had been at the beginning of the second.
For each step find the duration of the dream if Olga was at this step at the beginning of the dream.
Olga's fall also takes one second, so if she was on the first step and went down, she would wake up in the next second.
Input
The first line contains single integer n (1 ≤ n ≤ 106) — the number of steps on the stairs.
The second line contains a string s with the length n — it denotes the initial direction of pointers on the stairs. The i-th character of string s denotes the direction of the pointer above i-th step, and is either 'U' (it means that this pointer is directed up), or 'D' (it means this pointed is directed down).
The pointers are given in order from bottom to top.
Output
Print n numbers, the i-th of which is equal either to the duration of Olga's dream or to - 1 if Olga never goes beyond the stairs, if in the beginning of sleep she was on the i-th step.
Examples
Input
3
UUD
Output
5 6 3
Input
10
UUDUDUUDDU
Output
5 12 23 34 36 27 18 11 6 1
Submitted Solution:
```
#733E
def move(string,time,ind):
if string == 'U':
time += 1
i33[ind] = 'D'
ind += 1
if ind <= (len(i33)-1):
move(i33[ind],time,ind)
else: print(time)
elif string == 'D':
if ind == 0:
time += 1
print(time)
else:
time += 1
i33[ind] = 'U'
ind -= 1
if ind <= (len(i33)-1):
move(i33[ind],time,ind)
else: print(time)
i1 = int(input())
i2 = input()
i22 = tuple(i for i in i2)
print(i22)
l = len(i22)
for ind in range(l):
i33 = list(i22)
time = 0
string = i22[ind]
move(string, time, ind)
'''for i in i22:
i33 = list(i22)
time = 0
ind = i22.index(i)
print(ind)
"if move(i,time,ind) == True:
move(i,time,ind)
else:
print(time)"
move(i,time,ind)'''
``` | instruction | 0 | 50,975 | 8 | 101,950 |
No | output | 1 | 50,975 | 8 | 101,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which she was on a stairs.
The stairs consists of n steps. The steps are numbered from bottom to top, it means that the lowest step has number 1, and the highest step has number n. Above each of them there is a pointer with the direction (up or down) Olga should move from this step. As soon as Olga goes to the next step, the direction of the pointer (above the step she leaves) changes. It means that the direction "up" changes to "down", the direction "down" — to the direction "up".
Olga always moves to the next step in the direction which is shown on the pointer above the step.
If Olga moves beyond the stairs, she will fall and wake up. Moving beyond the stairs is a moving down from the first step or moving up from the last one (it means the n-th) step.
In one second Olga moves one step up or down according to the direction of the pointer which is located above the step on which Olga had been at the beginning of the second.
For each step find the duration of the dream if Olga was at this step at the beginning of the dream.
Olga's fall also takes one second, so if she was on the first step and went down, she would wake up in the next second.
Input
The first line contains single integer n (1 ≤ n ≤ 106) — the number of steps on the stairs.
The second line contains a string s with the length n — it denotes the initial direction of pointers on the stairs. The i-th character of string s denotes the direction of the pointer above i-th step, and is either 'U' (it means that this pointer is directed up), or 'D' (it means this pointed is directed down).
The pointers are given in order from bottom to top.
Output
Print n numbers, the i-th of which is equal either to the duration of Olga's dream or to - 1 if Olga never goes beyond the stairs, if in the beginning of sleep she was on the i-th step.
Examples
Input
3
UUD
Output
5 6 3
Input
10
UUDUDUUDDU
Output
5 12 23 34 36 27 18 11 6 1
Submitted Solution:
```
#s = 'UDUDUDUD'
#s = 'UUDUDUUDDU'
#import cProfile
def solve():
n = int(input())
s = input()
# s = 'U' * 1000000
# n = len(s)
u_tot = 0
d_tot = 0
u_count = [0] * n
d_count = [0] * n
u_pos = []
d_pos = []
u_pos_append = u_pos.append
d_pos_append = d_pos.append
for i, e in enumerate(s):
u_count[i] = u_tot
d_count[i] = d_tot
if e == 'U':
u_pos_append(i)
u_tot += 1
else:
d_pos_append(i)
d_tot += 1
u_count_rev = [0] * n
d_count_rev = [0] * n
u_fall = [1] * n
for i, e in enumerate(s):
if e == 'U':
u_count_rev[i] = u_tot - u_count[i] - 1
d_count_rev[i] = d_tot - d_count[i]
else:
u_count_rev[i] = u_tot - u_count[i]
d_count_rev[i] = d_tot - d_count[i] - 1
u_fall[i] = u_fall[i-1] + u_count[i] * 2 + 1
d_fall = [1] * n
for i in range(n - 1, -1, -1):
try:
d_fall[i] = d_fall[i+1] + d_count_rev[i] * 2 + 1
except IndexError:
pass
result = [0] * n
for i, e in enumerate(s):
if e == 'U':
if u_count[i] < d_count_rev[i]: # Fall from left.
pos = d_pos[u_count[i] - d_count_rev[i]]
result[i] = u_fall[i] + d_fall[i] - d_fall[pos] \
- (2 * d_count_rev[pos] + 1) * (pos - i)
else: # Fall from right.
pos = u_pos[u_count[i] - d_count_rev[i]]
result[i] = d_fall[i] + u_fall[i] - u_fall[pos] \
- (2 * u_count[pos] + 1) * (i - pos)
else:
if u_count[i] <= d_count_rev[i]: # Fall from left.
pos = d_pos[u_count[i] - d_count_rev[i] - 1]
result[i] = u_fall[i] + d_fall[i] - d_fall[pos] \
- (2 * d_count_rev[pos] + 1) * (pos - i)
else: # Fall from right.
pos = u_pos[u_count[i] - d_count_rev[i] - 1]
result[i] = d_fall[i] + u_fall[i] - u_fall[pos] \
- (2 * u_count[pos] + 1) * (i - pos)
print(' '.join(map(str,result)))
solve()
``` | instruction | 0 | 50,976 | 8 | 101,952 |
No | output | 1 | 50,976 | 8 | 101,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which she was on a stairs.
The stairs consists of n steps. The steps are numbered from bottom to top, it means that the lowest step has number 1, and the highest step has number n. Above each of them there is a pointer with the direction (up or down) Olga should move from this step. As soon as Olga goes to the next step, the direction of the pointer (above the step she leaves) changes. It means that the direction "up" changes to "down", the direction "down" — to the direction "up".
Olga always moves to the next step in the direction which is shown on the pointer above the step.
If Olga moves beyond the stairs, she will fall and wake up. Moving beyond the stairs is a moving down from the first step or moving up from the last one (it means the n-th) step.
In one second Olga moves one step up or down according to the direction of the pointer which is located above the step on which Olga had been at the beginning of the second.
For each step find the duration of the dream if Olga was at this step at the beginning of the dream.
Olga's fall also takes one second, so if she was on the first step and went down, she would wake up in the next second.
Input
The first line contains single integer n (1 ≤ n ≤ 106) — the number of steps on the stairs.
The second line contains a string s with the length n — it denotes the initial direction of pointers on the stairs. The i-th character of string s denotes the direction of the pointer above i-th step, and is either 'U' (it means that this pointer is directed up), or 'D' (it means this pointed is directed down).
The pointers are given in order from bottom to top.
Output
Print n numbers, the i-th of which is equal either to the duration of Olga's dream or to - 1 if Olga never goes beyond the stairs, if in the beginning of sleep she was on the i-th step.
Examples
Input
3
UUD
Output
5 6 3
Input
10
UUDUDUUDDU
Output
5 12 23 34 36 27 18 11 6 1
Submitted Solution:
```
#733E
def move(string,time,ind):
if string == 'U':
time += 1
i33[ind] = 'D'
ind += 1
if ind <= (len(i33)-1):
move(i33[ind],time,ind)
else: print(time,end = ' ')
elif string == 'D':
if ind == 0:
time += 1
print(time,end = ' ')
else:
time += 1
i33[ind] = 'U'
ind -= 1
if ind <= (len(i33)-1):
move(i33[ind],time,ind)
else: print(time,end = ' ')
i1 = int(input())
i2 = input()
i22 = tuple(i for i in i2)
print(i22)
l = len(i22)
for ind in range(l):
i33 = list(i22)
time = 0
string = i22[ind]
move(string, time, ind)
'''for i in i22:
i33 = list(i22)
time = 0
ind = i22.index(i)
print(ind)
"if move(i,time,ind) == True:
move(i,time,ind)
else:
print(time)"
move(i,time,ind)'''
``` | instruction | 0 | 50,977 | 8 | 101,954 |
No | output | 1 | 50,977 | 8 | 101,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which she was on a stairs.
The stairs consists of n steps. The steps are numbered from bottom to top, it means that the lowest step has number 1, and the highest step has number n. Above each of them there is a pointer with the direction (up or down) Olga should move from this step. As soon as Olga goes to the next step, the direction of the pointer (above the step she leaves) changes. It means that the direction "up" changes to "down", the direction "down" — to the direction "up".
Olga always moves to the next step in the direction which is shown on the pointer above the step.
If Olga moves beyond the stairs, she will fall and wake up. Moving beyond the stairs is a moving down from the first step or moving up from the last one (it means the n-th) step.
In one second Olga moves one step up or down according to the direction of the pointer which is located above the step on which Olga had been at the beginning of the second.
For each step find the duration of the dream if Olga was at this step at the beginning of the dream.
Olga's fall also takes one second, so if she was on the first step and went down, she would wake up in the next second.
Input
The first line contains single integer n (1 ≤ n ≤ 106) — the number of steps on the stairs.
The second line contains a string s with the length n — it denotes the initial direction of pointers on the stairs. The i-th character of string s denotes the direction of the pointer above i-th step, and is either 'U' (it means that this pointer is directed up), or 'D' (it means this pointed is directed down).
The pointers are given in order from bottom to top.
Output
Print n numbers, the i-th of which is equal either to the duration of Olga's dream or to - 1 if Olga never goes beyond the stairs, if in the beginning of sleep she was on the i-th step.
Examples
Input
3
UUD
Output
5 6 3
Input
10
UUDUDUUDDU
Output
5 12 23 34 36 27 18 11 6 1
Submitted Solution:
```
import sys
size=int(sys.stdin.readline())
steps=list(sys.stdin.readline())
time=1
time=list()
for current in range(size):
step = steps[:]
time.append(1)
cur=current
while(cur>=0 and cur<size):
if step[cur]=='U':
step[cur]='D'
cur+=1
else:
step[cur]='U'
cur-=1
time[current]+=1
for i in time:
sys.stdout.write(str(i))
sys.stdout.write(" ")
``` | instruction | 0 | 50,978 | 8 | 101,956 |
No | output | 1 | 50,978 | 8 | 101,957 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,091 | 8 | 102,182 |
"Correct Solution:
```
N, K = map(int, input().split())
h = [int(i) for i in input().split() if int(i) - K >= 0]
print(len(h))
``` | output | 1 | 51,091 | 8 | 102,183 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,092 | 8 | 102,184 |
"Correct Solution:
```
N, K = map(int, input().split())
vA = list(map(int, input().split()))
print(sum(a >= K for a in vA))
``` | output | 1 | 51,092 | 8 | 102,185 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,093 | 8 | 102,186 |
"Correct Solution:
```
N,K = map(int,input().split())
*H, = map(int,input().split())
print(sum(h>=K for h in H))
``` | output | 1 | 51,093 | 8 | 102,187 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,094 | 8 | 102,188 |
"Correct Solution:
```
N, K = map(int,input().split())
li_h = list(map(int, input().split()))
print(sum(i>=K for i in li_h))
``` | output | 1 | 51,094 | 8 | 102,189 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,095 | 8 | 102,190 |
"Correct Solution:
```
n,k = map(int,input().split())
ans = 0
for h in map(int,input().split()):
ans += (h>=k)
print(ans)
``` | output | 1 | 51,095 | 8 | 102,191 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,096 | 8 | 102,192 |
"Correct Solution:
```
N,K=map(int,input().split())
H=list(map(int,input().split()))
print(sum(map(lambda x:x>=K, H)))
``` | output | 1 | 51,096 | 8 | 102,193 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,097 | 8 | 102,194 |
"Correct Solution:
```
N,K=map(int,input().split())
H=list(map(int,input().split()))
print(sum(1 for h in H if h>=K))
``` | output | 1 | 51,097 | 8 | 102,195 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5 | instruction | 0 | 51,098 | 8 | 102,196 |
"Correct Solution:
```
N,K=map(int, input().split())
h=list(map(int, input().split()))
print(sum([H>=K for H in h]))
``` | output | 1 | 51,098 | 8 | 102,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5
Submitted Solution:
```
li = lambda: list(map(int,input().split()))
n, k = li()
h = li()
print(sum(hh >= k for hh in h))
``` | instruction | 0 | 51,100 | 8 | 102,200 |
Yes | output | 1 | 51,100 | 8 | 102,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5
Submitted Solution:
```
_,k = map(int, input().split())
print(sum(1 for h in map(int, input().split()) if h >= k))
``` | instruction | 0 | 51,101 | 8 | 102,202 |
Yes | output | 1 | 51,101 | 8 | 102,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5
Submitted Solution:
```
n,k=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
cnt=0
for i in range(n):
if l[i]>=k:
cnt=i
break
print(n-cnt)
``` | instruction | 0 | 51,103 | 8 | 102,206 |
No | output | 1 | 51,103 | 8 | 102,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5
Submitted Solution:
```
N,K=(int(x) for x in input().split())
h = [int(x) for x in input().split()]
print(h)
j = 0
a = 0
for i in range(N):
if h[j]>=K:
a = a+1
j = j + 1
print(a)
``` | instruction | 0 | 51,104 | 8 | 102,208 |
No | output | 1 | 51,104 | 8 | 102,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?
Constraints
* 1 \le N \le 10^5
* 1 \le K \le 500
* 1 \le h_i \le 500
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N
Output
Print the number of people among the Takahashi's friends who can ride the roller coaster.
Examples
Input
4 150
150 140 100 200
Output
2
Input
1 500
499
Output
0
Input
5 1
100 200 300 400 500
Output
5
Submitted Solution:
```
n, k = map(int, input().split())
hs = input().split()
count = 0
for i in range(0, N):
h = int(hs[i])
if h >= k:
count += 1
print(count)
``` | instruction | 0 | 51,106 | 8 | 102,212 |
No | output | 1 | 51,106 | 8 | 102,213 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and another one in the shape of a rectangle (which possibly can be a square as well).
Applejack will build the storages using planks, she is going to spend exactly one plank on each side of the storage. She can get planks from her friend's company. Initially, the company storehouse has n planks, Applejack knows their lengths. The company keeps working so it receives orders and orders the planks itself. Applejack's friend can provide her with information about each operation. For convenience, he will give her information according to the following format:
* + x: the storehouse received a plank with length x
* - x: one plank with length x was removed from the storehouse (it is guaranteed that the storehouse had some planks with length x).
Applejack is still unsure about when she is going to order the planks so she wants to know if she can order the planks to build rectangular and square storages out of them after every event at the storehouse. Applejack is busy collecting apples and she has completely no time to do the calculations so she asked you for help!
We remind you that all four sides of a square are equal, and a rectangle has two pairs of equal sides.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5): the initial amount of planks at the company's storehouse, the second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^5): the lengths of the planks.
The third line contains a single integer q (1 ≤ q ≤ 10^5): the number of events in the company. Each of the next q lines contains a description of the events in a given format: the type of the event (a symbol + or -) is given first, then goes the integer x (1 ≤ x ≤ 10^5).
Output
After every event in the company, print "YES" if two storages of the required shape can be built from the planks of that company's set, and print "NO" otherwise. You can print each letter in any case (upper or lower).
Example
Input
6
1 1 1 2 1 1
6
+ 2
+ 1
- 1
+ 2
- 1
+ 2
Output
NO
YES
NO
NO
NO
YES
Note
After the second event Applejack can build a rectangular storage using planks with lengths 1, 2, 1, 2 and a square storage using planks with lengths 1, 1, 1, 1.
After the sixth event Applejack can build a rectangular storage using planks with lengths 2, 2, 2, 2 and a square storage using planks with lengths 1, 1, 1, 1. | instruction | 0 | 51,519 | 8 | 103,038 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import sys
import math
from collections import Counter,defaultdict
input = sys.stdin.readline
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
def case():
n=IN()
a=LI()
di=defaultdict(int)
di=Counter(a)
c=0
d=0
for i in di:
t=di[i]
if t>=4:
c+=t//4
t=t%4
if t>=2:
d+=1
x=IN()
for i in range(x):
ans="NO"
p,q=input().strip().split()
q=int(q)
t=di[q]
if p=="+":
di[q]+=1
if t%4==3:
d-=1
c+=1
elif t%4==1:
d+=1
else:
di[q]-=1
if t%4==2:
d-=1
elif t%4==0:
c-=1
d+=1
if c>1 or (c and d>1):
ans="YES"
print(ans)
for _ in range(1):
case()
``` | output | 1 | 51,519 | 8 | 103,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and another one in the shape of a rectangle (which possibly can be a square as well).
Applejack will build the storages using planks, she is going to spend exactly one plank on each side of the storage. She can get planks from her friend's company. Initially, the company storehouse has n planks, Applejack knows their lengths. The company keeps working so it receives orders and orders the planks itself. Applejack's friend can provide her with information about each operation. For convenience, he will give her information according to the following format:
* + x: the storehouse received a plank with length x
* - x: one plank with length x was removed from the storehouse (it is guaranteed that the storehouse had some planks with length x).
Applejack is still unsure about when she is going to order the planks so she wants to know if she can order the planks to build rectangular and square storages out of them after every event at the storehouse. Applejack is busy collecting apples and she has completely no time to do the calculations so she asked you for help!
We remind you that all four sides of a square are equal, and a rectangle has two pairs of equal sides.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5): the initial amount of planks at the company's storehouse, the second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^5): the lengths of the planks.
The third line contains a single integer q (1 ≤ q ≤ 10^5): the number of events in the company. Each of the next q lines contains a description of the events in a given format: the type of the event (a symbol + or -) is given first, then goes the integer x (1 ≤ x ≤ 10^5).
Output
After every event in the company, print "YES" if two storages of the required shape can be built from the planks of that company's set, and print "NO" otherwise. You can print each letter in any case (upper or lower).
Example
Input
6
1 1 1 2 1 1
6
+ 2
+ 1
- 1
+ 2
- 1
+ 2
Output
NO
YES
NO
NO
NO
YES
Note
After the second event Applejack can build a rectangular storage using planks with lengths 1, 2, 1, 2 and a square storage using planks with lengths 1, 1, 1, 1.
After the sixth event Applejack can build a rectangular storage using planks with lengths 2, 2, 2, 2 and a square storage using planks with lengths 1, 1, 1, 1. | instruction | 0 | 51,520 | 8 | 103,040 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
d={}
l={2:set(),4:set()}
for i in range(n):
if a[i] not in d:d[a[i]]=1
else:
d[a[i]]+=1
if d[a[i]]==2:
l[2].add(a[i])
if d[a[i]]==4:
l[4].add(a[i])
l[2].remove(a[i])
l2,l4=len(l[2]),len(l[4])
for _ in range(int(input())):
#n=int(input())
# n,k=map(int,input().split())
ch,x=input().strip().split()
#=sorted(list(map(int,input().split())))
x=int(x)
if ch=='+':
if x not in d:d[x]=1
else:d[x]+=1
if d[x]==2:
l[2].add(x)
l2+=1
if d[x]==4:
l[4].add(x)
l4+=1
l[2].remove(x)
l2-=1
f=0
if l4>1:f=1
if l4==1:
e=l[4].pop()
if d[e]//4>1:
f=1
if 5<d[e]<8 and l2>0:
f=1
if l2>1:
f=1
l[4].add(e)
if f:print('YES')
else:print("NO")
else:
d[x]-=1
if d[x]==1:
l[2].remove(x)
l2-=1
if d[x]==3:
l[4].remove(x)
l4-=1
l[2].add(x)
l2+=1
f=0
if l4>1:f=1
if l4==1:
e=l[4].pop()
if d[e]//4>1:
f=1
if 5<d[e]<8 and l2>0:
f=1
if l2>1:
f=1
l[4].add(e)
if f:print('YES')
else:print("NO")
``` | output | 1 | 51,520 | 8 | 103,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and another one in the shape of a rectangle (which possibly can be a square as well).
Applejack will build the storages using planks, she is going to spend exactly one plank on each side of the storage. She can get planks from her friend's company. Initially, the company storehouse has n planks, Applejack knows their lengths. The company keeps working so it receives orders and orders the planks itself. Applejack's friend can provide her with information about each operation. For convenience, he will give her information according to the following format:
* + x: the storehouse received a plank with length x
* - x: one plank with length x was removed from the storehouse (it is guaranteed that the storehouse had some planks with length x).
Applejack is still unsure about when she is going to order the planks so she wants to know if she can order the planks to build rectangular and square storages out of them after every event at the storehouse. Applejack is busy collecting apples and she has completely no time to do the calculations so she asked you for help!
We remind you that all four sides of a square are equal, and a rectangle has two pairs of equal sides.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5): the initial amount of planks at the company's storehouse, the second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^5): the lengths of the planks.
The third line contains a single integer q (1 ≤ q ≤ 10^5): the number of events in the company. Each of the next q lines contains a description of the events in a given format: the type of the event (a symbol + or -) is given first, then goes the integer x (1 ≤ x ≤ 10^5).
Output
After every event in the company, print "YES" if two storages of the required shape can be built from the planks of that company's set, and print "NO" otherwise. You can print each letter in any case (upper or lower).
Example
Input
6
1 1 1 2 1 1
6
+ 2
+ 1
- 1
+ 2
- 1
+ 2
Output
NO
YES
NO
NO
NO
YES
Note
After the second event Applejack can build a rectangular storage using planks with lengths 1, 2, 1, 2 and a square storage using planks with lengths 1, 1, 1, 1.
After the sixth event Applejack can build a rectangular storage using planks with lengths 2, 2, 2, 2 and a square storage using planks with lengths 1, 1, 1, 1. | instruction | 0 | 51,521 | 8 | 103,042 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
# from bisect import bisect_left
N = int(input())
A = {}
sq = set()
rec = set()
for a in map(int, input().split()):
c = A.setdefault(a, 0) + 1
A[a] = c
if c > 3:
sq.add(a)
if c > 1:
rec.add(a)
Q = int(input())
for _ in range(Q):
op, x = input().split()
a = int(x)
if op == '+':
c = A.setdefault(a, 0) + 1
else:
c = A.setdefault(a, 0) - 1
A[a] = c
if c > 3:
sq.add(a)
else:
sq.discard(a)
if c > 1:
rec.add(a)
else:
rec.discard(a)
# print(sq, rec, A)
if len(sq) > 1:
print('Yes')
elif len(sq) == 1:
if len(rec) > 2:
print('Yes')
elif len(rec) == 2:
if sq and rec:
t = list(rec)
c1 = A[t[0]]
c2 = A[t[1]]
if c1 > 5 or c2 > 5:
print('Yes')
else:
print('No')
else:
print('Yes')
else:
t = list(rec)
c1 = A[t[0]]
if c1 > 7:
print('Yes')
else:
print('No')
else:
print('No')
# print(A, sq, rec)
``` | output | 1 | 51,521 | 8 | 103,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and another one in the shape of a rectangle (which possibly can be a square as well).
Applejack will build the storages using planks, she is going to spend exactly one plank on each side of the storage. She can get planks from her friend's company. Initially, the company storehouse has n planks, Applejack knows their lengths. The company keeps working so it receives orders and orders the planks itself. Applejack's friend can provide her with information about each operation. For convenience, he will give her information according to the following format:
* + x: the storehouse received a plank with length x
* - x: one plank with length x was removed from the storehouse (it is guaranteed that the storehouse had some planks with length x).
Applejack is still unsure about when she is going to order the planks so she wants to know if she can order the planks to build rectangular and square storages out of them after every event at the storehouse. Applejack is busy collecting apples and she has completely no time to do the calculations so she asked you for help!
We remind you that all four sides of a square are equal, and a rectangle has two pairs of equal sides.
Input
The first line contains a single integer n (1 ≤ n ≤ 10^5): the initial amount of planks at the company's storehouse, the second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^5): the lengths of the planks.
The third line contains a single integer q (1 ≤ q ≤ 10^5): the number of events in the company. Each of the next q lines contains a description of the events in a given format: the type of the event (a symbol + or -) is given first, then goes the integer x (1 ≤ x ≤ 10^5).
Output
After every event in the company, print "YES" if two storages of the required shape can be built from the planks of that company's set, and print "NO" otherwise. You can print each letter in any case (upper or lower).
Example
Input
6
1 1 1 2 1 1
6
+ 2
+ 1
- 1
+ 2
- 1
+ 2
Output
NO
YES
NO
NO
NO
YES
Note
After the second event Applejack can build a rectangular storage using planks with lengths 1, 2, 1, 2 and a square storage using planks with lengths 1, 1, 1, 1.
After the sixth event Applejack can build a rectangular storage using planks with lengths 2, 2, 2, 2 and a square storage using planks with lengths 1, 1, 1, 1. | instruction | 0 | 51,522 | 8 | 103,044 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
z,zz=input,lambda:list(map(int,z().split()))
fast=lambda:stdin.readline().strip()
zzz=lambda:[int(i) for i in fast().split()]
szz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())
from string import *
from re import *
from collections import *
from queue import *
from sys import *
from collections import *
from math import *
from heapq import *
from itertools import *
from bisect import *
from collections import Counter as cc
from math import factorial as f
from bisect import bisect as bs
from bisect import bisect_left as bsl
from itertools import accumulate as ac
from io import BytesIO, IOBase
def lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))
def prime(x):
p=ceil(x**.5)+1
for i in range(2,p):
if (x%i==0 and x!=2) or x==0:return 0
return 1
def dfs(u,visit,graph):
visit[u]=1
for i in graph[u]:
if not visit[i]:
dfs(i,visit,graph)
###########################---Test-Case---#################################
"""
If you Know me , Then you probably don't know me !
"""
###########################---START-CODING---##############################
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")
n4, n2 = 0, 0
freq = defaultdict(int)
def add(x):
global n2, n4
freq[x] += 1
if freq[x] % 2 == 0:
n2 += 1
if freq[x] % 4 == 0:
n4 += 1
def sub(x):
global n2, n4
old = freq[x]
freq[x] -= 1
if old % 2 == 0:
n2 -= 1
if old % 4 == 0:
n4 -= 1
N = int(fast())
for x in zzz():add(x)
Q = int(fast())
for _ in range(Q):
t, x = fast().split(' ')
x = int(x)
if t == '+':
add(x)
else:
sub(x)
print('YES' if n4 >= 1 and n2 - 2 >= 2 else 'NO')
``` | output | 1 | 51,522 | 8 | 103,045 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.