oj.uz

답안 #383926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
383926 2021-03-31T02:39:40 Z nikatamliani Examination (JOI19_examination) C++14
100 / 100
 812 ms 52380 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
template <typename T>
struct fenwick_tree {
    int size;
    vector<T> tree;
    T neutral;
    fenwick_tree(int n, T _neutral) {
        size = n;
        neutral = _neutral;
        tree = vector<T>(n + 1);
    }

    void update(int index, T value) {
        for(; index <= size; index += index & -index) {
            tree[index] += value;
        }
    }
    T query_prefix(int index) {
        T ans = neutral;
        for(; index; index -= index & -index) {
            ans += tree[index];
        }
        return ans; 
    }
    T query(int l, int r) {
        return query_prefix(r) - query_prefix(l - 1);
    }
};
map<int, int> compress(vector<int> &coords) {
	sort(coords.begin(), coords.end());
	map<int, int> compressed;
	for(int i = 0, current = 0; i < (int)coords.size(); ++i) {
		if(i == 0 || coords[i] != coords[i - 1]) ++current;
		compressed[coords[i]] = current;
	}
	return compressed;
}
int x[N], y[N], a[N], b[N], c[N];
int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int n, m;
	cin >> n >> m; 
	vector<vector<int>> v;
	vector<int> sorted_sums;
	for(int i = 1; i <= n; ++i) {
		cin >> x[i] >> y[i];
		sorted_sums.push_back(x[i] + y[i]);
		v.push_back({x[i], y[i]});
	}
	sort(sorted_sums.begin(), sorted_sums.end());
	sort(v.begin(), v.end());
	for(int i = 1; i <= n; ++i) {
		x[i] = v[i - 1][0];
		y[i] = v[i - 1][1];
	}
	v.clear();
	for(int i = 1; i <= m; ++i) {
		cin >> a[i] >> b[i] >> c[i];
		c[i] = max(c[i], a[i] + b[i]);
	}
	map<int, int> compressed_sum, compressed_x, compressed_y;
	//sum
	vector<int> coords(n + m); 
	for(int i = 1; i <= m; ++i) {
		coords[i - 1] = c[i];
	}
	for(int i = 1; i <= n; ++i) {
		coords[i + m - 1] = x[i] + y[i];
	}
	compressed_sum = compress(coords);
	//x
	for(int i = 1; i <= m; ++i) {
		coords[i - 1] = a[i];
	}
	for(int i = 1; i <= n; ++i) {
		coords[i + m - 1] = x[i];
	}
	compressed_x = compress(coords);
	//y
	for(int i = 1; i <= m; ++i) {
		coords[i - 1] = b[i];
	}
	for(int i = 1; i <= n; ++i) {
		coords[i + m - 1] = y[i];
	}
	compressed_y = compress(coords);
	auto sum = [](int x, int y) -> int {
		return x + y;
	};
	fenwick_tree<int> tx(N, 0);
	fenwick_tree<int> ty(N, 0);
	vector<int> ans(m+1);
	for(int i = 1; i <= m; ++i) {
		int l = 0, r = n - 1, ind = n;
		while(r >= l) {
			int middle = l + r >> 1;
			if(sorted_sums[middle] >= c[i]) {
				r = middle - 1;
				ind = middle;
			} else {
				l = middle + 1;
			}
		}
		ans[i] = n - ind;
	}
	vector<int> sums[N], queries[N];
	for(int i = 1; i <= n; ++i) {
		int val = compressed_sum[x[i] + y[i]];
		sums[val].push_back(i);
	}
	for(int i = 1; i <= m; ++i) {
		int val = compressed_sum[c[i]];
		queries[val].push_back(i);
	}
	int max_sum_val = (int)compressed_sum.size();
	for(int i = max_sum_val; i >= 1; --i) {
		for(int id : sums[i]) {
			int val_x = compressed_x[x[id]];
			int val_y = compressed_y[y[id]];
			tx.update(val_x, 1); 
			ty.update(val_y, 1);
		}
		for(int id : queries[i]) {
			int val_x = compressed_x[a[id]];
			int val_y = compressed_y[b[id]];
			ans[id] -= tx.query_prefix(val_x - 1);
			ans[id] -= ty.query_prefix(val_y - 1);
		}
	}
	for(int i = 1; i <= m; ++i) {
		cout << ans[i] << '\n';
	}
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:98:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   98 |    int middle = l + r >> 1;
      |                 ~~^~~
