oj.uz

Submission #927927

# Submission time Handle Problem Language Result Execution time Memory
927927 2024-02-15T14:07:49 Z OAleksa Team Contest (JOI22_team) C++14
37 / 100
 2000 ms 255928 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;
  	int C;
  	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;
  		C = max({C, a[i], b[i], c[i]});
  	}
  	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 R;
  	if (C <= 4000)
  		R = 4000;
  	else
  		R = n;
  	int ans = -1;
  	for (int i = 1;i <= n;i++) {
  		for (int j = R;j > a[i];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]]);
  				break;
  			}
  		}
  	}
  	cout << ans << '\n';
  }
  return 0;
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:64:4: warning: 'C' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |    if (C <= 4000)
      |    ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 252972 KB Output is correct
2 Correct 113 ms 252952 KB Output is correct
3 Correct 110 ms 252756 KB Output is correct
4 Correct 110 ms 253008 KB Output is correct
5 Correct 112 ms 253268 KB Output is correct
6 Correct 111 ms 252756 KB Output is correct
7 Correct 110 ms 253008 KB Output is correct
8 Correct 111 ms 252924 KB Output is correct
9 Correct 111 ms 253008 KB Output is correct
10 Correct 109 ms 252876 KB Output is correct
11 Correct 110 ms 252756 KB Output is correct
12 Correct 110 ms 253012 KB Output is correct
13 Correct 111 ms 253008 KB Output is correct
14 Correct 119 ms 252972 KB Output is correct
15 Correct 117 ms 253036 KB Output is correct
16 Correct 121 ms 253012 KB Output is correct
17 Correct 119 ms 252944 KB Output is correct
18 Correct 118 ms 253044 KB Output is correct
19 Correct 118 ms 253008 KB Output is correct
20 Correct 120 ms 253012 KB Output is correct
21 Correct 122 ms 253264 KB Output is correct
22 Correct 129 ms 252996 KB Output is correct
23 Correct 122 ms 253008 KB Output is correct
24 Correct 119 ms 253012 KB Output is correct
25 Correct 118 ms 253008 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 252972 KB Output is correct
2 Correct 113 ms 252952 KB Output is correct
3 Correct 110 ms 252756 KB Output is correct
4 Correct 110 ms 253008 KB Output is correct
5 Correct 112 ms 253268 KB Output is correct
6 Correct 111 ms 252756 KB Output is correct
7 Correct 110 ms 253008 KB Output is correct
8 Correct 111 ms 252924 KB Output is correct
9 Correct 111 ms 253008 KB Output is correct
10 Correct 109 ms 252876 KB Output is correct
11 Correct 110 ms 252756 KB Output is correct
12 Correct 110 ms 253012 KB Output is correct
13 Correct 111 ms 253008 KB Output is correct
14 Correct 119 ms 252972 KB Output is correct
15 Correct 117 ms 253036 KB Output is correct
16 Correct 121 ms 253012 KB Output is correct
17 Correct 119 ms 252944 KB Output is correct
18 Correct 118 ms 253044 KB Output is correct
19 Correct 118 ms 253008 KB Output is correct
20 Correct 120 ms 253012 KB Output is correct
21 Correct 122 ms 253264 KB Output is correct
22 Correct 129 ms 252996 KB Output is correct
23 Correct 122 ms 253008 KB Output is correct
24 Correct 119 ms 253012 KB Output is correct
25 Correct 118 ms 253008 KB Output is correct
26 Correct 116 ms 253524 KB Output is correct
27 Correct 204 ms 253320 KB Output is correct
28 Correct 234 ms 253400 KB Output is correct
29 Correct 276 ms 253264 KB Output is correct
30 Correct 207 ms 253104 KB Output is correct
31 Correct 243 ms 253180 KB Output is correct
32 Correct 205 ms 253012 KB Output is correct
33 Correct 210 ms 253012 KB Output is correct
34 Correct 219 ms 253520 KB Output is correct
35 Correct 137 ms 253076 KB Output is correct
36 Correct 134 ms 253012 KB Output is correct
37 Correct 209 ms 253348 KB Output is correct
38 Correct 191 ms 253016 KB Output is correct
39 Correct 159 ms 253012 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 252756 KB Output is correct
2 Correct 110 ms 253004 KB Output is correct
3 Correct 111 ms 253004 KB Output is correct
4 Correct 113 ms 253008 KB Output is correct
5 Correct 113 ms 253004 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 112 ms 252864 KB Output is correct
8 Correct 112 ms 253020 KB Output is correct
9 Correct 110 ms 252872 KB Output is correct
10 Correct 112 ms 252904 KB Output is correct
11 Execution timed out 2037 ms 255928 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 252756 KB Output is correct
2 Correct 110 ms 253004 KB Output is correct
3 Correct 111 ms 253004 KB Output is correct
4 Correct 113 ms 253008 KB Output is correct
5 Correct 113 ms 253004 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 112 ms 252864 KB Output is correct
8 Correct 112 ms 253020 KB Output is correct
9 Correct 110 ms 252872 KB Output is correct
10 Correct 112 ms 252904 KB Output is correct
11 Execution timed out 2037 ms 255928 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 252756 KB Output is correct
2 Correct 110 ms 253004 KB Output is correct
3 Correct 111 ms 253004 KB Output is correct
4 Correct 113 ms 253008 KB Output is correct
5 Correct 113 ms 253004 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 112 ms 252864 KB Output is correct
8 Correct 112 ms 253020 KB Output is correct
9 Correct 110 ms 252872 KB Output is correct
10 Correct 112 ms 252904 KB Output is correct
11 Execution timed out 2037 ms 255928 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 252756 KB Output is correct
2 Correct 110 ms 253004 KB Output is correct
3 Correct 111 ms 253004 KB Output is correct
4 Correct 113 ms 253008 KB Output is correct
5 Correct 113 ms 253004 KB Output is correct
6 Correct 110 ms 253012 KB Output is correct
7 Correct 112 ms 252864 KB Output is correct
8 Correct 112 ms 253020 KB Output is correct
9 Correct 110 ms 252872 KB Output is correct
10 Correct 112 ms 252904 KB Output is correct
11 Execution timed out 2037 ms 255928 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 252972 KB Output is correct
2 Correct 113 ms 252952 KB Output is correct
3 Correct 110 ms 252756 KB Output is correct
4 Correct 110 ms 253008 KB Output is correct
5 Correct 112 ms 253268 KB Output is correct
6 Correct 111 ms 252756 KB Output is correct
7 Correct 110 ms 253008 KB Output is correct
8 Correct 111 ms 252924 KB Output is correct
9 Correct 111 ms 253008 KB Output is correct
10 Correct 109 ms 252876 KB Output is correct
11 Correct 110 ms 252756 KB Output is correct
12 Correct 110 ms 253012 KB Output is correct
13 Correct 111 ms 253008 KB Output is correct
14 Correct 119 ms 252972 KB Output is correct
15 Correct 117 ms 253036 KB Output is correct
16 Correct 121 ms 253012 KB Output is correct
17 Correct 119 ms 252944 KB Output is correct
18 Correct 118 ms 253044 KB Output is correct
19 Correct 118 ms 253008 KB Output is correct
20 Correct 120 ms 253012 KB Output is correct
21 Correct 122 ms 253264 KB Output is correct
22 Correct 129 ms 252996 KB Output is correct
23 Correct 122 ms 253008 KB Output is correct
24 Correct 119 ms 253012 KB Output is correct
25 Correct 118 ms 253008 KB Output is correct
26 Correct 116 ms 253524 KB Output is correct
27 Correct 204 ms 253320 KB Output is correct
28 Correct 234 ms 253400 KB Output is correct
29 Correct 276 ms 253264 KB Output is correct
30 Correct 207 ms 253104 KB Output is correct
31 Correct 243 ms 253180 KB Output is correct
32 Correct 205 ms 253012 KB Output is correct
33 Correct 210 ms 253012 KB Output is correct
34 Correct 219 ms 253520 KB Output is correct
35 Correct 137 ms 253076 KB Output is correct
36 Correct 134 ms 253012 KB Output is correct
37 Correct 209 ms 253348 KB Output is correct
38 Correct 191 ms 253016 KB Output is correct
39 Correct 159 ms 253012 KB Output is correct
40 Correct 111 ms 252756 KB Output is correct
41 Correct 110 ms 253004 KB Output is correct
42 Correct 111 ms 253004 KB Output is correct
43 Correct 113 ms 253008 KB Output is correct
44 Correct 113 ms 253004 KB Output is correct
45 Correct 110 ms 253012 KB Output is correct
46 Correct 112 ms 252864 KB Output is correct
47 Correct 112 ms 253020 KB Output is correct
48 Correct 110 ms 252872 KB Output is correct
49 Correct 112 ms 252904 KB Output is correct
50 Execution timed out 2037 ms 255928 KB Time limit exceeded
51 Halted 0 ms 0 KB -