oj.uz

Submission #572462

# Submission time Handle Problem Language Result Execution time Memory
572462 2022-06-04T12:38:07 Z sidon Team Contest (JOI22_team) C++17
73 / 100
 145 ms 9168 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 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);
	}
	DS f[2];

	for(int i = 0; i < 2; ++i) {
		sort(all(C[i]));
		C[i].erase(unique(all(C[i])), end(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].query(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].query(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].add(sz[k] - 1 - c[i][k], sz[!k] - 1 - c[i][!k]);
		}
	}

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

Compilation message

team.cpp: In function 'int main()':
team.cpp:61:13: warning: 'sz' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |  BIT b(sz[0]);
      |             ^
team.cpp:65:24: warning: ''target_mem_ref' not supported by dump_expr<expression error>' may be used uninitialized in this function [-Wmaybe-uninitialized]
   65 |    c[i][k] = sz[k] - 1 - (lower_bound(all(C[k]), a[i][k]) - begin(C[k]));
team.cpp:77:17: warning: '*((void*)& sz +4)' may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |    if(j > sz[1] - 1 - c[i][1])

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 47 ms 4908 KB Output is correct
12 Correct 37 ms 3276 KB Output is correct
13 Correct 35 ms 3892 KB Output is correct
14 Correct 46 ms 4916 KB Output is correct
15 Correct 38 ms 4936 KB Output is correct
16 Correct 37 ms 4952 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 47 ms 4908 KB Output is correct
12 Correct 37 ms 3276 KB Output is correct
13 Correct 35 ms 3892 KB Output is correct
14 Correct 46 ms 4916 KB Output is correct
15 Correct 38 ms 4936 KB Output is correct
16 Correct 37 ms 4952 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 73 ms 4936 KB Output is correct
23 Correct 60 ms 4896 KB Output is correct
24 Correct 44 ms 3528 KB Output is correct
25 Correct 71 ms 4944 KB Output is correct
26 Correct 60 ms 4936 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 47 ms 4908 KB Output is correct
12 Correct 37 ms 3276 KB Output is correct
13 Correct 35 ms 3892 KB Output is correct
14 Correct 46 ms 4916 KB Output is correct
15 Correct 38 ms 4936 KB Output is correct
16 Correct 37 ms 4952 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 73 ms 4936 KB Output is correct
23 Correct 60 ms 4896 KB Output is correct
24 Correct 44 ms 3528 KB Output is correct
25 Correct 71 ms 4944 KB Output is correct
26 Correct 60 ms 4936 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 83 ms 4816 KB Output is correct
35 Correct 83 ms 4744 KB Output is correct
36 Correct 88 ms 5028 KB Output is correct
37 Correct 84 ms 4936 KB Output is correct
38 Correct 63 ms 4924 KB Output is correct
39 Correct 29 ms 3024 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 47 ms 4908 KB Output is correct
12 Correct 37 ms 3276 KB Output is correct
13 Correct 35 ms 3892 KB Output is correct
14 Correct 46 ms 4916 KB Output is correct
15 Correct 38 ms 4936 KB Output is correct
16 Correct 37 ms 4952 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 73 ms 4936 KB Output is correct
23 Correct 60 ms 4896 KB Output is correct
24 Correct 44 ms 3528 KB Output is correct
25 Correct 71 ms 4944 KB Output is correct
26 Correct 60 ms 4936 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 83 ms 4816 KB Output is correct
35 Correct 83 ms 4744 KB Output is correct
36 Correct 88 ms 5028 KB Output is correct
37 Correct 84 ms 4936 KB Output is correct
38 Correct 63 ms 4924 KB Output is correct
39 Correct 29 ms 3024 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 5 ms 724 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 3 ms 724 KB Output is correct
44 Correct 128 ms 5028 KB Output is correct
45 Correct 129 ms 4932 KB Output is correct
46 Correct 130 ms 4996 KB Output is correct
47 Correct 123 ms 4936 KB Output is correct
48 Correct 69 ms 4992 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 7 ms 916 KB Output is correct
27 Correct 4 ms 724 KB Output is correct
28 Correct 5 ms 724 KB Output is correct
29 Correct 5 ms 724 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 5 ms 596 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 4 ms 980 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 3 ms 724 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 0 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 0 ms 468 KB Output is correct
50 Correct 47 ms 4908 KB Output is correct
51 Correct 37 ms 3276 KB Output is correct
52 Correct 35 ms 3892 KB Output is correct
53 Correct 46 ms 4916 KB Output is correct
54 Correct 38 ms 4936 KB Output is correct
55 Correct 37 ms 4952 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 2 ms 596 KB Output is correct
61 Correct 73 ms 4936 KB Output is correct
62 Correct 60 ms 4896 KB Output is correct
63 Correct 44 ms 3528 KB Output is correct
64 Correct 71 ms 4944 KB Output is correct
65 Correct 60 ms 4936 KB Output is correct
66 Correct 1 ms 468 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 0 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 3 ms 596 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 596 KB Output is correct
73 Correct 83 ms 4816 KB Output is correct
74 Correct 83 ms 4744 KB Output is correct
75 Correct 88 ms 5028 KB Output is correct
76 Correct 84 ms 4936 KB Output is correct
77 Correct 63 ms 4924 KB Output is correct
78 Correct 29 ms 3024 KB Output is correct
79 Correct 3 ms 596 KB Output is correct
80 Correct 5 ms 724 KB Output is correct
81 Correct 3 ms 724 KB Output is correct
82 Correct 3 ms 724 KB Output is correct
83 Correct 128 ms 5028 KB Output is correct
84 Correct 129 ms 4932 KB Output is correct
85 Correct 130 ms 4996 KB Output is correct
86 Correct 123 ms 4936 KB Output is correct
87 Correct 69 ms 4992 KB Output is correct
88 Runtime error 145 ms 9168 KB Execution killed with signal 11
89 Halted 0 ms 0 KB -