제출 #287633

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287633		b00n0rp	팀들 (IOI15_teams)	C++17	0 / 100	4080 ms	8312 KiB

teams

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

#define pii pair<int,int>
#define F first
#define S second

const int MAXN = 500005;
const int LIM = 10000;

int n;
pii a[MAXN];
int dp[MAXN];

void init(int N, int A[], int B[]){
	n = N;
	for(int i = 0; i < n; i ++){
		a[i] = {A[i],B[i]};
	}
	sort(a,a+n);
}

int query(int l,int r,int val){
	int res = 0;
	for(int i = l; i <= r; i++){
		if(a[i].S >= val) res++;
	}
	return res;
}

int can(int M, int K[]) {
	sort(K,K+M);
	if(M > LIM){
		return 0;
	}
	else{
		dp[0] = 0;
		for(int i = 1; i <= M; i ++){
			dp[i] = dp[i-1];
			for(int j = 1; j < i; j ++){
				// dp[j] + (No. of kids (A, B) satisfying K[j-1] < A <= K[i-1] and B >= K[i-1]))-K[i-1]
				// int ind1 = lower_bound(a,a+n,make_pair(K[j-1]+1,-1))-a;
				// int ind2 = (lower_bound(a,a+n,make_pair(K[i-1]+1,-1))-a)-1;
				int res = 0;
				for(int ii = 0; ii < n; ii++){
					if(K[i-1] >= a[ii].F and a[ii].F > K[j-1] and a[ii].S >= K[i-1]) res++;
				}
				dp[i] = min(dp[i],dp[j]-K[i-1]+res);
			}
		}
		return dp[M] >= 0;
	}
}

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