Submission #727629

#	Time	Username	Problem	Language	Result	Execution time	Memory
727629		mgl_diamond	Teams (IOI15_teams)	C++14	0 / 100	4057 ms	31084 KiB

teams

#include <bits/stdc++.h>

#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define C make_pair
#define vec vector
#define ins push_back
#define fi first
#define se second

using namespace std;
using ll = long long;
using ii = pair<int, int>;

int n;
multiset<ii> avail;

void init(int N, int A[], int B[]) {
    n = N;
    for(int i=0; i<n; ++i) avail.insert({A[i], B[i]});
}

bool can(int M, int K[]) {
    sort(K, K+M);
    for(int i=0; i<M; ++i) {
        vec<ii> cands;
        for(auto x : avail) if (x.fi <= K[i] && x.se >= K[i])
            cands.emplace_back(x.se, x.fi);
        if (K[i] > sz(cands)) return 0;
        sort(all(cands));
        for(int j=0; j<i; ++j) avail.erase(avail.find({cands[j].se, cands[j].fi}));    
    }
    return 1;
}

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