oj.uz

Submission #103153

# Submission time Handle Problem Language Result Execution time Memory
103153 2019-03-29T06:55:28 Z E869120 New Home (APIO18_new_home) C++14
47 / 100
 3580 ms 142856 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#pragma warning (disable: 4996)

class SegmentTree {
public:
	vector<priority_queue<pair<int, int>, vector<pair<int, int>>, less<pair<int, int>>>>dat;
	vector<bool> used; vector<int> cl, cr;
	int size_ = 1;

	void init(int sz) {
		while (size_ <= sz) size_ *= 2;
		dat.resize(size_ * 2);
	}
	void add_(int l, int r, int a, int b, int x, int u) {
		if (l <= a && b <= r) { dat[u].push(make_pair(x, used.size())); return; }
		if (r <= a || b <= l) return;

		add_(l, r, a, (a + b) >> 1, x, u * 2);
		add_(l, r, (a + b) >> 1, b, x, u * 2 + 1);
	}
	int add(int l, int r, int x) {
		add_(l, r, 0, size_, x, 1);
		used.push_back(false); cl.push_back(l); cr.push_back(r);
		return used.size() - 1;
	}
	void query(int l, int r, int a, int b, int u) {
		if (l <= a && b <= r) {
			while (!dat[u].empty()) {
				int t = dat[u].top().second;
				if (used[t] == true) dat[u].pop();
				else break;
			}
			return;
		}
		if (r <= a || b <= l) return;

		query(l, r, a, (a + b) >> 1, u * 2);
		query(l, r, (a + b) >> 1, b, u * 2 + 1);
	}
	void dels(int num) {
		used[num] = true;
		query(cl[num], cr[num], 0, size_, 1);
	}
	
	int answer(int pos) {
		pos += size_; int ans = -(1 << 30);

		while (pos >= 1) {
			if (!dat[pos].empty()) ans = max(ans, dat[pos].top().first);
			pos >>= 1;
		}
		return ans;
	}
};

const int MAX_N = (1 << 17);

int N, K, Q, R, X[MAX_N], T[MAX_N], A[MAX_N], B[MAX_N], L[MAX_N], Y[MAX_N], Answer[MAX_N], cnt1[MAX_N], cnt;
set<pair<int, int>> dishes[MAX_N]; map<tuple<int, int, int>, int>Map;

SegmentTree V1, V2; vector<int>VX; vector<tuple<int, int, int>>vec;

void delete_vision(int cl, int cr) {
	if (R == 1) return;
	if (cr != -2) V1.dels(Map[make_tuple(cl, cr, 1)]);
	if (cl != -1) V2.dels(Map[make_tuple(cl, cr, 2)]);
}

void add_vision(int cl, int cr) {
	if (R == 1) {
		if (cl != -1 && cr != -2) VX.push_back((X[cl] + X[cr]) / 2);
		return;
	}
	if (cl != -1 && cr != -2) {
		int pos1 = lower_bound(VX.begin(), VX.end(), X[cl]) - VX.begin();
		int pos2 = lower_bound(VX.begin(), VX.end(), (X[cl] + X[cr]) / 2) - VX.begin();
		int pos3 = lower_bound(VX.begin(), VX.end(), X[cr]) - VX.begin();

		int Z1 = V1.add(pos2, pos3 + 1, X[cr]); Map[make_tuple(cl, cr, 1)] = Z1;
		int Z2 = V2.add(pos1, pos2 + 1, -X[cl]); Map[make_tuple(cl, cr, 2)] = Z2;
	}
	else if (cr != -2) {
		int pos1 = lower_bound(VX.begin(), VX.end(), X[cr]) - VX.begin();
		
		int Z1 = V1.add(0, pos1 + 1, X[cr]); Map[make_tuple(cl, cr, 1)] = Z1;
	}
	else if (cl != -1) {
		int pos1 = lower_bound(VX.begin(), VX.end(), X[cl]) - VX.begin();

		int Z2 = V2.add(pos1, VX.size() + 1, -X[cl]); Map[make_tuple(cl, cr, 2)] = Z2;
	}
}

