This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
typedef tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>ordered_multiset;
#define int long long
#define endl '\n'
void Excuse_Me(int TC)
{
int n;
cin>>n;
vector<int> mx(3,0);
priority_queue<pair<int,pair<int,int>>> pq;
set<pair<int,int>> s[3];
vector<vector<int>> g(n,vector<int>(3));
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
int x;
cin>>x;
pq.push({x,{j,i}});
mx[j]=max(mx[j],x);
g[i][j]=x;
}
}
while(!pq.empty()){
pair<int,pair<int,int>> p=pq.top();
pq.pop();
int i=p.second.second,j=p.second.first;
bool poss=true;
for(int k=0;k<3;k++){
if(k==j) continue;
if(g[i][k]==mx[k]) poss=false;
}
if(poss) s[j].insert({p.first,i});
}
int ans=-1;
for(auto it1=s[0].begin();it1!=s[0].end();it1++){
for(auto it2=s[1].begin();it2!=s[1].end();it2++){
for(auto it3=s[2].begin();it3!=s[2].end();it3++){
int i=(*it1).second,j=(*it2).second,k=(*it3).second;
if(i==j or i==k or j==k) continue;
if(g[j][0]>=g[i][0] or g[k][0]>=g[i][0]) continue;
if(g[i][1]>=g[j][1] or g[k][1]>=g[j][1]) continue;
if(g[i][2]>=g[k][2] or g[j][2]>=g[k][2]) continue;
ans=max(ans,g[i][0]+g[j][1]+g[k][2]);
}
}
}
cout<<ans;
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
freopen("error.txt","w",stderr);
int Tc=1;
// cin>>Tc;
for(int tc=1;tc<=Tc;tc++)
{
Excuse_Me(tc);
}
return 0;
}
Compilation message (stderr)
team.cpp: In function 'int main()':
team.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
77 | freopen("error.txt","w",stderr);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |