oj.uz

답안 #255398

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255398 2020-07-31T21:25:17 Z islingr Examination (JOI19_examination) C++14
100 / 100
 383 ms 12764 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);
			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);
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 8 ms 896 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 227 ms 11888 KB Output is correct
2 Correct 242 ms 12020 KB Output is correct
3 Correct 231 ms 11888 KB Output is correct
4 Correct 205 ms 11256 KB Output is correct
5 Correct 142 ms 11120 KB Output is correct
6 Correct 90 ms 9964 KB Output is correct
7 Correct 212 ms 11628 KB Output is correct
8 Correct 211 ms 11884 KB Output is correct
9 Correct 207 ms 11500 KB Output is correct
10 Correct 123 ms 10864 KB Output is correct
11 Correct 182 ms 10864 KB Output is correct
12 Correct 65 ms 9452 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 227 ms 11888 KB Output is correct
2 Correct 242 ms 12020 KB Output is correct
3 Correct 231 ms 11888 KB Output is correct
4 Correct 205 ms 11256 KB Output is correct
5 Correct 142 ms 11120 KB Output is correct
6 Correct 90 ms 9964 KB Output is correct
7 Correct 212 ms 11628 KB Output is correct
8 Correct 211 ms 11884 KB Output is correct
9 Correct 207 ms 11500 KB Output is correct
10 Correct 123 ms 10864 KB Output is correct
11 Correct 182 ms 10864 KB Output is correct
12 Correct 65 ms 9452 KB Output is correct
13 Correct 340 ms 12764 KB Output is correct
14 Correct 332 ms 11756 KB Output is correct
15 Correct 235 ms 11644 KB Output is correct
16 Correct 320 ms 11640 KB Output is correct
17 Correct 254 ms 11628 KB Output is correct
18 Correct 95 ms 9840 KB Output is correct
19 Correct 360 ms 11820 KB Output is correct
20 Correct 355 ms 11772 KB Output is correct
21 Correct 347 ms 11632 KB Output is correct
22 Correct 122 ms 10864 KB Output is correct
23 Correct 189 ms 10992 KB Output is correct
24 Correct 66 ms 9452 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 8 ms 896 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 227 ms 11888 KB Output is correct
20 Correct 242 ms 12020 KB Output is correct
21 Correct 231 ms 11888 KB Output is correct
22 Correct 205 ms 11256 KB Output is correct
23 Correct 142 ms 11120 KB Output is correct
24 Correct 90 ms 9964 KB Output is correct
25 Correct 212 ms 11628 KB Output is correct
26 Correct 211 ms 11884 KB Output is correct
27 Correct 207 ms 11500 KB Output is correct
28 Correct 123 ms 10864 KB Output is correct
29 Correct 182 ms 10864 KB Output is correct
30 Correct 65 ms 9452 KB Output is correct
31 Correct 340 ms 12764 KB Output is correct
32 Correct 332 ms 11756 KB Output is correct
33 Correct 235 ms 11644 KB Output is correct
34 Correct 320 ms 11640 KB Output is correct
35 Correct 254 ms 11628 KB Output is correct
36 Correct 95 ms 9840 KB Output is correct
37 Correct 360 ms 11820 KB Output is correct
38 Correct 355 ms 11772 KB Output is correct
39 Correct 347 ms 11632 KB Output is correct
40 Correct 122 ms 10864 KB Output is correct
41 Correct 189 ms 10992 KB Output is correct
42 Correct 66 ms 9452 KB Output is correct
43 Correct 380 ms 12636 KB Output is correct
44 Correct 383 ms 12528 KB Output is correct
45 Correct 372 ms 12524 KB Output is correct
46 Correct 337 ms 12528 KB Output is correct
47 Correct 287 ms 12528 KB Output is correct
48 Correct 103 ms 9708 KB Output is correct
49 Correct 359 ms 12400 KB Output is correct
50 Correct 359 ms 12396 KB Output is correct
51 Correct 360 ms 12272 KB Output is correct
52 Correct 249 ms 12140 KB Output is correct
53 Correct 191 ms 11504 KB Output is correct