solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
const int factor_N = 10000005;
using namespace std;
int read() {
char c = getchar();
int x = 0, f = 1;
for (; !isdigit(c); c = getchar())
if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = x * 10 + c - 48;
return x * f;
}
struct Node {
int t, a, b;
};
const int N = 2e5 ... | 11 | CPP |
import time,math,bisect,sys
from sys import stdin,stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi=3.14159265358979323846264338327950
def II(): # to take integer input
return int(stdin.readline())
def IO(): # to take string in... | 11 | PYTHON3 |
def cta(t,p,r):
global ana,iva,an
ana[iva[t][p][1]]^=True
an+=iva[t][p][0]*r
n,k=[int(x) for x in input().split()]
iva=[[] for _ in range(4)]
js=[() for _ in range(n)]
for i in range(n):
v,o,u=[int(x) for x in input().split()]
q=(o<<1)|u
iva[q].append((v,i))
js[i]=(v,q)
for e in iva :
e.sort()
ct,a,r,ps,an = ... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int a, b, t;
int index;
node() {}
node(int _a, int _b, int _t, int _index) {
a = _a;
b = _b;
t = _t;
index = _index;
}
bool operator<(const struct node &nd) const { return t < nd.t; }
bool operator>(const struct node &nd) const { ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long int> a, b, c;
for (int i = 0; i < n; i++) {
int t, x, y;
cin >> t >> x >> y;
if (x && y)
c.push_back(t);
else if (x && !y)
a.push_back(t);
else if (!x && y)
b.push_bac... | 11 | CPP |
n, k = map(int, input().split())
times = [[], [], [], []]
for i in range(n):
t, a, b = map(int, input().split())
times[a * 2 + b].append(t)
for i in range(1, 4):
times[i].sort()
sums = []
for i in range(len(times)):
sums.append([])
for j in range(len(times[i])):
if j == 0:
sums[i... | 11 | PYTHON3 |
n,k=list(map(int,input().split()))
l,l1,l2=[],[],[]
for _ in range(n):
x,y,z=list(map(int,input().split()))
if y==1 and z==1:
l.append(x)
elif y==1:
l1.append([x,y,z])
elif z==1:
l2.append([x,y,z])
l1.sort()
l2.sort()
for i in range(min(k,len(l1),len(l2))):
a=l1[i][0]
b=... | 11 | PYTHON3 |
n,k=map(int,input().split(" "))
both=[]
bob=[]
alice=[]
for i in range(n):
t,a,b=map(int,input().split(" "))
if a==1 and b==1:
both.append(t)
elif a==1:
alice.append(t)
elif b==1:
bob.append(t)
if len(both)!=0:
both.sort()
if len(alice)!=0:
alice.sort()
if len(bob)... | 11 | PYTHON3 |
from sys import maxsize
n, k = map(int, input().split())
l = [[0], [0], [0], [0]]
x = []
ans = maxsize
for i in range(n):
x.append(list(map(int, input().split())))
x.sort()
for p in x:
temp = l[p[1]*2 + p[2]][-1]
l[p[1]*2 + p[2]].append(temp + p[0])
for i in range(min(k + 1, len(l[3]))):
if k - i < len(... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void quick_sort(int a[], int left, int right) {
int l = left, r = right, m = a[rand() % (r - l) + l];
while (l < r) {
while (a[l] < m) l++;
while (a[r] > m) r--;
if (l <= r) {
int t = a[l];
a[l] = a[r];
a[r] = t;
l++;
r--;
}... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n, k;
cin >> n >> k;
vector<long long> alice;
vector<long long> bob;
vector<long long> combined;
long long atotal = 0, btotal = 0;
for (long long i = 0; i < n; ++i) {
lo... | 11 | CPP |
n,k = map(int,input().split())
U = [];A = [];B = []
for i in range(n):
a,b,c = map(int,input().split())
if(b==1 and c==1):
U.append(a)
elif(b==1 and c==0):
A.append(a)
elif(b==0 and c==1):
B.append(a)
A.sort();B.sort();U.sort()
for i in range(1,len(U)):
U[i]+=U[i-1]
for i in ... | 11 | PYTHON3 |
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k = map(int,input().split())
bookA = []
bookB = []
bookAB = []
for _ in range(n):
t,a,b = map(int,input().split())
if a == 1 and b == 1:
bookAB.append(t)
elif a == 1:
bookA.append(t)
elif b == 1:
bookB.appe... | 11 | PYTHON3 |
import sys
# from collections import defaultdict
# t=1
# t=int(input())
def fun(x):
# print(x)
return x[0]
n,k=list(map(int,sys.stdin.readline().strip().split()))
xx=[]
a=[]
b=[]
c=[]
for i in range(n):
# n=int(input())
x=list(map(int,sys.stdin.readline().strip().split()))
# a,b,c,d=list(sys.std... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 99;
int n, k, m, x, y, p0, p1, p2, b0, b1, b2, b3, a[N];
vector<pair<long long, int> > v0, v1, v2, v3;
long long ans = 1e18, sum;
void calc(int x) {
if (p0 < v0.size() - 1) p0++, sum += v0[p0].first;
if (p0 < v0.size() - 1) p0++, sum += v0[p0].first;... | 11 | CPP |
import collections as cc
import math as mt
import sys
input=sys.stdin.readline
I=lambda:list(map(int,input().split()))
n,k=I()
a=[]
for i in range(n):
a.append(I())
a.sort()
both=[]
bs=0
f=0
for i in range(n):
if a[i][1] and a[i][2]:
both.append(a[i][0])
al=[]
bo=[]
for i in range(n):
if a[i][1] and not a[i][2]:... | 11 | PYTHON3 |
#include <bits/stdc++.h>
const long long maxn = 2e5 + 1;
using namespace std;
struct triple {
long long t, ci;
bool a = 0, b = 0;
triple() {}
};
bool cmp(triple x, triple y) { return x.t < y.t; }
triple v[maxn];
bool usd[maxn];
long long ci = -1;
long long cs = 0;
inline void add() {
++ci;
for (; usd[ci]; ci+... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
template <typename T>
void read(T &x) {
int f = 1;
x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = x * 10 + s - '0';
s = getchar();
}
... | 11 | CPP |
from sys import stdin
input = lambda: stdin.readline().rstrip("\r\n")
from collections import defaultdict as vector
from collections import deque as que
inin = lambda: int(input())
inar = lambda: list(map(int,input().split()))
from heapq import heappush as hpush,heappop as hpop
bob=[]
alice=[]
both=[]
n,k=inar()
for ... | 11 | PYTHON3 |
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
... | 11 | PYTHON3 |
import sys
import math
import heapq
from collections import defaultdict, deque
input = sys.stdin.readline
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
n,k=rm()
a=[];b=[];both=[]
for _ in range(n):
t,ai,bi=rm()
if ai==1 and bi... | 11 | PYTHON3 |
""" 616C """
""" 1152B """
# import math
# import sys
def main():
# n ,m= map(int,input().split())
# arr = list(map(int,input().split()))
# b = list(map(int,input().split()))
# n = int(input())
# string = str(input())
n ,k= map(int,input().split())
a = []
b = []
c = []
for _ in range(n):
t,first,second = ma... | 11 | PYTHON3 |
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
import math
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline
M = mod = 998244353
def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in ... | 11 | PYTHON3 |
t,k = map(int,input().split())
arra = []
arrb = []
arrc =[]
ans =0
for i in range(t):
a,b,c =map(int,input().split())
if b==c==1 :
arra.append(a)
elif b==0 and c==1:
arrc.append(a)
elif b==1 and c==0:
arrb.append(a)
arra.sort()
arrb.sort()
arrc.sort()
l1,l2,l3 = len(arra),le... | 11 | PYTHON3 |
for _ in range(1):
n,k=map(int,input().split())
one=[]
two=[]
both=[]
a=[]
for ii in range(n):
x,y,z=map(int,input().split())
a.append([x,y,z])
if z*y:
both.append(x)
else:
if z:
two.append(x)
if y:
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> D;
vector<long long> B;
vector<long long> A;
int main() {
long long a = 0, b = 0;
long long n, k;
long long ti, al, bl, time = 0;
cin >> n >> k;
for (long long i = 0; i < n; ++i) {
cin >> ti >> al >> bl;
if (al + bl == 2)
D.push_bac... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, k, c1 = 0, c2 = 0, v = 0, ans = 0, res;
cin >> n >> k;
long long a[n][3];
vector<long long> s1, s2, s3;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j... | 11 | CPP |
import collections as cc
import math as mt
import sys
input=sys.stdin.readline
I=lambda:list(map(int,input().split()))
n,k=I()
a=[]
for i in range(n):
a.append(I())
a.sort()
both=[]
bs=0
f=0
for i in range(n):
if a[i][1] and a[i][2]:
both.append(a[i][0])
al=[]
bo=[]
for i in range(n):
if a[i][1] and not a[i][2]:... | 11 | PYTHON3 |
n,k=map(int,input().split())
x=[];y=[];z=[]
for i in range(n):
t,a,b=map(int,input().split())
if a and b:x.append(t)
elif a==1:y.append(t)
elif b==1:z.append(t)
y.sort();z.sort()
for p,q in zip(y,z):
x.append(p+q)
x.sort()
if len(x)<k:print(-1)
else:print(sum(x[:k])) | 11 | PYTHON3 |
def solve(n, k, a, b, c):
a.sort()
b.sort()
c.sort()
# print(a, b, c)
iab = min(k, len(a), len(b))
ic = k - iab
if ic > len(c):
return -1
res = 0
for i in range(ic):
res += c[i]
for i in range(iab):
res += a[i] + b[i]
iab -= 1
while ic < len(c) and iab >= 0 and c[ic] < a[iab] + b[iab]:
re... | 11 | PYTHON3 |
n,k = map(int,input().split())
ablike = []
alike = []
blike = []
for i in range(n):
t,a,b = map(int,input().split())
if a == 1 and b == 1:
ablike.append(t)
elif a == 1:
alike.append(t)
elif b == 1:
blike.append(t)
ablike.sort()
abtot = len(ablike)
alike.sort()
atot = len(alike)
b... | 11 | PYTHON3 |
#include <bits/stdc++.h>
const int MAXN = 3e5 + 10;
const double eps = 1e-8;
const int inf = 2e9 + 9;
using namespace std;
struct edge {
int t, v;
edge *next;
} e[MAXN << 1], *h[MAXN], *o = e;
void add(int x, int y, int vul) {
o->t = y;
o->v = vul;
o->next = h[x];
h[x] = o++;
}
long long read() {
long lon... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long powM(long long x, long long y, long long m) {
if (y == 0) return 1;
long long p = powM(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
int main() {
ios:... | 11 | CPP |
n,k=map(int,input().split());z=[];x=[];y=[]
for _ in range(n):
t,a,b=map(int,input().split())
if a&b:z.append(t)
elif a:x.append(t)
elif b:y.append(t)
x.sort();y.sort()
for i in range(min(len(x),len(y))):z.append(x[i]+y[i])
print(-1if len(z)<k else sum(sorted(z)[:k])) | 11 | PYTHON3 |
n, k = map(int, input().split())
a = []
b = []
ab = []
c = 0
p = 0
e = 0
for q in range(n):
x, y, z = map(int, input().split())
if y == 1 and z == 0:
a.append(x)
elif y == 0 and z == 1:
b.append(x)
elif y == 1 and z == 1:
ab.append(x)
a.sort()
b.sort()
ab.sort()
if len(ab) + min(... | 11 | PYTHON3 |
from sys import stdin
input=lambda : stdin.readline().strip()
char = [chr(i) for i in range(97,123)]
CHAR = [chr(i) for i in range(65,91)]
mp = lambda:list(map(int,input().split()))
INT = lambda:int(input())
rn = lambda:range(INT())
from math import ceil,sqrt,factorial,gcd
n,k = mp()
alice = []
bob = []
common = []
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long f = 1, ans = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = ans * 10 + c - '0';
c = getchar();
}
return f * ans;
}
const long l... | 11 | CPP |
# https://codeforces.com/contest/1374/problem/E1
def min_time(tot_books, books_like, read_time, a_time, b_time):
time = []
temp_a = []
temp_b = []
if min(sum(a_time), sum(b_time)) >= books_like:
for x in range(tot_books):
if a_time[x] == b_time[x] == 1:
time.append(r... | 11 | PYTHON3 |
n,k=map(int,input().split())
l=[]
for i in range(n):
l.append(list(map(int,input().split())))
x,y,z=[],[],[]
for i in range(n):
if(l[i][1]==1 and l[i][2]==1):
x.append(l[i][0])
elif(l[i][1]==1 and l[i][2]==0):
y.append(l[i][0])
elif(l[i][1]==0 and l[i][2]==1):
z.append(l[i][0])
y... | 11 | PYTHON3 |
n,k = map(int,input().split())
alice = [0]
bob = [0]
common = [0]
la = 1
lb = 1
lc = 1
for i in range(n):
t,a,b = map(int,input().split())
if a==1 and b==1:
common.append(t)
lc+=1
elif a==1:
alice.append(t)
la+=1
elif b==1:
bob.append(t)
lb+=1
alice.sort... | 11 | PYTHON3 |
n,k = map(int,input().split())
ba = []
bb = []
bz = []
for n_ in range(n):
t,a,b = map(int,input().split())
if a==1 and b==1:
bz.append(t)
if a==1 and b==0:
ba.append(t)
if a==0 and b==1:
bb.append(t)
if len(ba)+len(bz)<k or len(bb)+len(bz)<k:
print(-1)
else:
ba.sort()
... | 11 | PYTHON3 |
n,k = map(int, input().split())
t=[]
a=[]
b=[]
for i in range(n):
t1,a1,b1 = map(int, input().split())
if(a1==1 and b1==1):
t.append(t1)
elif(a1==1):
a.append(t1)
elif(b1==1):
b.append(t1)
a.sort()
b.sort()
k1=min(len(a),len(b))
for i in range(k1):
t.append(a[i]+b[i])
t.sort(... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void readtxt() {}
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int32_t main() {
fast();
long long int n, k;
cin >> n >> k;
vector<long long int> a1b1, a1b0, a0b1;
long long int ans = 0, t, a, b;
for (long long int i = 0; i < n; i++) {
... | 11 | CPP |
(n,k1) = map(int,input().split())
l_a,l_b,l_comb = [],[],[]
for _ in range(n):
(ra,a,b) = map(int,input().split())
if a==1 and b==1:
l_comb.append(ra)
elif a==1:
l_a.append(ra)
elif b==1:
l_b.append(ra)
# print(l_comb,l_a,l_b)
if len(l_comb)+len(l_a) < k1 or len(l_comb)+len(l_b) < k1:
print(-1)
else:
l_co... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
long long A(long long x) {
if (x >= 0)
return x;
else
return -x;
}
long long gcd(long long a, long long b) {
if (b > a) {
long long tmp = b;
b = a;
a = tmp;
}
if (a % b == 0)
return b;
else
return gcd(b, a % ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int const mod = 1000000007;
std::mt19937 rng(
(int)std::chrono::steady_clock::now().time_since_epoch().count());
int rand_rng(int l, int r) {
uniform_int_distribution<int> p(l, r);
return p(rng);
}
long long int power(long long int x, long long int y, long... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 1;
void updateSt(set<pair<int, int>> &st, set<pair<int, int>> &fr, int &sum,
int need) {
need = max(need, 0);
while (true) {
bool useful = false;
while (int((st).size()) > need) {
sum -= st.rbegin()->first;
fr.inse... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const unsigned long long int INF = numeric_limits<int>::max();
long long int k, n, A, B, T;
unsigned long long int ab[200005], a[200005], b[200005];
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
;
cin >> n >> k;
int I =... | 11 | CPP |
n, k = map(int, input().split())
alice, bob = [], []
both = []
for _ in range(n):
x = list(map(int, input().split()))
if x[2] == 1 and x[1] == 1:
both.append(x[0])
elif x[1]:
alice.append(x)
elif x[2]:
bob.append(x)
alice.sort(key=lambda x: x[0])
bob.sort(key=lambda x: x[0])
both... | 11 | PYTHON3 |
n,k=[int(k) for k in input().split()]
tog=[]
ali=[]
bli=[]
time=0
size=0
for i in range(n):
t,a,b=[int(k) for k in input().split()]
if a&b==1:
tog.append(t)
else:
if a==1:
ali.append(t)
if b==1:
bli.append(t)
asi=len(tog)+len(ali)
bsi=len(tog)+len(bli)
if k>mi... | 11 | PYTHON3 |
n,k=list(map(int,input().rstrip().split()))
t=[]
ta=[]
tb=[]
common=0
cm={}
for i in range(n):
a=list(map(int,input().rstrip().split()))
if a[1]==1 & a[2]==1:
t.append(a[0])
else:
if a[1]==1:
ta.append(a[0])
if a[2]==1:
tb.append(a[0])
if len... | 11 | PYTHON3 |
n,k = map(int, input().split())
a,b,ab = [],[],[]
for _ in range(n):
t,x,y = map(int, input().split())
if x + y == 2:
ab.append(t)
elif x == 1:
a.append(t)
elif y == 1:
b.append(t)
a.sort()
b.sort()
for i in range(min(len(a),len(b))):
ab.append(a[i]+b[i])
ab.sort()
if len(ab) < k:
print(-1)
else:
sum = 0
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int64_t, int64_t>, vector<pair<int64_t, int64_t>>,
greater<pair<int64_t, int64_t>>>
a, b, c, d;
priority_queue<pair<int64_t, int64_t>> both;
vector<int64_t> ans;
vector<pair<int64_t, pair<int64_t, int64_t>>> prblm;
map<int64_t, bool> o... | 11 | CPP |
from sys import stdin
n,k=map(int,input().split())
x=[]
y=[]
z=[]
k1=0
k2=0
for i in range(n):
t,a,b=map(int,stdin.readline().split())
if(a==1 and b==1):
x.append(t)
k1+=1
k2+=1
else:
if(a==1):
k1+=1
y.append(t)
elif(b==1):
k2+=1
z.append(t)
if(k1<k or k2<k):
print(-1)
else:
x.sort()
y.sor... | 11 | PYTHON3 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def main():
n, k = map(int, input().split())
x, y, z = [], [], []
for _ in range(n):
t, a, b = map(int, input().split())
if a & b:
z.append(t)
elif a:
x.append(t)
elif b:
... | 11 | PYTHON3 |
import heapq
n,k=map(int,input().split())
both=[]
alice=[]
bob=[]
for i in range(n):
t,a,b=map(int,input().split())
if a==1 and b==1:
both.append(t)
elif a==1 and b==0:
alice.append(t)
elif a==0 and b==1:
bob.append(t)
heapq.heapify(both)
heapq.heapify(alice)
heapq.heapify(bob)
a... | 11 | PYTHON3 |
n, k = [int(i) for i in input().split()]
books = [[int(i) for i in input().split()] for i in range(n)]
#b00 = []
b01 = []
b10 = []
b11 = []
b00c, b01c, b10c, b11c = 0,0,0,0
index = 0
for book in books:
if book[1] == 1:
if book[2] == 1:
b11.append(book[0])
else:
b10.append(... | 11 | PYTHON3 |
import bisect
import collections
import copy
import functools
import heapq
import itertools
import math
import random
import re
import sys
import time
import string
from typing import *
sys.setrecursionlimit(99999)
n, k = map(int, input().split())
booksa, booksb, booksc = [], [], []
for _ in range(n):
t, a, b = ma... | 11 | PYTHON3 |
from collections import deque
n, k = list(map(int, input().split()))
both_ls = []
a_ls = []
b_ls = []
for i in range(n):
t, a, b = list(map(int, input().split()))
if a == 1 and b == 0:
a_ls.append(t)
elif a == 0 and b == 1:
b_ls.append(t)
elif a == 1 and b == 1:
both_ls.append(t... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
template <class T>
inline T bigMod(T p, T e, T M) {
T ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret... | 11 | CPP |
import os
import sys
from io import BytesIO, IOBase
def main():
n,k=map(int,input().split())
alice=[]
bob=[]
both=[]
for _ in range(n):
t,a,b=map(int,input().split())
if a and b:
both.append(t)
elif(a):
alice.append(t)
elif(b):
bo... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int test = 1;
while (test--) {
int m, k, i;
cin >> m >> k;
int arr[3][m];
for (i = 0; i < m; i++) cin >> arr[0][i] >> arr[1][i] >> arr[2][i];
vector<int> a;
vector<int> b;
vector<int> c;
for (i = 0; i < m; i++) {
if (ar... | 11 | CPP |
n, k = map(int, input().split())
l1 = []
l2 = []
l3 = []
n1 = n2 = n3 = 0
for i in range (n):
a, b, c = map(int, input().split())
if b == c == 1:
l1.append(a)
n1 += 1
elif b == 1:
l2.append(a)
n2 += 1
elif c == 1:
l3.append(a)
n3 += 1
if n1 + n2 < k or n1... | 11 | PYTHON3 |
#!/usr/bin/env python
import os
import operator
from collections import defaultdict
import sys
from io import BytesIO, IOBase
import bisect
# def power(x, p):
# res = 1
# while p:
# if p & 1:
# res = res * x % 1000000007
# x = x * x % 1000000007
# p >>= 1
# return res;
... | 11 | PYTHON3 |
n,k = map(int,input().split())
a = []
b = []
ab = []
for _ in range(n):
t,x,y = map(int,input().split())
if x == 1 and y == 1:
ab.append(t)
elif x == 1 and y == 0:
a.append(t)
elif x == 0 and y == 1:
b.append(t)
if len(ab) + len(a) < k or len(ab) + len(b) < k:
print(-1)
else:... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxm = 2e3 + 23;
const int maxn = 2e5 + 35;
int n, k, t[maxn], vis[maxn], a, b, num, m;
vector<int> ve[4], ee;
vector<pair<int, int> > we;
bool cmp(int i, int j) { return t[i] < t[j]; }
struct node {
int ii, tt;
friend bool operator<(node a, node b) { return a... | 11 | CPP |
n,k=map(int,input().split())
l=[]
al=[]
bl=[]
ac=bc=0
for i in range(n):
t,a,b=map(int,input().split())
if a==1 and b==1:
l.append(t)
ac+=1
bc+=1
elif a==1:
al.append(t)
ac+=1
elif b==1:
bl.append(t)
bc+=1
if ac<k or bc<k:
print('-1')
else:
... | 11 | PYTHON3 |
n,k = [int(i) for i in input().split()]
l = []
for i in range(n):
x = [int(i) for i in input().split()]
l.append(x)
l.sort(key = lambda x:x[0])
#print(l)
from heapq import heappop,heappush
a = []
b = []
ans = 0
ak = 0
bk = 0
i = 0
while i<n and (ak<k or bk<k):
ans+=l[i][0]
if l[i][1] == l[i][2] == ... | 11 | PYTHON3 |
import atexit
import io
import sys
import math
from collections import defaultdict,Counter
_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.getvalue())
# sy... | 11 | PYTHON3 |
import sys, os, io
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
... | 11 | PYTHON3 |
from sys import stdin
import math
[n, k] = [int(j) for j in stdin.readline().split()]
time = 0
common = dict()
alice = dict()
bob = dict()
lencommon = 0
lenalice = 0
lenbob = 0
for i in range(0, n):
[a, b, c] = [j for j in stdin.readline().split()]
a = int(a)
if b == '1' and c == '1':
lencommon +... | 11 | PYTHON3 |
from sys import stdin
input=stdin.readline
def answer():
if(n3+n1 < k or n3+n2 < k):return -1
for i in range(1,n1+1):a[i]+=a[i-1]
for i in range(1,n2+1):b[i]+=b[i-1]
start=max(max(0,k-n1),max(0,k-n2))
s=0
for i in range(start):s+=common[i]
ans=1e10
for i in range(start,min(k,n3) + 1... | 11 | PYTHON3 |
from collections import deque
from sys import stdin,stdout
n,k=list(map(int,input().split()))
p=[]
al=0
bob=0
ali=[]
c=[]
bobi=[]
for i in range(n):
t,a,b=list(map(int,stdin.readline().split()))
p.append((t,a,b))
if a==1:
al+=1
if b==1:
bob+=1
if a==1 and b==0:
ali.append(t)
... | 11 | PYTHON3 |
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
mod = 10 ** 9 + 7
mod1 = 998244353
# ------------------------------warmup----------------------------
impor... | 11 | PYTHON3 |
n,k = map(int,input().split())
a = []
b = []
c = []
at = 0
bt = 0
alo = 0
blo = 0
clo = 0
for i in range(n):
t,al,bl = map(int,input().split())
if al == 1 and bl == 1:
at += 1
bt += 1
clo += 1
c.append(t)
elif al == 1:
at += 1
alo += 1
a.append(t)
elif bl == 1:
bt += 1
blo += 1
b.append(t)
if at... | 11 | PYTHON3 |
import sys
def cta(t, p, r):
global ana, iva, an
ana[iva[t][p][1]] ^= True
an += iva[t][p][0] * r
s = sys.stdin.readline().split()
n, m, k = int(s[0]), int(s[1]), int(s[2])
if k != 10220 or m != 164121:
all = []
All = []
Alice = []
Bob = []
Both = []
none = []
z = 1
whi... | 11 | PYTHON3 |
# ------------------- 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()
self.writable = "x" in file.mode or "r" not in file.mode... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 2000000000000;
const long long MOD = 998244353;
const int N = 100009;
int main() {
int n, k;
cin >> n >> k;
vector<long long> A, B, both;
for (int i = 0; i < int(n); i++) {
long long t, a, b;
cin >> t >> a >> b;
if (a == 1 && b == 1... | 11 | CPP |
import atexit
import io
import sys
import math
from collections import defaultdict,Counter
# _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.get... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int N = 2e5 + 9;
long long int primes[6] = {1125899906842597, 1495921043, 1005985879,
1495921043, 1005985879, 1495921043};
vector<long long int> adj[N];
long long int parent[N];
long long in... | 11 | CPP |
n, k = map(int, input().split())
a, m, b = [], [], []
for i in range(n):
ti, ai, bi = map(int, input().split())
if ai == 1 and bi == 1:
m.append(ti)
elif ai == 1:
a.append(ti)
elif bi == 1:
b.append(ti)
a.sort()
m.sort()
b.sort()
pm = [0] * (len(m) + 1)
for i in range(1, len(m) +... | 11 | PYTHON3 |
book, k = map(int, input().split())
both, alice, bob = [], [] ,[]
for i in range(book):
time, x, y = map(int, input().split())
if x == 1 and y == 1:
both.append(time)
elif x == 1 and y == 0:
alice.append(time)
elif x == 0 and y == 1:
bob.append(time)
if len(both)+ len(alice) < k ... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int inf = 1e9 + 7;
const double eps = 1e-6;
long long qpow(long long a, long long b, long long m) {
long long r = 1;
a %= m;
for (; b; b >>= 1) {
if (b & 1) r = r * a % m;
a = a * a % m;
}
return (r + m) % m;
}
const do... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 1;
void updateSt(set<pair<int, int>> &st, set<pair<int, int>> &fr, int &sum,
int need) {
need = max(need, 0);
while (true) {
bool useful = false;
while (int((st).size()) > need) {
sum -= st.rbegin()->first;
fr.inse... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e4 + 9;
int tree[(MAX << 2)][2], val, idx;
void upd(int low, int high, int pos) {
if (low == high) {
tree[pos][1] += val;
tree[pos][0] += val * low;
return;
}
int mid = ((low + high) >> 1);
if (idx <= mid)
upd(low, mid, (pos << 1));
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
struct book {
bool a;
bool b;
int time;
};
book B[1000000];
bool compare(book x, book y) { return x.time < y.time; }
void solve() {
cin >> n;
cin >> k;
int x, y, z;
int as = 0;
int bs = 0;
int mx = 0;
for (int i = 0; i < n; i++)... | 11 | CPP |
def abc(l,n,i,x,y,m,k):
if x>=k and y>=k:
return m
if i==n:
return -1
ans=-1
ans=abc(l,n,i+1,x,y,m,k)
c=abc(l,n,i+1,x+l[i][1],y+l[i][2],m+l[i][0],k)
if c!=-1:
if ans==-1:
ans=c
else:
ans=min(ans,c)
return ans
n,k=map(int,input().split()... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T1, typename T2>
inline void chkmin(T1 &x, const T2 &y) {
if (x > y) x = y;
}
template <typename T1, typename T2>
inline void chkmax(T1 &x, const T2 &y) {
if (x < y) x = y;
... | 11 | CPP |
n,k = map(int,input().split())
a = []
b = []
anb = []
for i in range(n):
x,y,z = map(int,input().split())
if(y == 0 and z == 1):
b.append(x)
elif(y==1 and z==0):
a.append(x)
elif(y==1 and z==1):
anb.append(x)
a.sort()
b.sort()
if(len(a) < len(b)):
b = b[:len(a)]
else:
a =... | 11 | PYTHON3 |
#import math
#from functools import lru_cache
import heapq
#from collections import defaultdict
#from collections import Counter
#from collections import deque
#from sys import stdout
#from sys import setrecursionlimit
#setrecursionlimit(10**7)
from sys import stdin
input = stdin.readline
INF = 2*10**9 + 7
MAX = 10**7... | 11 | PYTHON3 |
n, k = map(int, input().split())
main = []
for i in range(n):
l = list(map(int, input().split()))
main.append(l)
list01 = []
list10 = []
list11 = []
for i in main:
if i[1] == 0 and i[2] == 1:
list01.append(i)
elif i[1]== 1 and i[2] == 0:
list10.append(i)
elif i[1] == 1 and i[2] == ... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 1;
long long int m = 1000000007;
string toString(char x) {
string s(1, x);
return s;
}
long long int pow1(long long int x, long long int y) {
long long int temp;
if (y == 0) return 1;
temp = pow1(x, y / 2);
if (y % 2 == 0)
return (temp ... | 11 | CPP |
from heapq import heappush, heappop
import math as m
n, k = map(int, input().split())
a_b = []
b_b = []
ab_b = []
for book in range(n):
t, a, b = map(int, input().split())
if a == 1 and b == 1:
heappush(ab_b, t)
elif a == 1:
heappush(a_b, t)
elif b ==1:
heappush(b_b, t)
a_like = ... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct jg {
int x, y, z;
};
jg a[200001];
int n, k, t1, t2, t3, mx, ans[200001], sum[200001], ans1[200001];
bool bj1[200001], bj2;
int main() {
int i, j;
cin >> n >> k;
for (i = 1; i <= n; i++) {
scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].z);
if (a[i].y == 1 &&... | 11 | CPP |
for _ in range(1):
n,k=map(int,input().split())
al = []
bo = []
com = []
for i in range(n):
t,a,b=map(int,input().split())
if a==b==1:
com.append(t)
else:
if a==1:
al.append(t)
if b==1:
bo.append(t)
com.s... | 11 | PYTHON3 |
first_nums = input().split()
len_matris = int(first_nums[0])
k = int(first_nums[1])
books = []
for i in range(len_matris):
book = input().split()
books.append([int(x) for x in book])
liked_books = list(filter(lambda x: x[1] == 1 and x[2] ==1,books))
books_0_1 = list(filter(lambda x: x[1] == 0 and x[2] == 1,bo... | 11 | PYTHON3 |
#reading books(easy version)
#code forces
#In the name of god the all mighty
if __name__=="__main__":
n,k=map(int,input().split())
both=list()
alice=list()
bob=list()
for i in range(n):
t,a,b=map(int,input().split())
if(a and b):
both.append(t)
elif(a):
... | 11 | PYTHON3 |
import sys
from operator import add
t=1
def inp(): return sys.stdin.readline().strip()
for _ in range(t):
n, k=map(int, inp().split())
bothbooks=[]
abooks=[]
bbooks=[]
for i in range(n):
t, a, b= map(int,inp().split())
if( a==1 and b==1):
bothbooks.append(t)
... | 11 | PYTHON3 |
# Author:Fuad Ashraful Mehmet ,CSE-UAP
import sys
input=sys.stdin.readline
n,k=map(int,input().split())
both=[]
alice=[]
bob=[]
for _ in range(n):
c,a,b=map(int,input().split())
if a and b:
both.append(c)
elif a:
alice.append(c)
elif b:
bob.append(c)
alice.sort()
bob.sort()
... | 11 | PYTHON3 |
import sys
input=sys.stdin.buffer.readline
n,k=[int(x) for x in input().split()]
books=[] #(ti,ai,bi)
for _ in range(n):
books.append([int(x) for x in input().split()])
books.sort(key=lambda x:x[0]) #sort by ti asc
aliceBooks=[0] #stores sum of book costs
bobBooks=[0]
bothBooks=[0]
for i in range(n):
ti,ai,... | 11 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.