examination.cpp:89:7: warning: variable 'sum' set but not used [-Wunused-but-set-variable]
   89 |  auto sum = [](int x, int y) -> int {
      |       ^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11372 KB Output is correct
2 Correct 8 ms 11372 KB Output is correct
3 Correct 8 ms 11372 KB Output is correct
4 Correct 8 ms 11372 KB Output is correct
5 Correct 7 ms 11372 KB Output is correct
6 Correct 8 ms 11372 KB Output is correct
7 Correct 19 ms 12524 KB Output is correct
8 Correct 19 ms 12524 KB Output is correct
9 Correct 18 ms 12524 KB Output is correct
10 Correct 16 ms 12268 KB Output is correct
11 Correct 17 ms 12268 KB Output is correct
12 Correct 11 ms 11628 KB Output is correct
13 Correct 19 ms 12524 KB Output is correct
14 Correct 20 ms 12524 KB Output is correct
15 Correct 19 ms 12652 KB Output is correct
16 Correct 15 ms 12268 KB Output is correct
17 Correct 15 ms 12268 KB Output is correct
18 Correct 10 ms 11628 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 574 ms 35848 KB Output is correct
2 Correct 582 ms 35924 KB Output is correct
3 Correct 546 ms 35868 KB Output is correct
4 Correct 305 ms 29852 KB Output is correct
5 Correct 353 ms 29872 KB Output is correct
6 Correct 125 ms 19452 KB Output is correct
7 Correct 494 ms 34588 KB Output is correct
8 Correct 502 ms 34588 KB Output is correct
9 Correct 405 ms 31644 KB Output is correct
10 Correct 296 ms 29724 KB Output is correct
11 Correct 295 ms 29852 KB Output is correct
12 Correct 99 ms 18588 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 574 ms 35848 KB Output is correct
2 Correct 582 ms 35924 KB Output is correct
3 Correct 546 ms 35868 KB Output is correct
4 Correct 305 ms 29852 KB Output is correct
5 Correct 353 ms 29872 KB Output is correct
6 Correct 125 ms 19452 KB Output is correct
7 Correct 494 ms 34588 KB Output is correct
8 Correct 502 ms 34588 KB Output is correct
9 Correct 405 ms 31644 KB Output is correct
10 Correct 296 ms 29724 KB Output is correct
11 Correct 295 ms 29852 KB Output is correct
12 Correct 99 ms 18588 KB Output is correct
13 Correct 603 ms 36124 KB Output is correct
14 Correct 575 ms 35632 KB Output is correct
15 Correct 556 ms 35868 KB Output is correct
16 Correct 321 ms 29724 KB Output is correct
17 Correct 358 ms 29596 KB Output is correct
18 Correct 123 ms 19484 KB Output is correct
19 Correct 636 ms 35868 KB Output is correct
20 Correct 564 ms 35484 KB Output is correct
21 Correct 556 ms 35592 KB Output is correct
22 Correct 293 ms 29724 KB Output is correct
23 Correct 293 ms 29724 KB Output is correct
24 Correct 99 ms 18588 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11372 KB Output is correct
2 Correct 8 ms 11372 KB Output is correct
3 Correct 8 ms 11372 KB Output is correct
4 Correct 8 ms 11372 KB Output is correct
5 Correct 7 ms 11372 KB Output is correct
6 Correct 8 ms 11372 KB Output is correct
7 Correct 19 ms 12524 KB Output is correct
8 Correct 19 ms 12524 KB Output is correct
9 Correct 18 ms 12524 KB Output is correct
10 Correct 16 ms 12268 KB Output is correct
11 Correct 17 ms 12268 KB Output is correct
12 Correct 11 ms 11628 KB Output is correct
13 Correct 19 ms 12524 KB Output is correct
14 Correct 20 ms 12524 KB Output is correct
15 Correct 19 ms 12652 KB Output is correct
16 Correct 15 ms 12268 KB Output is correct
17 Correct 15 ms 12268 KB Output is correct
18 Correct 10 ms 11628 KB Output is correct
19 Correct 574 ms 35848 KB Output is correct
20 Correct 582 ms 35924 KB Output is correct
21 Correct 546 ms 35868 KB Output is correct
22 Correct 305 ms 29852 KB Output is correct
23 Correct 353 ms 29872 KB Output is correct
24 Correct 125 ms 19452 KB Output is correct
25 Correct 494 ms 34588 KB Output is correct
26 Correct 502 ms 34588 KB Output is correct
27 Correct 405 ms 31644 KB Output is correct
28 Correct 296 ms 29724 KB Output is correct
29 Correct 295 ms 29852 KB Output is correct
30 Correct 99 ms 18588 KB Output is correct
31 Correct 603 ms 36124 KB Output is correct
32 Correct 575 ms 35632 KB Output is correct
33 Correct 556 ms 35868 KB Output is correct
34 Correct 321 ms 29724 KB Output is correct
35 Correct 358 ms 29596 KB Output is correct
36 Correct 123 ms 19484 KB Output is correct
37 Correct 636 ms 35868 KB Output is correct
38 Correct 564 ms 35484 KB Output is correct
39 Correct 556 ms 35592 KB Output is correct
40 Correct 293 ms 29724 KB Output is correct
41 Correct 293 ms 29724 KB Output is correct
42 Correct 99 ms 18588 KB Output is correct
43 Correct 802 ms 52168 KB Output is correct
44 Correct 812 ms 52220 KB Output is correct
45 Correct 761 ms 52232 KB Output is correct
46 Correct 422 ms 42908 KB Output is correct
47 Correct 449 ms 42908 KB Output is correct
48 Correct 130 ms 20124 KB Output is correct
49 Correct 742 ms 52252 KB Output is correct
50 Correct 778 ms 52252 KB Output is correct
51 Correct 748 ms 52380 KB Output is correct
52 Correct 397 ms 42652 KB Output is correct
53 Correct 369 ms 42780 KB Output is correct