oj.uz

Submission #927869

# Submission time Handle Problem Language Result Execution time Memory
927869 2024-02-15T12:45:48 Z OAleksa Team Contest (JOI22_team) C++14
37 / 100
 2000 ms 256752 KB 
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
const int N = 2e5 + 69;
const int A = 4010;
const int inf = 1e9;
int n, a[N], b[N], c[N], d[A][A];
int gmx[A][A], gmn[A][A], mn[A][A];
map<int, int> ca, cb, cc;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n;
  	vector<int> x, y, z;
  	for (int i = 1;i <= n;i++) {
  		cin >> a[i] >> b[i] >> c[i];
  		x.push_back(a[i]);
  		y.push_back(b[i]);
  		z.push_back(c[i]);
  	}
  	sort(x.begin(), x.end());
  	x.erase(unique(x.begin(), x.end()), x.end());
  	sort(y.begin(), y.end());
  	y.erase(unique(y.begin(), y.end()), y.end());
  	sort(z.begin(), z.end());
  	z.erase(unique(z.begin(), z.end()), z.end());
  	for (int i = 1;i <= n;i++) {
  		auto u = lower_bound(x.begin(), x.end(), a[i]) - x.begin() + 1;
  		ca[u] = a[i];
  		a[i] = u;
  		u = lower_bound(y.begin(), y.end(), b[i]) - y.begin() + 1;
  		cb[u] = b[i];
  		b[i] = u;
  		u = lower_bound(z.begin(), z.end(), c[i]) - z.begin() + 1;
  		cc[u] = c[i];
  		c[i] = u;
  	}
  	for (int i = 0;i < A;i++) {
  		for (int j = 0;j < A;j++) {
  			gmn[i][j] = inf;
  			gmx[i][j] = -inf;
  			d[i][j] = -inf;
  			mn[i][j] = inf;
  		}
  	}
  	for (int i = 1;i <= n;i++) {
  		gmx[a[i]][b[i]] = max(c[i], gmx[a[i]][b[i]]);
  		gmn[a[i]][b[i]] = min(c[i], gmn[a[i]][b[i]]);
  	}
  	for (int i = 1;i < A;i++) {
  		for (int j = 1;j < A;j++) {
  			d[i][j] = max({d[i][j - 1], d[i - 1][j], gmx[i][j]});
  			mn[i][j] = min(mn[i][j - 1], gmn[i][j]);
  		}
  	}
  	int ans = -1;
  	for (int i = 1;i <= n;i++) {
  		for (int j = a[i] + 1;j < A;j++) {
  			if (mn[j][b[i] - 1] < d[j - 1][b[i] - 1] && d[j - 1][b[i] - 1] > c[i]) {
  				ans = max(ans, cb[b[i]] + ca[j] + cc[d[j - 1][b[i] - 1]]);
  			}
  		}
  	}
  	cout << ans << '\n';
  }
  return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 252788 KB Output is correct