void delete_relation(int ty, int pos) {
	if (ty == 1) {
		// 2 点の場合
		auto itr1 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos));
		auto itr2 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos));

		int P1 = -1; if (itr1 != dishes[T[pos]].begin()) { itr1--; P1 = (*itr1).second; }
		int P2 = -2; if (itr2 != dishes[T[pos]].end()) { P2 = (*itr2).second; }

		delete_vision(P1, P2);
	}
	if (ty == 2) {
		auto itr1 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos));
		auto itr2 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos + 1));

		int P1 = -1; if (itr1 != dishes[T[pos]].begin()) { itr1--; P1 = (*itr1).second; }
		int P2 = -2; if (itr2 != dishes[T[pos]].end()) { P2 = (*itr2).second; }

		delete_vision(P1, pos);
		delete_vision(pos, P2);
	}
}

void add_relation(int ty, int pos) {
	if (ty == 1) {
		// 3 点の場合
		auto itr1 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos));
		auto itr2 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos + 1));

		int P1 = -1; if (itr1 != dishes[T[pos]].begin()) { itr1--; P1 = (*itr1).second; }
		int P2 = -2; if (itr2 != dishes[T[pos]].end()) { P2 = (*itr2).second; }

		add_vision(P1, pos);
		add_vision(pos, P2);
	}
	if (ty == 2) {
		// 2 点の場合
		auto itr1 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos));
		auto itr2 = dishes[T[pos]].lower_bound(make_pair(X[pos], pos));

		int P1 = -1; if (itr1 != dishes[T[pos]].begin()) { itr1--; P1 = (*itr1).second; }
		int P2 = -2; if (itr2 != dishes[T[pos]].end()) { P2 = (*itr2).second; }

		add_vision(P1, P2);
	}
}

void add(int pos) {
	cnt1[T[pos]]++; if (cnt1[T[pos]] == 1) cnt++;
	delete_relation(1, pos);
	dishes[T[pos]].insert(make_pair(X[pos], pos));
	add_relation(1, pos);
}

void lose(int pos) {
	cnt1[T[pos]]--; if (cnt1[T[pos]] == 0) cnt--;

	delete_relation(2, pos);
	dishes[T[pos]].erase(make_pair(X[pos], pos));
	add_relation(2, pos);
}

int getval(int pos) {
	int pos1 = lower_bound(VX.begin(), VX.end(), pos) - VX.begin();
	int val1 = V1.answer(pos1) - pos;

	int pos2 = lower_bound(VX.begin(), VX.end(), pos) - VX.begin();
	int val2 = V2.answer(pos2) + pos;

	return max(val1, val2);
}

int main() {
	scanf("%d%d%d", &N, &K, &Q);
	for (int i = 1; i <= N; i++) {
		scanf("%d%d%d%d", &X[i], &T[i], &A[i], &B[i]);
		vec.push_back(make_tuple(A[i], 1, i)); vec.push_back(make_tuple(B[i], 3, i)); X[i] *= 2;
	}
	for (int i = 1; i <= Q; i++) {
		scanf("%d%d", &L[i], &Y[i]);
		L[i] *= 2;
		vec.push_back(make_tuple(Y[i], 2, i));
	}
	for (int i = 1; i <= N; i++) VX.push_back(X[i]);
	for (int i = 1; i <= Q; i++) VX.push_back(L[i]);

	sort(vec.begin(), vec.end());
	sort(VX.begin(), VX.end());

	// まず 1 回シミュレーションを行う
	R = 1;

	for (int i = 0; i < vec.size(); i++) {
		if (get<1>(vec[i]) == 1) {
			add(get<2>(vec[i]));
		}
		if (get<1>(vec[i]) == 3) {
			lose(get<2>(vec[i]));
		}
	}

	sort(VX.begin(), VX.end());
	VX.erase(unique(VX.begin(), VX.end()), VX.end());
	V1.init(VX.size() + 2);
	V2.init(VX.size() + 2);
	
	// 次に、本シミュレーション
	R = 2;

	for (int i = 0; i < vec.size(); i++) {
		if (get<1>(vec[i]) == 1) {
			add(get<2>(vec[i]));
		}
		if (get<1>(vec[i]) == 2) {
			Answer[get<2>(vec[i])] = getval(L[get<2>(vec[i])]);
			if (cnt != K) Answer[get<2>(vec[i])] = -2;
		}
		if (get<1>(vec[i]) == 3) {
			lose(get<2>(vec[i]));
		}
	}

	for (int i = 1; i <= Q; i++) printf("%d\n", Answer[i] / 2);
	return 0;
}

