# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550386 | Stjarna | Team Contest (JOI22_team) | C++14 | 1 ms | 308 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 pb push_back
#define X first
#define Y second
int n,x[150005][5],ot[150005],a,b,c,ans=-1,fr[150005];
multiset<int>ss[5];
priority_queue<pair<int,pair<int,int> > >pq;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d %d %d",&x[i][0],&x[i][1],&x[i][2]);
pq.push({x[i][0]-x[i][2],{0,i}});
pq.push({x[i][1]-x[i][0],{1,i}});
pq.push({x[i][2]-x[i][1],{2,i}});
}
while(!pq.empty()){
a=pq.top().X;
b=pq.top().Y.X;
c=pq.top().Y.Y;
pq.pop();
ot[c]++;
if(ot[c]==1){
fr[c]=b;
ss[b].insert(x[c][b]);
}
else if(ot[c]==2){
ss[fr[c]].erase(ss[fr[c]].find(x[c][fr[c]]));
}
if(!pq.empty()){
if(a!=pq.top().X){
if((!ss[0].empty())&&(!ss[1].empty())&&(!ss[2].empty())){
ans=max(ans,*ss[0].begin()+*ss[1].begin()+*ss[2].begin());
}
}
}
}
printf("%d",ans);
}
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... |