oj.uz

Submission #572461

# Submission time Handle Problem Language Result Execution time Memory
572461 2022-06-04T12:35:16 Z sidon Team Contest (JOI22_team) C++17
100 / 100
 300 ms 26108 KB 
#include <bits/stdc++.h>
using namespace std;
#define maxim(X, Y) (X = max(X, Y))
#define all(X) begin(X), end(X)

const int INF = 2e9+5;

struct Fenwick {
	int n, *a;
	Fenwick(int N) : n(N), a(new int[N+1]) {
		fill(a, a + N + 1, -INF);
	}
	void upd(int i, int v) {
		for(++i; i <= n; i += i&-i) maxim(a[i], v);
	}
	int qry(int i) {
		int v = -INF;
		for(++i; i >= 1; i -= i&-i) maxim(v, a[i]);
		return v;
	}
};

struct DS : set<pair<int, int>> {
	void add(int i, int v) {
		auto f = lower_bound({i+1, 0});
		if(f != begin() && prev(f)->second >= v) return;
		f = insert({i, v}).first;
		while(next(f) != end() && next(f)->second <= v)
			erase(next(f));
	}
	int query(int i) {
		auto f = lower_bound({i+1, 0});
		if(f == begin()) return -INF;
		return prev(f)->second;
	}
};

struct BIT {
	int n;
	vector<DS> a;
	BIT(int N) : n(N), a(N+1) {}
	void update(int i, int j, int v) {
		for(++i; i <= n; i += i&-i) a[i].add(j, v);
	}
	int query(int i, int j) {
		int v = -INF;
		for(++i; i >= 1; i -= i&-i) maxim(v, a[i].query(j));
		return v;
	}
};

