Submission #37134

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
37134	2017-12-21T15:13:05 Z	cheater2k	Cake (CEOI14_cake)	C++14	100 / 100	566 ms	14112 KB

cake

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

const int N = 250005;
int n, q, start, d[N];
vector<int> topten;

struct SegmentTree {
	int T[N << 2]; // maxpos
	SegmentTree() {
		memset(T, 0, sizeof T);
	}
	
	#define mid ((l + r) >> 1)
	void build(int v, int l, int r) {
		if (l == r) { T[v] = l; return; }
		build(v << 1, l, mid); build(v << 1 | 1, mid + 1, r);
		if (d[T[v << 1]] > d[T[v << 1 | 1]]) T[v] = T[v << 1];
		else T[v] = T[v << 1 | 1];
	}
	void upd(int v, int l, int r, int pos) {
		if (l > r || l > pos || r < pos) return;
		if (l == r) { T[v] = pos; return; }
		upd(v << 1, l, mid, pos); upd(v << 1 | 1, mid + 1, r, pos);
		if (d[T[v << 1]] > d[T[v << 1 | 1]]) T[v] = T[v << 1];
		else T[v] = T[v << 1 | 1];
	}
	int get(int v, int l, int r, int L, int R) {
		if (l > r || R < l || L > r) return 0;
		if (L <= l && r <= R) return T[v];
		int le = get(v << 1, l, mid, L, R), ri = get(v << 1 | 1, mid + 1, r, L, R);
		return d[le] > d[ri] ? le : ri;
	} 
	int get_lef(int v, int l, int r, int x) {
		// get the leftmost position i such that i > start and d[i] > x
		if (r <= start) return n + 1;
		if (l > start) {
			if (d[T[v]] <= x) return n + 1;
			if (l == r) {
				if (d[T[v]] > x) return l; else return n + 1;
			}
		}
		int le = get_lef(v << 1, l, mid, x);
		if (le == n + 1) return get_lef(v << 1 | 1, mid + 1, r, x);
		return le;
	}
	int get_rig(int v, int l, int r, int x) {
		// get the rightmost position such that i < start and d[i] > x
		if (l >= start) return 0;
		if (r < start) {
			if (d[T[v]] <= x) return 0;
			if (l == r) {
				if (d[T[v]] > x) return l; else return 0;
			}
		}
		int ri = get_rig(v << 1 | 1, mid + 1, r, x);
		if (ri == 0) return get_rig(v << 1, l, mid, x);
		return ri;
	}
	#undef mid
} seg1, seg2;

int count(int p) {
	if (p == start) return 0;
	// [le+1...ri-1]
	if (p < start) {
		int le = seg1.get(1, 1, n, p, start - 1);
		int ri = seg2.get_lef(1, 1, n, d[le]);
		return ri - p - 1;
	} else { // p > start
		int ri = seg2.get(1, 1, n, start + 1, p);
		int le = seg1.get_rig(1, 1, n, d[ri]);
		return p - le - 1;
	}
}

int main() {
	// freopen("in", "r", stdin);
	// freopen("out", "w", stdout);
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> start; // start eating
	for (int i = 1; i <= n; ++i) cin >> d[i];
	seg1.build(1, 1, n);
	seg2.build(1, 1, n);

	// init: stack<int> topten
	priority_queue < pair<int,int> > pq;
	for (int i = 1; i <= n; ++i) pq.push(make_pair(d[i], i));
	while(pq.size() && topten.size() < 10) {
		int p = pq.top().second; pq.pop(); topten.push_back(p);
	}
	// topten contains the ten largest elements in descending order

	cin >> q;
	for (int i = 1; i <= q; ++i) {
		char type; cin >> type;
		if (type == 'E') {
			int pos, e; cin >> pos >> e; // e-th largest element
			vector<int>::iterator it = find(topten.begin(), topten.end(), pos);
			if (it != topten.end()) topten.erase(it);

			for (int i = 0; i < e-1; ++i) d[topten[i]]++;
			topten.insert(topten.begin() + e - 1, pos);
			while(topten.size() > 10) topten.pop_back();

			if (e != topten.size()) d[pos] = d[topten[e]] + 1;
			else if (e != 1) d[pos] = d[topten[e - 2]] - 1;
			else d[pos] = 1; // in case N = 1

			// update
			if (pos < start) seg1.upd(1, 1, n, pos);
			else seg2.upd(1, 1, n, pos);
		} else {
			int pos; cin >> pos;
			printf("%d\n", count(pos));
		}
	}
}

Compilation message

cake.cpp: In function 'int main()':
cake.cpp:106:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (e != topten.size()) d[pos] = d[topten[e]] + 1;
          ^

Subtask #1

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	11000 KB	Output is correct
2	Correct	0 ms	11000 KB	Output is correct
3	Correct	0 ms	11000 KB	Output is correct
4	Correct	0 ms	11000 KB	Output is correct
5	Correct	6 ms	11160 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	183 ms	11160 KB	Output is correct
2	Correct	159 ms	11160 KB	Output is correct
3	Correct	199 ms	11160 KB	Output is correct
4	Correct	146 ms	11160 KB	Output is correct
5	Correct	196 ms	11420 KB	Output is correct
6	Correct	186 ms	11420 KB	Output is correct
7	Correct	196 ms	11420 KB	Output is correct
8	Correct	173 ms	11420 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	99 ms	12576 KB	Output is correct
2	Correct	76 ms	12576 KB	Output is correct
3	Correct	59 ms	12576 KB	Output is correct
4	Correct	0 ms	11000 KB	Output is correct
5	Correct	163 ms	14112 KB	Output is correct
6	Correct	116 ms	14112 KB	Output is correct
7	Correct	93 ms	14112 KB	Output is correct

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	11000 KB	Output is correct
2	Correct	29 ms	11160 KB	Output is correct
3	Correct	73 ms	11808 KB	Output is correct
4	Correct	56 ms	11808 KB	Output is correct
5	Correct	79 ms	11000 KB	Output is correct
6	Correct	106 ms	12576 KB	Output is correct
7	Correct	113 ms	11160 KB	Output is correct
8	Correct	109 ms	12576 KB	Output is correct
9	Correct	503 ms	14112 KB	Output is correct
10	Correct	263 ms	11000 KB	Output is correct
11	Correct	333 ms	11420 KB	Output is correct
12	Correct	566 ms	14112 KB	Output is correct
13	Correct	389 ms	14112 KB	Output is correct