oj.uz

Submission #712811

# Submission time Handle Problem Language Result Execution time Memory
712811 2023-03-20T07:10:13 Z Gromp15 Examination (JOI19_examination) C++17
100 / 100
 810 ms 95556 KB 
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
struct fenwick {
	int n;
	vector<int> bit;
	fenwick() {}
	void resize(int a) {
		n = a, bit.resize(a+1);
	}
	void update(int pos, int x) {
		pos++;
		for (; pos <= n; pos += pos&-pos) {
			bit[pos] += x;
		}
	}
	int sum(int pos) {
		int s = 0;
		while (pos) {
			s += bit[pos], pos -= pos&-pos;
		}
		return s;
	}
	int query(int l, int r) {
		return sum(r+1) - sum(l);
	}
};
struct seg {
	int N;
	vector<fenwick> tree;
	vector<vector<int>> vals;
	vector<int> who;
	vector<int> L, R;
	seg(const vector<ar<int, 2>> &pts) {
		int each = 1;
		for (int i = 1; i < sz(pts); i++) each += pts[i][0] != pts[i-1][0];
		N = 1<<(__lg(each)+1);
		tree.resize(2*N), vals.resize(2*N), who.resize(each), L.resize(2*N, 1e9), R.resize(2*N, -1e9);
		for (int i = 0, c = 0; i < sz(pts); i++, c++) {
			int r = i;
			while (r+1 < sz(pts) && pts[r+1][0] == pts[r][0]) r++;
			for (int j = i; j <= r; j++) {
				vals[c+N].push_back(pts[j][1]);
			}
			tree[c+N].resize(r-i+1), L[c+N] = pts[i][0], R[c+N] = pts[i][0];
			who[c] = pts[i][0];
			i = r;
		}
		for (int i = N-1; i >= 1; i--) {
			merge(all(vals[i*2]), all(vals[i*2+1]), back_inserter(vals[i]));
			vals[i].erase(unique(all(vals[i])), vals[i].end());
			tree[i].resize(sz(vals[i]));
			L[i] = min(L[i*2], L[i*2+1]);
			R[i] = max(R[i*2], R[i*2+1]);
		}
	}
	void update(int x, int y, int v) {
		auto it = lower_bound(all(who), x);
		assert(it != who.end() && *it == x);
		int pos = it - who.begin();
		for (int i = pos+N; i; i >>= 1) {
			auto it2 = lower_bound(all(vals[i]), y);
			assert(it2 != vals[i].end() && *it2 == y);
			tree[i].update(it2 - vals[i].begin(), v);
		}
	}
	int query(int node, int x, int y) {
		if (R[node] < x) return 0;
		if (L[node] >= x) {
			auto it = lower_bound(all(vals[node]), y);
			if (it != vals[node].end()) {
				return tree[node].query(it - vals[node].begin(), sz(vals[node]) - 1);
			}
			return 0;
		}
		return query(node*2, x, y) + query(node*2+1, x, y);
	}
};
void test_case() {
	int n, q;
	cin >> n >> q;
	vector<ar<int, 2>> pts(n);
	for (auto &x : pts) cin >> x[0] >> x[1];
	vector<ar<int, 4>> queries(q);
	for (auto &x : queries) cin >> x[0] >> x[1] >> x[2];
	for (int i = 0; i < q; i++) queries[i][3] = i;
	sort(all(queries), [&](const auto &A, const auto &B) { return A[2] > B[2]; });
	sort(all(pts), [&](const auto &A, const auto &B) { return A[0]+A[1] > B[0]+B[1]; });
	vector<int> ans(q);
	int to = -1;
	vector<ar<int, 2>> all_pts{pts};
	for (int i = 0; i < q; i++) all_pts.push_back({queries[i][0], queries[i][1]});
	sort(all(all_pts));
	all_pts.erase(unique(all(all_pts)), all_pts.end());
	seg st(all_pts);
	for (int i = 0; i < q; i++) {
		while (to+1 < n && pts[to+1][0] + pts[to+1][1] >= queries[i][2]) { 
			to++;
			st.update(pts[to][0], pts[to][1], 1);
		}
		ans[queries[i][3]] = st.query(1, queries[i][0], queries[i][1]);
	}
	for (int i = 0; i < q; i++) cout << ans[i] << '\n';
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
//    cin >> t;
    while (t--) test_case();
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 324 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 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 11 ms 3004 KB Output is correct
8 Correct 11 ms 2892 KB Output is correct
9 Correct 10 ms 2896 KB Output is correct
10 Correct 7 ms 2516 KB Output is correct
11 Correct 5 ms 844 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 10 ms 2900 KB Output is correct
14 Correct 10 ms 2900 KB Output is correct
15 Correct 10 ms 2896 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 6 ms 2448 KB Output is correct
18 Correct 3 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 64460 KB Output is correct
2 Correct 596 ms 64376 KB Output is correct
3 Correct 666 ms 64340 KB Output is correct
4 Correct 257 ms 39296 KB Output is correct
5 Correct 170 ms 13528 KB Output is correct
6 Correct 74 ms 6204 KB Output is correct
7 Correct 553 ms 60760 KB Output is correct
8 Correct 593 ms 63072 KB Output is correct
9 Correct 556 ms 57916 KB Output is correct
10 Correct 105 ms 9468 KB Output is correct
11 Correct 163 ms 35744 KB Output is correct
12 Correct 57 ms 5748 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 64460 KB Output is correct
2 Correct 596 ms 64376 KB Output is correct
3 Correct 666 ms 64340 KB Output is correct
4 Correct 257 ms 39296 KB Output is correct
5 Correct 170 ms 13528 KB Output is correct
6 Correct 74 ms 6204 KB Output is correct
7 Correct 553 ms 60760 KB Output is correct
8 Correct 593 ms 63072 KB Output is correct
9 Correct 556 ms 57916 KB Output is correct
10 Correct 105 ms 9468 KB Output is correct
11 Correct 163 ms 35744 KB Output is correct
12 Correct 57 ms 5748 KB Output is correct
13 Correct 668 ms 64856 KB Output is correct
14 Correct 708 ms 64824 KB Output is correct
15 Correct 603 ms 64172 KB Output is correct
16 Correct 237 ms 39740 KB Output is correct
17 Correct 169 ms 13856 KB Output is correct
18 Correct 75 ms 6204 KB Output is correct
19 Correct 718 ms 64900 KB Output is correct
20 Correct 694 ms 65012 KB Output is correct
21 Correct 706 ms 61244 KB Output is correct
22 Correct 115 ms 9448 KB Output is correct
23 Correct 180 ms 35760 KB Output is correct
24 Correct 58 ms 5752 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 324 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 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 11 ms 3004 KB Output is correct
8 Correct 11 ms 2892 KB Output is correct
9 Correct 10 ms 2896 KB Output is correct
10 Correct 7 ms 2516 KB Output is correct
11 Correct 5 ms 844 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 10 ms 2900 KB Output is correct
14 Correct 10 ms 2900 KB Output is correct
15 Correct 10 ms 2896 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 6 ms 2448 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 591 ms 64460 KB Output is correct
20 Correct 596 ms 64376 KB Output is correct
21 Correct 666 ms 64340 KB Output is correct
22 Correct 257 ms 39296 KB Output is correct
23 Correct 170 ms 13528 KB Output is correct
24 Correct 74 ms 6204 KB Output is correct
25 Correct 553 ms 60760 KB Output is correct
26 Correct 593 ms 63072 KB Output is correct
27 Correct 556 ms 57916 KB Output is correct
28 Correct 105 ms 9468 KB Output is correct
29 Correct 163 ms 35744 KB Output is correct
30 Correct 57 ms 5748 KB Output is correct
31 Correct 668 ms 64856 KB Output is correct
32 Correct 708 ms 64824 KB Output is correct
33 Correct 603 ms 64172 KB Output is correct
34 Correct 237 ms 39740 KB Output is correct
35 Correct 169 ms 13856 KB Output is correct
36 Correct 75 ms 6204 KB Output is correct
37 Correct 718 ms 64900 KB Output is correct
38 Correct 694 ms 65012 KB Output is correct
39 Correct 706 ms 61244 KB Output is correct
40 Correct 115 ms 9448 KB Output is correct
41 Correct 180 ms 35760 KB Output is correct
42 Correct 58 ms 5752 KB Output is correct
43 Correct 775 ms 95516 KB Output is correct
44 Correct 787 ms 95408 KB Output is correct
45 Correct 810 ms 95388 KB Output is correct
46 Correct 300 ms 72296 KB Output is correct
47 Correct 183 ms 16728 KB Output is correct
48 Correct 74 ms 6064 KB Output is correct
49 Correct 723 ms 95556 KB Output is correct
50 Correct 714 ms 94976 KB Output is correct
51 Correct 692 ms 95292 KB Output is correct
52 Correct 128 ms 13244 KB Output is correct
53 Correct 215 ms 68160 KB Output is correct