Submission #770308

#TimeUsernameProblemLanguageResultExecution timeMemory
770308ttamxTeam Contest (JOI22_team)C++14
8 / 100
2072 ms2948 KiB
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=150005;

int n,nx,ny,nz;
int x[N],y[N],z[N];
ll ans=-1;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i=1;i<=n;i++)cin >> x[i] >> y[i] >> z[i];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(x[j]>=x[i]||y[i]>=y[j])continue;
            for(int k=1;k<=n;k++){
                if(x[k]>=x[i]||y[k]>=y[j]||z[i]>=z[k]||z[j]>=z[k])continue;
                ans=max(ans,(ll)x[i]+y[j]+z[k]);
            }
        }
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...