Submission #384609

#	Time	Username	Problem	Language	Result	Execution time	Memory
384609		Leonardo_Paes	Teams (IOI15_teams)	C++17	0 / 100	4080 ms	12680 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define f first
#define s second
vector<pii> e;
int n;
void init(int N, int A[], int B[]) {
	n = N;
	for(int i=0; i<N; i++){
		e.push_back({A[i], B[i]});
	}
	sort(e.begin(), e.end());
}

int can(int M, int K[]) {
	sort(K, K+M);
	vector<pii> wtf(M);
	for(int i=0; i<M; i++){
		wtf[i] = {K[i], K[i]};
	}
	int id = 0;
	priority_queue<int,vector<int>,greater<int>> fila;
	for(int i=0;i<M;i++) {
        while(id < n and e[id].f <= wtf[i].f) {
            fila.push(e[id].s);
            id++;
        }
        while(wtf[i].s--){
            while(fila.empty() and fila.top() < wtf[i].f) fila.pop();
            if(fila.empty()) return 0;
            fila.pop();
        }
    }
	return 1;
}

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