Submission #719678

#TimeUsernameProblemLanguageResultExecution timeMemory
719678lamTeam Contest (JOI22_team)C++14
8 / 100
2080 ms4612 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int maxn = 1e5 + 5e4 + 10; typedef pair<int,int> ii; typedef pair<int,ii> iii; #define ff first #define ss second int n; iii a[maxn]; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin>>n; for (int i=1; i<=n; i++) cin>>a[i].ff>>a[i].ss.ff>>a[i].ss.ss; int ans=-1; for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) if (a[i].ff>a[j].ff&&a[j].ss.ff>a[i].ss.ff) for (int z=1; z<=n; z++) if (a[i].ff>a[z].ff&&a[j].ss.ff>a[z].ss.ff&&a[z].ss.ss>max(a[i].ss.ss,a[j].ss.ss)) ans=max(ans,a[i].ff+a[j].ss.ff+a[z].ss.ss); 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...