oj.uz

답안 #622980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622980 2022-08-04T22:28:17 Z izanbf Examination (JOI19_examination) C++14
100 / 100
 1748 ms 62080 KB 
#include <bits/stdc++.h>
using namespace std;
 
struct Point {
	int x, y, z;
};
 
struct Query {
	int a, b, c, id;
};
 
const int B = 750;
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);
		}
 
		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);
				over_block.pop_back();
			}

			cnt_over = bit_sum(q.b, sz-1);
 
			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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 14 ms 2192 KB Output is correct
8 Correct 13 ms 2132 KB Output is correct
9 Correct 14 ms 2132 KB Output is correct
10 Correct 10 ms 1620 KB Output is correct
11 Correct 11 ms 1620 KB Output is correct
12 Correct 7 ms 468 KB Output is correct
13 Correct 13 ms 1888 KB Output is correct
14 Correct 13 ms 1936 KB Output is correct
15 Correct 11 ms 1876 KB Output is correct
16 Correct 6 ms 1108 KB Output is correct
17 Correct 7 ms 1236 KB Output is correct
18 Correct 3 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 257 ms 19240 KB Output is correct
2 Correct 257 ms 19260 KB Output is correct
3 Correct 249 ms 19328 KB Output is correct
4 Correct 197 ms 16060 KB Output is correct
5 Correct 271 ms 15848 KB Output is correct
6 Correct 112 ms 6084 KB Output is correct
7 Correct 335 ms 19312 KB Output is correct
8 Correct 265 ms 19132 KB Output is correct
9 Correct 324 ms 18864 KB Output is correct
10 Correct 180 ms 15224 KB Output is correct
11 Correct 176 ms 15164 KB Output is correct
12 Correct 99 ms 6200 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 257 ms 19240 KB Output is correct
2 Correct 257 ms 19260 KB Output is correct
3 Correct 249 ms 19328 KB Output is correct
4 Correct 197 ms 16060 KB Output is correct
5 Correct 271 ms 15848 KB Output is correct
6 Correct 112 ms 6084 KB Output is correct
7 Correct 335 ms 19312 KB Output is correct
8 Correct 265 ms 19132 KB Output is correct
9 Correct 324 ms 18864 KB Output is correct
10 Correct 180 ms 15224 KB Output is correct
11 Correct 176 ms 15164 KB Output is correct
12 Correct 99 ms 6200 KB Output is correct
13 Correct 1084 ms 21644 KB Output is correct
14 Correct 844 ms 19536 KB Output is correct
15 Correct 249 ms 19260 KB Output is correct
16 Correct 700 ms 16716 KB Output is correct
17 Correct 655 ms 16792 KB Output is correct
18 Correct 198 ms 6756 KB Output is correct
19 Correct 1037 ms 21724 KB Output is correct
20 Correct 1033 ms 20544 KB Output is correct
21 Correct 1008 ms 21700 KB Output is correct
22 Correct 181 ms 15292 KB Output is correct
23 Correct 179 ms 15352 KB Output is correct
24 Correct 96 ms 6132 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 14 ms 2192 KB Output is correct
8 Correct 13 ms 2132 KB Output is correct
9 Correct 14 ms 2132 KB Output is correct
10 Correct 10 ms 1620 KB Output is correct
11 Correct 11 ms 1620 KB Output is correct
12 Correct 7 ms 468 KB Output is correct
13 Correct 13 ms 1888 KB Output is correct
14 Correct 13 ms 1936 KB Output is correct
15 Correct 11 ms 1876 KB Output is correct
16 Correct 6 ms 1108 KB Output is correct
17 Correct 7 ms 1236 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 257 ms 19240 KB Output is correct
20 Correct 257 ms 19260 KB Output is correct
21 Correct 249 ms 19328 KB Output is correct
22 Correct 197 ms 16060 KB Output is correct
23 Correct 271 ms 15848 KB Output is correct
24 Correct 112 ms 6084 KB Output is correct
25 Correct 335 ms 19312 KB Output is correct
26 Correct 265 ms 19132 KB Output is correct
27 Correct 324 ms 18864 KB Output is correct
28 Correct 180 ms 15224 KB Output is correct
29 Correct 176 ms 15164 KB Output is correct
30 Correct 99 ms 6200 KB Output is correct
31 Correct 1084 ms 21644 KB Output is correct
32 Correct 844 ms 19536 KB Output is correct
33 Correct 249 ms 19260 KB Output is correct
34 Correct 700 ms 16716 KB Output is correct
35 Correct 655 ms 16792 KB Output is correct
36 Correct 198 ms 6756 KB Output is correct
37 Correct 1037 ms 21724 KB Output is correct
38 Correct 1033 ms 20544 KB Output is correct
39 Correct 1008 ms 21700 KB Output is correct
40 Correct 181 ms 15292 KB Output is correct
41 Correct 179 ms 15352 KB Output is correct
42 Correct 96 ms 6132 KB Output is correct
43 Correct 1748 ms 62080 KB Output is correct
44 Correct 1715 ms 62072 KB Output is correct
45 Correct 1508 ms 61920 KB Output is correct
46 Correct 1236 ms 44900 KB Output is correct
47 Correct 1037 ms 44956 KB Output is correct
48 Correct 171 ms 6576 KB Output is correct
49 Correct 1423 ms 61804 KB Output is correct
50 Correct 1719 ms 62016 KB Output is correct
51 Correct 1323 ms 61868 KB Output is correct
52 Correct 691 ms 34548 KB Output is correct
53 Correct 280 ms 26256 KB Output is correct