oj.uz

답안 #587547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587547 2022-07-02T05:20:15 Z Tekor Team Contest (JOI22_team) C++17
64 / 100
 2000 ms 12760 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
void boos() {
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}
const int N = 3e5 + 100;
const int M = 4e3 + 100;
const ll LLINF = (ll)1e18;
ll a[N],b[N],c[N];
ll mn[M][M],mn1[M][M],mn2[M][M];
int n;
bool cmp(int x,int y) {
	return a[x] < a[y];
}
bool cmp1(int x,int y) {
	return b[x] < b[y];
}
ll check(ll x,ll y,ll t) {
	bool ch = 0,ch1 = 0,ch2 = 0;
	for(int i = 1;i <= n;i++) {
		if(a[i] == x && b[i] < y && c[i] < t)ch = 1;
		if(a[i] < x && b[i] == y && c[i] < t)ch1 = 1;
		if(a[i] < x && b[i] < y && c[i] == t)ch2 = 1;
	}
	if(ch && ch1 && ch2)return x + y + t;
	else return -1;
}
void solve() {
	cin >> n;
	vector <int> g,q;
	ll mx = 0;
	for(int i = 1;i <= n;i++) {
		cin >> a[i] >> b[i] >> c[i];
		mx = max(mx,a[i]);
		mx = max(mx,b[i]);
		mx = max(mx,c[i]);
		g.pb(i);
		q.pb(i);
	}
	ll ans = -1;
	if(mx <= 300) {
		for(int i = 1;i <= mx;i++) {
			for(int j = 1;j <= mx;j++) {
				mn[i][j] = mx + 1;
				mn1[i][j] = mx + 1;
				mn2[i][j] = mx + 1;
			}
		}
		for(int i = 1;i <= n;i++) {
			mn[a[i]][b[i] + 1] = min(mn[a[i]][b[i] + 1],c[i]);
			mn1[b[i]][a[i] + 1] = min(mn1[b[i]][a[i] + 1],c[i]);
			mn2[c[i]][a[i] + 1] = min(mn2[c[i]][a[i] + 1],b[i]);
		}
		for(int i = 1;i <= mx;i++) {
			for(int j = 2;j <= mx;j++) {
				mn[i][j] = min(mn[i][j],mn[i][j - 1]);
				mn1[i][j] = min(mn1[i][j],mn1[i][j - 1]);
				mn2[i][j] = min(mn2[i][j],mn2[i][j - 1]);
			}
		}
		//cout << mn[5][5] << " " << mn1[5][5] << " " << mn2[5][5] << endl;
		for(int i = 1;i <= mx;i++) {
			for(int j = 1;j <= mx;j++) {
				for(int h = 1;h <= mx;h++) {
					if(mn[i][j] < h && mn1[j][i] < h && mn2[h][i] < j)ans = max(ans,(ll)(i + j + h));
				}
			}
		}
		cout << ans;
		return;
	}
	sort(all(g),cmp);
	sort(all(q),cmp1);
	for(auto v : g) {
		ll mxa = a[v];
		set <ll> tt;
		//cout << v << " -- " << a[v] << endl;
		for(int j = 0;j < q.size();j++) {
			int to = q[j];
			ll mxb = b[to];
			//cout << to << " :: " << b[to] << " == ";
			if(j > 0 && b[q[j - 1]] != b[to]) {
				int pos = j - 1;
				while(pos >= 0 && b[q[pos]] == b[q[j - 1]]) {
					int p = q[pos];
					if(a[p] < mxa)tt.insert(c[p]);
					pos--;
				}	
			}
			if(a[to] >= mxa || b[v] >= mxb) {
				//cout << "fail" << endl;
				continue;
			}
			if(!tt.empty()) {
				ll val = *(tt.rbegin());
				if(val > max(c[v],c[to]))ans = max(ans,mxa + mxb + val);
				//cout << val << " ";
			}
			//cout << ans << endl;
		}
		//cout << ans << endl;
	} 
	cout << ans;
}
int main() {
	boos();
	solve();
}

Compilation message

