oj.uz

답안 #622978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622978 2022-08-04T22:25:57 Z izanbf Examination (JOI19_examination) C++14
100 / 100
 2096 ms 62396 KB 
#include <bits/stdc++.h>
using namespace std;
 
struct Point {
	int x, y, z;
};
 
struct Query {
	int a, b, c, id;
};
 
const int B = 500;
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 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 16 ms 2088 KB Output is correct
8 Correct 13 ms 2132 KB Output is correct
9 Correct 13 ms 2132 KB Output is correct
10 Correct 9 ms 1620 KB Output is correct
11 Correct 10 ms 1668 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 10 ms 1876 KB Output is correct
14 Correct 10 ms 1900 KB Output is correct
15 Correct 10 ms 1876 KB Output is correct
16 Correct 5 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 242 ms 19336 KB Output is correct
2 Correct 275 ms 19248 KB Output is correct
3 Correct 233 ms 19200 KB Output is correct
4 Correct 206 ms 15920 KB Output is correct
5 Correct 222 ms 15944 KB Output is correct
6 Correct 101 ms 6128 KB Output is correct
7 Correct 323 ms 19148 KB Output is correct
8 Correct 240 ms 19300 KB Output is correct
9 Correct 257 ms 18748 KB Output is correct
10 Correct 161 ms 15176 KB Output is correct
11 Correct 194 ms 15184 KB Output is correct
12 Correct 87 ms 6108 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 242 ms 19336 KB Output is correct
2 Correct 275 ms 19248 KB Output is correct
3 Correct 233 ms 19200 KB Output is correct
4 Correct 206 ms 15920 KB Output is correct
5 Correct 222 ms 15944 KB Output is correct
6 Correct 101 ms 6128 KB Output is correct
7 Correct 323 ms 19148 KB Output is correct
8 Correct 240 ms 19300 KB Output is correct
9 Correct 257 ms 18748 KB Output is correct
10 Correct 161 ms 15176 KB Output is correct
11 Correct 194 ms 15184 KB Output is correct
12 Correct 87 ms 6108 KB Output is correct
13 Correct 1409 ms 21996 KB Output is correct
14 Correct 1118 ms 19744 KB Output is correct
15 Correct 227 ms 19336 KB Output is correct
16 Correct 895 ms 16476 KB Output is correct
17 Correct 838 ms 16476 KB Output is correct
18 Correct 164 ms 6740 KB Output is correct
19 Correct 1342 ms 21964 KB Output is correct
20 Correct 1360 ms 20672 KB Output is correct
21 Correct 1223 ms 21928 KB Output is correct
22 Correct 176 ms 15272 KB Output is correct
23 Correct 167 ms 15300 KB Output is correct
24 Correct 80 ms 6204 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 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 16 ms 2088 KB Output is correct
8 Correct 13 ms 2132 KB Output is correct
9 Correct 13 ms 2132 KB Output is correct
10 Correct 9 ms 1620 KB Output is correct
11 Correct 10 ms 1668 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 10 ms 1876 KB Output is correct
14 Correct 10 ms 1900 KB Output is correct
15 Correct 10 ms 1876 KB Output is correct
16 Correct 5 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 242 ms 19336 KB Output is correct
20 Correct 275 ms 19248 KB Output is correct
21 Correct 233 ms 19200 KB Output is correct
22 Correct 206 ms 15920 KB Output is correct
23 Correct 222 ms 15944 KB Output is correct
24 Correct 101 ms 6128 KB Output is correct
25 Correct 323 ms 19148 KB Output is correct
26 Correct 240 ms 19300 KB Output is correct
27 Correct 257 ms 18748 KB Output is correct
28 Correct 161 ms 15176 KB Output is correct
29 Correct 194 ms 15184 KB Output is correct
30 Correct 87 ms 6108 KB Output is correct
31 Correct 1409 ms 21996 KB Output is correct
32 Correct 1118 ms 19744 KB Output is correct
33 Correct 227 ms 19336 KB Output is correct
34 Correct 895 ms 16476 KB Output is correct
35 Correct 838 ms 16476 KB Output is correct
36 Correct 164 ms 6740 KB Output is correct
37 Correct 1342 ms 21964 KB Output is correct
38 Correct 1360 ms 20672 KB Output is correct
39 Correct 1223 ms 21928 KB Output is correct
40 Correct 176 ms 15272 KB Output is correct
41 Correct 167 ms 15300 KB Output is correct
42 Correct 80 ms 6204 KB Output is correct
43 Correct 2096 ms 62340 KB Output is correct
44 Correct 2043 ms 62356 KB Output is correct
45 Correct 1745 ms 62100 KB Output is correct
46 Correct 1363 ms 44764 KB Output is correct
47 Correct 1163 ms 44832 KB Output is correct
48 Correct 159 ms 6504 KB Output is correct
49 Correct 1575 ms 62128 KB Output is correct
50 Correct 1990 ms 62396 KB Output is correct
51 Correct 1563 ms 62200 KB Output is correct
52 Correct 850 ms 34336 KB Output is correct
53 Correct 286 ms 26176 KB Output is correct