Submission #696116

# Submission time Handle Problem Language Result Execution time Memory
696116 2023-02-05T14:11:20 Z penguin133 Team Contest (JOI22_team) C++17
8 / 100
2000 ms 10484 KB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, A[150005], B[150005], C[150005];
vector <pii> lmao;
void solve(){
	cin >> n;
	for(int i=1;i<=n;i++)cin >> A[i] >> B[i] >> C[i], lmao.push_back({A[i], {B[i], C[i]}});
	sort(lmao.begin(), lmao.end());
	int ans = -1;
	for(int i=1;i<=n;i++)A[i] = lmao[i-1].fi, B[i] = lmao[i-1].se.fi, C[i] = lmao[i-1].se.se;// cout << A[i] << ' ' <<B[i] << ' ' << C[i] << '\n';
	for(int i=1;i<=n;i++){
		
		for(int j=i+1;j<=n;j++){
			for(int k=j+1;k<=n;k++){
				if(A[k] <= A[i] || A[k] <= A[j])continue;
				bool f = 1, f2 = 1;
				//cout << i << ' ' << j << ' ' << k << '\n';
				if(B[j] <= B[i] || B[j] <= B[k] || C[i] <= C[k] || C[i] <= C[j])f = 0;
				if(B[i] <= B[j] || B[i] <= B[k] || C[j] <= C[k] || C[j] <= C[i])f2 = 0;
				if(f)ans = max(ans, A[k] + B[j] + C[i]);
				if(f2)ans = max(ans, A[k] + B[i] + C[j]);
			}
		}
	}
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

team.cpp:39:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   39 | main(){
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 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 0 ms 332 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 21 ms 388 KB Output is correct
15 Correct 7 ms 368 KB Output is correct
16 Correct 12 ms 340 KB Output is correct
17 Correct 14 ms 380 KB Output is correct
18 Correct 17 ms 340 KB Output is correct
19 Correct 21 ms 340 KB Output is correct
20 Correct 11 ms 372 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 4 ms 340 KB Output is correct
24 Correct 9 ms 340 KB Output is correct
25 Correct 9 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 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 0 ms 332 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 21 ms 388 KB Output is correct
15 Correct 7 ms 368 KB Output is correct
16 Correct 12 ms 340 KB Output is correct
17 Correct 14 ms 380 KB Output is correct
18 Correct 17 ms 340 KB Output is correct
19 Correct 21 ms 340 KB Output is correct
20 Correct 11 ms 372 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 4 ms 340 KB Output is correct
24 Correct 9 ms 340 KB Output is correct
25 Correct 9 ms 336 KB Output is correct
26 Execution timed out 2076 ms 728 KB Time limit exceeded
27 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 264 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Execution timed out 2077 ms 10484 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 264 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Execution timed out 2077 ms 10484 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 264 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Execution timed out 2077 ms 10484 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 264 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Execution timed out 2077 ms 10484 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 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 0 ms 332 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 21 ms 388 KB Output is correct
15 Correct 7 ms 368 KB Output is correct
16 Correct 12 ms 340 KB Output is correct
17 Correct 14 ms 380 KB Output is correct
18 Correct 17 ms 340 KB Output is correct
19 Correct 21 ms 340 KB Output is correct
20 Correct 11 ms 372 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 4 ms 340 KB Output is correct
24 Correct 9 ms 340 KB Output is correct
25 Correct 9 ms 336 KB Output is correct
26 Execution timed out 2076 ms 728 KB Time limit exceeded
27 Halted 0 ms 0 KB -