team.cpp: In function 'void solve()':
team.cpp:83:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   for(int j = 0;j < q.size();j++) {
      |                 ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 5 ms 392 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 25 ms 6232 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 5 ms 392 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 25 ms 6232 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 1020 ms 756 KB Output is correct
27 Correct 956 ms 572 KB Output is correct
28 Correct 929 ms 572 KB Output is correct
29 Correct 810 ms 664 KB Output is correct
30 Correct 377 ms 468 KB Output is correct
31 Correct 736 ms 520 KB Output is correct
32 Correct 27 ms 6356 KB Output is correct
33 Correct 80 ms 488 KB Output is correct
34 Correct 791 ms 808 KB Output is correct
35 Correct 26 ms 6356 KB Output is correct
36 Correct 26 ms 6356 KB Output is correct
37 Correct 560 ms 540 KB Output is correct
38 Correct 535 ms 756 KB Output is correct
39 Correct 1 ms 596 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 23 ms 5508 KB Output is correct
12 Correct 16 ms 4168 KB Output is correct
13 Correct 19 ms 4808 KB Output is correct
14 Correct 23 ms 5700 KB Output is correct
15 Correct 24 ms 5676 KB Output is correct
16 Correct 23 ms 5584 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 23 ms 5508 KB Output is correct
12 Correct 16 ms 4168 KB Output is correct
13 Correct 19 ms 4808 KB Output is correct
14 Correct 23 ms 5700 KB Output is correct
15 Correct 24 ms 5676 KB Output is correct
16 Correct 23 ms 5584 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 26 ms 5844 KB Output is correct
23 Correct 25 ms 6212 KB Output is correct
24 Correct 20 ms 4936 KB Output is correct
25 Correct 27 ms 6612 KB Output is correct
26 Correct 25 ms 6308 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 23 ms 5508 KB Output is correct
12 Correct 16 ms 4168 KB Output is correct
13 Correct 19 ms 4808 KB Output is correct
14 Correct 23 ms 5700 KB Output is correct
15 Correct 24 ms 5676 KB Output is correct
16 Correct 23 ms 5584 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 26 ms 5844 KB Output is correct
23 Correct 25 ms 6212 KB Output is correct
24 Correct 20 ms 4936 KB Output is correct
25 Correct 27 ms 6612 KB Output is correct
26 Correct 25 ms 6308 KB Output is correct
27 Correct 25 ms 6228 KB Output is correct
28 Correct 3 ms 2260 KB Output is correct
29 Correct 2 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 25 ms 6516 KB Output is correct
32 Correct 27 ms 6352 KB Output is correct
33 Correct 26 ms 6372 KB Output is correct
34 Correct 70 ms 12344 KB Output is correct
35 Correct 63 ms 12016 KB Output is correct
36 Correct 60 ms 12384 KB Output is correct
37 Correct 71 ms 12760 KB Output is correct
38 Correct 51 ms 12240 KB Output is correct
39 Correct 39 ms 10332 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 23 ms 5508 KB Output is correct
12 Correct 16 ms 4168 KB Output is correct
13 Correct 19 ms 4808 KB Output is correct
14 Correct 23 ms 5700 KB Output is correct
15 Correct 24 ms 5676 KB Output is correct
16 Correct 23 ms 5584 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 26 ms 5844 KB Output is correct
23 Correct 25 ms 6212 KB Output is correct
24 Correct 20 ms 4936 KB Output is correct
25 Correct 27 ms 6612 KB Output is correct
26 Correct 25 ms 6308 KB Output is correct
27 Correct 25 ms 6228 KB Output is correct
28 Correct 3 ms 2260 KB Output is correct
29 Correct 2 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 25 ms 6516 KB Output is correct
32 Correct 27 ms 6352 KB Output is correct
33 Correct 26 ms 6372 KB Output is correct
34 Correct 70 ms 12344 KB Output is correct
35 Correct 63 ms 12016 KB Output is correct
36 Correct 60 ms 12384 KB Output is correct
37 Correct 71 ms 12760 KB Output is correct
38 Correct 51 ms 12240 KB Output is correct
39 Correct 39 ms 10332 KB Output is correct
40 Correct 362 ms 544 KB Output is correct
41 Correct 690 ms 556 KB Output is correct
42 Correct 547 ms 692 KB Output is correct
43 Correct 535 ms 588 KB Output is correct
44 Execution timed out 2071 ms 7256 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 5 ms 392 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 25 ms 6232 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 1020 ms 756 KB Output is correct
27 Correct 956 ms 572 KB Output is correct
28 Correct 929 ms 572 KB Output is correct
29 Correct 810 ms 664 KB Output is correct
30 Correct 377 ms 468 KB Output is correct
31 Correct 736 ms 520 KB Output is correct
32 Correct 27 ms 6356 KB Output is correct
33 Correct 80 ms 488 KB Output is correct
34 Correct 791 ms 808 KB Output is correct
35 Correct 26 ms 6356 KB Output is correct
36 Correct 26 ms 6356 KB Output is correct
37 Correct 560 ms 540 KB Output is correct
38 Correct 535 ms 756 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 23 ms 5508 KB Output is correct
51 Correct 16 ms 4168 KB Output is correct
52 Correct 19 ms 4808 KB Output is correct
53 Correct 23 ms 5700 KB Output is correct
54 Correct 24 ms 5676 KB Output is correct
55 Correct 23 ms 5584 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 0 ms 468 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 26 ms 5844 KB Output is correct
62 Correct 25 ms 6212 KB Output is correct
63 Correct 20 ms 4936 KB Output is correct
64 Correct 27 ms 6612 KB Output is correct
65 Correct 25 ms 6308 KB Output is correct
66 Correct 25 ms 6228 KB Output is correct
67 Correct 3 ms 2260 KB Output is correct
68 Correct 2 ms 1876 KB Output is correct
69 Correct 2 ms 1876 KB Output is correct
70 Correct 25 ms 6516 KB Output is correct
71 Correct 27 ms 6352 KB Output is correct
72 Correct 26 ms 6372 KB Output is correct
73 Correct 70 ms 12344 KB Output is correct
74 Correct 63 ms 12016 KB Output is correct
75 Correct 60 ms 12384 KB Output is correct
76 Correct 71 ms 12760 KB Output is correct
77 Correct 51 ms 12240 KB Output is correct
78 Correct 39 ms 10332 KB Output is correct
79 Correct 362 ms 544 KB Output is correct
80 Correct 690 ms 556 KB Output is correct
81 Correct 547 ms 692 KB Output is correct
82 Correct 535 ms 588 KB Output is correct
83 Execution timed out 2071 ms 7256 KB Time limit exceeded
84 Halted 0 ms 0 KB -