Submission #885572

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
885572	2023-12-10T08:18:25 Z	ByeWorld	Team Contest (JOI22_team)	C++14	0 / 100	2000 ms	7648 KB

team

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#define bupol __builtin_popcount
#define int long long 
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 3e5+20;
const int LOG = 60;
const int MOD = 998244353;
const int SQRT = 520;
const int INF = 1e18;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
 
int n, x;
int a[MAXN], b[MAXN], c[MAXN];
 
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> a[i] >> b[i] >> c[i];
    }
    int ans = -1;
    for(int i=1; i<=n; i++){
        for(int j=i+1; j<=n; j++){
            for(int k=j+1; k<=n; k++){
                int id1=-1, id2=-1, id3=-1;
                
                if(a[i] > max(a[j], a[k])) id1 = i;
                else if(a[j] > max(a[i], a[k])) id1 = j; 
                else if(a[k] > max(a[i], a[j])) id1 = k;
                if(b[i] > max(b[j], b[k])) id1 = i;
                else if(b[j] > max(b[i], b[k])) id2 = j; 
                else if(b[k] > max(b[i], b[j])) id2 = k;
                if(c[i] > max(c[j], c[k])) id3 = i;
                else if(c[j] > max(c[i], c[k])) id3 = j; 
                else if(c[k] > max(c[i], c[j])) id3 = k;

                bool x = 1;
                if(id1==-1 || id2==-1 || id3==-1) x = 0;
                if(id1==id2 || id1==id3 || id2==id3) x = 0;
                if(x) ans = max(ans, max(a[i], max(a[j], a[k])) + max(b[i], max(b[j], b[k]))
                     + max(c[i], max(c[j], c[k])) );
            }
        }
    }
    cout << ans << '\n';
}

Subtask #1

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4440 KB	Output is correct
2	Correct	1 ms	4560 KB	Output is correct
3	Correct	1 ms	4552 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	67 ms	4696 KB	Output is correct
15	Correct	26 ms	4440 KB	Output is correct
16	Correct	42 ms	4444 KB	Output is correct
17	Correct	49 ms	4440 KB	Output is correct
18	Correct	53 ms	4440 KB	Output is correct
19	Incorrect	63 ms	4440 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #2

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4440 KB	Output is correct
2	Correct	1 ms	4560 KB	Output is correct
3	Correct	1 ms	4552 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	67 ms	4696 KB	Output is correct
15	Correct	26 ms	4440 KB	Output is correct
16	Correct	42 ms	4444 KB	Output is correct
17	Correct	49 ms	4440 KB	Output is correct
18	Correct	53 ms	4440 KB	Output is correct
19	Incorrect	63 ms	4440 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4696 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Execution timed out	2089 ms	7648 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4696 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Execution timed out	2089 ms	7648 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4696 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Execution timed out	2089 ms	7648 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4696 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Execution timed out	2089 ms	7648 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4440 KB	Output is correct
2	Correct	1 ms	4560 KB	Output is correct
3	Correct	1 ms	4552 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	67 ms	4696 KB	Output is correct
15	Correct	26 ms	4440 KB	Output is correct
16	Correct	42 ms	4444 KB	Output is correct
17	Correct	49 ms	4440 KB	Output is correct
18	Correct	53 ms	4440 KB	Output is correct
19	Incorrect	63 ms	4440 KB	Output isn't correct
20	Halted	0 ms	0 KB	-