oj.uz

답안 #616243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
616243 2022-08-01T03:58:31 Z GusterGoose27 Ruka (COI15_ruka) C++11
44 / 100
 586 ms 41880 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> pii;
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> ostree;

const int MAXN = 1e5;
int n, q;
int l_cross = 0;
int xelems[MAXN+1];
int yelems[MAXN+1];
pii vecs[MAXN];
int pos = 0;

void er(ostree &s, pii v) {
	s.erase(s.find(v));
}

void print(ostree &s) {
	for (pii p: s) cout << p.first << " ";
	cout << endl;
}

int get_cross(int a, int b) {
	return (min(a, b) <= 0 && max(a, b) > 0);
}

class right_ds {
public:
	int lz = 0;
	ostree mn_elems;
	ostree mx_elems;
	right_ds() {}
	right_ds(int elems[]) {
		for (int i = 0; i < n; i++) {
			mn_elems.insert(pii(min(elems[i], elems[i+1]), i));
			mx_elems.insert(pii(max(elems[i], elems[i+1]), i));
		}
	}
	int query() {
		pii qelem(-lz+1, -1);
		return mn_elems.order_of_key(qelem)-mx_elems.order_of_key(qelem);
	}
	int get_cross(int elems[], int pos) {
		int mne = min(elems[pos], elems[pos+1]);
		int mxe = max(elems[pos], elems[pos+1]);
		return (mne <= -lz && mxe > -lz);
	}
	void del(int elems[], int pos) { // del, then ++
		int mne = min(elems[pos], elems[pos+1]);
		int mxe = max(elems[pos], elems[pos+1]);
		er(mn_elems, pii(mne, pos));
		er(mx_elems, pii(mxe, pos));
		l_cross += get_cross(elems, pos);
		elems[pos] += lz;
	}
	void ins(int elems[], int pos) { // --, then ins
		elems[pos] -= lz;
		int mne = min(elems[pos], elems[pos+1]);
		int mxe = max(elems[pos], elems[pos+1]);
		mn_elems.insert(pii(mne, pos));
		mx_elems.insert(pii(mxe, pos));
		l_cross -= get_cross(elems, pos);
	}
};

right_ds xds;
right_ds yds;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n;
	xelems[0] = 1;
	yelems[0] = 1;
	for (int i = 1; i <= n; i++) {
		int x, y; cin >> x >> y;
		xelems[i] = xelems[i-1]+x;
		yelems[i] = yelems[i-1]+y;
		vecs[i] = pii(x, y);
	}
	xds = right_ds(xelems);
	yds = right_ds(yelems);
	cin >> q;
	xds.del(xelems, pos);
	yds.del(yelems, pos);
	pos++;
	for (int i = 0; i < q; i++) {
		char c; cin >> c;
		// print(xds.mn_elems);
		// print(xds.mx_elems);
		if (c == 'F') {
			if (pos == n) continue;
			xds.del(xelems, pos);
			yds.del(yelems, pos);
			pos++;
		}
		if (c == 'B') {
			if (pos == 1) continue;
			pos--;
			xds.ins(xelems, pos);
			yds.ins(yelems, pos);
		}
		if (c == 'Q') {
			cout << (l_cross+xds.query()+yds.query()) << "\n";
		}
		if (c == 'C') {
			int x, y; cin >> x >> y;
			int xsh = x-vecs[pos].first;
			int ysh = y-vecs[pos].second;
			vecs[pos] = pii(x, y);
			l_cross -= (get_cross(xelems[pos-1], xelems[pos]+xds.lz)+get_cross(yelems[pos-1], yelems[pos]+yds.lz));
			xds.lz += xsh;
			yds.lz += ysh;
			l_cross += (get_cross(xelems[pos-1], xelems[pos]+xds.lz)+get_cross(yelems[pos-1], yelems[pos]+yds.lz));
		}
	}
};

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 188 ms 19992 KB Output is correct
6 Correct 113 ms 8928 KB Output is correct
7 Correct 160 ms 21004 KB Output is correct
8 Correct 136 ms 20936 KB Output is correct

Subtask #3
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 188 ms 19992 KB Output is correct
6 Correct 113 ms 8928 KB Output is correct
7 Correct 160 ms 21004 KB Output is correct
8 Correct 136 ms 20936 KB Output is correct
9 Correct 373 ms 22192 KB Output is correct
10 Incorrect 586 ms 41880 KB Output isn't correct
11 Halted 0 ms 0 KB -