Submission #50132

#	Time	Username	Problem	Language	Result	Execution time	Memory
50132		Benq	Teams (IOI15_teams)	C++14	34 / 100	4057 ms	35512 KiB

teams

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

#include "teams.h"
vpi v;
int n;

void init(int N, int A[], int B[]) {
    n = N;
    F0R(i,n) v.pb({A[i],B[i]});
    sort(all(v));
}


int can(int M, int K[]) {
    multiset<int> S;
    sort(K,K+M);
    int ind = 0;
    F0R(i,M) {
        while (ind < n && v[ind].f <= K[i]) S.insert(v[ind++].s);
        while (sz(S) && *S.begin() < K[i]) S.erase(S.begin());
        F0R(j,K[i]) {
            if (sz(S) == 0) return 0;
            S.erase(S.begin());
        }
    }
    return 1;
}

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