Submission #1244077

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244077		Almonther	Team Contest (JOI22_team)	C++20	8 / 100	34 ms	3912 KiB

team

#include<bits/stdc++.h>

#define ll long long
#define co cout<<
// TLE 2 sec
using namespace std;
// stuff

void solve(){
    ll n;
    cin>>n;
    ll arr[n+5][3];
    if(n>500) return;
    ll mx=-1;
    for(int i=0;i<n;i++) cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<n;k++){
                if(arr[i][0]>max(arr[j][0],arr[k][0])&&arr[j][1]>max(arr[i][1],arr[k][1])&&arr[k][2]>max(arr[i][2],arr[j][2])){
                    mx=max(mx,arr[i][0]+arr[j][1]+arr[k][2]);
                }
            }
        }
    }
    co mx;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int _=1;
    // cin>>_;
    while(_--) solve();
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27