제출 #17282

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
17282		erdemkiraz	팀들 (IOI15_teams)	C++98	0 / 100	183 ms	112992 KiB

teams

#include <bits/stdc++.h>

using namespace std;

#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;

const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;

#include "teams.h"

const int N = 5e5 + 5;

ii a[N];

class node{ public:
	int x;
	node *l, *r, *lazy;
	node() {
		x = 0;
		l = r = lazy = 0;
	}
};

typedef node* pNode;

pNode del;
pNode t[N];

pNode insert(pNode x, int l, int r, int x1) {
	pNode nw = new node;
	if(l == r) {
		nw -> x = 1;
		return nw;
	}
	int m = l + r >> 1;
	if(x1 <= m) {
		nw -> l = insert(x -> l, l, m, x1);
		nw -> r = x -> r;
	}
	else {
		nw -> l = x -> l;
		nw -> r = insert(x -> r, m + 1, r, x1);
	}
	nw -> x = nw -> l -> x + nw -> r -> x;
	return nw;
}

int n;

void init(pNode x, int l, int r) {
	if(l == r)
		return;
	int m = l + r >> 1;
	x -> l = new node;
	x -> r = new node;
	init(x -> l, l, m);
	init(x -> r, m + 1, r);
}

void init(int N, int A[], int B[]) {
	n = N;
	for(int i = 1; i <= n; i++) {
		a[i] = ii(B[i - 1], A[i - 1]);
	}
	sort(a + 1, a + n + 1);
	vector < ii > vs;
	for(int i = 1; i <= n; i++)
		vs.push_back(ii(a[i].second, i));
	sort(vs.begin(), vs.end());
	int ptr = 0;
	t[0] = new node;
	init(t[0], 1, n);
	for(int i = 1; i <= n; i++) {
		t[i] = t[i - 1];
		//printf("vs = %d ", i);
		while(ptr < vs.size() and vs[ptr].first <= i) {
			//printf("%d ", vs[ptr].second);
			t[i] = insert(t[i], 1, n, vs[ptr].second);
			ptr++;
		}
		//puts("");
	}
	del = new node;
	init(del, 1, n);
}

void push(pNode x, pNode del) {
	if(x -> lazy) {
		del -> l -> x = x -> lazy -> l -> x;
		del -> r -> x = x -> lazy -> r -> x;
		x -> l -> lazy = x -> lazy;
		x -> r -> lazy = x -> lazy;
		x -> lazy = 0;
	}
}

int get(pNode x, pNode del, int l, int r, int x1, int x2, int k) {
	if(x1 <= l and r <= x2 and x -> x - del -> x <= k) {
		x -> lazy = x;
		int ret = x -> x - del -> x;
		del -> x += ret;
		return ret;
	}
	if(x2 < l or r < x1 or l == r or del -> x == x -> x)
		return 0;
    int m = l + r >> 1;
    push(x, del);
    int lf = get(x -> l, del -> l, l, m, x1, x2, k);
    if(lf == k) {
		del -> x = del -> l -> x + del -> r -> x;
		return k;
	}
	k -= lf;
	int rf = get(x -> r, del -> r, m + 1, r, x1, x2, k);
	del -> x = del -> l -> x + del -> r -> x;
	return lf + rf;
}

void clear(pNode x) {
	if(x -> x and x -> l)
		clear(x -> l);
	if(x -> x and x -> r)
		clear(x -> r);
	x -> lazy = 0;
	x -> x = 0;
}

int can(int M, int K[]) {
	sort(K, K + M);
	int sum = 0;
	for(int i = 0; i < M; i++) {
		if(sum + K[i] > n)
			return 0;
		sum += K[i];
	}
	clear(del);
	for(int i = 0; i < M; i++) {
		int id = lower_bound(a + 1, a + n + 1, ii(K[i], 0)) - a;
		//printf("id = %d ", id);
		int res = get(t[K[i]], del, 1, n, id, n, K[i]);
		//printf("res = %d\n", res);
		if(res != K[i])
			return 0;
	}
	return 1;
}

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