Submission #761955

#	Time	Username	Problem	Language	Result	Execution time	Memory
761955		Dan4Life	팀들 (IOI15_teams)	C++17	34 / 100	4078 ms	31464 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
vector<pair<int,int>> v; int n;
multiset<int> S;
 
void init(int N, int a[], int b[]) {
	for(int i = 0; i < N; i++) v.pb({a[i],b[i]});
	sort(begin(v),end(v)); n = N;
}
 
int can(int m, int a[]) {
    if(accumulate(a,a+m,0ll)>n) return 0;
    sort(a,a+m);
    int j = 0; S.clear();
    for(int i = 0; i < m; i++){
        int x = a[i];
        while(j<n and v[j].fi<=a[i]) 
            S.insert(v[j].se), j++;
        while(x--){
            auto itr = S.lower_bound(a[i]);
            if(itr==end(S)) return 0;
            S.erase(itr);
        }
    }
    return 1;
}

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