oj.uz

답안 #255549

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255549 2020-08-01T08:13:55 Z islingr Examination (JOI19_examination) C++17
100 / 100
 390 ms 10600 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 pair(-x, y) < pair(-p.x, p.y); }
} 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 + q] = {x, y, x + y, 0};
		cmp.eb(x + y);
	}
	rep(i, 0, q) {
		int x, y, z; cin >> x >> y >> z; --x; --y;
		a[i] = {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

# 결과 실행 시간 메모리 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 9 ms 768 KB Output is correct
8 Correct 8 ms 768 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 8 ms 768 KB Output is correct
11 Correct 7 ms 768 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 6 ms 768 KB Output is correct
16 Correct 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 9892 KB Output is correct
2 Correct 223 ms 9844 KB Output is correct
3 Correct 242 ms 10092 KB Output is correct
4 Correct 209 ms 9708 KB Output is correct
5 Correct 147 ms 9580 KB Output is correct
6 Correct 95 ms 9196 KB Output is correct
7 Correct 206 ms 9580 KB Output is correct
8 Correct 214 ms 9776 KB Output is correct
9 Correct 201 ms 9580 KB Output is correct
10 Correct 117 ms 9328 KB Output is correct
11 Correct 184 ms 9448 KB Output is correct
12 Correct 66 ms 8708 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 9892 KB Output is correct
2 Correct 223 ms 9844 KB Output is correct
3 Correct 242 ms 10092 KB Output is correct
4 Correct 209 ms 9708 KB Output is correct
5 Correct 147 ms 9580 KB Output is correct
6 Correct 95 ms 9196 KB Output is correct
7 Correct 206 ms 9580 KB Output is correct
8 Correct 214 ms 9776 KB Output is correct
9 Correct 201 ms 9580 KB Output is correct
10 Correct 117 ms 9328 KB Output is correct
11 Correct 184 ms 9448 KB Output is correct
12 Correct 66 ms 8708 KB Output is correct
13 Correct 351 ms 10212 KB Output is correct
14 Correct 328 ms 10220 KB Output is correct
15 Correct 220 ms 9836 KB Output is correct
16 Correct 310 ms 9968 KB Output is correct
17 Correct 253 ms 9964 KB Output is correct
18 Correct 105 ms 9068 KB Output is correct
19 Correct 342 ms 10280 KB Output is correct
20 Correct 342 ms 10356 KB Output is correct
21 Correct 332 ms 10092 KB Output is correct
22 Correct 123 ms 9324 KB Output is correct
23 Correct 184 ms 9328 KB Output is correct
24 Correct 61 ms 8432 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 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 9 ms 768 KB Output is correct
8 Correct 8 ms 768 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 8 ms 768 KB Output is correct
11 Correct 7 ms 768 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 6 ms 768 KB Output is correct
16 Correct 4 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 9892 KB Output is correct
20 Correct 223 ms 9844 KB Output is correct
21 Correct 242 ms 10092 KB Output is correct
22 Correct 209 ms 9708 KB Output is correct
23 Correct 147 ms 9580 KB Output is correct
24 Correct 95 ms 9196 KB Output is correct
25 Correct 206 ms 9580 KB Output is correct
26 Correct 214 ms 9776 KB Output is correct
27 Correct 201 ms 9580 KB Output is correct
28 Correct 117 ms 9328 KB Output is correct
29 Correct 184 ms 9448 KB Output is correct
30 Correct 66 ms 8708 KB Output is correct
31 Correct 351 ms 10212 KB Output is correct
32 Correct 328 ms 10220 KB Output is correct
33 Correct 220 ms 9836 KB Output is correct
34 Correct 310 ms 9968 KB Output is correct
35 Correct 253 ms 9964 KB Output is correct
36 Correct 105 ms 9068 KB Output is correct
37 Correct 342 ms 10280 KB Output is correct
38 Correct 342 ms 10356 KB Output is correct
39 Correct 332 ms 10092 KB Output is correct
40 Correct 123 ms 9324 KB Output is correct
41 Correct 184 ms 9328 KB Output is correct
42 Correct 61 ms 8432 KB Output is correct
43 Correct 387 ms 10480 KB Output is correct
44 Correct 390 ms 10360 KB Output is correct
45 Correct 369 ms 10352 KB Output is correct
46 Correct 334 ms 10348 KB Output is correct
47 Correct 270 ms 10600 KB Output is correct
48 Correct 124 ms 8724 KB Output is correct
49 Correct 371 ms 10224 KB Output is correct
50 Correct 388 ms 10352 KB Output is correct
51 Correct 363 ms 10192 KB Output is correct
52 Correct 269 ms 10168 KB Output is correct
53 Correct 189 ms 9452 KB Output is correct