oj.uz

Submission #255530

# Submission time Handle Problem Language Result Execution time Memory
255530 2020-08-01T07:51:26 Z islingr Examination (JOI19_examination) C++14
100 / 100
 394 ms 12016 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)

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, i;
	bool operator<(const P &p) {
		return tuple<int, int, int>(-x, -y, i) < tuple<int, int, int>(-p.x, -p.y, p.i);
	}
} 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].i) ++cnt, update(a[i].z, 1), op.eb(a[i].z);
			tmp[k++] = a[i++];
		} else {
			if (a[j].i) ans[a[j].i] += cnt - query(0, a[j].z);
			tmp[k++] = a[j++];
		}
	while (i < m) tmp[k++] = a[i++];
	while (j < r) {
		if (a[j].i) ans[a[j].i] += cnt - query(0, a[j].z);
		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 1 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 1 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 7 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 3 ms 640 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 9456 KB Output is correct
2 Correct 232 ms 10476 KB Output is correct
3 Correct 219 ms 10476 KB Output is correct
4 Correct 203 ms 10352 KB Output is correct
5 Correct 204 ms 10352 KB Output is correct
6 Correct 111 ms 9712 KB Output is correct
7 Correct 209 ms 10220 KB Output is correct
8 Correct 217 ms 10476 KB Output is correct
9 Correct 216 ms 10220 KB Output is correct
10 Correct 201 ms 10092 KB Output is correct
11 Correct 194 ms 10352 KB Output is correct
12 Correct 93 ms 9328 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 9456 KB Output is correct
2 Correct 232 ms 10476 KB Output is correct
3 Correct 219 ms 10476 KB Output is correct
4 Correct 203 ms 10352 KB Output is correct
5 Correct 204 ms 10352 KB Output is correct
6 Correct 111 ms 9712 KB Output is correct
7 Correct 209 ms 10220 KB Output is correct
8 Correct 217 ms 10476 KB Output is correct
9 Correct 216 ms 10220 KB Output is correct
10 Correct 201 ms 10092 KB Output is correct
11 Correct 194 ms 10352 KB Output is correct
12 Correct 93 ms 9328 KB Output is correct
13 Correct 355 ms 10828 KB Output is correct
14 Correct 354 ms 10996 KB Output is correct
15 Correct 231 ms 10452 KB Output is correct
16 Correct 320 ms 10572 KB Output is correct
17 Correct 317 ms 10472 KB Output is correct
18 Correct 135 ms 9712 KB Output is correct
19 Correct 348 ms 11116 KB Output is correct
20 Correct 349 ms 11004 KB Output is correct
21 Correct 354 ms 10736 KB Output is correct
22 Correct 197 ms 10096 KB Output is correct
23 Correct 195 ms 10220 KB Output is correct
24 Correct 94 ms 9328 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 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 7 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 223 ms 9456 KB Output is correct
20 Correct 232 ms 10476 KB Output is correct
21 Correct 219 ms 10476 KB Output is correct
22 Correct 203 ms 10352 KB Output is correct
23 Correct 204 ms 10352 KB Output is correct
24 Correct 111 ms 9712 KB Output is correct
25 Correct 209 ms 10220 KB Output is correct
26 Correct 217 ms 10476 KB Output is correct
27 Correct 216 ms 10220 KB Output is correct
28 Correct 201 ms 10092 KB Output is correct
29 Correct 194 ms 10352 KB Output is correct
30 Correct 93 ms 9328 KB Output is correct
31 Correct 355 ms 10828 KB Output is correct
32 Correct 354 ms 10996 KB Output is correct
33 Correct 231 ms 10452 KB Output is correct
34 Correct 320 ms 10572 KB Output is correct
35 Correct 317 ms 10472 KB Output is correct
36 Correct 135 ms 9712 KB Output is correct
37 Correct 348 ms 11116 KB Output is correct
38 Correct 349 ms 11004 KB Output is correct
39 Correct 354 ms 10736 KB Output is correct
40 Correct 197 ms 10096 KB Output is correct
41 Correct 195 ms 10220 KB Output is correct
42 Correct 94 ms 9328 KB Output is correct
43 Correct 394 ms 12012 KB Output is correct
44 Correct 380 ms 11884 KB Output is correct
45 Correct 366 ms 12016 KB Output is correct
46 Correct 332 ms 11952 KB Output is correct
47 Correct 342 ms 12012 KB Output is correct
48 Correct 141 ms 9584 KB Output is correct
49 Correct 355 ms 12004 KB Output is correct
50 Correct 368 ms 11984 KB Output is correct
51 Correct 371 ms 11756 KB Output is correct
52 Correct 329 ms 11756 KB Output is correct
53 Correct 207 ms 10476 KB Output is correct