oj.uz

Submission #383929

# Submission time Handle Problem Language Result Execution time Memory
383929 2021-03-31T03:24:31 Z nikatamliani Examination (JOI19_examination) C++14
100 / 100
 784 ms 50412 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;
}
struct point {
	int x, y, sum;
	bool operator < (const point &other) {
		if(x == other.x) {
			return y < other.y;
		}
		return x < other.x;
	}
};
point a[N], b[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 >> a[i].x >> a[i].y;
		a[i].sum = a[i].x + a[i].y;
		sorted_sums.push_back(a[i].sum);
	}
	sort(sorted_sums.begin(), sorted_sums.end());
	sort(a + 1, a + n + 1);
	for(int i = 1; i <= m; ++i) {
		cin >> b[i].x >> b[i].y >> b[i].sum;
		b[i].sum = max(b[i].sum, b[i].x + b[i].y);
	}
	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] = b[i].sum;
	}
	for(int i = 1; i <= n; ++i) {
		coords[i + m - 1] = a[i].sum;
	}
	compressed_sum = compress(coords);
	//x
	for(int i = 1; i <= m; ++i) {
		coords[i - 1] = b[i].x;
	}
	for(int i = 1; i <= n; ++i) {
		coords[i + m - 1] = a[i].x;
	}
	compressed_x = compress(coords);
	//y
	for(int i = 1; i <= m; ++i) {
		coords[i - 1] = b[i].y;
	}
	for(int i = 1; i <= n; ++i) {
		coords[i + m - 1] = a[i].y;
	}
	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] >= b[i].sum) {
				r = middle - 1;
				ind = middle;
			} else {
				l = middle + 1;
			}
		}
		ans[i] = n - ind;
	}
	for(int i = 1; i <= n; ++i) {
	    a[i].x = compressed_x[a[i].x];
	    a[i].y = compressed_y[a[i].y];
	    a[i].sum = compressed_sum[a[i].sum];
	}
	for(int i = 1; i <= m; ++i) {
	    b[i].x = compressed_x[b[i].x];
	    b[i].y = compressed_y[b[i].y];
	    b[i].sum = compressed_sum[b[i].sum];
	}
	vector<int> sums[N], queries[N];
	for(int i = 1; i <= n; ++i) {
		int val = a[i].sum;
		sums[val].push_back(i); 
	}
	for(int i = 1; i <= m; ++i) {
		int val = b[i].sum;
		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 = a[id].x;
			int val_y = a[id].y;
			tx.update(val_x, 1); 
			ty.update(val_y, 1);
		}
		for(int id : queries[i]) {
			int val_x = b[id].x;
			int val_y = b[id].y;
			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:102:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  102 |    int middle = l + r >> 1;
      |                 ~~^~~
examination.cpp:93:7: warning: variable 'sum' set but not used [-Wunused-but-set-variable]
   93 |  auto sum = [](int x, int y) -> int {
      |       ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11244 KB Output is correct
2 Correct 8 ms 11244 KB Output is correct
3 Correct 9 ms 11244 KB Output is correct
4 Correct 8 ms 11244 KB Output is correct
5 Correct 7 ms 11244 KB Output is correct
6 Correct 8 ms 11244 KB Output is correct
7 Correct 18 ms 12544 KB Output is correct
8 Correct 17 ms 12524 KB Output is correct
9 Correct 18 ms 12524 KB Output is correct
10 Correct 15 ms 12140 KB Output is correct
11 Correct 15 ms 12140 KB Output is correct
12 Correct 11 ms 11500 KB Output is correct
13 Correct 18 ms 12544 KB Output is correct
14 Correct 18 ms 12536 KB Output is correct
15 Correct 19 ms 12524 KB Output is correct
16 Correct 15 ms 12140 KB Output is correct
17 Correct 15 ms 12140 KB Output is correct
18 Correct 10 ms 11500 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 33824 KB Output is correct
2 Correct 582 ms 33924 KB Output is correct
3 Correct 617 ms 33892 KB Output is correct
4 Correct 326 ms 28012 KB Output is correct
5 Correct 372 ms 27884 KB Output is correct
6 Correct 114 ms 16876 KB Output is correct
7 Correct 453 ms 32620 KB Output is correct
8 Correct 488 ms 32748 KB Output is correct
9 Correct 364 ms 29676 KB Output is correct
10 Correct 314 ms 27896 KB Output is correct
11 Correct 326 ms 27756 KB Output is correct
12 Correct 88 ms 16624 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 33824 KB Output is correct
2 Correct 582 ms 33924 KB Output is correct
3 Correct 617 ms 33892 KB Output is correct
4 Correct 326 ms 28012 KB Output is correct
5 Correct 372 ms 27884 KB Output is correct
6 Correct 114 ms 16876 KB Output is correct
7 Correct 453 ms 32620 KB Output is correct
8 Correct 488 ms 32748 KB Output is correct
9 Correct 364 ms 29676 KB Output is correct
10 Correct 314 ms 27896 KB Output is correct
11 Correct 326 ms 27756 KB Output is correct
12 Correct 88 ms 16624 KB Output is correct
13 Correct 554 ms 34028 KB Output is correct
14 Correct 555 ms 33644 KB Output is correct
15 Correct 531 ms 34028 KB Output is correct
16 Correct 337 ms 27628 KB Output is correct
17 Correct 373 ms 27628 KB Output is correct
18 Correct 108 ms 16844 KB Output is correct
19 Correct 561 ms 34028 KB Output is correct
20 Correct 564 ms 33516 KB Output is correct
21 Correct 547 ms 33516 KB Output is correct
22 Correct 316 ms 27756 KB Output is correct
23 Correct 312 ms 27756 KB Output is correct
24 Correct 89 ms 16496 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11244 KB Output is correct
2 Correct 8 ms 11244 KB Output is correct
3 Correct 9 ms 11244 KB Output is correct
4 Correct 8 ms 11244 KB Output is correct
5 Correct 7 ms 11244 KB Output is correct
6 Correct 8 ms 11244 KB Output is correct
7 Correct 18 ms 12544 KB Output is correct
8 Correct 17 ms 12524 KB Output is correct
9 Correct 18 ms 12524 KB Output is correct
10 Correct 15 ms 12140 KB Output is correct
11 Correct 15 ms 12140 KB Output is correct
12 Correct 11 ms 11500 KB Output is correct
13 Correct 18 ms 12544 KB Output is correct
14 Correct 18 ms 12536 KB Output is correct
15 Correct 19 ms 12524 KB Output is correct
16 Correct 15 ms 12140 KB Output is correct
17 Correct 15 ms 12140 KB Output is correct
18 Correct 10 ms 11500 KB Output is correct
19 Correct 538 ms 33824 KB Output is correct
20 Correct 582 ms 33924 KB Output is correct
21 Correct 617 ms 33892 KB Output is correct
22 Correct 326 ms 28012 KB Output is correct
23 Correct 372 ms 27884 KB Output is correct
24 Correct 114 ms 16876 KB Output is correct
25 Correct 453 ms 32620 KB Output is correct
26 Correct 488 ms 32748 KB Output is correct
27 Correct 364 ms 29676 KB Output is correct
28 Correct 314 ms 27896 KB Output is correct
29 Correct 326 ms 27756 KB Output is correct
30 Correct 88 ms 16624 KB Output is correct
31 Correct 554 ms 34028 KB Output is correct
32 Correct 555 ms 33644 KB Output is correct
33 Correct 531 ms 34028 KB Output is correct
34 Correct 337 ms 27628 KB Output is correct
35 Correct 373 ms 27628 KB Output is correct
36 Correct 108 ms 16844 KB Output is correct
37 Correct 561 ms 34028 KB Output is correct
38 Correct 564 ms 33516 KB Output is correct
39 Correct 547 ms 33516 KB Output is correct
40 Correct 316 ms 27756 KB Output is correct
41 Correct 312 ms 27756 KB Output is correct
42 Correct 89 ms 16496 KB Output is correct
43 Correct 764 ms 50248 KB Output is correct
44 Correct 784 ms 50284 KB Output is correct
45 Correct 754 ms 50284 KB Output is correct
46 Correct 434 ms 40812 KB Output is correct
47 Correct 522 ms 40812 KB Output is correct
48 Correct 112 ms 16620 KB Output is correct
49 Correct 777 ms 50284 KB Output is correct
50 Correct 730 ms 50412 KB Output is correct
51 Correct 673 ms 50412 KB Output is correct
52 Correct 418 ms 40684 KB Output is correct
53 Correct 438 ms 40684 KB Output is correct