int main() {
	ios::sync_with_stdio(0), cin.tie(0);

	int N; cin >> N;
	array<int, 3> a[N];
	vector<int> C[2];
	array<int, 2> sz, c[N];

	for(auto &[x, y, z] : a) {
		cin >> x >> y >> z;
		C[0].push_back(x);
		C[1].push_back(y);
	}
	Fenwick *f[2];

	for(int i = 0; i < 2; ++i) {
		sort(all(C[i]));
		C[i].erase(unique(all(C[i])), end(C[i]));
		f[i] = new Fenwick(sz[i] = size(C[i]));
	}

	sort(a, a + N, [&](const auto &i, const auto &j) {
		return i[2] < j[2];
	});

	BIT b(sz[0]);

	for(int i = 0; i < N; ++i)
		for(int k = 0; k < 2; ++k)
			c[i][k] = sz[k] - 1 - (lower_bound(all(C[k]), a[i][k]) - begin(C[k]));

	int ans = -INF;

	for(int l = 0, r; l < N; l = r) {
		for(r = l + 1; r < N && a[l][2] == a[r][2]; ++r);

		for(int i = l; i < r; ++i)
			maxim(ans, a[i][2] + b.query(c[i][0] - 1, c[i][1] - 1));

		for(int i = l; i < r; ++i) {
			int j = f[0]->qry(sz[0] - 2 - c[i][0]);
			if(j > sz[1] - 1 - c[i][1])
				b.update(c[i][0], sz[1] - 1 - j, a[i][0] + C[1][j]);

			j = f[1]->qry(sz[1] - 2 - c[i][1]);
			if(j > sz[0] - 1 - c[i][0])
				b.update(sz[0] - 1 - j, c[i][1], a[i][1] + C[0][j]);

			for(int k = 0; k < 2; ++k)
				f[k]->upd(sz[k] - 1 - c[i][k], sz[!k] - 1 - c[i][!k]);
		}
	}

	cout << max(ans, int(-1));
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 5 ms 972 KB Output is correct
27 Correct 4 ms 724 KB Output is correct
28 Correct 4 ms 724 KB Output is correct
29 Correct 4 ms 596 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 3 ms 460 KB Output is correct
39 Correct 1 ms 340 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 49 ms 5756 KB Output is correct
12 Correct 29 ms 3856 KB Output is correct
13 Correct 39 ms 4516 KB Output is correct
14 Correct 45 ms 5816 KB Output is correct
15 Correct 39 ms 5708 KB Output is correct
16 Correct 34 ms 5748 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 49 ms 5756 KB Output is correct
12 Correct 29 ms 3856 KB Output is correct
13 Correct 39 ms 4516 KB Output is correct
14 Correct 45 ms 5816 KB Output is correct
15 Correct 39 ms 5708 KB Output is correct
16 Correct 34 ms 5748 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 67 ms 5960 KB Output is correct
23 Correct 55 ms 5832 KB Output is correct
24 Correct 41 ms 4156 KB Output is correct
25 Correct 57 ms 6072 KB Output is correct
26 Correct 44 ms 5932 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 49 ms 5756 KB Output is correct
12 Correct 29 ms 3856 KB Output is correct
13 Correct 39 ms 4516 KB Output is correct
14 Correct 45 ms 5816 KB Output is correct
15 Correct 39 ms 5708 KB Output is correct
16 Correct 34 ms 5748 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 67 ms 5960 KB Output is correct
23 Correct 55 ms 5832 KB Output is correct
24 Correct 41 ms 4156 KB Output is correct
25 Correct 57 ms 6072 KB Output is correct
26 Correct 44 ms 5932 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 94 ms 6328 KB Output is correct
35 Correct 79 ms 5940 KB Output is correct
36 Correct 88 ms 6420 KB Output is correct
37 Correct 76 ms 6564 KB Output is correct
38 Correct 56 ms 6404 KB Output is correct
39 Correct 35 ms 3904 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 49 ms 5756 KB Output is correct
12 Correct 29 ms 3856 KB Output is correct
13 Correct 39 ms 4516 KB Output is correct
14 Correct 45 ms 5816 KB Output is correct
15 Correct 39 ms 5708 KB Output is correct
16 Correct 34 ms 5748 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 67 ms 5960 KB Output is correct
23 Correct 55 ms 5832 KB Output is correct
24 Correct 41 ms 4156 KB Output is correct
25 Correct 57 ms 6072 KB Output is correct
26 Correct 44 ms 5932 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 94 ms 6328 KB Output is correct
35 Correct 79 ms 5940 KB Output is correct
36 Correct 88 ms 6420 KB Output is correct
37 Correct 76 ms 6564 KB Output is correct
38 Correct 56 ms 6404 KB Output is correct
39 Correct 35 ms 3904 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 4 ms 588 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 131 ms 7012 KB Output is correct
45 Correct 108 ms 6936 KB Output is correct
46 Correct 137 ms 6900 KB Output is correct
47 Correct 105 ms 7044 KB Output is correct
48 Correct 64 ms 6964 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 5 ms 972 KB Output is correct
27 Correct 4 ms 724 KB Output is correct
28 Correct 4 ms 724 KB Output is correct
29 Correct 4 ms 596 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 3 ms 460 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 324 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 320 KB Output is correct
47 Correct 1 ms 316 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 49 ms 5756 KB Output is correct
51 Correct 29 ms 3856 KB Output is correct
52 Correct 39 ms 4516 KB Output is correct
53 Correct 45 ms 5816 KB Output is correct
54 Correct 39 ms 5708 KB Output is correct
55 Correct 34 ms 5748 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 224 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 67 ms 5960 KB Output is correct
62 Correct 55 ms 5832 KB Output is correct
63 Correct 41 ms 4156 KB Output is correct
64 Correct 57 ms 6072 KB Output is correct
65 Correct 44 ms 5932 KB Output is correct
66 Correct 1 ms 320 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 3 ms 468 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 94 ms 6328 KB Output is correct
74 Correct 79 ms 5940 KB Output is correct
75 Correct 88 ms 6420 KB Output is correct
76 Correct 76 ms 6564 KB Output is correct
77 Correct 56 ms 6404 KB Output is correct
78 Correct 35 ms 3904 KB Output is correct
79 Correct 3 ms 588 KB Output is correct
80 Correct 4 ms 588 KB Output is correct
81 Correct 2 ms 468 KB Output is correct
82 Correct 3 ms 468 KB Output is correct
83 Correct 131 ms 7012 KB Output is correct
84 Correct 108 ms 6936 KB Output is correct
85 Correct 137 ms 6900 KB Output is correct
86 Correct 105 ms 7044 KB Output is correct
87 Correct 64 ms 6964 KB Output is correct
88 Correct 300 ms 26108 KB Output is correct
89 Correct 195 ms 16652 KB Output is correct
90 Correct 232 ms 19644 KB Output is correct
91 Correct 167 ms 14644 KB Output is correct
92 Correct 165 ms 9796 KB Output is correct
93 Correct 182 ms 15864 KB Output is correct
94 Correct 147 ms 11764 KB Output is correct
95 Correct 87 ms 10208 KB Output is correct
96 Correct 107 ms 16784 KB Output is correct
97 Correct 52 ms 8096 KB Output is correct
98 Correct 67 ms 9616 KB Output is correct
99 Correct 105 ms 9884 KB Output is correct