제출 #1215825

#제출 시각아이디문제언어결과실행 시간메모리
1215825noyancanturkTeam Contest (JOI22_team)C++20
100 / 100
70 ms8524 KiB
#include<bits/stdc++.h>
using namespace std;

#define int int64_t

const int lim=2e5;

int x[3][lim];
int p[3][lim];

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  int n;
  cin>>n;
  for(int i=0;i<n;i++){
    for(int j=0;j<3;j++){
      cin>>x[j][i];
      p[j][i]=i;
    }
  }
  for(int i=0;i<3;i++){
    sort(p[i],p[i]+n,[&](int a,int b) -> bool {
      return x[i][b]<x[i][a];
    });
  }
  int banned[n]{};
  int i=0,j=0,k=0;
  while(i<n&&j<n&&k<n){
    if(banned[p[0][i]])i++;
    else if(banned[p[1][j]])j++;
    else if(banned[p[2][k]])k++;
    else if(x[1][p[0][i]]==x[1][p[1][j]] || x[2][p[0][i]]==x[2][p[2][k]])banned[p[0][i]]=1;
    else if(x[0][p[1][j]]==x[0][p[0][i]] || x[2][p[1][j]]==x[2][p[2][k]])banned[p[1][j]]=1;
    else if(x[0][p[2][k]]==x[0][p[0][i]] || x[1][p[2][k]]==x[1][p[1][j]])banned[p[2][k]]=1;
    else break;
  }
  if(i<n&&j<n&&k<n){
    cout<<x[0][p[0][i]]+x[1][p[1][j]]+x[2][p[2][k]]<<'\n';
  }else cout<<"-1\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...