oj.uz

Submission #255389

# Submission time Handle Problem Language Result Execution time Memory
255389 2020-07-31T21:13:49 Z islingr Examination (JOI19_examination) C++14
100 / 100
 401 ms 10488 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define sz(x) int((x).size())
#define eb(x...) emplace_back(x)
#define lb(x...) lower_bound(x)
#define all(x) begin(x), end(x)

using ll = int64_t;

const int N = 1 << 17;

int n, m;
int t[4 * N];
int query(int l, int r) {
	int sum = 0;
	for (l += m, r += m; l < r; l >>= 1, r >>= 1) {
		if (l & 1) sum += t[l++];
		if (r & 1) sum += t[--r];
	}
	return sum;
}
void update(int p, int x) {
	for (t[p += m] += x; p >>= 1; ) t[p] = t[p << 1] + t[p << 1|1];
}

struct P {
	int x, y, z, idx;
	bool operator<(const P &p) {
		return tuple<int, int, int>(-x, y, z) < tuple<int, int, int>(-p.x, p.y, p.z);
	}
} a[2 * N], tmp[2 * N];
int ans[N];

void cdq(int l, int r) {
	if (r - l == 1) return;
	int m = (l + r) / 2;
	cdq(l, m); cdq(m, r);
	vector<int> op;
	int i = l, j = m, k = l, cnt = 0;
	while (i < m && j < r) {
		if (a[j].y < a[i].y) {
			if (!a[i].idx) ++cnt, update(a[i].z, 1), op.eb(a[i].z);
			tmp[k++] = a[i++];
		} else {
			if (a[j].idx) ans[a[j].idx] += cnt - query(0, a[j].z + 1);
			tmp[k++] = a[j++];
		}
	}
	while (i < m) tmp[k++] = a[i++];
	while (j < r) {
		if (a[j].idx) ans[a[j].idx] += cnt - query(0, a[j].z + 1);
		tmp[k++] = a[j++];
	}
	rep(i, l, r) a[i] = tmp[i];
	for (int p : op) update(p, -1);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	vector<int> cmp;
	int q; cin >> n >> q;
	rep(i, 0, n) {
		int x, y; cin >> x >> y;
		a[i] = {x, y, x + y, 0};
		cmp.eb(x + y);
	}
	rep(i, 0, q) {
		int x, y, z; cin >> x >> y >> z;
		a[i + n] = {--x, --y, --z, i + 1};
		cmp.eb(z);
	}
	sort(all(cmp)); cmp.resize(m = unique(all(cmp)) - begin(cmp));
	rep(i, 0, n + q) a[i].z = lb(all(cmp), a[i].z) - begin(cmp);
	sort(a, a + n + q); cdq(0, n + q);
	rep(i, 0, q) cout << ans[i + 1] << '\n';
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 8 ms 640 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 8 ms 640 KB Output is correct
10 Correct 8 ms 640 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 7 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 9452 KB Output is correct
2 Correct 230 ms 9452 KB Output is correct
3 Correct 224 ms 9456 KB Output is correct
4 Correct 206 ms 9372 KB Output is correct
5 Correct 144 ms 9324 KB Output is correct
6 Correct 92 ms 8816 KB Output is correct
7 Correct 209 ms 9200 KB Output is correct
8 Correct 215 ms 9584 KB Output is correct
9 Correct 206 ms 9452 KB Output is correct
10 Correct 121 ms 9072 KB Output is correct
11 Correct 186 ms 9328 KB Output is correct
12 Correct 67 ms 8560 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 9452 KB Output is correct
2 Correct 230 ms 9452 KB Output is correct
3 Correct 224 ms 9456 KB Output is correct
4 Correct 206 ms 9372 KB Output is correct
5 Correct 144 ms 9324 KB Output is correct
6 Correct 92 ms 8816 KB Output is correct
7 Correct 209 ms 9200 KB Output is correct
8 Correct 215 ms 9584 KB Output is correct
9 Correct 206 ms 9452 KB Output is correct
10 Correct 121 ms 9072 KB Output is correct
11 Correct 186 ms 9328 KB Output is correct
12 Correct 67 ms 8560 KB Output is correct
13 Correct 340 ms 9836 KB Output is correct
14 Correct 335 ms 9836 KB Output is correct
15 Correct 230 ms 9456 KB Output is correct
16 Correct 316 ms 9836 KB Output is correct
17 Correct 251 ms 9584 KB Output is correct
18 Correct 98 ms 8816 KB Output is correct
19 Correct 340 ms 9868 KB Output is correct
20 Correct 337 ms 9840 KB Output is correct
21 Correct 339 ms 9584 KB Output is correct
22 Correct 122 ms 9068 KB Output is correct
23 Correct 182 ms 9144 KB Output is correct
24 Correct 67 ms 8560 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 8 ms 640 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 8 ms 640 KB Output is correct
10 Correct 8 ms 640 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 7 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 225 ms 9452 KB Output is correct
20 Correct 230 ms 9452 KB Output is correct
21 Correct 224 ms 9456 KB Output is correct
22 Correct 206 ms 9372 KB Output is correct
23 Correct 144 ms 9324 KB Output is correct
24 Correct 92 ms 8816 KB Output is correct
25 Correct 209 ms 9200 KB Output is correct
26 Correct 215 ms 9584 KB Output is correct
27 Correct 206 ms 9452 KB Output is correct
28 Correct 121 ms 9072 KB Output is correct
29 Correct 186 ms 9328 KB Output is correct
30 Correct 67 ms 8560 KB Output is correct
31 Correct 340 ms 9836 KB Output is correct
32 Correct 335 ms 9836 KB Output is correct
33 Correct 230 ms 9456 KB Output is correct
34 Correct 316 ms 9836 KB Output is correct
35 Correct 251 ms 9584 KB Output is correct
36 Correct 98 ms 8816 KB Output is correct
37 Correct 340 ms 9868 KB Output is correct
38 Correct 337 ms 9840 KB Output is correct
39 Correct 339 ms 9584 KB Output is correct
40 Correct 122 ms 9068 KB Output is correct
41 Correct 182 ms 9144 KB Output is correct
42 Correct 67 ms 8560 KB Output is correct
43 Correct 388 ms 10424 KB Output is correct
44 Correct 401 ms 10348 KB Output is correct
45 Correct 383 ms 10352 KB Output is correct
46 Correct 346 ms 10472 KB Output is correct
47 Correct 278 ms 10480 KB Output is correct
48 Correct 103 ms 8688 KB Output is correct
49 Correct 362 ms 10224 KB Output is correct
50 Correct 354 ms 10488 KB Output is correct
51 Correct 358 ms 10220 KB Output is correct
52 Correct 258 ms 10220 KB Output is correct
53 Correct 200 ms 9572 KB Output is correct