message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim has opened his own restaurant! The restaurant has got a huge table, the table's length is p meters.
Maxim has got a dinner party tonight, n guests will come to him. Let's index the guests... | instruction | 0 | 74,472 | 14 | 148,944 |
No | output | 1 | 74,472 | 14 | 148,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim has opened his own restaurant! The restaurant has got a huge table, the table's length is p meters.
Maxim has got a dinner party tonight, n guests will come to him. Let's index the guests... | instruction | 0 | 74,473 | 14 | 148,946 |
No | output | 1 | 74,473 | 14 | 148,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim has opened his own restaurant! The restaurant has got a huge table, the table's length is p meters.
Maxim has got a dinner party tonight, n guests will come to him. Let's index the guests... | instruction | 0 | 74,474 | 14 | 148,948 |
No | output | 1 | 74,474 | 14 | 148,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim has opened his own restaurant! The restaurant has got a huge table, the table's length is p meters.
Maxim has got a dinner party tonight, n guests will come to him. Let's index the guests... | instruction | 0 | 74,475 | 14 | 148,950 |
No | output | 1 | 74,475 | 14 | 148,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,509 | 14 | 149,018 |
Tags: greedy, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
import math
from decimal import *
from collections import defaultdict
getcontext().prec = 25
MOD = pow(10, 9) + 7
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = f... | output | 1 | 74,509 | 14 | 149,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,510 | 14 | 149,020 |
Tags: greedy, sortings
Correct Solution:
```
n, v = map(int, input().split())
temp = {1: [], 2: []}
s = {1: [0], 2: [0]}
for i in range(n):
x, y = map(int, input().split())
temp[x].append([y, i+1])
temp[1].sort(reverse=True)
temp[2].sort(reverse=True)
# print(temp[1])
# print(temp[2])
for i in range(min(v, len... | output | 1 | 74,510 | 14 | 149,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,511 | 14 | 149,022 |
Tags: greedy, sortings
Correct Solution:
```
n, v = map(int, input().split())
boat_list = []
for _ in range(n):
t, p = map(int, input().split())
boat_list.append([t, p])
boat1 = []
boat2 = []
for i in range(n):
if boat_list[i][0] == 1:
boat1.append([boat_list[i][1], i + 1])
else:
boat2.... | output | 1 | 74,511 | 14 | 149,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,512 | 14 | 149,024 |
Tags: greedy, sortings
Correct Solution:
```
import math as mt
import sys,string,bisect
input=sys.stdin.readline
from collections import deque
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
n,v=M()
k=[]
c=[]
for i in range(n):
... | output | 1 | 74,512 | 14 | 149,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,513 | 14 | 149,026 |
Tags: greedy, sortings
Correct Solution:
```
n, v = map(int, input().split())
boat = []
for i in range(n):
boat.append(list(map(int, input().split())))
boat[i].append(i + 1)
boat1 = [b for b in boat if b[0] == 1]
boat2 = [b for b in boat if b[0] == 2]
boat1.sort(key=lambda x: x[1], reverse=True)
boat2.sort(key=... | output | 1 | 74,513 | 14 | 149,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,514 | 14 | 149,028 |
Tags: greedy, sortings
Correct Solution:
```
from operator import itemgetter
if __name__ == "__main__":
n, v = map(int, input().split(" "))
vehicles = {1:[], 2:[]}
for i in range(n):
vtype, vcarry = map(int, input().split(" "))
vehicles[vtype].append((str(i+1), vcarry))
vehicles[1] = sorted... | output | 1 | 74,514 | 14 | 149,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,515 | 14 | 149,030 |
Tags: greedy, sortings
Correct Solution:
```
#3B - Lorry
# n - the number of waterborne vehicles in the boat depot
# v - the truck body volume of the lorry in cubic metres
n,v = map(int,input().split())
# l1 - list of kayaks
# l2 - list of catamarans
l1 = []
l2 = []
for i in range(n):
# t - vehicle type
# x - ... | output | 1 | 74,515 | 14 | 149,031 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the sp... | instruction | 0 | 74,516 | 14 | 149,032 |
Tags: greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
def main():
n, v = map(int, input().split())
kayak = list()
k_add = kayak.append
catamaran = list()
c_add = catamaran.append
for i in range(1, n + 1):
t, p = map(int, input().split())
pn = p, i
if t ==... | output | 1 | 74,516 | 14 | 149,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,642 | 14 | 149,284 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
n, m, k = map(int, input().split())
socks = list(map(int, input().split()))
adj = [[] for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
adj[a].append(b)
adj[b].append(a)
component = [None] * n
cur_co... | output | 1 | 74,642 | 14 | 149,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,643 | 14 | 149,286 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
import sys
n, m, k = [int(x) for x in sys.stdin.readline().replace('\n', '').split(' ')]
c = [int(x) for x in sys.stdin.readline().replace('\n', '').split(' ')]
# print ((n,m,k))
# Graphs with python
socks = [[] for _ in range(n)]
# populate a Graph
for ... | output | 1 | 74,643 | 14 | 149,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,644 | 14 | 149,288 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
def dfs(v, visited, edges, colors):
st = [v]
visited.add(v)
comp = []
cols = dict()
while st:
ver = st.pop()
comp.append(colors[ver])
if ver in edges:
for i in edges[ver]:
if i not in... | output | 1 | 74,644 | 14 | 149,289 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,645 | 14 | 149,290 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
def find(node):
while p[node] != node:
p[node] = p[p[node]]
node = p[node]
return node
def union(n1,n2):
p1 = find(n1)
p2 = find(n2)
if p1 != p2: p[p1] = p2
n,m,k = map(int,input().split())
socks = list(map(int,inpu... | output | 1 | 74,645 | 14 | 149,291 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,646 | 14 | 149,292 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
n, m, k = map(int, input().split())
c = [int(x) - 1 for x in input().split()]
adj = [[] for _ in range(n)]
for _ in range(m):
l, r = map(int, input().split())
adj[l - 1].append(r - 1)
adj[r - 1].append(l - 1)
vis = [0] * n
ans = 0
for i in ... | output | 1 | 74,646 | 14 | 149,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,647 | 14 | 149,294 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
from collections import Counter, defaultdict
class DSU:
def __init__(self, n):
self.parents = [i for i in range(n)]
self.rank = [0 for i in range(n)]
def find_parent(self, a):
if a == self.parents[a]:
return a
else:
b = self.find_parent(... | output | 1 | 74,647 | 14 | 149,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,648 | 14 | 149,296 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
from collections import deque, defaultdict
def BFS(graph, source, visited, colours):
# Generator which yields all vertices connected to source (includes source)
colour_counts = defaultdict(int)
max_count = 0
total = 0
n = len(graph)
... | output | 1 | 74,648 | 14 | 149,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.
Ten minutes before her leave she reali... | instruction | 0 | 74,649 | 14 | 149,298 |
Tags: dfs and similar, dsu, graphs, greedy
Correct Solution:
```
from collections import defaultdict
from sys import stdin
input=stdin.readline
class Unionfind:
def __init__(self, n):
self.par = [-1]*n
self.rank = [1]*n
def root(self, x):
p = x
while not self.par[p]... | output | 1 | 74,649 | 14 | 149,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,094 | 14 | 150,188 |
Tags: binary search, data structures, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
n=int(input())
A=list(map(int,input().split()))
B=[(-a,i) for i,a in enumerate(A)]
from collections import deque
LIST=deque()
LIST.append(B[0])
for b,i in B[1:]:
if b>LIST[-1][0]:
LIST.appen... | output | 1 | 75,094 | 14 | 150,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,095 | 14 | 150,190 |
Tags: binary search, data structures, implementation
Correct Solution:
```
#TO MAKE THE PROGRAM FAST
''' ---------------------------------------------------------------------------------------------------- '''
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
from collections import *
''' ----------... | output | 1 | 75,095 | 14 | 150,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,096 | 14 | 150,192 |
Tags: binary search, data structures, implementation
Correct Solution:
```
import sys
readline = sys.stdin.readline
class Segtree:
def __init__(self, A, intv, initialize = True, segf = max):
self.N = len(A)
self.N0 = 2**(self.N-1).bit_length()
self.intv = intv
self.segf = segf
... | output | 1 | 75,096 | 14 | 150,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,097 | 14 | 150,194 |
Tags: binary search, data structures, implementation
Correct Solution:
```
class SortedList:
def __init__(self, iterable=[], _load=200):
"""Initialize sorted list instance."""
values = sorted(iterable)
self._len = _len = len(values)
self._load = _load
self._lists = _lists = [... | output | 1 | 75,097 | 14 | 150,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,098 | 14 | 150,196 |
Tags: binary search, data structures, implementation
Correct Solution:
```
class SortedList:
def __init__(self, iterable=[], _load=200):
"""Initialize sorted list instance."""
values = sorted(iterable)
self._len = _len = len(values)
self._load = _load
self._lists = _lists = [... | output | 1 | 75,098 | 14 | 150,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,099 | 14 | 150,198 |
Tags: binary search, data structures, implementation
Correct Solution:
```
import heapq
def main():
n=int(input())
a=readIntArr()
a=a+a+a
maxHeap=[] # store [value,index]
stoppingTrack=[inf]*(3*n) # 0-indexing
for i in range(3*n):
searchVal=2*a[i]+1
# all items with val... | output | 1 | 75,099 | 14 | 150,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,100 | 14 | 150,200 |
Tags: binary search, data structures, implementation
Correct Solution:
```
#TO MAKE THE PROGRAM FAST
''' ---------------------------------------------------------------------------------------------------- '''
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
from collections import deque
''' ------... | output | 1 | 75,100 | 14 | 150,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic: whenever track i finishes playing, track i+1 s... | instruction | 0 | 75,101 | 14 | 150,202 |
Tags: binary search, data structures, implementation
Correct Solution:
```
q = []
a = []
lnt = []
n = int(input())
a = map(int, input().split())
mx = 0
a = list(a)
for i in range(0, n):
if a[i] > a[mx]: mx = i
lnt.append(0)
def find_length(pos):
for i in range(0, n):
if a[(pos + i) % n] < (a[pos] ... | output | 1 | 75,101 | 14 | 150,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,102 | 14 | 150,204 |
Yes | output | 1 | 75,102 | 14 | 150,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,103 | 14 | 150,206 |
Yes | output | 1 | 75,103 | 14 | 150,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,104 | 14 | 150,208 |
Yes | output | 1 | 75,104 | 14 | 150,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,105 | 14 | 150,210 |
Yes | output | 1 | 75,105 | 14 | 150,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,106 | 14 | 150,212 |
No | output | 1 | 75,106 | 14 | 150,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,107 | 14 | 150,214 |
No | output | 1 | 75,107 | 14 | 150,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,108 | 14 | 150,216 |
No | output | 1 | 75,108 | 14 | 150,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The playlist is automatic and cyclic:... | instruction | 0 | 75,109 | 14 | 150,218 |
No | output | 1 | 75,109 | 14 | 150,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,126 | 14 | 150,252 |
Tags: data structures, implementation
Correct Solution:
```
import sys
lines = sys.stdin.readlines()
T = int(lines[0].strip())
for t in range(T):
#temp += 1
[n, m] = list(map(lambda x: int(x), lines[3 * t + 1].strip().split(" ")))
stack = list(map(lambda x: int(x), lines[3 * t + 2].strip().split(" ")))
... | output | 1 | 75,126 | 14 | 150,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,127 | 14 | 150,254 |
Tags: data structures, implementation
Correct Solution:
```
def GetList(): return list(map(int, input().split()))
def floor(n):
if int(n)-n ==0:
n = int(n)
else:
n = int(n)-1
return n
def main():
t = int(input())
for num in range(t):
n,m = map(int, input().split())
... | output | 1 | 75,127 | 14 | 150,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,128 | 14 | 150,256 |
Tags: data structures, implementation
Correct Solution:
```
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
... | output | 1 | 75,128 | 14 | 150,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,129 | 14 | 150,258 |
Tags: data structures, implementation
Correct Solution:
```
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
DA = {}
for i, a in enumerate(A):
DA[a] = i
cur = -1
cnt = 0
ans = 0
for b ... | output | 1 | 75,129 | 14 | 150,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,130 | 14 | 150,260 |
Tags: data structures, implementation
Correct Solution:
```
for t in range(int(input())):
n, m = map(int, input().split())
a = [x - 1 for x in list(map(int, input().split()))]
b = [x - 1 for x in list(map(int, input().split()))]
pos = a[:]
for i in range(n):
pos[a[i]] = i
lst = -1
res = m
for i in range(m):... | output | 1 | 75,130 | 14 | 150,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,131 | 14 | 150,262 |
Tags: data structures, implementation
Correct Solution:
```
t = int(input())
while(t>0):
d = {}
n,m = [int(i) for i in input().split()]
arr = [int(i) for i in input().split()]
arr1 = [int(i) for i in input().split()]
for i in range(n):
d[arr[i]]=i
summ = 0
end = 0
for i in range(... | output | 1 | 75,131 | 14 | 150,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,132 | 14 | 150,264 |
Tags: data structures, implementation
Correct Solution:
```
t = int(input())
for i in range(t):
n, m = map(int, input().split())
gifts = list(map(int, input().split()))
arr = list(map(int, input().split()))
gifts_set = set()
ans = 0
k = 0
for j in range(m):
if arr[j] not in gifts_set... | output | 1 | 75,132 | 14 | 150,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,133 | 14 | 150,266 |
Tags: data structures, implementation
Correct Solution:
```
n=int(input())
for x in range(n):
a,b=list(map(int,input().split()))
array=list(map(int,input().split()))
dic={}
index=1
for it in array:
dic[it]=index
index+=1
count=0
current=0
answer=0
arr=list(map(int,inp... | output | 1 | 75,133 | 14 | 150,267 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has number a_n. All numbers are distinct.
Santa has... | instruction | 0 | 75,134 | 14 | 150,268 |
Tags: data structures, implementation
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
pr=stdout.write
raw_input = stdin.readline
def ni():
return int(raw_input())
def li():
return list(map(int,raw_input().split()))
def pn(n):
stdout.write(str(n)+'\n')
... | output | 1 | 75,134 | 14 | 150,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has n... | instruction | 0 | 75,135 | 14 | 150,270 |
Yes | output | 1 | 75,135 | 14 | 150,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has n... | instruction | 0 | 75,136 | 14 | 150,272 |
Yes | output | 1 | 75,136 | 14 | 150,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has n... | instruction | 0 | 75,137 | 14 | 150,274 |
Yes | output | 1 | 75,137 | 14 | 150,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has n... | instruction | 0 | 75,138 | 14 | 150,276 |
Yes | output | 1 | 75,138 | 14 | 150,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Santa has to send presents to the kids. He has a large stack of n presents, numbered from 1 to n; the topmost present has number a_1, the next present is a_2, and so on; the bottom present has n... | instruction | 0 | 75,139 | 14 | 150,278 |
No | output | 1 | 75,139 | 14 | 150,279 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.