oj.uz

Submission #549252

# Submission time Handle Problem Language Result Execution time Memory
549252 2022-04-15T12:51:37 Z nonsensenonsense1 Team Contest (JOI22_team) C++17
73 / 100
 2000 ms 68140 KB 
#include <cstdio>
#include <vector>
#include <algorithm>

inline void mxm(int &a, int b) {
	a = std::max(a, b);
}

const int N = 150000;
int n, yval[N], amt, y1[N], z1[N], y2[N], z2[N];
std::pair<int, std::pair<int, int> > a[N];
std::vector<int> val[N * 2], t[N * 2];

void show(int i, int j) {
	for (i += amt; i; i >>= 1) val[i].push_back(j);
}

void build() {
	for (int i = 2 * amt - 1; i; --i) {
		if (i < amt) {
			val[i].resize(val[i << 1].size() + val[i << 1 | 1].size());
			std::merge(val[i << 1].begin(), val[i << 1].end(), val[i << 1 | 1].begin(), val[i << 1 | 1].end(), val[i].begin());
		} else std::sort(val[i].begin(), val[i].end());
		val[i].resize(std::unique(val[i].begin(), val[i].end()) - val[i].begin());
		t[i].resize(val[i].size() * 2);
	}
}

int find(int i, int j) {
	return std::lower_bound(val[i].begin(), val[i].end(), j) - val[i].begin();
}

void update1(int i, int j, int x) {
	for (j += val[i].size(); j; j >>= 1) mxm(t[i][j], x);
}

void update(int i, int j, int x) {
	for (i += amt; i; i >>= 1) update1(i, find(i, j), x);
}

int query1(int i, int lj, int rj) {
	lj = find(i, lj);
	rj = find(i, rj);
	int ans = 0;
	for (lj += val[i].size(), rj += val[i].size(); lj < rj; lj >>= 1, rj >>= 1) {
		if (lj & 1) mxm(ans, t[i][lj++]);
		if (rj & 1) mxm(ans, t[i][--rj]);
	}
	return ans;
}

