oj.uz

Submission #549263

# Submission time Handle Problem Language Result Execution time Memory
549263 2022-04-15T13:11:33 Z nonsensenonsense1 Team Contest (JOI22_team) C++17
100 / 100
 1928 ms 85492 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], zval[N], amt, zamt, 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;
}

struct tree {
	int n;
	std::vector<int> t;
	void resize(int n_) {
		n = n_;
		t.assign(2 * n, 0);
	}
	void update(int i, int x) {
		for (i += n; i; i >>= 1) mxm(t[i], x);
	}
	int query(int l, int r) {
		int ans = 0;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (l & 1) mxm(ans, t[l++]);
			if (r & 1) mxm(ans, t[--r]);
		}
		return ans;
	}
} tr;

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;
		zval[i] = a[i].second.second;
	}
	std::sort(yval, yval + n);
	std::sort(zval, zval + n);
	amt = std::unique(yval, yval + n) - yval;
	zamt = std::unique(zval, zval + n) - zval;
	std::sort(a, a + n);
	tr.resize(amt);
	for (int i = 0; i < n; ++i) {
		a[i].second.first = std::lower_bound(yval, yval + amt, a[i].second.first) - yval;
		y1[i] = a[i].second.first + 1;
		z1[i] = tr.query(0, a[i].second.first);
		if (z1[i] <= a[i].second.second) z1[i] = 0;
		tr.update(a[i].second.first, a[i].second.second);
	}
	tr.resize(zamt);
	for (int i = 0; i < n; ++i) {
		int p = std::lower_bound(zval, zval + zamt, a[i].second.second) - zval;
		y2[i] = tr.query(0, p);
		z2[i] = a[i].second.second;
		if (y2[i] - 1 <= a[i].second.first) y2[i] = 0;
		tr.update(p, a[i].second.first + 1);
	}
	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:82:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
