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.
You are the planning manager of an animation production company. What animation production companies produce these days is not limited to animation itself. Related products, such as figures of c... | instruction | 0 | 80,768 | 14 | 161,536 |
No | output | 1 | 80,768 | 14 | 161,537 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Hiasat registered a new account in NeckoForces and when his friends found out about that, each one of them asked to use his name as Hiasat's handle.
Luckily for Hiasat, he can change his handle in some points in time. Also he knows the exac... | instruction | 0 | 80,847 | 14 | 161,694 |
Tags: bitmasks, brute force, dp, meet-in-the-middle
Correct Solution:
```
import time
n, m =map(int, input().split())
names={None:0}
count={i:0 for i in range(1, m+1)}
a=[0]*(n+1)
for i in range(n):
l=list(input().split())
if l[0]=='2':
if l[1] not in names:
names[l[1]]=len(names)
... | output | 1 | 80,847 | 14 | 161,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Hiasat registered a new account in NeckoForces and when his friends found out about that, each one of them asked to use his name as Hiasat's handle.
Luckily for Hiasat, he can change his handle in some points in time. Also he knows the exac... | instruction | 0 | 80,848 | 14 | 161,696 |
Tags: bitmasks, brute force, dp, meet-in-the-middle
Correct Solution:
```
import time
def find_max_clique(remain, size, max_, index, maxs):
# print(remain, size, max_)
result = max_
if size + len(remain) <= result:
# print('pruning (1)...')
return result
if not remain:
# print('... | output | 1 | 80,848 | 14 | 161,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hiasat registered a new account in NeckoForces and when his friends found out about that, each one of them asked to use his name as Hiasat's handle.
Luckily for Hiasat, he can change his handle... | instruction | 0 | 80,849 | 14 | 161,698 |
No | output | 1 | 80,849 | 14 | 161,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hiasat registered a new account in NeckoForces and when his friends found out about that, each one of them asked to use his name as Hiasat's handle.
Luckily for Hiasat, he can change his handle... | instruction | 0 | 80,850 | 14 | 161,700 |
No | output | 1 | 80,850 | 14 | 161,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hiasat registered a new account in NeckoForces and when his friends found out about that, each one of them asked to use his name as Hiasat's handle.
Luckily for Hiasat, he can change his handle... | instruction | 0 | 80,851 | 14 | 161,702 |
No | output | 1 | 80,851 | 14 | 161,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hiasat registered a new account in NeckoForces and when his friends found out about that, each one of them asked to use his name as Hiasat's handle.
Luckily for Hiasat, he can change his handle... | instruction | 0 | 80,852 | 14 | 161,704 |
No | output | 1 | 80,852 | 14 | 161,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,959 | 14 | 161,918 |
Tags: implementation, math
Correct Solution:
```
import sys
f = sys.stdin
#f = open("input.txt", "r")
f. readline()
t = [int(i) for i in f.readline().strip().split()]
times = dict().fromkeys(t)
for i in times:
times[i] = t.count(i)
count = 0
for i in times.keys():
if i!=0 and -1*i in times.keys():
count... | output | 1 | 80,959 | 14 | 161,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,960 | 14 | 161,920 |
Tags: implementation, math
Correct Solution:
```
d = {}
for i in range(-10,11):
d[i] = 0
n = input()
n = int(n)
t = input()
t = t.split()
for x in t:
d[int(x)]+=1
sum = 0
#for i in d:
# print(str(i)+" "+str(d[i]))
x = -10
while x<0:
sum += (d[x]*d[-x])
x = x+1
if d[0]>1:
sum += d[0]*(d[0]-1)/2
print(int(sum))
`... | output | 1 | 80,960 | 14 | 161,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,961 | 14 | 161,922 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
clientlist = list(map(int, input().split()))
num_of_pairs = 0
set_of_numbers = dict()
for i in clientlist:
set_of_numbers[i] = set_of_numbers.get(i, 0) + 1
if 0 in set_of_numbers.keys():
if set_of_numbers[0] > 1:
num_of_pairs += ((set_of_... | output | 1 | 80,961 | 14 | 161,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,962 | 14 | 161,924 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
arr = list(map(int,input().split()))
cnt_zero = 0
pos = [0] * 11
neg = [0] * 11
for i in range(n):
if arr[i] > 0: pos[arr[i]] += 1
elif arr[i] < 0: neg[abs(arr[i])] += 1
else: cnt_zero += 1
ans = 0
for i in range(1,cnt_zero):
ans += i
f... | output | 1 | 80,962 | 14 | 161,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,963 | 14 | 161,926 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
pos = [0]*20 ; neg = [0]*20 ; zero = 0
x = [int(e) for e in input().split()]
for v in x:
if(v > 0):
pos[v]+=1
elif(v < 0):
neg[-v]+=1
else:
zero+=1
ans = 0
for v in range(1,11):
ans += pos[v] * neg[v]
ans += (zero ... | output | 1 | 80,963 | 14 | 161,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,964 | 14 | 161,928 |
Tags: implementation, math
Correct Solution:
```
from collections import defaultdict
n=int(input())
a=list(map(int,input().split()))
d=defaultdict(int)
for i in a:
d[i]+=1
ans=0
z = [i for i in d.keys()]
for i in z:
if(i==0):
ans+=(d[i]*(d[i]-1))
else:
ans+=(d[i]*d[-i])
print(ans//2)
``` | output | 1 | 80,964 | 14 | 161,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,965 | 14 | 161,930 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
t = list(map(int, input().split()))
p = {}
for i in t:
p[i] = p.get(i, 0) + 1
print(sum(p[i] * p.get(-i, 0) for i in p if i > 0) + (p.get(0, 0) * (p.get(0, 0) - 1)) // 2)
``` | output | 1 | 80,965 | 14 | 161,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his interests and assigned to the i-th client number ti... | instruction | 0 | 80,966 | 14 | 161,932 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
t = [int(i) for i in input().split()]
pairs = 0
used = []
for i in set(t):
if used.count(-i) == 0:
if i == 0:
pairs += sum(range(1, t.count(i)))
else:
pairs += t.count(-i) * t.count(i)
used.append(i)
prin... | output | 1 | 80,966 | 14 | 161,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,967 | 14 | 161,934 |
Yes | output | 1 | 80,967 | 14 | 161,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,968 | 14 | 161,936 |
Yes | output | 1 | 80,968 | 14 | 161,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,969 | 14 | 161,938 |
Yes | output | 1 | 80,969 | 14 | 161,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,970 | 14 | 161,940 |
Yes | output | 1 | 80,970 | 14 | 161,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,971 | 14 | 161,942 |
No | output | 1 | 80,971 | 14 | 161,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,972 | 14 | 161,944 |
No | output | 1 | 80,972 | 14 | 161,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,973 | 14 | 161,946 |
No | output | 1 | 80,973 | 14 | 161,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that opposites attract. That is the key principle of the "Perfect Matching" dating agency. The "Perfect Matching" matchmakers have classified each registered customer by his inte... | instruction | 0 | 80,974 | 14 | 161,948 |
No | output | 1 | 80,974 | 14 | 161,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Overall there are m actors in Berland. Each actor has a personal identifier β an integer from 1 to m (distinct actors have distinct identifiers). Vasya likes to watch Berland movies with Berland actors, and he has k favorite actors. He watch... | instruction | 0 | 81,081 | 14 | 162,162 |
Tags: implementation
Correct Solution:
```
import sys
try:
sys.stdin = open('input.txt')
sys.stdout = open('output.txt', 'w')
except:
pass
def compl(n, s):
return set(filter(lambda x: x not in s, range(1, n + 1)))
m, k = list(map(int, input().split()))
id = list(map(int, input().split()... | output | 1 | 81,081 | 14 | 162,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Overall there are m actors in Berland. Each actor has a personal identifier β an integer from 1 to m (distinct actors have distinct identifiers). Vasya likes to watch Berland movies with Berland... | instruction | 0 | 81,082 | 14 | 162,164 |
No | output | 1 | 81,082 | 14 | 162,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Overall there are m actors in Berland. Each actor has a personal identifier β an integer from 1 to m (distinct actors have distinct identifiers). Vasya likes to watch Berland movies with Berland... | instruction | 0 | 81,083 | 14 | 162,166 |
No | output | 1 | 81,083 | 14 | 162,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Overall there are m actors in Berland. Each actor has a personal identifier β an integer from 1 to m (distinct actors have distinct identifiers). Vasya likes to watch Berland movies with Berland... | instruction | 0 | 81,084 | 14 | 162,168 |
No | output | 1 | 81,084 | 14 | 162,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Overall there are m actors in Berland. Each actor has a personal identifier β an integer from 1 to m (distinct actors have distinct identifiers). Vasya likes to watch Berland movies with Berland... | instruction | 0 | 81,085 | 14 | 162,170 |
No | output | 1 | 81,085 | 14 | 162,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 β€ pi β€ n).
Little penguin Polo loves ... | instruction | 0 | 81,092 | 14 | 162,184 |
Tags: combinatorics
Correct Solution:
```
def g(n2, l):
if n2==0: return c(l)
n3 = 0
for i in range(m):
if i==m-n2: continue
n3 += g(n2-1, l+[i])
return n3%mod
def c(l):
v = [10,0,0,0,0,0,0,0]
for i in range(1,len(l)):
if v[i]: continue
n2 = i
while True:
v[n2] = i
n2 = l[n2]
if v[n2]==i: retu... | output | 1 | 81,092 | 14 | 162,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 β€ pi β€ n).
Little penguin Polo loves ... | instruction | 0 | 81,095 | 14 | 162,190 |
Tags: combinatorics
Correct Solution:
```
n, k = map(int, input().split())
mod = 1000000007
print((pow(k, k-1, mod) * pow(n-k, n-k, mod)) % mod)
``` | output | 1 | 81,095 | 14 | 162,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 β€ pi β€ n).
Little penguin Polo loves ... | instruction | 0 | 81,098 | 14 | 162,196 |
Tags: combinatorics
Correct Solution:
```
n, k = map(int, input().split())
d = 1000000007
def f(a, b):
if b == 0: return 1
s, c = 0, b * a
for i in range(1, b + 1):
s += c * f(i, b - i)
c = (a * c * (b - i)) // (i + 1)
return s
print((k * f(1, k - 1) * pow(n - k, n - k, d)) % d)
``` | output | 1 | 81,098 | 14 | 162,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 β€ pi β€ n).
Little penguin Polo loves ... | instruction | 0 | 81,099 | 14 | 162,198 |
Tags: combinatorics
Correct Solution:
```
MOD = 10 ** 9 + 7
n, k = map(int, input().split())
ans = pow(n - k, n - k, MOD) * pow(k, k - 1, MOD)
print(ans % MOD)
``` | output | 1 | 81,099 | 14 | 162,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,129 | 14 | 162,258 |
Tags: data structures, greedy
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
x=l.count(0)
y=l.count(1)
if x>=y:
a=[]
k=0
for i in range(n-1,-1,-1):
if l[i]==1:
a.append(k)
else:
k+=1
else:
a=[]
k=0
for i in range(n):
if l[i]=... | output | 1 | 81,129 | 14 | 162,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,130 | 14 | 162,260 |
Tags: data structures, greedy
Correct Solution:
```
# Made By Mostafa_Khaled
bot = True
n = int(input())
s = k = 0
for i in input()[::2]:
if i == '1':
k += 1
else:
s += k
print(s)
# Made By Mostafa_Khaled
``` | output | 1 | 81,130 | 14 | 162,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,131 | 14 | 162,262 |
Tags: data structures, greedy
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
zero_count = [0] * n
zero_count[n - 1] = int(arr[n - 1] == 0)
for i in reversed(range(n - 1)):
zero_count[i] = zero_count[i + 1] + int(arr[i] == 0)
res = 0
for i in range(n - 1):
if arr[i] == 1:
... | output | 1 | 81,131 | 14 | 162,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,132 | 14 | 162,264 |
Tags: data structures, greedy
Correct Solution:
```
n = int(input())
array = list(map(int, input().split()))
cnt = 0
s = [0 for i in range(n)]
s[n - 1] = 1 * (array[n - 1] == 0)
for i in range(n - 2, -1, -1):
s[i] = s[i + 1] + 1 * (array[i] == 0)
for i in range(n):
cnt += s[i] * (array[i] == 1)
print(cnt)
``` | output | 1 | 81,132 | 14 | 162,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,133 | 14 | 162,266 |
Tags: data structures, greedy
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b=[0,0]
ans=0
for i in range(n):
b[a[i]]+=1
if a[i]==0: ans+=b[1]
print(ans)
``` | output | 1 | 81,133 | 14 | 162,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,134 | 14 | 162,268 |
Tags: data structures, greedy
Correct Solution:
```
#n,k=map(int, input().split())
n=int(input())
arr=list(map(int,input().split()))
cnt=[0]*n
cnt[0]=arr[0]
for i in range(1,n):
cnt[i]=cnt[i-1]+arr[i]
ans=0
for i in range(n):
if arr[i]==0:
ans+=cnt[i]
print(ans)
``` | output | 1 | 81,134 | 14 | 162,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,135 | 14 | 162,270 |
Tags: data structures, greedy
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b=0
c=0
d=0
e=0
for i in range(n):
b+=a[i]
c+=b*(1-a[i])
for i in range(n-1,-1,-1):
d+=1-a[i]
e+=d*a[i]
print(min(c,e))
``` | output | 1 | 81,135 | 14 | 162,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the c... | instruction | 0 | 81,136 | 14 | 162,272 |
Tags: data structures, greedy
Correct Solution:
```
n = input()
a = [int(x) for x in input().split()]
ans=sum=0
for i in a:
if i==1:
sum+=1
else:
ans+=sum
print(ans)
``` | output | 1 | 81,136 | 14 | 162,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,202 | 14 | 162,404 |
Tags: *special, data structures, implementation
Correct Solution:
```
import heapq
n, k = map(int, input().split())
pq = [0] * k
res = [None] * n
for i in range(n):
s, m = map(int, input().split())
time = max(pq[0], s) + m
heapq.heapreplace(pq, time)
res[i] = time
print("\n".join(map(str, res)))
``` | output | 1 | 81,202 | 14 | 162,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,203 | 14 | 162,406 |
Tags: *special, data structures, implementation
Correct Solution:
```
import heapq
from sys import stdin, stdout
def __main__(n, k):
servers = [0] * k
times = []
for i in range(n):
s, m = list(map(int, stdin.readline().split()))
time = max(servers[0], s)
heapq.heapreplace(servers,... | output | 1 | 81,203 | 14 | 162,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,204 | 14 | 162,408 |
Tags: *special, data structures, implementation
Correct Solution:
```
import atexit
import io
import sys
_INPUT_LINES = sys.stdin.read().splitlines()
input = iter(_INPUT_LINES).__next__
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUFFER
@atexit.register
def write():
sys.__stdout__.write(_OUTPUT_BUFFER.ge... | output | 1 | 81,204 | 14 | 162,409 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,205 | 14 | 162,410 |
Tags: *special, data structures, implementation
Correct Solution:
```
import heapq
def __main__(n, k):
servers = [0] * k
times = []
for i in range(n):
s, m = list(map(int, input().split()))
time = max(servers[0], s)
heapq.heapreplace(servers, time + m)
times.append(time + ... | output | 1 | 81,205 | 14 | 162,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,206 | 14 | 162,412 |
Tags: *special, data structures, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
rInt = lambda: int(input())
mInt = lambda: map(int, input().split())
rList = lambda: list(map(int, input().split()))
n, k = mInt()
inp = []
for i in range(n):
inp.append(rList())
avail = k
from heapq impor... | output | 1 | 81,206 | 14 | 162,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,207 | 14 | 162,414 |
Tags: *special, data structures, implementation
Correct Solution:
```
# tested by Hightail - https://github.com/dj3500/hightail
from __future__ import print_function
from heapq import heappop, heappush
from sys import stdin, stdout
read, read_array = stdin.readline, lambda: stdin.readline().split()
write = lambda *a... | output | 1 | 81,207 | 14 | 162,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,208 | 14 | 162,416 |
Tags: *special, data structures, implementation
Correct Solution:
```
import heapq
f = lambda: map(int, input().split())
n, k = f()
p = [0] * k
q = [0] * n
for i in range(n):
s, m = f()
q[i] = max(p[0], s) + m
heapq.heapreplace(p, q[i])
print('\n'.join(map(str, q)))
``` | output | 1 | 81,208 | 14 | 162,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the ... | instruction | 0 | 81,209 | 14 | 162,418 |
Tags: *special, data structures, implementation
Correct Solution:
```
import heapq
from sys import stdin, stdout
def __main__(n, k):
servers = [0] * k
times = []
for i in range(n):
s, m = [int(x) for x in stdin.readline().split()]
time = max(servers[0], s)
heapq.heapreplace(server... | output | 1 | 81,209 | 14 | 162,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the serve... | instruction | 0 | 81,210 | 14 | 162,420 |
Yes | output | 1 | 81,210 | 14 | 162,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the serve... | instruction | 0 | 81,211 | 14 | 162,422 |
Yes | output | 1 | 81,211 | 14 | 162,423 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.