Submission #1215808

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215808		noyancanturk	Team Contest (JOI22_team)	C++20	0 / 100	1 ms	328 KiB

team

#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(p[0][i]==p[1][j])banned[p[0][i]]=1;
    else if(p[0][i]==p[2][k])banned[p[0][j]]=1;
    else if(p[1][j]==p[2][k])banned[p[1][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";
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27