message stringlengths 2 22.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 16 109k | cluster float64 1 1 | __index_level_0__ int64 32 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long party Petya decided to return home, but he turned out to be at the opposite end of the town from his home. There are n crossroads in the line in the town, and there is either the bu... | instruction | 0 | 35,331 | 1 | 70,662 |
No | output | 1 | 35,331 | 1 | 70,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long party Petya decided to return home, but he turned out to be at the opposite end of the town from his home. There are n crossroads in the line in the town, and there is either the bu... | instruction | 0 | 35,332 | 1 | 70,664 |
No | output | 1 | 35,332 | 1 | 70,665 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a long party Petya decided to return home, but he turned out to be at the opposite end of the town from his home. There are n crossroads in the line in the town, and there is either the bu... | instruction | 0 | 35,333 | 1 | 70,666 |
No | output | 1 | 35,333 | 1 | 70,667 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,353 | 1 | 70,706 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
import sys
input=sys.stdin.readline
n,h,m,k=map(int,input().split())
tram=[]
dic={}
for i in range(n):
H,M=map(int,input().split())
r=M%(m//2)
tram.append(r)
if r not in dic:
dic[r]=0
dic[r]+=1
... | output | 1 | 35,353 | 1 | 70,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,354 | 1 | 70,708 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
#starting time t of passenger tram wll always be equal to (k+m) of
#some freight train where m is the departure time of some freight train
from collections import defaultdict
import sys
input=sys.stdin.readline
n,h,m,k=map(i... | output | 1 | 35,354 | 1 | 70,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,355 | 1 | 70,710 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
from bisect import *
from collections import *
from math import gcd,ceil,sqrt,floor,inf
from heapq import *
from itertools import *
from operator import add,mul,sub,xor,truediv,floordiv
from functools import *
#------------... | output | 1 | 35,355 | 1 | 70,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,356 | 1 | 70,712 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
import sys
from bisect import bisect_left, bisect_right
input = sys.stdin.buffer.readline
n, h, m, k = map(int, input().split())
p, trm = m//2, []
for i in range(n):
a, b = map(int, input().split())
trm.append((b%p,... | output | 1 | 35,356 | 1 | 70,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,357 | 1 | 70,714 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
# Fast IO (only use in integer input)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,h,m,k = map(int,input().split())
trainMod = []
for i in range(n):
hi,mi = map(int,input().split())
trai... | output | 1 | 35,357 | 1 | 70,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,358 | 1 | 70,716 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,h,m,k = map(int,input().split());trainMod = []
for i in range(n):
hi,mi = map(int,input().split());trainMod.append((mi % (m//2),i+1))
if (mi % ... | output | 1 | 35,358 | 1 | 70,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,359 | 1 | 70,718 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
import sys
import re
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
def solve():
n, h, m, k = mints()
m //= 2
a = [0]*n
e = [None]*(2*n+... | output | 1 | 35,359 | 1 | 70,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every da... | instruction | 0 | 35,360 | 1 | 70,720 |
Tags: binary search, brute force, data structures, sortings, two pointers
Correct Solution:
```
import sys
import collections
inpy = [int(x) for x in sys.stdin.read().split()]
n, h, m, k = inpy[:4]
rm = [0] * n
index = 4
for i in range(n):
rm[i] = (inpy[index+1], i + 1)
index += 2
res, cancle = 0, None
rm.sort... | output | 1 | 35,360 | 1 | 70,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,361 | 1 | 70,722 |
Yes | output | 1 | 35,361 | 1 | 70,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,362 | 1 | 70,724 |
Yes | output | 1 | 35,362 | 1 | 70,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,363 | 1 | 70,726 |
Yes | output | 1 | 35,363 | 1 | 70,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,364 | 1 | 70,728 |
Yes | output | 1 | 35,364 | 1 | 70,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,365 | 1 | 70,730 |
No | output | 1 | 35,365 | 1 | 70,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,366 | 1 | 70,732 |
No | output | 1 | 35,366 | 1 | 70,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,367 | 1 | 70,734 |
No | output | 1 | 35,367 | 1 | 70,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there... | instruction | 0 | 35,368 | 1 | 70,736 |
No | output | 1 | 35,368 | 1 | 70,737 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. The i-th car starts at intersection v_i and has ... | instruction | 0 | 35,413 | 1 | 70,826 |
Tags: dfs and similar, graphs, math, number theory
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
"""
Given a directed graph, find_SCC returns a list of lists containing
the strongly connected components in topological order.
Note that this implementation can be also b... | output | 1 | 35,413 | 1 | 70,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. The i-th car starts at intersection v_i and has ... | instruction | 0 | 35,414 | 1 | 70,828 |
Tags: dfs and similar, graphs, math, number theory
Correct Solution:
```
import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from math import gcd
n,m=map(int,input().split())
E=[[] for i in range(n)]
X=[[] for i in range(n)]
for i in range(m):
a,b,x=map(int,input().split())
a-... | output | 1 | 35,414 | 1 | 70,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. The i-th car starts at intersection v_i and has ... | instruction | 0 | 35,415 | 1 | 70,830 |
Tags: dfs and similar, graphs, math, number theory
Correct Solution:
```
import sys, io, os
from math import gcd
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline;n,m=map(int,input().split());E=[[] for i in range(n)];X=[[] for i in range(n)]
for i in range(m):a,b,x=map(int,input().split());a-=1;b-=1;E[a].appe... | output | 1 | 35,415 | 1 | 70,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. The i-th car starts at intersection v_i and has ... | instruction | 0 | 35,416 | 1 | 70,832 |
Tags: dfs and similar, graphs, math, number theory
Correct Solution:
```
import sys
from sys import stdin
import math
from collections import deque
import sys
class scc_graph:
def __init__(self, N):
self.N = N
self.edges = []
def csr(self):
self.start = [0]*(self.N+1)
self... | output | 1 | 35,416 | 1 | 70,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. The i-th car starts at intersection v_i and has ... | instruction | 0 | 35,417 | 1 | 70,834 |
Tags: dfs and similar, graphs, math, number theory
Correct Solution:
```
def find_SCC(graph):
SCC, S, P = [], [], []
depth = [0] * len(graph)
stack = list(range(len(graph)))
while stack:
node = stack.pop()
if node < 0:
d = depth[~node] - 1
if P[-1] > d:
... | output | 1 | 35,417 | 1 | 70,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. The i-th car starts at intersection v_i and has ... | instruction | 0 | 35,418 | 1 | 70,836 |
Tags: dfs and similar, graphs, math, number theory
Correct Solution:
```
import sys, io, os
from math import gcd
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline;n,m=map(int,input().split());E=[[] for i in range(n)];X=[[] for i in range(n)]
for i in range(m):a,b,x=map(int,input().split());a-=1;b-=1;E[a].appe... | output | 1 | 35,418 | 1 | 70,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. T... | instruction | 0 | 35,419 | 1 | 70,838 |
No | output | 1 | 35,419 | 1 | 70,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. T... | instruction | 0 | 35,420 | 1 | 70,840 |
No | output | 1 | 35,420 | 1 | 70,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. T... | instruction | 0 | 35,421 | 1 | 70,842 |
No | output | 1 | 35,421 | 1 | 70,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. T... | instruction | 0 | 35,422 | 1 | 70,844 |
No | output | 1 | 35,422 | 1 | 70,845 |
Provide a correct Python 3 solution for this coding contest problem.
Problem C: Seishun 18 Kippu
A student at R University, sirokurostone, was about to attend a training camp at Atsu University. Other members plan to use the Shinkansen, but sirokurostone was going to use the Seishun 18 Ticket. Similarly, a person who... | instruction | 0 | 35,939 | 1 | 71,878 |
"Correct Solution:
```
from heapq import heappush, heappop
while True:
n, m = map(int, input().split())
if n == 0:break
s, p, g = input().split()
edges = {}
for _ in range(m):
a, b, d, t = input().split()
if a not in edges:edges[a] = []
if b not in edges:edges[b] = []
d = int(d)
t = int(t)... | output | 1 | 35,939 | 1 | 71,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,094 | 1 | 72,188 |
Tags: implementation
Correct Solution:
```
n=int(input())
x=0
y=0
m=0
for u in range(n):
a,b=map(int,input().split())
y=y-a
y=y+b
if(y>m):
m=y
print(m)
``` | output | 1 | 36,094 | 1 | 72,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,095 | 1 | 72,190 |
Tags: implementation
Correct Solution:
```
n=int(input())
ar1=[]
for i in range(n):
x=input()
ar1.append([0,1])
a,b=x.split(' ')
ar1[i][0],ar1[i][1]=a,b
maxi=0
tsum=0
temp=0
for j in range(n):
temp=int(ar1[j][1])-int(ar1[j][0])
tsum+=temp
if tsum>maxi:
maxi=tsum
print(maxi)
... | output | 1 | 36,095 | 1 | 72,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,096 | 1 | 72,192 |
Tags: implementation
Correct Solution:
```
m=k=0
for i in range(int(input())):
a,b=map(int,input().split())
k+=b-a
m=max(m,k)
print(m)
``` | output | 1 | 36,096 | 1 | 72,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,097 | 1 | 72,194 |
Tags: implementation
Correct Solution:
```
no_of_tram_stops = int(input())
current, remaining = 0, 0
temp = []
for i in range(no_of_tram_stops):
a, b = map(int, input().split())
current = b - a
current += remaining
remaining = current
temp.append(remaining)
print(max(temp))
``` | output | 1 | 36,097 | 1 | 72,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,098 | 1 | 72,196 |
Tags: implementation
Correct Solution:
```
# 116A - Tram
n = int(input())
zui = 0
zong = 0
for i in range(n):
num = input().split()
zong = zong - int(num[0]) + int(num[1])
if zong > zui:
zui = zong
print(zui)
``` | output | 1 | 36,098 | 1 | 72,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,099 | 1 | 72,198 |
Tags: implementation
Correct Solution:
```
n = int(input())
x =0
m =0
for i in range(n):
s = input()
a = list(s.split(" "))
x = x + int(a[1])- int(a[0])
if m < x:
m = x
print(m)
``` | output | 1 | 36,099 | 1 | 72,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,100 | 1 | 72,200 |
Tags: implementation
Correct Solution:
```
t=int(input())
c=0
capacity=0
for i in range(t):
a,b=map(int,input().split())
c=c-a
c=c+b
if c>capacity:
capacity=c
print(capacity)
``` | output | 1 | 36,100 | 1 | 72,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop... | instruction | 0 | 36,101 | 1 | 72,202 |
Tags: implementation
Correct Solution:
```
n=int(input())
c=0
m=[]
for i in range(n):
a,b=input().split()
a=int(a)
b=int(b)
c=c-a+b
m.append(c)
print(max(m))
``` | output | 1 | 36,101 | 1 | 72,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,102 | 1 | 72,204 |
Yes | output | 1 | 36,102 | 1 | 72,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,103 | 1 | 72,206 |
Yes | output | 1 | 36,103 | 1 | 72,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,104 | 1 | 72,208 |
Yes | output | 1 | 36,104 | 1 | 72,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,105 | 1 | 72,210 |
Yes | output | 1 | 36,105 | 1 | 72,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,106 | 1 | 72,212 |
No | output | 1 | 36,106 | 1 | 72,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,107 | 1 | 72,214 |
No | output | 1 | 36,107 | 1 | 72,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,108 | 1 | 72,216 |
No | output | 1 | 36,108 | 1 | 72,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tr... | instruction | 0 | 36,109 | 1 | 72,218 |
No | output | 1 | 36,109 | 1 | 72,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nowadays it is becoming increasingly difficult to park a car in cities successfully. Let's imagine a segment of a street as long as L meters along which a parking lot is located. Drivers should park their cars strictly parallel to the paveme... | instruction | 0 | 36,479 | 1 | 72,958 |
Tags: data structures, implementation
Correct Solution:
```
class Car:
def __init__(self, id, size, location):
self.id = id
self.size = size
self.location = location
print(location)
cars = []
lot_size, back_gap, front_gap = map(int, input().split())
q = int(input())
for id in range(1, q + 1):
reque... | output | 1 | 36,479 | 1 | 72,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nowadays it is becoming increasingly difficult to park a car in cities successfully. Let's imagine a segment of a street as long as L meters along which a parking lot is located. Drivers should park their cars strictly parallel to the paveme... | instruction | 0 | 36,480 | 1 | 72,960 |
Tags: data structures, implementation
Correct Solution:
```
class Car:
def __init__(self, id, size, location):
self.id = id
self.size = size
self.location = location
print(location)
cars = []
lot_size, back_gap, front_gap = map(int, input().split())
q = int(input())
for id in range(1, q + 1):
reque... | output | 1 | 36,480 | 1 | 72,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nowadays it is becoming increasingly difficult to park a car in cities successfully. Let's imagine a segment of a street as long as L meters along which a parking lot is located. Drivers should park their cars strictly parallel to the paveme... | instruction | 0 | 36,481 | 1 | 72,962 |
Tags: data structures, implementation
Correct Solution:
```
from sys import stdin
L,b,f = [int(x) for x in stdin.readline().split()]
n = int(stdin.readline())
segs = [[0,L]]
cars = {}
for x in range(n):
r,ln = [int(x) for x in stdin.readline().split()]
if r == 1:
#print(segs)
#print('length... | output | 1 | 36,481 | 1 | 72,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nowadays it is becoming increasingly difficult to park a car in cities successfully. Let's imagine a segment of a street as long as L meters along which a parking lot is located. Drivers should park their cars strictly parallel to the paveme... | instruction | 0 | 36,482 | 1 | 72,964 |
Tags: data structures, implementation
Correct Solution:
```
l, b, f = map(int, input().split())
p = [[-b, -b, -192], [l + f, l + f, -38]]
n = int(input())
for i in range(1, n + 1):
a, h = map(int, input().split())
if a == 1:
k = False
for w in range(len(p) - 1):
if p[w + 1][0] - p[w]... | output | 1 | 36,482 | 1 | 72,965 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.