int query(int li, int ri, int lj, int rj) {
	int ans = 0;
	for (li += amt, ri += amt; li < ri; li >>= 1, ri >>= 1) {
		if (li & 1) mxm(ans, query1(li++, lj, rj));
		if (ri & 1) mxm(ans, query1(--ri, lj, rj));
	}
	return ans;
}

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; ++i) {
		scanf("%d%d%d", &a[i].first, &a[i].second.first, &a[i].second.second);
		yval[i] = a[i].second.first;
	}
	std::sort(yval, yval + n);
	amt = std::unique(yval, yval + n) - yval;
	std::sort(a, a + n);
	for (int i = 0; i < n; ++i) {
		a[i].second.first = std::lower_bound(yval, yval + amt, a[i].second.first) - yval;
		show(a[i].second.first, a[i].second.second);
	}
	build();
	for (int i = 0; i < n; ++i) {
		y1[i] = a[i].second.first + 1;
		z1[i] = query(0, a[i].second.first, a[i].second.second + 1, ~(1 << 31));
		update(a[i].second.first, a[i].second.second, a[i].second.second);
	}
	for (int i = 0; i < n * 2; ++i) t[i].assign(t[i].size(), 0);
	for (int i = 0; i < n; ++i) {
		y2[i] = query(a[i].second.first + 1, amt, 0, a[i].second.second);
		z2[i] = a[i].second.second;
		update(a[i].second.first, a[i].second.second, a[i].second.first + 1);
	}
	for (int i = 0; i < n * 2; ++i) {
		t[i].clear();
		val[i].clear();
	}
	for (int i = 0; i < n; ++i) {
		if (y1[i] && z1[i]) show(y1[i] - 1, z1[i]);
		if (y2[i] && z2[i]) show(y2[i] - 1, z2[i]);
	}
	build();
	int ans = 0;
	for (int i = 0; i < n;) {
		int j = i;
		do {
			int x = query(a[i].second.first + 1, amt, a[i].second.second + 1, ~(1 << 31));
			if (x) ans = std::max(ans, a[i].first + x);
			++i;
		} while (i < n && a[i].first == a[i - 1].first);
		for (; j < i; ++j) {
			if (y1[j] && z1[j]) update(y1[j] - 1, z1[j], yval[y1[j] - 1] + z1[j]);
			if (y2[j] && z2[j]) update(y2[j] - 1, z2[j], yval[y2[j] - 1] + z2[j]);
		}
	}
	printf("%d\n", ans ? ans : -1);
	return 0;
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:62:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
team.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   scanf("%d%d%d", &a[i].first, &a[i].second.first, &a[i].second.second);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 8 ms 14396 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14372 KB Output is correct
6 Correct 8 ms 14392 KB Output is correct
7 Correct 7 ms 14332 KB Output is correct
8 Correct 8 ms 14292 KB Output is correct
9 Correct 8 ms 14384 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 8 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 10 ms 14380 KB Output is correct
14 Correct 10 ms 14512 KB Output is correct
15 Correct 9 ms 14392 KB Output is correct
16 Correct 9 ms 14448 KB Output is correct
17 Correct 8 ms 14388 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14404 KB Output is correct
22 Correct 9 ms 14420 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14384 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 8 ms 14396 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14372 KB Output is correct
6 Correct 8 ms 14392 KB Output is correct
7 Correct 7 ms 14332 KB Output is correct
8 Correct 8 ms 14292 KB Output is correct
9 Correct 8 ms 14384 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 8 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 10 ms 14380 KB Output is correct
14 Correct 10 ms 14512 KB Output is correct
15 Correct 9 ms 14392 KB Output is correct
16 Correct 9 ms 14448 KB Output is correct
17 Correct 8 ms 14388 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14404 KB Output is correct
22 Correct 9 ms 14420 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14384 KB Output is correct
26 Correct 41 ms 16296 KB Output is correct
27 Correct 44 ms 15748 KB Output is correct
28 Correct 31 ms 15544 KB Output is correct
29 Correct 26 ms 15304 KB Output is correct
30 Correct 21 ms 14976 KB Output is correct
31 Correct 31 ms 15332 KB Output is correct
32 Correct 21 ms 14804 KB Output is correct
33 Correct 14 ms 14900 KB Output is correct
34 Correct 21 ms 15532 KB Output is correct
35 Correct 11 ms 14420 KB Output is correct
36 Correct 9 ms 14532 KB Output is correct
37 Correct 16 ms 15060 KB Output is correct
38 Correct 15 ms 14964 KB Output is correct
39 Correct 11 ms 14516 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 11 ms 14388 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 10 ms 14292 KB Output is correct
9 Correct 9 ms 14292 KB Output is correct
10 Correct 8 ms 14416 KB Output is correct
11 Correct 91 ms 23200 KB Output is correct
12 Correct 59 ms 19648 KB Output is correct
13 Correct 67 ms 20460 KB Output is correct
14 Correct 80 ms 22716 KB Output is correct
15 Correct 75 ms 21384 KB Output is correct
16 Correct 55 ms 20360 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 11 ms 14388 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 10 ms 14292 KB Output is correct
9 Correct 9 ms 14292 KB Output is correct
10 Correct 8 ms 14416 KB Output is correct
11 Correct 91 ms 23200 KB Output is correct
12 Correct 59 ms 19648 KB Output is correct
13 Correct 67 ms 20460 KB Output is correct
14 Correct 80 ms 22716 KB Output is correct
15 Correct 75 ms 21384 KB Output is correct
16 Correct 55 ms 20360 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 8 ms 14292 KB Output is correct
20 Correct 8 ms 14384 KB Output is correct
21 Correct 10 ms 14524 KB Output is correct
22 Correct 145 ms 28780 KB Output is correct
23 Correct 124 ms 25660 KB Output is correct
24 Correct 95 ms 21340 KB Output is correct
25 Correct 136 ms 24128 KB Output is correct
26 Correct 93 ms 23024 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 11 ms 14388 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 10 ms 14292 KB Output is correct
9 Correct 9 ms 14292 KB Output is correct
10 Correct 8 ms 14416 KB Output is correct
11 Correct 91 ms 23200 KB Output is correct
12 Correct 59 ms 19648 KB Output is correct
13 Correct 67 ms 20460 KB Output is correct
14 Correct 80 ms 22716 KB Output is correct
15 Correct 75 ms 21384 KB Output is correct
16 Correct 55 ms 20360 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 8 ms 14292 KB Output is correct
20 Correct 8 ms 14384 KB Output is correct
21 Correct 10 ms 14524 KB Output is correct
22 Correct 145 ms 28780 KB Output is correct
23 Correct 124 ms 25660 KB Output is correct
24 Correct 95 ms 21340 KB Output is correct
25 Correct 136 ms 24128 KB Output is correct
26 Correct 93 ms 23024 KB Output is correct
27 Correct 9 ms 14388 KB Output is correct
28 Correct 9 ms 14420 KB Output is correct
29 Correct 8 ms 14420 KB Output is correct
30 Correct 8 ms 14420 KB Output is correct
31 Correct 19 ms 14908 KB Output is correct
32 Correct 9 ms 14540 KB Output is correct
33 Correct 8 ms 14524 KB Output is correct
34 Correct 476 ms 36272 KB Output is correct
35 Correct 511 ms 31748 KB Output is correct
36 Correct 550 ms 32820 KB Output is correct
37 Correct 339 ms 28164 KB Output is correct
38 Correct 175 ms 25776 KB Output is correct
39 Correct 164 ms 23980 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 11 ms 14388 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 10 ms 14292 KB Output is correct
9 Correct 9 ms 14292 KB Output is correct
10 Correct 8 ms 14416 KB Output is correct
11 Correct 91 ms 23200 KB Output is correct
12 Correct 59 ms 19648 KB Output is correct
13 Correct 67 ms 20460 KB Output is correct
14 Correct 80 ms 22716 KB Output is correct
15 Correct 75 ms 21384 KB Output is correct
16 Correct 55 ms 20360 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 8 ms 14292 KB Output is correct
20 Correct 8 ms 14384 KB Output is correct
21 Correct 10 ms 14524 KB Output is correct
22 Correct 145 ms 28780 KB Output is correct
23 Correct 124 ms 25660 KB Output is correct
24 Correct 95 ms 21340 KB Output is correct
25 Correct 136 ms 24128 KB Output is correct
26 Correct 93 ms 23024 KB Output is correct
27 Correct 9 ms 14388 KB Output is correct
28 Correct 9 ms 14420 KB Output is correct
29 Correct 8 ms 14420 KB Output is correct
30 Correct 8 ms 14420 KB Output is correct
31 Correct 19 ms 14908 KB Output is correct
32 Correct 9 ms 14540 KB Output is correct
33 Correct 8 ms 14524 KB Output is correct
34 Correct 476 ms 36272 KB Output is correct
35 Correct 511 ms 31748 KB Output is correct
36 Correct 550 ms 32820 KB Output is correct
37 Correct 339 ms 28164 KB Output is correct
38 Correct 175 ms 25776 KB Output is correct
39 Correct 164 ms 23980 KB Output is correct
40 Correct 24 ms 15156 KB Output is correct
41 Correct 40 ms 15408 KB Output is correct
42 Correct 17 ms 14932 KB Output is correct
43 Correct 20 ms 15040 KB Output is correct
44 Correct 1591 ms 53704 KB Output is correct
45 Correct 1204 ms 38092 KB Output is correct
46 Correct 1406 ms 41832 KB Output is correct
47 Correct 991 ms 37404 KB Output is correct
48 Correct 245 ms 29864 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 8 ms 14396 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14372 KB Output is correct
6 Correct 8 ms 14392 KB Output is correct
7 Correct 7 ms 14332 KB Output is correct
8 Correct 8 ms 14292 KB Output is correct
9 Correct 8 ms 14384 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 8 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 10 ms 14380 KB Output is correct
14 Correct 10 ms 14512 KB Output is correct
15 Correct 9 ms 14392 KB Output is correct
16 Correct 9 ms 14448 KB Output is correct
17 Correct 8 ms 14388 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14404 KB Output is correct
22 Correct 9 ms 14420 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14384 KB Output is correct
26 Correct 41 ms 16296 KB Output is correct
27 Correct 44 ms 15748 KB Output is correct
28 Correct 31 ms 15544 KB Output is correct
29 Correct 26 ms 15304 KB Output is correct
30 Correct 21 ms 14976 KB Output is correct
31 Correct 31 ms 15332 KB Output is correct
32 Correct 21 ms 14804 KB Output is correct
33 Correct 14 ms 14900 KB Output is correct
34 Correct 21 ms 15532 KB Output is correct
35 Correct 11 ms 14420 KB Output is correct
36 Correct 9 ms 14532 KB Output is correct
37 Correct 16 ms 15060 KB Output is correct
38 Correct 15 ms 14964 KB Output is correct
39 Correct 11 ms 14516 KB Output is correct
40 Correct 7 ms 14292 KB Output is correct
41 Correct 7 ms 14292 KB Output is correct
42 Correct 9 ms 14412 KB Output is correct
43 Correct 8 ms 14292 KB Output is correct
44 Correct 8 ms 14292 KB Output is correct
45 Correct 11 ms 14388 KB Output is correct
46 Correct 9 ms 14292 KB Output is correct
47 Correct 10 ms 14292 KB Output is correct
48 Correct 9 ms 14292 KB Output is correct
49 Correct 8 ms 14416 KB Output is correct
50 Correct 91 ms 23200 KB Output is correct
51 Correct 59 ms 19648 KB Output is correct
52 Correct 67 ms 20460 KB Output is correct
53 Correct 80 ms 22716 KB Output is correct
54 Correct 75 ms 21384 KB Output is correct
55 Correct 55 ms 20360 KB Output is correct
56 Correct 7 ms 14292 KB Output is correct
57 Correct 7 ms 14292 KB Output is correct
58 Correct 8 ms 14292 KB Output is correct
59 Correct 8 ms 14384 KB Output is correct
60 Correct 10 ms 14524 KB Output is correct
61 Correct 145 ms 28780 KB Output is correct
62 Correct 124 ms 25660 KB Output is correct
63 Correct 95 ms 21340 KB Output is correct
64 Correct 136 ms 24128 KB Output is correct
65 Correct 93 ms 23024 KB Output is correct
66 Correct 9 ms 14388 KB Output is correct
67 Correct 9 ms 14420 KB Output is correct
68 Correct 8 ms 14420 KB Output is correct
69 Correct 8 ms 14420 KB Output is correct
70 Correct 19 ms 14908 KB Output is correct
71 Correct 9 ms 14540 KB Output is correct
72 Correct 8 ms 14524 KB Output is correct
73 Correct 476 ms 36272 KB Output is correct
74 Correct 511 ms 31748 KB Output is correct
75 Correct 550 ms 32820 KB Output is correct
76 Correct 339 ms 28164 KB Output is correct
77 Correct 175 ms 25776 KB Output is correct
78 Correct 164 ms 23980 KB Output is correct
79 Correct 24 ms 15156 KB Output is correct
80 Correct 40 ms 15408 KB Output is correct
81 Correct 17 ms 14932 KB Output is correct
82 Correct 20 ms 15040 KB Output is correct
83 Correct 1591 ms 53704 KB Output is correct
84 Correct 1204 ms 38092 KB Output is correct
85 Correct 1406 ms 41832 KB Output is correct
86 Correct 991 ms 37404 KB Output is correct
87 Correct 245 ms 29864 KB Output is correct
88 Execution timed out 2032 ms 68140 KB Time limit exceeded
89 Halted 0 ms 0 KB -