Submission #557978

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
557978	2022-05-06T12:03:25 Z	DanShaders	Team Contest (JOI22_team)	C++17	37 / 100	45 ms	2004 KB

team

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;

namespace x = __gnu_pbds;
template <typename T, typename Comp = less<T>>
using ordered_set = x::tree<T, x::null_type, Comp, x::rb_tree_tag, x::tree_order_statistics_node_update>;

template <typename T>
using normal_queue = priority_queue<T, vector<T>, greater<>>;

#define all(x) begin(x), end(x)
#define sz(x) ((int) (x).size())
#define x first
#define y second
using ll = long long;
using ld = long double;

const int N = 1.6e5;

using P = array<int, 3>;

P a[N];

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < 3; ++j) {
			cin >> a[i][j];
		}
	}
	sort(a, a + n);
	ordered_set<pair<int, int>, greater<>> f, b;
	f.insert({a[0][1], a[0][2]}), b.insert({a[0][2], a[0][1]});
	ll ans = -1;
	int y = -1, z = -1;
	vector<tuple<int, int, int>> cands;
	for (int i = 1; i < n - 1; ++i) {
		// add a[i]
		auto [fit, sc1] = f.insert({a[i][1], a[i][2]});
		auto [bit, sc2] = b.insert({a[i][2], a[i][1]});
		if (sc1) {
			assert(sc2);
			{
				int j = int(f.order_of_key({a[i][1], a[i][2]}));
				auto other = *b.find_by_order(j);
				if (pair{a[i][2], a[i][1]} != other) {
					y = max({y, a[i][1], other.y});
					z = max({z, a[i][2], other.x});
				}
			}
			{
				int j = int(b.order_of_key({a[i][2], a[i][1]}));
				auto other = *f.find_by_order(j);
				if (pair{a[i][1], a[i][2]} != other) {
					y = max({y, a[i][1], other.x});
					z = max({z, a[i][2], other.y});
				}
			}
		}

		if (a[i][0] == a[i + 1][0]) {
			continue;
		}
		// [0; i] and [i + 1; n - 1]
		int x = -1;
		for (int j = i + 1; j <= i + 1; ++j) {
			if (a[j][1] < y && a[j][2] < z) {
				x = a[j][0];
				break;
			}
		}
		if (x != -1) {
			ans = max(ans, 0ll + x + y + z);
		}
	}
	cout << ans;
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 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	0 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 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	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 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	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 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	0 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 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	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	6 ms	800 KB	Output is correct
27	Correct	5 ms	768 KB	Output is correct
28	Correct	7 ms	852 KB	Output is correct
29	Correct	5 ms	724 KB	Output is correct
30	Correct	3 ms	596 KB	Output is correct
31	Correct	6 ms	812 KB	Output is correct
32	Correct	4 ms	724 KB	Output is correct
33	Correct	4 ms	596 KB	Output is correct
34	Correct	5 ms	852 KB	Output is correct
35	Correct	2 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	4 ms	652 KB	Output is correct
38	Correct	4 ms	632 KB	Output is correct
39	Correct	2 ms	340 KB	Output is correct

Subtask #3
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	45 ms	2004 KB	Output is correct
12	Incorrect	27 ms	1428 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	45 ms	2004 KB	Output is correct
12	Incorrect	27 ms	1428 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	45 ms	2004 KB	Output is correct
12	Incorrect	27 ms	1428 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #6
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	45 ms	2004 KB	Output is correct
12	Incorrect	27 ms	1428 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #7
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 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	0 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 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	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	6 ms	800 KB	Output is correct
27	Correct	5 ms	768 KB	Output is correct
28	Correct	7 ms	852 KB	Output is correct
29	Correct	5 ms	724 KB	Output is correct
30	Correct	3 ms	596 KB	Output is correct
31	Correct	6 ms	812 KB	Output is correct
32	Correct	4 ms	724 KB	Output is correct
33	Correct	4 ms	596 KB	Output is correct
34	Correct	5 ms	852 KB	Output is correct
35	Correct	2 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	4 ms	652 KB	Output is correct
38	Correct	4 ms	632 KB	Output is correct
39	Correct	2 ms	340 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	1 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	45 ms	2004 KB	Output is correct
51	Incorrect	27 ms	1428 KB	Output isn't correct
52	Halted	0 ms	0 KB	-

Submission #557978

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 0 / 9.0

Subtask #4 0 / 9.0

Subtask #5 0 / 9.0

Subtask #6 0 / 9.0

Subtask #7 0 / 27.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
0 / 9.0

Subtask #4
0 / 9.0

Subtask #5
0 / 9.0

Subtask #6
0 / 9.0

Subtask #7
0 / 27.0