oj.uz

답안 #622974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622974 2022-08-04T22:20:49 Z izanbf Examination (JOI19_examination) C++14
100 / 100
 2912 ms 67072 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define D(x) cerr << #x << " = " << x << ", "
 
struct Point {
	int x, y, z;
};
 
struct Query {
	int a, b, c, id;
};
 
const int B = 300;
const int MAXSZ = 6e5+9;

int bit[MAXSZ];  // binary/fenwick indexed tree
int sz; // bit size

int bit_sum(int r) {
    int ret = 0;
    for (; r >= 0; r = (r & (r + 1)) - 1)
        ret += bit[r];
    return ret;
}

int bit_sum(int l, int r) {
    return bit_sum(r) - bit_sum(l - 1);
}

void bit_add(int idx, int delta) {
    for (; idx < sz; idx = idx | (idx + 1))
        bit[idx] += delta;
}
 
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
 
	int N, Q;
	cin >> N >> Q;
 
	set<int> values;
 
	vector<Point> pts(N);
	for (int i = 0; i < N; ++i) {
		Point& p = pts[i];
		cin >> p.x >> p.y;
		p.z = p.x + p.y;
		values.insert(p.x);
		values.insert(p.y);
		values.insert(p.z);
	}
 
	vector<Query> qs(Q);
	for (int i = 0; i < Q; ++i) {
		Query& q = qs[i];
		cin >> q.a >> q.b >> q.c;
		q.id = i;
		values.insert(q.a);
		values.insert(q.b);
		values.insert(q.c);
	}
 
 
	unordered_map<int,int> comp;
	for (int v : values) {
		comp[v] = comp.size();
	}
 
	for (Query& q : qs) {
		q.a = comp[q.a];
		q.b = comp[q.b];
		q.c = comp[q.c];
	}
 
	for (Point& p : pts) {
		p.x = comp[p.x];
		p.y = comp[p.y];
		p.z = comp[p.z];
	}
 
	sz = comp.size() + 2;
 
	sort(qs.begin(), qs.end(), [](const Query& l, const Query& r) {
		return l.c < r.c;
	});
 
	sort(pts.begin(), pts.end(), [](const Point& l, const Point& r) {
		return l.z < r.z;
	});
 
	int blocks = (N+B-1)/B;
	vector<vector<Query>> block_queries(blocks);
	int j = 0;
 
	for (int block = 1; block < blocks; ++block) {
		int i = B*block;
		while (j < Q and qs[j].c <= pts[i].z) {
			block_queries[block-1].push_back(qs[j]);
			++j;
		}
	}
	while (j < Q) {
		block_queries.back().push_back(qs[j]);
		++j;
	}
 
	vector<int> ans(Q);
 
	for (int block = 0; block < blocks; ++block) {
		if (block_queries[block].empty()) continue;
 
		memset(bit, 0, sizeof(int)*sz);
 
		vector<Point> in_block;
		in_block.reserve(B);
		for (int i = B*block; i < N and i < B*(block+1); ++i) {
			in_block.push_back(pts[i]);
		}
 
		vector<Point> over_block;
		over_block.reserve(N-B*block);
		for (int i = B*(block+1); i < N; ++i) {
			over_block.push_back(pts[i]);
			bit_add(pts[i].y, 1); //heights.insert(pts[i].y);
		}
 
		sort(over_block.begin(), over_block.end(), [&](const Point& l, const Point& r) {
			return l.x > r.x;
		});
 
		sort(block_queries[block].begin(), block_queries[block].end(), [&](const Query& l, const Query& r) {
			return l.a < r.a;
		});
 
		for (const Query& q : block_queries[block]) {
			int cnt_in = 0;
			int cnt_over = 0;
 
			// points in block
			for (const Point& p : in_block) {
				if (p.x >= q.a and p.y >= q.b and p.z >= q.c) ++cnt_in;
			}
 
			// points over block
			while ((not over_block.empty()) and over_block.back().x < q.a) {
				const Point& p = over_block.back();
				bit_add(p.y, -1); // heights.erase(heights.find(p.y));
				over_block.pop_back();
			}
 
			/*for (int y : heights) {
				if (y >= q.b) {
					++cnt_over;
				}
			}*/

			cnt_over = bit_sum(q.b, sz-1);
 
			// D(q.id), D(block), D(in_block.size()), D(over_block.size()), D(cnt_in), D(cnt_over) << endl;
 
			ans[q.id] = cnt_in + cnt_over;
		}
	}
 
	for (int i = 0; i < Q; ++i) {
		cout << ans[i] << '\n';
	}
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 11 ms 2304 KB Output is correct
8 Correct 11 ms 2264 KB Output is correct
9 Correct 12 ms 2260 KB Output is correct
10 Correct 8 ms 1748 KB Output is correct
11 Correct 9 ms 1748 KB Output is correct
12 Correct 4 ms 584 KB Output is correct
13 Correct 9 ms 2004 KB Output is correct
14 Correct 9 ms 2076 KB Output is correct
15 Correct 10 ms 2004 KB Output is correct
16 Correct 5 ms 1116 KB Output is correct
17 Correct 8 ms 1364 KB Output is correct
18 Correct 4 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 221 ms 19472 KB Output is correct
2 Correct 221 ms 19564 KB Output is correct
3 Correct 236 ms 19376 KB Output is correct
4 Correct 171 ms 16060 KB Output is correct
5 Correct 186 ms 15964 KB Output is correct
6 Correct 79 ms 6380 KB Output is correct
7 Correct 260 ms 19204 KB Output is correct
8 Correct 236 ms 19260 KB Output is correct
9 Correct 220 ms 18864 KB Output is correct
10 Correct 157 ms 15396 KB Output is correct
11 Correct 147 ms 15460 KB Output is correct
12 Correct 70 ms 6456 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 221 ms 19472 KB Output is correct
2 Correct 221 ms 19564 KB Output is correct
3 Correct 236 ms 19376 KB Output is correct
4 Correct 171 ms 16060 KB Output is correct
5 Correct 186 ms 15964 KB Output is correct
6 Correct 79 ms 6380 KB Output is correct
7 Correct 260 ms 19204 KB Output is correct
8 Correct 236 ms 19260 KB Output is correct
9 Correct 220 ms 18864 KB Output is correct
10 Correct 157 ms 15396 KB Output is correct
11 Correct 147 ms 15460 KB Output is correct
12 Correct 70 ms 6456 KB Output is correct
13 Correct 1983 ms 22060 KB Output is correct
14 Correct 1651 ms 20000 KB Output is correct
15 Correct 313 ms 19508 KB Output is correct
16 Correct 1325 ms 17488 KB Output is correct
17 Correct 1165 ms 17468 KB Output is correct
18 Correct 136 ms 7048 KB Output is correct
19 Correct 2021 ms 22160 KB Output is correct
20 Correct 1916 ms 21088 KB Output is correct
21 Correct 1777 ms 22124 KB Output is correct
22 Correct 165 ms 15548 KB Output is correct
23 Correct 177 ms 15548 KB Output is correct
24 Correct 68 ms 6448 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 11 ms 2304 KB Output is correct
8 Correct 11 ms 2264 KB Output is correct
9 Correct 12 ms 2260 KB Output is correct
10 Correct 8 ms 1748 KB Output is correct
11 Correct 9 ms 1748 KB Output is correct
12 Correct 4 ms 584 KB Output is correct
13 Correct 9 ms 2004 KB Output is correct
14 Correct 9 ms 2076 KB Output is correct
15 Correct 10 ms 2004 KB Output is correct
16 Correct 5 ms 1116 KB Output is correct
17 Correct 8 ms 1364 KB Output is correct
18 Correct 4 ms 468 KB Output is correct
19 Correct 221 ms 19472 KB Output is correct
20 Correct 221 ms 19564 KB Output is correct
21 Correct 236 ms 19376 KB Output is correct
22 Correct 171 ms 16060 KB Output is correct
23 Correct 186 ms 15964 KB Output is correct
24 Correct 79 ms 6380 KB Output is correct
25 Correct 260 ms 19204 KB Output is correct
26 Correct 236 ms 19260 KB Output is correct
27 Correct 220 ms 18864 KB Output is correct
28 Correct 157 ms 15396 KB Output is correct
29 Correct 147 ms 15460 KB Output is correct
30 Correct 70 ms 6456 KB Output is correct
31 Correct 1983 ms 22060 KB Output is correct
32 Correct 1651 ms 20000 KB Output is correct
33 Correct 313 ms 19508 KB Output is correct
34 Correct 1325 ms 17488 KB Output is correct
35 Correct 1165 ms 17468 KB Output is correct
36 Correct 136 ms 7048 KB Output is correct
37 Correct 2021 ms 22160 KB Output is correct
38 Correct 1916 ms 21088 KB Output is correct
39 Correct 1777 ms 22124 KB Output is correct
40 Correct 165 ms 15548 KB Output is correct
41 Correct 177 ms 15548 KB Output is correct
42 Correct 68 ms 6448 KB Output is correct
43 Correct 2864 ms 62568 KB Output is correct
44 Correct 2912 ms 67072 KB Output is correct
45 Correct 2465 ms 66932 KB Output is correct
46 Correct 1899 ms 48812 KB Output is correct
47 Correct 1540 ms 48872 KB Output is correct
48 Correct 136 ms 7612 KB Output is correct
49 Correct 2131 ms 66752 KB Output is correct
50 Correct 2811 ms 67036 KB Output is correct
51 Correct 2004 ms 66672 KB Output is correct
52 Correct 1140 ms 38392 KB Output is correct
53 Correct 306 ms 28740 KB Output is correct