Submission #1140363

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140363		Lemser	Teams (IOI15_teams)	C++20	34 / 100	4096 ms	69164 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using pii = pair<int,int>;
using pll = pair<ll, ll>;
 
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
 
// #define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
 
bool cmin(ll &a, ll b) { if(b<a){a=b;return 1;}return 0; }
bool cmax(ll &a, ll b) { if(b>a){a=b;return 1;}return 0; }
void valid(ll in) { cout<<((in)?"YES\n":"NO\n"); }
ll lcm(ll a, ll b) { return (a/gcd(a,b))*b; }
ll gauss(ll n) { return (n*(n+1))/2; }

const int N = 5e5 + 7;

int n;
vector<vector<int>> bs;

void init(int N, int A[], int B[]) {
	n = N;
	bs = vector<vector<int>>(n+1);
	fo (i, n) bs[A[i]].pb(B[i]);
}

int can(int M, int K[]) {
	sort(K, K+M);
	ll r = 1;
	multiset<ll> st;
	auto w = bs;
	fo (i, M) {
		while (r <= K[i]) {
			while (sz(w[r])) {
				st.insert(w[r].back());
				w[r].pop_back();
			}
			r++;
		}
		while (sz(st) && *st.begin() < K[i]) st.erase(st.find(*st.begin()));
		while (sz(st) && K[i]--) st.erase(st.find(*st.begin()));
		if (K[i] > 0) return 0;
	}
	return 1;
}

• Subtask 1: 21 / 21
• Subtask 2: 13 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23