2 Correct 112 ms 252924 KB Output is correct
3 Correct 111 ms 252756 KB Output is correct
4 Correct 112 ms 252952 KB Output is correct
5 Correct 111 ms 253008 KB Output is correct
6 Correct 114 ms 253012 KB Output is correct
7 Correct 111 ms 252840 KB Output is correct
8 Correct 112 ms 253008 KB Output is correct
9 Correct 111 ms 253012 KB Output is correct
10 Correct 111 ms 252956 KB Output is correct
11 Correct 110 ms 253008 KB Output is correct
12 Correct 110 ms 253012 KB Output is correct
13 Correct 111 ms 253008 KB Output is correct
14 Correct 128 ms 253020 KB Output is correct
15 Correct 116 ms 252916 KB Output is correct
16 Correct 123 ms 253024 KB Output is correct
17 Correct 122 ms 253012 KB Output is correct
18 Correct 119 ms 252920 KB Output is correct
19 Correct 120 ms 253180 KB Output is correct
20 Correct 121 ms 252880 KB Output is correct
21 Correct 121 ms 253036 KB Output is correct
22 Correct 120 ms 252992 KB Output is correct
23 Correct 118 ms 252884 KB Output is correct
24 Correct 124 ms 253008 KB Output is correct
25 Correct 121 ms 253008 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 252788 KB Output is correct
2 Correct 112 ms 252924 KB Output is correct
3 Correct 111 ms 252756 KB Output is correct
4 Correct 112 ms 252952 KB Output is correct
5 Correct 111 ms 253008 KB Output is correct
6 Correct 114 ms 253012 KB Output is correct
7 Correct 111 ms 252840 KB Output is correct
8 Correct 112 ms 253008 KB Output is correct
9 Correct 111 ms 253012 KB Output is correct
10 Correct 111 ms 252956 KB Output is correct
11 Correct 110 ms 253008 KB Output is correct
12 Correct 110 ms 253012 KB Output is correct
13 Correct 111 ms 253008 KB Output is correct
14 Correct 128 ms 253020 KB Output is correct
15 Correct 116 ms 252916 KB Output is correct
16 Correct 123 ms 253024 KB Output is correct
17 Correct 122 ms 253012 KB Output is correct
18 Correct 119 ms 252920 KB Output is correct
19 Correct 120 ms 253180 KB Output is correct
20 Correct 121 ms 252880 KB Output is correct
21 Correct 121 ms 253036 KB Output is correct
22 Correct 120 ms 252992 KB Output is correct
23 Correct 118 ms 252884 KB Output is correct
24 Correct 124 ms 253008 KB Output is correct
25 Correct 121 ms 253008 KB Output is correct
26 Correct 955 ms 253748 KB Output is correct
27 Correct 598 ms 253520 KB Output is correct
28 Correct 457 ms 253512 KB Output is correct
29 Correct 382 ms 253432 KB Output is correct
30 Correct 282 ms 253316 KB Output is correct
31 Correct 470 ms 253276 KB Output is correct
32 Correct 242 ms 253120 KB Output is correct
33 Correct 245 ms 253308 KB Output is correct
34 Correct 279 ms 253744 KB Output is correct
35 Correct 134 ms 252960 KB Output is correct
36 Correct 138 ms 253084 KB Output is correct
37 Correct 214 ms 253264 KB Output is correct
38 Correct 190 ms 253268 KB Output is correct
39 Correct 170 ms 253264 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 253008 KB Output is correct
2 Correct 110 ms 253008 KB Output is correct
3 Correct 112 ms 252916 KB Output is correct
4 Correct 112 ms 253016 KB Output is correct
5 Correct 110 ms 253012 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 110 ms 252972 KB Output is correct
8 Correct 114 ms 253008 KB Output is correct
9 Correct 110 ms 253008 KB Output is correct
10 Correct 110 ms 253008 KB Output is correct
11 Execution timed out 2081 ms 256752 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 253008 KB Output is correct
2 Correct 110 ms 253008 KB Output is correct
3 Correct 112 ms 252916 KB Output is correct
4 Correct 112 ms 253016 KB Output is correct
5 Correct 110 ms 253012 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 110 ms 252972 KB Output is correct
8 Correct 114 ms 253008 KB Output is correct
9 Correct 110 ms 253008 KB Output is correct
10 Correct 110 ms 253008 KB Output is correct
11 Execution timed out 2081 ms 256752 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 253008 KB Output is correct
2 Correct 110 ms 253008 KB Output is correct
3 Correct 112 ms 252916 KB Output is correct
4 Correct 112 ms 253016 KB Output is correct
5 Correct 110 ms 253012 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 110 ms 252972 KB Output is correct
8 Correct 114 ms 253008 KB Output is correct
9 Correct 110 ms 253008 KB Output is correct
10 Correct 110 ms 253008 KB Output is correct
11 Execution timed out 2081 ms 256752 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 253008 KB Output is correct
2 Correct 110 ms 253008 KB Output is correct
3 Correct 112 ms 252916 KB Output is correct
4 Correct 112 ms 253016 KB Output is correct
5 Correct 110 ms 253012 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 110 ms 252972 KB Output is correct
8 Correct 114 ms 253008 KB Output is correct
9 Correct 110 ms 253008 KB Output is correct
10 Correct 110 ms 253008 KB Output is correct
11 Execution timed out 2081 ms 256752 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 252788 KB Output is correct
2 Correct 112 ms 252924 KB Output is correct
3 Correct 111 ms 252756 KB Output is correct
4 Correct 112 ms 252952 KB Output is correct
5 Correct 111 ms 253008 KB Output is correct
6 Correct 114 ms 253012 KB Output is correct
7 Correct 111 ms 252840 KB Output is correct
8 Correct 112 ms 253008 KB Output is correct
9 Correct 111 ms 253012 KB Output is correct
10 Correct 111 ms 252956 KB Output is correct
11 Correct 110 ms 253008 KB Output is correct
12 Correct 110 ms 253012 KB Output is correct
13 Correct 111 ms 253008 KB Output is correct
14 Correct 128 ms 253020 KB Output is correct
15 Correct 116 ms 252916 KB Output is correct
16 Correct 123 ms 253024 KB Output is correct
17 Correct 122 ms 253012 KB Output is correct
18 Correct 119 ms 252920 KB Output is correct
19 Correct 120 ms 253180 KB Output is correct
20 Correct 121 ms 252880 KB Output is correct
21 Correct 121 ms 253036 KB Output is correct
22 Correct 120 ms 252992 KB Output is correct
23 Correct 118 ms 252884 KB Output is correct
24 Correct 124 ms 253008 KB Output is correct
25 Correct 121 ms 253008 KB Output is correct
26 Correct 955 ms 253748 KB Output is correct
27 Correct 598 ms 253520 KB Output is correct
28 Correct 457 ms 253512 KB Output is correct
29 Correct 382 ms 253432 KB Output is correct
30 Correct 282 ms 253316 KB Output is correct
31 Correct 470 ms 253276 KB Output is correct
32 Correct 242 ms 253120 KB Output is correct
33 Correct 245 ms 253308 KB Output is correct
34 Correct 279 ms 253744 KB Output is correct
35 Correct 134 ms 252960 KB Output is correct
36 Correct 138 ms 253084 KB Output is correct
37 Correct 214 ms 253264 KB Output is correct
38 Correct 190 ms 253268 KB Output is correct
39 Correct 170 ms 253264 KB Output is correct
40 Correct 113 ms 253008 KB Output is correct
41 Correct 110 ms 253008 KB Output is correct
42 Correct 112 ms 252916 KB Output is correct
43 Correct 112 ms 253016 KB Output is correct
44 Correct 110 ms 253012 KB Output is correct
45 Correct 110 ms 253012 KB Output is correct
46 Correct 110 ms 252972 KB Output is correct
47 Correct 114 ms 253008 KB Output is correct
48 Correct 110 ms 253008 KB Output is correct
49 Correct 110 ms 253008 KB Output is correct
50 Execution timed out 2081 ms 256752 KB Time limit exceeded
51 Halted 0 ms 0 KB -