Submission #356691

#	Time	Username	Problem	Language	Result	Execution time	Memory
356691		urd05	Teams (IOI15_teams)	C++14	34 / 100	4035 ms	11756 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
 
int n;
int a[100000];
int b[100000];
typedef pair<int,int> P;
P ind[100000];
int k[100000];
int m;
 
void init(int N, int A[], int B[]) {
    n=N;
    for(int i=0;i<n;i++) {
        a[i]=A[i];
        b[i]=B[i];
        ind[i]=P(a[i],i);
    }
    sort(ind,ind+n);
}
 
int can(int M, int K[]) {
    m=M;
    for(int i=0;i<m;i++) {
        k[i]=K[i];
    }
    sort(k,k+m);
    int in=0;
    priority_queue<int,vector<int>,greater<int>> pq;
    for(int i=0;i<m;i++) {
        while (in<n&&ind[in].first<=k[i]) {
            pq.push(b[ind[in].second]);
            in++;
        }
        for(int j=0;j<k[i];j++) {
            while (!pq.empty()&&pq.top()<k[i]) {
                pq.pop();
            }
            if (pq.empty()) {
                return 0;
            }
            pq.pop();
        }
    }
	return 1;
}

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