Submission #912411

#	Time	Username	Problem	Language	Result	Execution time	Memory
912411		JakobZorz	Teams (IOI15_teams)	C++17	34 / 100	4094 ms	38608 KiB

teams

#include"teams.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;

int n;
int a[500000];
int b[500000];

void init(int N,int A[],int B[]){
    n=N;
    vector<pair<int,int>>vec(n);
    for(int i=0;i<n;i++)
        vec[i]={A[i],B[i]};
    sort(vec.begin(),vec.end());
    for(int i=0;i<n;i++){
        a[i]=vec[i].first;
        b[i]=vec[i].second;
    }
}

int can(int m,int k[]){
    multiset<int>s;
    sort(k,k+m);
    int ci=0;
    for(int i=0;i<m;i++){
        while(ci<n&&a[ci]<=k[i])
            s.insert(b[ci++]);
        while(s.size()&&*s.begin()<k[i])
            s.erase(s.begin());
        for(int j=0;j<k[i];j++){
            if(s.empty())
                return 0;
            s.erase(s.begin());
        }
    }
	return 1;
}

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