[Programmers] 캠핑

#define v vector<int>

bool inRange(v i, v j,v k){
    int in_x = 0, in_y = 0;
    if( ( i[0] < k[0] && k[0] < j[0] ) || (i[0] > k[0] && k[0] > j[0]) )
        in_x = 1;
    if( ( i[1] < k[1] && k[1] < j[1] ) || (i[1] > k[1] && k[1] > j[1]) )
        in_y = 1;
    
    return in_x * in_y ;
}

int solution(int n, vector<vector<int>> data) {
    int answer = 0;
    int size = (int) data.size();
    sort(data.begin(), data.end());
    
    for(int i=0; i<size; i++){
        for(int j=i+1; j<size; j++){
            if(data[i][0] == data[j][0] || data[i][1] == data[j][1]) continue;
            
            int flag = 1;
            for(int k=0; k<size; k++){
                if(k == i || k == j){
                    continue;
                }
                if( inRange(data[i],data[j],data[k]) ) {
                    flag = 0;
                    break;
                }
            }
            if(flag)
                answer++;
        }
    }
    return answer;
}

int solution(int n, vector<vector<int>> data) {
    int answer = 0;
    int size = (int) data.size();
    sort(data.begin(), data.end());
    
    for(int i=0; i<size; i++){
        for(int j=i+1; j<size; j++){
            if(data[i][0] == data[j][0] || data[i][1] == data[j][1]) continue;
            
            for(int k=j-1; k>i; k--){
               if(data[k][0] < max(data[i][0],data[j][0]) &&
                  data[k][0] > min(data[i][0],data[j][0]) &&
                  data[k][1] < max(data[i][1],data[j][1]) &&
                  data[k][1] > min(data[i][1],data[j][1])){
                    answer--; // [1]
                    break;
                }
            }
            answer++; // [2]
        }
    }
    return answer;
}