# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917783 | _VIBE | Team Contest (JOI22_team) | C++17 | 1 ms | 456 KiB |
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;
#define int long long
#define endl '\n'
void Excuse_Me(int TC)
{
int n;
cin>>n;
set<pair<int,int>> s[3];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
int x;
cin>>x;
s[j].insert({x,i});
}
}
bool ok=true;
while(ok){
ok=false;
for(int i=0;i<3;i++){
for(int j=i+1;j<3;j++){
if(!s[j].empty() and !s[i].empty()){
pair<int,int> p=*s[i].rbegin();
pair<int,int> q=*s[j].rbegin();
if(p.second==q.second){
ok=true;
s[i].erase(s[i].find(p));
s[j].erase(s[j].find(q));
int k=3-i-j;
if(!s[k].empty()){
pair<int,int> r=*s[k].rbegin();
if(r.second==p.second) s[k].erase(s[k].find(r));
}
break;
}
}
}
}
}
bool poss=true;
int ans=0;
for(int i=0;i<3;i++){
if(s[i].empty()) poss=false;
else ans+=(*s[i].rbegin()).first;
}
if(!poss) cout<<-1;
else 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)
# | 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... |