oj.uz

Submission #223339

# Submission time Handle Problem Language Result Execution time Memory
223339 2020-04-15T07:28:10 Z atoiz New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 323004 KB 
/*input
1 1 1
100000000 1 1 1
1 1

2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7

4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10
*/

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

const int INF = 400 * 1000 * 1000 + 3, MAXN = 300007, MAXC = 100 * 1000 * 1000;

void maximize(int &x, int y) { x = (x > y ? x : y); }

struct SegmentTree {
	int X;
	vector<int> valXs;
	vector<vector<int>> valYs, tree;

	int getPos(vector<int> &vec, int x) { return (int) (lower_bound(vec.begin(), vec.end(), x) - vec.begin()); }

	void init(vector<pair<int, int>> &vec) {
		valXs.clear();
		for (auto p : vec) valXs.push_back(p.first);
		sort(valXs.begin(), valXs.end());
		valXs.erase(unique(valXs.begin(), valXs.end()), valXs.end());

		X = (int) valXs.size();

		valYs.assign(X * 2, vector<int>(0));
		for (auto p : vec) {
			for (int x = getPos(valXs, p.first) + X; x > 0; x >>= 1) {
				valYs[x].push_back(p.second);
			}
		}

		tree.resize(X * 2);
		for (int x = 0; x < 2 * X; ++x) {
			sort(valYs[x].begin(), valYs[x].end());
			valYs[x].erase(unique(valYs[x].begin(), valYs[x].end()), valYs[x].end());
			tree[x].assign(valYs[x].size() * 2, -INF);
		}
	}

	void updSingle(int x, int y1, int y2, int z) {
		for (y1 = getPos(valYs[x], y1) + (int) valYs[x].size(), y2 = getPos(valYs[x], y2) + (int) valYs[x].size(); y1 < y2; y1 >>= 1, y2 >>= 1) {
			if (y1 & 1) maximize(tree[x][y1++], z);
			if (y2 & 1) maximize(tree[x][--y2], z);
		}
	}

	void updMax(int x1, int x2, int y1, int y2, int z) {
		if (y2 < 0 || y1 > MAXC) return;
		// cout << "upd " << x1 << ' ' << x2 << ' ' << y1 << ' ' << y2 << ": " << z << endl;
		for (x1 = getPos(valXs, x1) + X, x2 = getPos(valXs, x2) + X; x1 < x2; x1 >>= 1, x2 >>= 1) {
			if (x1 & 1) updSingle(x1++, y1, y2, z);
			if (x2 & 1) updSingle(--x2, y1, y2, z);
		}
	}

	int getSingle(int x, int y) {
		int ans = -INF;
		for (y = getPos(valYs[x], y) + (int) valYs[x].size(); y > 0; y >>= 1) maximize(ans, tree[x][y]);
		return ans;
	}

	int getMax(int x, int y) {
		int ans = -INF;
		for (x = getPos(valXs, x) + X; x > 0; x >>= 1) maximize(ans, getSingle(x, y));
		return ans;
	}
} lefST, rigST;

struct Event {
	int eventType, storeType, year, pos;
	Event (int _eventType, int _storeType, int _year, int _pos): eventType(_eventType), storeType(_storeType), year(_year), pos(_pos) {}
	bool operator< (const Event &ev) { return year < ev.year; }
};

int N, Q, K;
map<int, pair<int, int>> locations[MAXN];
vector<Event> events;
vector<pair<int, int>> queries;

void apply(int from, int to, int l, int r)
{
	int m = l + ((r - l + 1) >> 1);
	lefST.updMax(from, to, l, m, -l);
	rigST.updMax(from, to, m, r, r);
}

