제출 #26985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
26985		Bruteforceman	팀들 (IOI15_teams)	C++11	21 / 100	4000 ms	361516 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
int n;
pii range[500010];
int dp[500010];
const int inf = 1e9;

vector <int> g[500010];

struct node {
	node *l, *r;
	int sum;
	node () {
		l = NULL;
		r = NULL;
		sum = 0;
	}
	void merge() {
		sum = 0;
		if(l) sum += l -> sum;
		if(r) sum += r -> sum;
	}
} *t[500010]; 
typedef node* pnode;

void insert(int x, pnode &cur, int b, int e) {
	if(!cur) cur = new node();
	if(b == e) {
		cur -> sum += 1;
		return ;
	}
	int m = (b + e) >> 1;
	if(x <= m) insert(x, cur -> l, b, m);
	else insert(x, cur -> r, m+1, e);
} 

void correct(pnode &cur, pnode &prev, int b, int e) {
	if(!cur) {
		cur = prev;
		return ;
	}
	if(b == e) {
		cur -> sum += prev -> sum;
		return ;
	}
	int m = (b + e) >> 1;
	correct(cur -> l, prev -> l, b, m);
	correct(cur -> r, prev -> r, m+1, e);
	cur -> merge();
}

void init(pnode &cur, int b, int e) {
	cur = new node();
	if(b == e) {
		return ;
	}
	int m = (b + e) >> 1;
	init(cur -> l, b, m);
	init(cur -> r, m+1, e);
}
int count(int x, int y, int k, pnode cur, pnode prev, int b, int e) {
	if(b == e) {
		return (cur -> sum) - (prev -> sum);
	}
	int m = (b + e) >> 1;
	if(k <= m) {
		return ((cur -> r -> sum) - (prev -> r -> sum)) + count(x, y, k, cur -> l, prev -> l, b, m);
	} else {
		return count(x, y, k, cur -> r, prev -> r, m+1, e);
	}
}
int count(int x, int y, int k) {
	if(x > y) return 0;
	return count(x, y, k, t[y], t[x-1], 1, n);
}
 
void init(int N, int A[], int B[]) {
	n = N;
	for(int i = 0; i < n; i++) {
		g[A[i]].push_back(B[i]);
	}	
	for(int i = 1; i <= n; i++) {
		sort(g[i].begin(), g[i].end());
	}
	for(int i = 0; i <= n; i++) {
		t[i] = NULL;
	}
	init(t[0], 1, n);
	for(int i = 1; i <= n; i++) {
		for(auto j : g[i]) {
			insert(j, t[i], 1, n);
		}
		correct(t[i], t[i - 1], 1, n);
	}
}

int can(int M, int K[]) {
	sort(K, K+M);
	int sum = 0;
	for(int i = 0; i < M; i++) {
		sum += K[i];
		if(sum > n) return false;
	}
	for(int i = 0; i < M; i++) {
		dp[i] = count(1, K[i], K[i]) - K[i];
		for(int j = 0; j < i; j++) {
			dp[i] = min(dp[i], dp[j] + count(K[j] + 1, K[i], K[i]) - K[i]);
		}
	}	
	int ans = inf;
	for(int i = 0; i < M; i++) {
		ans = min(ans, dp[i]);
	}
	// cout << (ans >= 0) << endl;
	return (ans >= 0);
}

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