제출 #1082074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082074		Malix	팀들 (IOI15_teams)	C++14	0 / 100	4041 ms	23500 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

pii a;
int n;

void init(int N, int A[], int B[]) {
	n=N;
	REP(i,0,n)a.PB({B[i],A[i]});
}

int can(int m, int K[]) {
	vi b;
	REP(i,0,m)b.PB(K[i]);
	sort(b.begin(),b.end());
	reverse(b.begin(),b.end());
	priority_queue<pi> pq;
	REP(i,0,n)pq.push(a[i]);
	REP(i,0,m){
		int x=b[i];
		if(pq.empty()||pq.top().F<x)return 0;
		while(!pq.empty()&&x>0){
			while(!pq.empty()&&pq.top().S>b[i])pq.pop();
			if(pq.empty()||pq.top().F<b[i])return 0;
			pq.pop();x--;
		}
		if(x>0)return 0;
	}
	return 1;
}

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