제출 #567706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
567706		tqbfjotld	Team Contest (JOI22_team)	C++14	100 / 100	509 ms	27016 KiB

team

#include <bits/stdc++.h>
using namespace std;

int X[150005];
int Y[150005];
int Z[150005];
set<pair<int,int> > Xv, Yv, Zv;

void remv(int x){
    Xv.erase(Xv.lower_bound({X[x],x}));
    Yv.erase(Yv.lower_bound({Y[x],x}));
    Zv.erase(Zv.lower_bound({Z[x],x}));
}

void getTop(int&a, int&b, int&c){
    if (Xv.size()<3){
        a = -1; b = -1; c = -1;
        return;
    }
    a = (*--Xv.end()).second;
    b = (*--Yv.end()).second;
    c = (*--Zv.end()).second;
}

bool checkTop(int a, int b, int c){
    if (a==b && b==c){
        remv(a);
        return false;
    }
    if (a==b){
        remv(a);
        return false;
    }
    else if (b==c){
        remv(b);
        return false;
    }
    else if (a==c){
        remv(a);
        return false;
    }
    if (Y[a]>=Y[b] || Z[a]>=Z[c]){
        remv(a);
        return false;
    }
    if (X[b]>=X[a] || Z[b]>=Z[c]){
        remv(b);
        return false;
    }
    if (X[c]>=X[a] || Y[c]>=Y[b]){
        remv(c);
        return false;
    }
    return true;
}

int main(){
    int n;
    scanf("%d",&n);
    for (int x = 0; x<n; x++){
        scanf("%d%d%d",&X[x],&Y[x],&Z[x]);
    }
    for (int x = 0; x<n; x++){
        Xv.insert({X[x],x});
        Yv.insert({Y[x],x});
        Zv.insert({Z[x],x});
    }
    int a,b,c;
    while (true){
        getTop(a,b,c);
        if (a==-1){
            printf("-1");
            return 0;
        }
        if (checkTop(a,b,c)){
            printf("%d",X[a]+Y[b]+Z[c]);
            return 0;
        }
    }

}

컴파일 시 표준 에러 (stderr) 메시지

team.cpp: In function 'int main()':
team.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
team.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         scanf("%d%d%d",&X[x],&Y[x],&Z[x]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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