Submission #1132251

#TimeUsernameProblemLanguageResultExecution timeMemory
1132251Math4Life2020Team Contest (JOI22_team)C++20
8 / 100
2095 ms6576 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<ll,ll>; ll ans = -1; bool isV(array<ll,3> a, array<ll,3> b, array<ll,3> c) { for (ll k=0;k<3;k++) { if (a[k]>b[k] && a[k]>c[k]) { return 1; } } return 0; } ll gval(array<ll,3> a, array<ll,3> b, array<ll,3> c) { ll fv = 0; for (ll k=0;k<3;k++) { fv += max(a[k],max(b[k],c[k])); } return fv; } int main() { ll N; cin >> N; vector<array<ll,3>> vdt; for (ll i=0;i<N;i++) { ll x1,y1,z1; cin >> x1 >> y1 >> z1; vdt.push_back({x1,y1,z1}); } for (ll i=0;i<(N-2);i++) { for (ll j=(i+1);j<(N-1);j++) { for (ll k=(j+1);k<N;k++) { if (isV(vdt[i],vdt[j],vdt[k]) && isV(vdt[j],vdt[k],vdt[i]) && isV(vdt[k],vdt[i],vdt[j])) { ans = max(ans,gval(vdt[i],vdt[j],vdt[k])); } } } } cout << ans << "\n"; }
#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...