void sweep() {
	for (int t = 1; t <= K; ++t) {
		locations[t][-INF] = locations[t][INF] = make_pair(0, 1);
	}

	for (auto &ev : events) {
		int t = ev.storeType, y = ev.year, p = ev.pos;
		auto &cur = locations[t];
		if (ev.eventType == 0) { // add
			// cout << "add " << y << ": " << t << ' ' << p << endl;
			if (cur.find(p) != cur.end()) {
				++cur[p].second;
				continue;
			}

			auto it = prev(cur.upper_bound(p));
			int l = it -> first, r = next(it) -> first, last = it -> second.first;
			apply(last, y, l, r);

			it -> second.first = y;
			cur[p] = make_pair(y, 1);
		} else {
			// cout << "rem " << y << ": " << t << ' ' << p << endl;
			if ((--cur[p].second)) continue;

			auto it = cur.find(p);
			int l = prev(it) -> first, r = next(it) -> first;
			apply(prev(it) -> second.first, y, l, p);
			apply(it -> second.first, y, p, r);

			prev(it) -> second.first = y;
			cur.erase(it);
		}
	}

	for (int i = 1; i <= K; ++i) {
		for (auto it = locations[i].begin(); it != prev(locations[i].end()); ++it) {
			apply(it -> second.first, INF, it -> first, next(it) -> first);
		}
	}
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> N >> K >> Q;

	events.reserve(2 * N);
	for (int i = 0; i < N; ++i) {
		int x, t, a, b;
		cin >> x >> t >> a >> b;
		events.emplace_back(0, t, a, x);
		events.emplace_back(1, t, b + 1, x);
	}
	sort(events.begin(), events.end());

	queries.reserve(Q);
	for (int i = 0; i < Q; ++i) {
		int l, y;
		cin >> l >> y;
		queries.emplace_back(y, l);
	}

	lefST.init(queries);
	rigST.init(queries);

	sweep();

	for (auto &q : queries) {
		int l = -lefST.getMax(q.first, q.second);
		int r = rigST.getMax(q.first, q.second);
		int ans = max(q.second - l, r - q.second);
		if (ans > MAXC) ans = -1;
		cout << ans << '\n';
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14592 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 16 ms 14720 KB Output is correct
7 Correct 16 ms 14592 KB Output is correct
8 Correct 16 ms 14720 KB Output is correct
9 Correct 15 ms 14720 KB Output is correct
10 Correct 16 ms 14720 KB Output is correct
11 Correct 15 ms 14720 KB Output is correct
12 Correct 15 ms 14720 KB Output is correct
13 Correct 15 ms 14720 KB Output is correct
14 Correct 15 ms 14720 KB Output is correct
15 Correct 15 ms 14720 KB Output is correct
16 Correct 15 ms 14720 KB Output is correct
17 Correct 15 ms 14720 KB Output is correct
18 Correct 16 ms 14720 KB Output is correct
19 Correct 16 ms 14720 KB Output is correct
20 Correct 16 ms 14720 KB Output is correct
21 Correct 14 ms 14592 KB Output is correct
22 Correct 16 ms 14720 KB Output is correct
23 Correct 17 ms 14720 KB Output is correct
24 Correct 16 ms 14720 KB Output is correct
25 Correct 20 ms 14720 KB Output is correct
26 Correct 16 ms 14720 KB Output is correct
27 Correct 14 ms 14592 KB Output is correct
28 Correct 15 ms 14720 KB Output is correct
29 Correct 15 ms 14720 KB Output is correct
30 Correct 15 ms 14720 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14592 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 16 ms 14720 KB Output is correct
7 Correct 16 ms 14592 KB Output is correct
8 Correct 16 ms 14720 KB Output is correct
9 Correct 15 ms 14720 KB Output is correct
10 Correct 16 ms 14720 KB Output is correct
11 Correct 15 ms 14720 KB Output is correct
12 Correct 15 ms 14720 KB Output is correct
13 Correct 15 ms 14720 KB Output is correct
14 Correct 15 ms 14720 KB Output is correct
15 Correct 15 ms 14720 KB Output is correct
16 Correct 15 ms 14720 KB Output is correct
17 Correct 15 ms 14720 KB Output is correct
18 Correct 16 ms 14720 KB Output is correct
19 Correct 16 ms 14720 KB Output is correct
20 Correct 16 ms 14720 KB Output is correct
21 Correct 14 ms 14592 KB Output is correct
22 Correct 16 ms 14720 KB Output is correct
23 Correct 17 ms 14720 KB Output is correct
24 Correct 16 ms 14720 KB Output is correct
25 Correct 20 ms 14720 KB Output is correct
26 Correct 16 ms 14720 KB Output is correct
27 Correct 14 ms 14592 KB Output is correct
28 Correct 15 ms 14720 KB Output is correct
29 Correct 15 ms 14720 KB Output is correct
30 Correct 15 ms 14720 KB Output is correct
31 Correct 1783 ms 71024 KB Output is correct
32 Correct 108 ms 20916 KB Output is correct
33 Correct 1517 ms 68496 KB Output is correct
34 Correct 1576 ms 68992 KB Output is correct
35 Correct 1694 ms 70896 KB Output is correct
36 Correct 1682 ms 70644 KB Output is correct
37 Correct 1008 ms 67432 KB Output is correct
38 Correct 1008 ms 66928 KB Output is correct
39 Correct 667 ms 66424 KB Output is correct
40 Correct 717 ms 66928 KB Output is correct
41 Correct 1068 ms 67440 KB Output is correct
42 Correct 1112 ms 66956 KB Output is correct
43 Correct 68 ms 20724 KB Output is correct
44 Correct 1034 ms 67312 KB Output is correct
45 Correct 1008 ms 67020 KB Output is correct
46 Correct 944 ms 67260 KB Output is correct
47 Correct 488 ms 66516 KB Output is correct
48 Correct 488 ms 66416 KB Output is correct
49 Correct 556 ms 66672 KB Output is correct
50 Correct 705 ms 66740 KB Output is correct
51 Correct 568 ms 66780 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5083 ms 323004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5087 ms 316076 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14592 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 16 ms 14720 KB Output is correct
7 Correct 16 ms 14592 KB Output is correct
8 Correct 16 ms 14720 KB Output is correct
9 Correct 15 ms 14720 KB Output is correct
10 Correct 16 ms 14720 KB Output is correct
11 Correct 15 ms 14720 KB Output is correct
12 Correct 15 ms 14720 KB Output is correct
13 Correct 15 ms 14720 KB Output is correct
14 Correct 15 ms 14720 KB Output is correct
15 Correct 15 ms 14720 KB Output is correct
16 Correct 15 ms 14720 KB Output is correct
17 Correct 15 ms 14720 KB Output is correct
18 Correct 16 ms 14720 KB Output is correct
19 Correct 16 ms 14720 KB Output is correct
20 Correct 16 ms 14720 KB Output is correct
21 Correct 14 ms 14592 KB Output is correct
22 Correct 16 ms 14720 KB Output is correct
23 Correct 17 ms 14720 KB Output is correct
24 Correct 16 ms 14720 KB Output is correct
25 Correct 20 ms 14720 KB Output is correct
26 Correct 16 ms 14720 KB Output is correct
27 Correct 14 ms 14592 KB Output is correct
28 Correct 15 ms 14720 KB Output is correct
29 Correct 15 ms 14720 KB Output is correct
30 Correct 15 ms 14720 KB Output is correct
31 Correct 1783 ms 71024 KB Output is correct
32 Correct 108 ms 20916 KB Output is correct
33 Correct 1517 ms 68496 KB Output is correct
34 Correct 1576 ms 68992 KB Output is correct
35 Correct 1694 ms 70896 KB Output is correct
36 Correct 1682 ms 70644 KB Output is correct
37 Correct 1008 ms 67432 KB Output is correct
38 Correct 1008 ms 66928 KB Output is correct
39 Correct 667 ms 66424 KB Output is correct
40 Correct 717 ms 66928 KB Output is correct
41 Correct 1068 ms 67440 KB Output is correct
42 Correct 1112 ms 66956 KB Output is correct
43 Correct 68 ms 20724 KB Output is correct
44 Correct 1034 ms 67312 KB Output is correct
45 Correct 1008 ms 67020 KB Output is correct
46 Correct 944 ms 67260 KB Output is correct
47 Correct 488 ms 66516 KB Output is correct
48 Correct 488 ms 66416 KB Output is correct
49 Correct 556 ms 66672 KB Output is correct
50 Correct 705 ms 66740 KB Output is correct
51 Correct 568 ms 66780 KB Output is correct
52 Correct 1480 ms 78296 KB Output is correct
53 Correct 1453 ms 75888 KB Output is correct
54 Correct 1671 ms 73328 KB Output is correct
55 Correct 1115 ms 71156 KB Output is correct
56 Correct 1147 ms 73072 KB Output is correct
57 Correct 1135 ms 68548 KB Output is correct
58 Correct 1199 ms 71024 KB Output is correct
59 Correct 1241 ms 72944 KB Output is correct
60 Correct 1109 ms 68332 KB Output is correct
61 Correct 99 ms 32084 KB Output is correct
62 Correct 1473 ms 78612 KB Output is correct
63 Correct 1704 ms 74108 KB Output is correct
64 Correct 1639 ms 72088 KB Output is correct
65 Correct 1465 ms 69232 KB Output is correct
66 Correct 1137 ms 67444 KB Output is correct
67 Correct 223 ms 24816 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14592 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 16 ms 14720 KB Output is correct
7 Correct 16 ms 14592 KB Output is correct
8 Correct 16 ms 14720 KB Output is correct
9 Correct 15 ms 14720 KB Output is correct
10 Correct 16 ms 14720 KB Output is correct
11 Correct 15 ms 14720 KB Output is correct
12 Correct 15 ms 14720 KB Output is correct
13 Correct 15 ms 14720 KB Output is correct
14 Correct 15 ms 14720 KB Output is correct
15 Correct 15 ms 14720 KB Output is correct
16 Correct 15 ms 14720 KB Output is correct
17 Correct 15 ms 14720 KB Output is correct
18 Correct 16 ms 14720 KB Output is correct
19 Correct 16 ms 14720 KB Output is correct
20 Correct 16 ms 14720 KB Output is correct
21 Correct 14 ms 14592 KB Output is correct
22 Correct 16 ms 14720 KB Output is correct
23 Correct 17 ms 14720 KB Output is correct
24 Correct 16 ms 14720 KB Output is correct
25 Correct 20 ms 14720 KB Output is correct
26 Correct 16 ms 14720 KB Output is correct
27 Correct 14 ms 14592 KB Output is correct
28 Correct 15 ms 14720 KB Output is correct
29 Correct 15 ms 14720 KB Output is correct
30 Correct 15 ms 14720 KB Output is correct
31 Correct 1783 ms 71024 KB Output is correct
32 Correct 108 ms 20916 KB Output is correct
33 Correct 1517 ms 68496 KB Output is correct
34 Correct 1576 ms 68992 KB Output is correct
35 Correct 1694 ms 70896 KB Output is correct
36 Correct 1682 ms 70644 KB Output is correct
37 Correct 1008 ms 67432 KB Output is correct
38 Correct 1008 ms 66928 KB Output is correct
39 Correct 667 ms 66424 KB Output is correct
40 Correct 717 ms 66928 KB Output is correct
41 Correct 1068 ms 67440 KB Output is correct
42 Correct 1112 ms 66956 KB Output is correct
43 Correct 68 ms 20724 KB Output is correct
44 Correct 1034 ms 67312 KB Output is correct
45 Correct 1008 ms 67020 KB Output is correct
46 Correct 944 ms 67260 KB Output is correct
47 Correct 488 ms 66516 KB Output is correct
48 Correct 488 ms 66416 KB Output is correct
49 Correct 556 ms 66672 KB Output is correct
50 Correct 705 ms 66740 KB Output is correct
51 Correct 568 ms 66780 KB Output is correct
52 Execution timed out 5083 ms 323004 KB Time limit exceeded
53 Halted 0 ms 0 KB -