제출 #1218726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218726		vidux	팀들 (IOI15_teams)	C++17	34 / 100	4094 ms	12408 KiB

teams

#include "teams.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const ll LLINF = 1e18;

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

int can(int m, int t[]) {
	priority_queue<int, vi, greater<int>> pq;
	sort(t, t+m);
	bool ok = 1;
	for (int i = 0, j = 0; i < m && ok; i++) {
		int need = t[i];
		while (j < n && a[j].first <= need) pq.push(a[j++].second);
		while ((int)pq.size() && pq.top() < need) pq.pop();
		while (need && (int)pq.size()) {
			pq.pop();
			need--;
		}
		if (need) ok = 0;
	}
	//cout << ok << endl;
	return ok;
}

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