oj.uz

답안 #622979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622979 2022-08-04T22:27:06 Z izanbf Examination (JOI19_examination) C++14
100 / 100
 1907 ms 62184 KB 
#include <bits/stdc++.h>
using namespace std;
 
struct Point {
	int x, y, z;
};
 
struct Query {
	int a, b, c, id;
};
 
const int B = 600;
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 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 19 ms 2132 KB Output is correct
8 Correct 15 ms 2104 KB Output is correct
9 Correct 14 ms 2132 KB Output is correct
10 Correct 10 ms 1592 KB Output is correct
11 Correct 10 ms 1672 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 10 ms 1876 KB Output is correct
14 Correct 10 ms 1896 KB Output is correct
15 Correct 10 ms 1876 KB Output is correct
16 Correct 6 ms 1108 KB Output is correct
17 Correct 7 ms 1348 KB Output is correct
18 Correct 3 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 256 ms 19272 KB Output is correct
2 Correct 244 ms 19376 KB Output is correct
3 Correct 274 ms 19252 KB Output is correct
4 Correct 179 ms 15920 KB Output is correct
5 Correct 299 ms 15952 KB Output is correct
6 Correct 101 ms 6140 KB Output is correct
7 Correct 300 ms 19260 KB Output is correct
8 Correct 252 ms 19252 KB Output is correct
9 Correct 309 ms 18848 KB Output is correct
10 Correct 166 ms 15176 KB Output is correct
11 Correct 180 ms 15220 KB Output is correct
12 Correct 86 ms 6140 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 256 ms 19272 KB Output is correct
2 Correct 244 ms 19376 KB Output is correct
3 Correct 274 ms 19252 KB Output is correct
4 Correct 179 ms 15920 KB Output is correct
5 Correct 299 ms 15952 KB Output is correct
6 Correct 101 ms 6140 KB Output is correct
7 Correct 300 ms 19260 KB Output is correct
8 Correct 252 ms 19252 KB Output is correct
9 Correct 309 ms 18848 KB Output is correct
10 Correct 166 ms 15176 KB Output is correct
11 Correct 180 ms 15220 KB Output is correct
12 Correct 86 ms 6140 KB Output is correct
13 Correct 1203 ms 21912 KB Output is correct
14 Correct 971 ms 19672 KB Output is correct
15 Correct 242 ms 19212 KB Output is correct
16 Correct 852 ms 16908 KB Output is correct
17 Correct 745 ms 16900 KB Output is correct
18 Correct 178 ms 6740 KB Output is correct
19 Correct 1164 ms 21904 KB Output is correct
20 Correct 1164 ms 20528 KB Output is correct
21 Correct 1070 ms 21768 KB Output is correct
22 Correct 213 ms 15212 KB Output is correct
23 Correct 170 ms 15264 KB Output is correct
24 Correct 87 ms 6200 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 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 19 ms 2132 KB Output is correct
8 Correct 15 ms 2104 KB Output is correct
9 Correct 14 ms 2132 KB Output is correct
10 Correct 10 ms 1592 KB Output is correct
11 Correct 10 ms 1672 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 10 ms 1876 KB Output is correct
14 Correct 10 ms 1896 KB Output is correct
15 Correct 10 ms 1876 KB Output is correct
16 Correct 6 ms 1108 KB Output is correct
17 Correct 7 ms 1348 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 256 ms 19272 KB Output is correct
20 Correct 244 ms 19376 KB Output is correct
21 Correct 274 ms 19252 KB Output is correct
22 Correct 179 ms 15920 KB Output is correct
23 Correct 299 ms 15952 KB Output is correct
24 Correct 101 ms 6140 KB Output is correct
25 Correct 300 ms 19260 KB Output is correct
26 Correct 252 ms 19252 KB Output is correct
27 Correct 309 ms 18848 KB Output is correct
28 Correct 166 ms 15176 KB Output is correct
29 Correct 180 ms 15220 KB Output is correct
30 Correct 86 ms 6140 KB Output is correct
31 Correct 1203 ms 21912 KB Output is correct
32 Correct 971 ms 19672 KB Output is correct
33 Correct 242 ms 19212 KB Output is correct
34 Correct 852 ms 16908 KB Output is correct
35 Correct 745 ms 16900 KB Output is correct
36 Correct 178 ms 6740 KB Output is correct
37 Correct 1164 ms 21904 KB Output is correct
38 Correct 1164 ms 20528 KB Output is correct
39 Correct 1070 ms 21768 KB Output is correct
40 Correct 213 ms 15212 KB Output is correct
41 Correct 170 ms 15264 KB Output is correct
42 Correct 87 ms 6200 KB Output is correct
43 Correct 1877 ms 62104 KB Output is correct
44 Correct 1907 ms 62120 KB Output is correct
45 Correct 1596 ms 61972 KB Output is correct
46 Correct 1306 ms 45068 KB Output is correct
47 Correct 1054 ms 45188 KB Output is correct
48 Correct 165 ms 6504 KB Output is correct
49 Correct 1485 ms 61952 KB Output is correct
50 Correct 1788 ms 62184 KB Output is correct
51 Correct 1484 ms 62100 KB Output is correct
52 Correct 759 ms 34740 KB Output is correct
53 Correct 265 ms 26356 KB Output is correct