Compilation message

new_home.cpp:10:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
new_home.cpp: In function 'int main()':
new_home.cpp:194:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vec.size(); i++) {
                  ~~^~~~~~~~~~~~
new_home.cpp:211:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vec.size(); i++) {
                  ~~^~~~~~~~~~~~
new_home.cpp:175:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &N, &K, &Q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:177:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &X[i], &T[i], &A[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:181:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &L[i], &Y[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6528 KB Output is correct
2 Correct 6 ms 6528 KB Output is correct
3 Correct 11 ms 6520 KB Output is correct
4 Correct 8 ms 6528 KB Output is correct
5 Correct 11 ms 6704 KB Output is correct
6 Correct 15 ms 7168 KB Output is correct
7 Correct 10 ms 6780 KB Output is correct
8 Correct 12 ms 7040 KB Output is correct
9 Correct 10 ms 6912 KB Output is correct
10 Correct 17 ms 7140 KB Output is correct
11 Correct 13 ms 6984 KB Output is correct
12 Correct 14 ms 7168 KB Output is correct
13 Correct 10 ms 6784 KB Output is correct
14 Correct 10 ms 7040 KB Output is correct
15 Correct 13 ms 7040 KB Output is correct
16 Correct 11 ms 7040 KB Output is correct
17 Correct 17 ms 7040 KB Output is correct
18 Correct 14 ms 7012 KB Output is correct
19 Correct 13 ms 7012 KB Output is correct
20 Correct 11 ms 7168 KB Output is correct
21 Correct 10 ms 6628 KB Output is correct
22 Correct 12 ms 6884 KB Output is correct
23 Correct 10 ms 6912 KB Output is correct
24 Correct 11 ms 7040 KB Output is correct
25 Correct 13 ms 7140 KB Output is correct
26 Correct 12 ms 7040 KB Output is correct
27 Correct 11 ms 6720 KB Output is correct
28 Correct 15 ms 7040 KB Output is correct
29 Correct 11 ms 7040 KB Output is correct
30 Correct 10 ms 6784 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6528 KB Output is correct
2 Correct 6 ms 6528 KB Output is correct
3 Correct 11 ms 6520 KB Output is correct
4 Correct 8 ms 6528 KB Output is correct
5 Correct 11 ms 6704 KB Output is correct
6 Correct 15 ms 7168 KB Output is correct
7 Correct 10 ms 6780 KB Output is correct
8 Correct 12 ms 7040 KB Output is correct
9 Correct 10 ms 6912 KB Output is correct
10 Correct 17 ms 7140 KB Output is correct
11 Correct 13 ms 6984 KB Output is correct
12 Correct 14 ms 7168 KB Output is correct
13 Correct 10 ms 6784 KB Output is correct
14 Correct 10 ms 7040 KB Output is correct
15 Correct 13 ms 7040 KB Output is correct
16 Correct 11 ms 7040 KB Output is correct
17 Correct 17 ms 7040 KB Output is correct
18 Correct 14 ms 7012 KB Output is correct
19 Correct 13 ms 7012 KB Output is correct
20 Correct 11 ms 7168 KB Output is correct
21 Correct 10 ms 6628 KB Output is correct
22 Correct 12 ms 6884 KB Output is correct
23 Correct 10 ms 6912 KB Output is correct
24 Correct 11 ms 7040 KB Output is correct
25 Correct 13 ms 7140 KB Output is correct
26 Correct 12 ms 7040 KB Output is correct
27 Correct 11 ms 6720 KB Output is correct
28 Correct 15 ms 7040 KB Output is correct
29 Correct 11 ms 7040 KB Output is correct
30 Correct 10 ms 6784 KB Output is correct
31 Correct 3468 ms 142856 KB Output is correct
32 Correct 769 ms 41392 KB Output is correct
33 Correct 2633 ms 127516 KB Output is correct
34 Correct 3580 ms 142404 KB Output is correct
35 Correct 3438 ms 140492 KB Output is correct
36 Correct 2891 ms 129244 KB Output is correct
37 Correct 2218 ms 129140 KB Output is correct
38 Correct 1726 ms 125412 KB Output is correct
39 Correct 1264 ms 124512 KB Output is correct
40 Correct 1288 ms 124896 KB Output is correct
41 Correct 2322 ms 84240 KB Output is correct
42 Correct 2275 ms 87728 KB Output is correct
43 Correct 327 ms 36068 KB Output is correct
44 Correct 2109 ms 86032 KB Output is correct
45 Correct 1818 ms 80608 KB Output is correct
46 Correct 1541 ms 79428 KB Output is correct
47 Correct 667 ms 75708 KB Output is correct
48 Correct 640 ms 76020 KB Output is correct
49 Correct 892 ms 79532 KB Output is correct
50 Correct 1073 ms 85600 KB Output is correct
51 Correct 962 ms 78404 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 71 ms 14816 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 82 ms 14820 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6528 KB Output is correct
2 Correct 6 ms 6528 KB Output is correct
3 Correct 11 ms 6520 KB Output is correct
4 Correct 8 ms 6528 KB Output is correct
5 Correct 11 ms 6704 KB Output is correct
6 Correct 15 ms 7168 KB Output is correct
7 Correct 10 ms 6780 KB Output is correct
8 Correct 12 ms 7040 KB Output is correct
9 Correct 10 ms 6912 KB Output is correct
10 Correct 17 ms 7140 KB Output is correct
11 Correct 13 ms 6984 KB Output is correct
12 Correct 14 ms 7168 KB Output is correct
13 Correct 10 ms 6784 KB Output is correct
14 Correct 10 ms 7040 KB Output is correct
15 Correct 13 ms 7040 KB Output is correct
16 Correct 11 ms 7040 KB Output is correct
17 Correct 17 ms 7040 KB Output is correct
18 Correct 14 ms 7012 KB Output is correct
19 Correct 13 ms 7012 KB Output is correct
20 Correct 11 ms 7168 KB Output is correct
21 Correct 10 ms 6628 KB Output is correct
22 Correct 12 ms 6884 KB Output is correct
23 Correct 10 ms 6912 KB Output is correct
24 Correct 11 ms 7040 KB Output is correct
25 Correct 13 ms 7140 KB Output is correct
26 Correct 12 ms 7040 KB Output is correct
27 Correct 11 ms 6720 KB Output is correct
28 Correct 15 ms 7040 KB Output is correct
29 Correct 11 ms 7040 KB Output is correct
30 Correct 10 ms 6784 KB Output is correct
31 Correct 3468 ms 142856 KB Output is correct
32 Correct 769 ms 41392 KB Output is correct
33 Correct 2633 ms 127516 KB Output is correct
34 Correct 3580 ms 142404 KB Output is correct
35 Correct 3438 ms 140492 KB Output is correct
36 Correct 2891 ms 129244 KB Output is correct
37 Correct 2218 ms 129140 KB Output is correct
38 Correct 1726 ms 125412 KB Output is correct
39 Correct 1264 ms 124512 KB Output is correct
40 Correct 1288 ms 124896 KB Output is correct
41 Correct 2322 ms 84240 KB Output is correct
42 Correct 2275 ms 87728 KB Output is correct
43 Correct 327 ms 36068 KB Output is correct
44 Correct 2109 ms 86032 KB Output is correct
45 Correct 1818 ms 80608 KB Output is correct
46 Correct 1541 ms 79428 KB Output is correct
47 Correct 667 ms 75708 KB Output is correct
48 Correct 640 ms 76020 KB Output is correct
49 Correct 892 ms 79532 KB Output is correct
50 Correct 1073 ms 85600 KB Output is correct
51 Correct 962 ms 78404 KB Output is correct
52 Correct 1273 ms 57432 KB Output is correct
53 Correct 1209 ms 53268 KB Output is correct
54 Correct 2361 ms 98332 KB Output is correct
55 Correct 1650 ms 85408 KB Output is correct
56 Correct 1562 ms 84196 KB Output is correct
57 Correct 2049 ms 89056 KB Output is correct
58 Correct 1858 ms 86128 KB Output is correct
59 Correct 1559 ms 84172 KB Output is correct
60 Correct 1913 ms 89872 KB Output is correct
61 Correct 248 ms 26852 KB Output is correct
62 Correct 1159 ms 59492 KB Output is correct
63 Correct 1808 ms 88484 KB Output is correct
64 Correct 1902 ms 93772 KB Output is correct
65 Correct 2185 ms 96132 KB Output is correct
66 Correct 2171 ms 88908 KB Output is correct
67 Correct 815 ms 39124 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6528 KB Output is correct
2 Correct 6 ms 6528 KB Output is correct
3 Correct 11 ms 6520 KB Output is correct
4 Correct 8 ms 6528 KB Output is correct
5 Correct 11 ms 6704 KB Output is correct
6 Correct 15 ms 7168 KB Output is correct
7 Correct 10 ms 6780 KB Output is correct
8 Correct 12 ms 7040 KB Output is correct
9 Correct 10 ms 6912 KB Output is correct
10 Correct 17 ms 7140 KB Output is correct
11 Correct 13 ms 6984 KB Output is correct
12 Correct 14 ms 7168 KB Output is correct
13 Correct 10 ms 6784 KB Output is correct
14 Correct 10 ms 7040 KB Output is correct
15 Correct 13 ms 7040 KB Output is correct
16 Correct 11 ms 7040 KB Output is correct
17 Correct 17 ms 7040 KB Output is correct
18 Correct 14 ms 7012 KB Output is correct
19 Correct 13 ms 7012 KB Output is correct
20 Correct 11 ms 7168 KB Output is correct
21 Correct 10 ms 6628 KB Output is correct
22 Correct 12 ms 6884 KB Output is correct
23 Correct 10 ms 6912 KB Output is correct
24 Correct 11 ms 7040 KB Output is correct
25 Correct 13 ms 7140 KB Output is correct
26 Correct 12 ms 7040 KB Output is correct
27 Correct 11 ms 6720 KB Output is correct
28 Correct 15 ms 7040 KB Output is correct
29 Correct 11 ms 7040 KB Output is correct
30 Correct 10 ms 6784 KB Output is correct
31 Correct 3468 ms 142856 KB Output is correct
32 Correct 769 ms 41392 KB Output is correct
33 Correct 2633 ms 127516 KB Output is correct
34 Correct 3580 ms 142404 KB Output is correct
35 Correct 3438 ms 140492 KB Output is correct
36 Correct 2891 ms 129244 KB Output is correct
37 Correct 2218 ms 129140 KB Output is correct
38 Correct 1726 ms 125412 KB Output is correct
39 Correct 1264 ms 124512 KB Output is correct
40 Correct 1288 ms 124896 KB Output is correct
41 Correct 2322 ms 84240 KB Output is correct
42 Correct 2275 ms 87728 KB Output is correct
43 Correct 327 ms 36068 KB Output is correct
44 Correct 2109 ms 86032 KB Output is correct
45 Correct 1818 ms 80608 KB Output is correct
46 Correct 1541 ms 79428 KB Output is correct
47 Correct 667 ms 75708 KB Output is correct
48 Correct 640 ms 76020 KB Output is correct
49 Correct 892 ms 79532 KB Output is correct
50 Correct 1073 ms 85600 KB Output is correct
51 Correct 962 ms 78404 KB Output is correct
52 Execution timed out 71 ms 14816 KB Time limit exceeded (wall clock)
53 Halted 0 ms 0 KB -