Submission #56448

#	Time	Username	Problem	Language	Result	Execution time	Memory
56448		WA_TLE	Teams (IOI15_teams)	C++14	34 / 100	4043 ms	43368 KiB

teams

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<teams.h>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int n;
vector<vector<int>>hito;
void init(int N,int A[],int B[]){
	n=N;
	int i;
	hito.res(n+1);
	for(i=0;i<n;i++){hito[A[i]].pub(B[i]);}
}
int can(int M,int K[]){
	int i,bas=0;
	priority_queue<int,vector<int>,greater<int>>que;
	sort(K,K+M);
	for(i=0;i<M;i++){
		while(bas<=K[i]){
			for(auto it:hito[bas]){que.push(it);}
			bas++;
		}
		while(que.size()>0&&que.top()<K[i]){que.pop();}
		for(int j=0;j<K[i];j++){
			if(que.empty()){return 0;}
			que.pop();
		}
		
	}
	return 1;
}

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