team.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |   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 8 ms 14292 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 7 ms 14292 KB Output is correct
4 Correct 7 ms 14296 KB Output is correct
5 Correct 8 ms 14360 KB Output is correct
6 Correct 7 ms 14384 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 7 ms 14328 KB Output is correct
9 Correct 7 ms 14384 KB Output is correct
10 Correct 9 ms 14408 KB Output is correct
11 Correct 7 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 7 ms 14292 KB Output is correct
14 Correct 8 ms 14508 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14424 KB Output is correct
17 Correct 9 ms 14388 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 7 ms 14384 KB Output is correct
21 Correct 8 ms 14332 KB Output is correct
22 Correct 7 ms 14372 KB Output is correct
23 Correct 8 ms 14428 KB Output is correct
24 Correct 8 ms 14380 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 7 ms 14292 KB Output is correct
4 Correct 7 ms 14296 KB Output is correct
5 Correct 8 ms 14360 KB Output is correct
6 Correct 7 ms 14384 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 7 ms 14328 KB Output is correct
9 Correct 7 ms 14384 KB Output is correct
10 Correct 9 ms 14408 KB Output is correct
11 Correct 7 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 7 ms 14292 KB Output is correct
14 Correct 8 ms 14508 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14424 KB Output is correct
17 Correct 9 ms 14388 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 7 ms 14384 KB Output is correct
21 Correct 8 ms 14332 KB Output is correct
22 Correct 7 ms 14372 KB Output is correct
23 Correct 8 ms 14428 KB Output is correct
24 Correct 8 ms 14380 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct
26 Correct 23 ms 15888 KB Output is correct
27 Correct 20 ms 15444 KB Output is correct
28 Correct 19 ms 15316 KB Output is correct
29 Correct 14 ms 14932 KB Output is correct
30 Correct 13 ms 14912 KB Output is correct
31 Correct 18 ms 15188 KB Output is correct
32 Correct 12 ms 14792 KB Output is correct
33 Correct 10 ms 14644 KB Output is correct
34 Correct 12 ms 14636 KB Output is correct
35 Correct 9 ms 14392 KB Output is correct
36 Correct 9 ms 14420 KB Output is correct
37 Correct 10 ms 14520 KB Output is correct
38 Correct 11 ms 14548 KB Output is correct
39 Correct 9 ms 14512 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14376 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 8 ms 14380 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 10 ms 14384 KB Output is correct
7 Correct 10 ms 14328 KB Output is correct
8 Correct 8 ms 14388 KB Output is correct
9 Correct 8 ms 14404 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 78 ms 22576 KB Output is correct
12 Correct 49 ms 19228 KB Output is correct
13 Correct 49 ms 19012 KB Output is correct
14 Correct 66 ms 21340 KB Output is correct
15 Correct 58 ms 20476 KB Output is correct
16 Correct 47 ms 19748 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14376 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 8 ms 14380 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 10 ms 14384 KB Output is correct
7 Correct 10 ms 14328 KB Output is correct
8 Correct 8 ms 14388 KB Output is correct
9 Correct 8 ms 14404 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 78 ms 22576 KB Output is correct
12 Correct 49 ms 19228 KB Output is correct
13 Correct 49 ms 19012 KB Output is correct
14 Correct 66 ms 21340 KB Output is correct
15 Correct 58 ms 20476 KB Output is correct
16 Correct 47 ms 19748 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14412 KB Output is correct
20 Correct 7 ms 14384 KB Output is correct
21 Correct 10 ms 14548 KB Output is correct
22 Correct 110 ms 27108 KB Output is correct
23 Correct 92 ms 24112 KB Output is correct
24 Correct 67 ms 20776 KB Output is correct
25 Correct 88 ms 22820 KB Output is correct
26 Correct 61 ms 20840 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14376 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 8 ms 14380 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 10 ms 14384 KB Output is correct
7 Correct 10 ms 14328 KB Output is correct
8 Correct 8 ms 14388 KB Output is correct
9 Correct 8 ms 14404 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 78 ms 22576 KB Output is correct
12 Correct 49 ms 19228 KB Output is correct
13 Correct 49 ms 19012 KB Output is correct
14 Correct 66 ms 21340 KB Output is correct
15 Correct 58 ms 20476 KB Output is correct
16 Correct 47 ms 19748 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14412 KB Output is correct
20 Correct 7 ms 14384 KB Output is correct
21 Correct 10 ms 14548 KB Output is correct
22 Correct 110 ms 27108 KB Output is correct
23 Correct 92 ms 24112 KB Output is correct
24 Correct 67 ms 20776 KB Output is correct
25 Correct 88 ms 22820 KB Output is correct
26 Correct 61 ms 20840 KB Output is correct
27 Correct 8 ms 14420 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct
29 Correct 9 ms 14420 KB Output is correct
30 Correct 8 ms 14420 KB Output is correct
31 Correct 13 ms 14824 KB Output is correct
32 Correct 8 ms 14392 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 216 ms 31924 KB Output is correct
35 Correct 189 ms 28036 KB Output is correct
36 Correct 210 ms 29860 KB Output is correct
37 Correct 140 ms 25200 KB Output is correct
38 Correct 74 ms 21456 KB Output is correct
39 Correct 61 ms 22236 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14376 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 8 ms 14380 KB Output is correct
4 Correct 8 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 10 ms 14384 KB Output is correct
7 Correct 10 ms 14328 KB Output is correct
8 Correct 8 ms 14388 KB Output is correct
9 Correct 8 ms 14404 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 78 ms 22576 KB Output is correct
12 Correct 49 ms 19228 KB Output is correct
13 Correct 49 ms 19012 KB Output is correct
14 Correct 66 ms 21340 KB Output is correct
15 Correct 58 ms 20476 KB Output is correct
16 Correct 47 ms 19748 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14412 KB Output is correct
20 Correct 7 ms 14384 KB Output is correct
21 Correct 10 ms 14548 KB Output is correct
22 Correct 110 ms 27108 KB Output is correct
23 Correct 92 ms 24112 KB Output is correct
24 Correct 67 ms 20776 KB Output is correct
25 Correct 88 ms 22820 KB Output is correct
26 Correct 61 ms 20840 KB Output is correct
27 Correct 8 ms 14420 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct
29 Correct 9 ms 14420 KB Output is correct
30 Correct 8 ms 14420 KB Output is correct
31 Correct 13 ms 14824 KB Output is correct
32 Correct 8 ms 14392 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 216 ms 31924 KB Output is correct
35 Correct 189 ms 28036 KB Output is correct
36 Correct 210 ms 29860 KB Output is correct
37 Correct 140 ms 25200 KB Output is correct
38 Correct 74 ms 21456 KB Output is correct
39 Correct 61 ms 22236 KB Output is correct
40 Correct 13 ms 14964 KB Output is correct
41 Correct 17 ms 15248 KB Output is correct
42 Correct 10 ms 14548 KB Output is correct
43 Correct 10 ms 14524 KB Output is correct
44 Correct 430 ms 40584 KB Output is correct
45 Correct 287 ms 30456 KB Output is correct
46 Correct 394 ms 33288 KB Output is correct
47 Correct 251 ms 29496 KB Output is correct
48 Correct 85 ms 22180 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 7 ms 14292 KB Output is correct
4 Correct 7 ms 14296 KB Output is correct
5 Correct 8 ms 14360 KB Output is correct
6 Correct 7 ms 14384 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 7 ms 14328 KB Output is correct
9 Correct 7 ms 14384 KB Output is correct
10 Correct 9 ms 14408 KB Output is correct
11 Correct 7 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 7 ms 14292 KB Output is correct
14 Correct 8 ms 14508 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14424 KB Output is correct
17 Correct 9 ms 14388 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 7 ms 14384 KB Output is correct
21 Correct 8 ms 14332 KB Output is correct
22 Correct 7 ms 14372 KB Output is correct
23 Correct 8 ms 14428 KB Output is correct
24 Correct 8 ms 14380 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct
26 Correct 23 ms 15888 KB Output is correct
27 Correct 20 ms 15444 KB Output is correct
28 Correct 19 ms 15316 KB Output is correct
29 Correct 14 ms 14932 KB Output is correct
30 Correct 13 ms 14912 KB Output is correct
31 Correct 18 ms 15188 KB Output is correct
32 Correct 12 ms 14792 KB Output is correct
33 Correct 10 ms 14644 KB Output is correct
34 Correct 12 ms 14636 KB Output is correct
35 Correct 9 ms 14392 KB Output is correct
36 Correct 9 ms 14420 KB Output is correct
37 Correct 10 ms 14520 KB Output is correct
38 Correct 11 ms 14548 KB Output is correct
39 Correct 9 ms 14512 KB Output is correct
40 Correct 7 ms 14376 KB Output is correct
41 Correct 8 ms 14292 KB Output is correct
42 Correct 8 ms 14380 KB Output is correct
43 Correct 8 ms 14292 KB Output is correct
44 Correct 8 ms 14292 KB Output is correct
45 Correct 10 ms 14384 KB Output is correct
46 Correct 10 ms 14328 KB Output is correct
47 Correct 8 ms 14388 KB Output is correct
48 Correct 8 ms 14404 KB Output is correct
49 Correct 8 ms 14412 KB Output is correct
50 Correct 78 ms 22576 KB Output is correct
51 Correct 49 ms 19228 KB Output is correct
52 Correct 49 ms 19012 KB Output is correct
53 Correct 66 ms 21340 KB Output is correct
54 Correct 58 ms 20476 KB Output is correct
55 Correct 47 ms 19748 KB Output is correct
56 Correct 7 ms 14292 KB Output is correct
57 Correct 8 ms 14420 KB Output is correct
58 Correct 8 ms 14412 KB Output is correct
59 Correct 7 ms 14384 KB Output is correct
60 Correct 10 ms 14548 KB Output is correct
61 Correct 110 ms 27108 KB Output is correct
62 Correct 92 ms 24112 KB Output is correct
63 Correct 67 ms 20776 KB Output is correct
64 Correct 88 ms 22820 KB Output is correct
65 Correct 61 ms 20840 KB Output is correct
66 Correct 8 ms 14420 KB Output is correct
67 Correct 8 ms 14420 KB Output is correct
68 Correct 9 ms 14420 KB Output is correct
69 Correct 8 ms 14420 KB Output is correct
70 Correct 13 ms 14824 KB Output is correct
71 Correct 8 ms 14392 KB Output is correct
72 Correct 8 ms 14420 KB Output is correct
73 Correct 216 ms 31924 KB Output is correct
74 Correct 189 ms 28036 KB Output is correct
75 Correct 210 ms 29860 KB Output is correct
76 Correct 140 ms 25200 KB Output is correct
77 Correct 74 ms 21456 KB Output is correct
78 Correct 61 ms 22236 KB Output is correct
79 Correct 13 ms 14964 KB Output is correct
80 Correct 17 ms 15248 KB Output is correct
81 Correct 10 ms 14548 KB Output is correct
82 Correct 10 ms 14524 KB Output is correct
83 Correct 430 ms 40584 KB Output is correct
84 Correct 287 ms 30456 KB Output is correct
85 Correct 394 ms 33288 KB Output is correct
86 Correct 251 ms 29496 KB Output is correct
87 Correct 85 ms 22180 KB Output is correct
88 Correct 1928 ms 85492 KB Output is correct
89 Correct 773 ms 52260 KB Output is correct
90 Correct 1507 ms 69768 KB Output is correct
91 Correct 425 ms 39040 KB Output is correct
92 Correct 807 ms 45968 KB Output is correct
93 Correct 663 ms 49900 KB Output is correct
94 Correct 447 ms 39104 KB Output is correct
95 Correct 114 ms 26960 KB Output is correct
96 Correct 147 ms 24400 KB Output is correct
97 Correct 64 ms 22168 KB Output is correct
98 Correct 102 ms 22540 KB Output is correct
99 Correct 129 ms 22492 KB Output is correct