답안 #892200

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
892200	2023-12-25T04:14:31 Z	vjudge1	Team Contest (JOI22_team)	C++17	8 / 100	2000 ms	12028 KB

team

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
// the most CHALISHKANCHIK
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
void solve(){
	int n;
	cin >> n;
	vector<vi> a;
	for(int i = 0; i < n; i++){
		vi b(3);
		for(int &i:b)cin >> i;
		a.pb(b);
	}
	sort(all(a));
	int ans = -1;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			for(int k = 0; k < n; k++){
				if(k == j || i == k || j == i)continue;
				int mx1 = 0, mx2 = 0, mx3 = 0;
				mx1 = max({a[i][0], a[j][0], a[k][0]});
				mx2 = max({a[i][1], a[j][1], a[k][1]});
				mx3 = max({a[i][2], a[j][2], a[k][2]});
				bool ok1 = 0, ok2 = 0, ok3 = 0;
				for(int h = 0; h < 3; h++){
					if(a[i][h] > a[j][h] && a[i][h] > a[k][h])ok1 = 1;
					if(a[j][h] > a[i][h] && a[j][h] > a[k][h])ok2 = 1;
					if(a[k][h] > a[j][h] && a[k][h] > a[i][h])ok3 = 1;
				}
				if(ok1 && ok2 && ok3)ans = max(ans, mx1+mx2+mx3);
			}
		}
	}
	cout << ans << '\n';
}
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int test = 1;
	//~ cin >> test;
	while(test--){
		solve();
	}
}

Compilation message

team.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main(){
      | ^~~~

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	248 ms	460 KB	Output is correct
15	Correct	106 ms	600 KB	Output is correct
16	Correct	153 ms	460 KB	Output is correct
17	Correct	201 ms	464 KB	Output is correct
18	Correct	191 ms	344 KB	Output is correct
19	Correct	227 ms	344 KB	Output is correct
20	Correct	190 ms	596 KB	Output is correct
21	Correct	169 ms	348 KB	Output is correct
22	Correct	154 ms	460 KB	Output is correct
23	Correct	174 ms	348 KB	Output is correct
24	Correct	176 ms	468 KB	Output is correct
25	Correct	205 ms	460 KB	Output is correct

Subtask #2

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	248 ms	460 KB	Output is correct
15	Correct	106 ms	600 KB	Output is correct
16	Correct	153 ms	460 KB	Output is correct
17	Correct	201 ms	464 KB	Output is correct
18	Correct	191 ms	344 KB	Output is correct
19	Correct	227 ms	344 KB	Output is correct
20	Correct	190 ms	596 KB	Output is correct
21	Correct	169 ms	348 KB	Output is correct
22	Correct	154 ms	460 KB	Output is correct
23	Correct	174 ms	348 KB	Output is correct
24	Correct	176 ms	468 KB	Output is correct
25	Correct	205 ms	460 KB	Output is correct
26	Execution timed out	2072 ms	604 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2086 ms	12028 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2086 ms	12028 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2086 ms	12028 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Execution timed out	2086 ms	12028 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	248 ms	460 KB	Output is correct
15	Correct	106 ms	600 KB	Output is correct
16	Correct	153 ms	460 KB	Output is correct
17	Correct	201 ms	464 KB	Output is correct
18	Correct	191 ms	344 KB	Output is correct
19	Correct	227 ms	344 KB	Output is correct
20	Correct	190 ms	596 KB	Output is correct
21	Correct	169 ms	348 KB	Output is correct
22	Correct	154 ms	460 KB	Output is correct
23	Correct	174 ms	348 KB	Output is correct
24	Correct	176 ms	468 KB	Output is correct
25	Correct	205 ms	460 KB	Output is correct
26	Execution timed out	2072 ms	604 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-