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.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,069 | 8 | 10,138 |
Yes | output | 1 | 5,069 | 8 | 10,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,070 | 8 | 10,140 |
Yes | output | 1 | 5,070 | 8 | 10,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,071 | 8 | 10,142 |
Yes | output | 1 | 5,071 | 8 | 10,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,072 | 8 | 10,144 |
Yes | output | 1 | 5,072 | 8 | 10,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,073 | 8 | 10,146 |
No | output | 1 | 5,073 | 8 | 10,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,074 | 8 | 10,148 |
No | output | 1 | 5,074 | 8 | 10,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,075 | 8 | 10,150 |
No | output | 1 | 5,075 | 8 | 10,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut likes kvass very much. On his birthday parents presented him n kegs of kvass. There are v_i liters of kvass in the i-th keg. Each keg has a lever. You can pour your glass by exactly... | instruction | 0 | 5,076 | 8 | 10,152 |
No | output | 1 | 5,076 | 8 | 10,153 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 5,430 | 8 | 10,860 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
n=int(input())
l=[int(i) for i in input().split()]
stack=[]
ans=[0]*n
left=[-1]*n
right=[n]*n
for i in range(n):
while(stack!=[] and l[i]<=l[stack[-1]]):
stack.pop()
if(stack!=[]):
left[i]=stack[-1]
stack.append(i)
stack=[]
... | output | 1 | 5,430 | 8 | 10,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to rig... | instruction | 0 | 5,432 | 8 | 10,864 |
No | output | 1 | 5,432 | 8 | 10,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to rig... | instruction | 0 | 5,433 | 8 | 10,866 |
No | output | 1 | 5,433 | 8 | 10,867 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of them. The sections are enumerated from 1 to m al... | instruction | 0 | 5,571 | 8 | 11,142 |
Tags: binary search
Correct Solution:
```
import bisect as bs
import sys
inp = sys.stdin.readlines()
n, m, ladders, elevators, v = [int(x) for x in inp[0].strip().split()]
ladders = [int(x) for x in inp[1].strip().split()]
elevators = [int(x) for x in inp[2].strip().split()]
q = int(inp[3].strip())
qs = []
for i in r... | output | 1 | 5,571 | 8 | 11,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of them. The sections are enumerated from 1 to m al... | instruction | 0 | 5,572 | 8 | 11,144 |
Tags: binary search
Correct Solution:
```
# python3
import sys
from bisect import bisect
def readline(): return tuple(map(int, input().split()))
def readlines():
return (tuple(map(int, line.split())) for line in sys.stdin.readlines())
def bisect_bounds(arr, val):
idx = bisect(arr, val)
if idx: yield idx... | output | 1 | 5,572 | 8 | 11,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of them. The sections are enumerated from 1 to m al... | instruction | 0 | 5,573 | 8 | 11,146 |
Tags: binary search
Correct Solution:
```
from bisect import bisect_left
input = __import__('sys').stdin.readline
MIS = lambda: map(int,input().split())
def walk(x1, y1, x2, y2, L, v):
if y1 == y2: return abs(x2-x1)
dy = abs(y1-y2)
vertical = dy // v
if dy%v: vertical+= 1
i = bisect_left(... | output | 1 | 5,573 | 8 | 11,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of them. The sections are enumerated from 1 to m al... | instruction | 0 | 5,574 | 8 | 11,148 |
Tags: binary search
Correct Solution:
```
def takeClosest(myList, myNumber):
"""
Assumes myList is sorted. Returns closest value to myNumber.
If two numbers are equally close, return the smallest number.
"""
if len(myList) == 0:
return 9e10
pos = bisect_left(myList, myNumber)
if pos... | output | 1 | 5,574 | 8 | 11,149 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of them. The sections are enumerated from 1 to m al... | instruction | 0 | 5,575 | 8 | 11,150 |
Tags: binary search
Correct Solution:
```
# Code by Sounak, IIESTS
# ------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
... | output | 1 | 5,575 | 8 | 11,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of t... | instruction | 0 | 5,576 | 8 | 11,152 |
No | output | 1 | 5,576 | 8 | 11,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of t... | instruction | 0 | 5,577 | 8 | 11,154 |
No | output | 1 | 5,577 | 8 | 11,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of t... | instruction | 0 | 5,578 | 8 | 11,156 |
No | output | 1 | 5,578 | 8 | 11,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the year of 30XX participants of some world programming championship live in a single large hotel. The hotel has n floors. Each floor has m sections with a single corridor connecting all of t... | instruction | 0 | 5,579 | 8 | 11,158 |
No | output | 1 | 5,579 | 8 | 11,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently in school Alina has learned what are the persistent data structures: they are data structures that always preserves the previous version of itself and access to it when it is modified.
... | instruction | 0 | 6,253 | 8 | 12,506 |
No | output | 1 | 6,253 | 8 | 12,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently in school Alina has learned what are the persistent data structures: they are data structures that always preserves the previous version of itself and access to it when it is modified.
... | instruction | 0 | 6,254 | 8 | 12,508 |
No | output | 1 | 6,254 | 8 | 12,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently in school Alina has learned what are the persistent data structures: they are data structures that always preserves the previous version of itself and access to it when it is modified.
... | instruction | 0 | 6,255 | 8 | 12,510 |
No | output | 1 | 6,255 | 8 | 12,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently in school Alina has learned what are the persistent data structures: they are data structures that always preserves the previous version of itself and access to it when it is modified.
... | instruction | 0 | 6,256 | 8 | 12,512 |
No | output | 1 | 6,256 | 8 | 12,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has prepared boxes with presents for n kids, one box for each kid. There are m kinds of presents: balloons, sweets, chocolate bars, toy cars... A child would be disappointed to receive two... | instruction | 0 | 6,608 | 8 | 13,216 |
No | output | 1 | 6,608 | 8 | 13,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has prepared boxes with presents for n kids, one box for each kid. There are m kinds of presents: balloons, sweets, chocolate bars, toy cars... A child would be disappointed to receive two... | instruction | 0 | 6,609 | 8 | 13,218 |
No | output | 1 | 6,609 | 8 | 13,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has prepared boxes with presents for n kids, one box for each kid. There are m kinds of presents: balloons, sweets, chocolate bars, toy cars... A child would be disappointed to receive two... | instruction | 0 | 6,610 | 8 | 13,220 |
No | output | 1 | 6,610 | 8 | 13,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has prepared boxes with presents for n kids, one box for each kid. There are m kinds of presents: balloons, sweets, chocolate bars, toy cars... A child would be disappointed to receive two... | instruction | 0 | 6,611 | 8 | 13,222 |
No | output | 1 | 6,611 | 8 | 13,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,894 | 8 | 13,788 |
Tags: shortest paths
Correct Solution:
```
f = lambda: [q != '-' for q in input()]
n, k = map(int, input().split())
t = [(0, 0, f(), f())]
def g(d, s, a, b):
if d > n - 1:
print('YES')
exit()
if not (a[d] or s > d):
a[d] = 1
t.append((d, s, a, b))
while t:
d, s, a, b = t.pop(... | output | 1 | 6,894 | 8 | 13,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,895 | 8 | 13,790 |
Tags: shortest paths
Correct Solution:
```
# 198B
__author__ = 'artyom'
n, k = map(int, input().split())
w = [input(), input()]
def neighbours(vertex, time):
vertices = set()
if vertex[1] + 1 >= n or w[vertex[0]][vertex[1] + 1] != 'X':
vertices.add((vertex[0], vertex[1] + 1))
if vertex[1] + k >= n or w[1 ... | output | 1 | 6,895 | 8 | 13,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,896 | 8 | 13,792 |
Tags: shortest paths
Correct Solution:
```
def bfs(n):
visited=[False]*(2*n)
queue=[]
queue2=[]
queue.append(0)
queue2.append(0)
visited[0]=True
flag=True
water=0
while queue and flag:
s=queue.pop(0)
water= queue2.pop(0)
for i in graph[s]:
if not ... | output | 1 | 6,896 | 8 | 13,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,897 | 8 | 13,794 |
Tags: shortest paths
Correct Solution:
```
n, k = map(int, input().split(' '))
l = input()
r = input()
data = [0, ' '+l, ' '+r]
dist = [[1000000]*(10**5+5) for _ in range(3)]
visited = [[False]*100005 for _ in range(3)]
visited[1][1] = True
dist[1][1] = 0
qx = [1]
qy = [1]
while qx:
x = qx.pop()
y = qy.p... | output | 1 | 6,897 | 8 | 13,795 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,898 | 8 | 13,796 |
Tags: shortest paths
Correct Solution:
```
n, k = map(int, input().split())
lzid = input()
dzid = input()
zidovi = [lzid, dzid]
q = [[-1, [False,0]]] #[koraci, [zid, visina]]
izasao = 0
bio = [[0 for i in range(n+k+100)], [0 for i in range(n+k+100)]]
while len(q) != 0:
trenutni = q.pop(0)
korak = trenutni[0... | output | 1 | 6,898 | 8 | 13,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,899 | 8 | 13,798 |
Tags: shortest paths
Correct Solution:
```
f = lambda: [q == '-' for q in input()]
n, k = map(int, input().split())
l, r = f(), f()
u, v = [0], []
def yes(d):
if d > n - 1:
print('YES')
exit()
for i in range(n):
a, b = [], []
for d in u:
if l[d - 1] and d - 1 > i:
a.appen... | output | 1 | 6,899 | 8 | 13,799 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,900 | 8 | 13,800 |
Tags: shortest paths
Correct Solution:
```
from sys import stdin, stdout
from collections import deque
n, k = map(int, stdin.readline().split())
maps = []
maps.append(list(stdin.readline() + '-'))
maps.append(list(stdin.readline() + '-'))
visit = [[0, 0] for i in range(n + 1)]
visit[0][0] = 1
queue = deque()
label =... | output | 1 | 6,900 | 8 | 13,801 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long ar... | instruction | 0 | 6,901 | 8 | 13,802 |
Tags: shortest paths
Correct Solution:
```
from collections import deque
l, j = [int(i) for i in input().split(' ')]
wallA = list(input())
wallB = list(input())
g = {}
for i in range(l):
# Each 4-tuple represents: (Visited?, Current Height, Current Water Height, Drowned?)
if wallA[i] == '-':
g[(1,i+1)... | output | 1 | 6,901 | 8 | 13,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,902 | 8 | 13,804 |
Yes | output | 1 | 6,902 | 8 | 13,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,903 | 8 | 13,806 |
Yes | output | 1 | 6,903 | 8 | 13,807 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,904 | 8 | 13,808 |
Yes | output | 1 | 6,904 | 8 | 13,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,905 | 8 | 13,810 |
Yes | output | 1 | 6,905 | 8 | 13,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,906 | 8 | 13,812 |
No | output | 1 | 6,906 | 8 | 13,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,907 | 8 | 13,814 |
No | output | 1 | 6,907 | 8 | 13,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,908 | 8 | 13,816 |
No | output | 1 | 6,908 | 8 | 13,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine... | instruction | 0 | 6,909 | 8 | 13,818 |
No | output | 1 | 6,909 | 8 | 13,819 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,630 | 8 | 15,260 |
Tags: implementation
Correct Solution:
```
n, h, m = list(map(int, input().split()))
A = [h] * n
for _ in range(m):
l, r, x = list(map(int, input().split()))
# print(l,r,x)
for i in range(l-1,r):
A[i] = min(A[i], x)
s = 0
for a in A:
s += a * a
# print(A)
print(s)
``` | output | 1 | 7,630 | 8 | 15,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,631 | 8 | 15,262 |
Tags: implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
n,h,m=list(map(int,input().split()))
a = [h]*n
for i in range(m):
b,c,d = list(map(int,input().split()))
a[b-1:c] = [min(x,d) for x in a[b-1:c]]
print(sum([x**2 for x in a]))
``` | output | 1 | 7,631 | 8 | 15,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,632 | 8 | 15,264 |
Tags: implementation
Correct Solution:
```
n,h,m=map(int,input().split())
b=[h]*n
while m:
m-=1
l,r,x=map(int,input().split())
for i in range(l-1,r):
b[i]=min(b[i],x)
print(sum([x**2 for x in b]))
``` | output | 1 | 7,632 | 8 | 15,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,633 | 8 | 15,266 |
Tags: implementation
Correct Solution:
```
n, h, m = map(int,input().split())
ans = [h for i in range(n+1)]
for i in range(m):
l, r, x = map(int,input().split())
for j in range(l,r+1):
ans[j] = min(ans[j],x)
sum = 0
for i in range(1,n+1):
sum += ans[i]*ans[i]
print(sum)
``` | output | 1 | 7,633 | 8 | 15,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,634 | 8 | 15,268 |
Tags: implementation
Correct Solution:
```
n,h,m=map(int,input().split())
a=[h for i in range(n)]
for i in range(m):
l,r,x=map(int,input().split())
for j in range(l-1,r):
a[j]=min(a[j],x)
sum=0
for i in range(len(a)):
sum=sum+a[i]*a[i]
print(sum)
``` | output | 1 | 7,634 | 8 | 15,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,635 | 8 | 15,270 |
Tags: implementation
Correct Solution:
```
n,h,m=map(int,input().split())
import math
ar=[math.inf]*n
for i in range(m):
l,r,x=map(int,input().split())
for k in range(l-1,r):
ar[k]=min(ar[k],x)
for i in range(len(ar)):
if ar[i]==math.inf:
ar[i]=h
s=0
for i in ar:
s=s+i**2
print(s)
``` | output | 1 | 7,635 | 8 | 15,271 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.