Submission #3755

# Submission time Handle Problem Language Result Execution time Memory
3755 2013-08-31T08:09:07 Z arine Cactus? Not cactus? (kriii1_C) C++
0 / 1
0 ms 1684 KB
#include <iostream>
#include <algorithm>
using namespace std;
typedef struct _point {
    int x, y;
    int num;
    bool operator<(const _point& A) const { return x<A.x || x==A.x && y<A.y; }
} point;

int N;
point data[905];

int main() {

    cin >> N;
    for(int i=0; i<3*N; ++i) {
        cin >> data[i].x >> data[i].y;
        data[i].num=i+1;
    }   
    sort(data, data+3*N);

    for(int i=0; i<3*N; i+=3)
        cout << data[i].num << " " << data[i+1].num << " " << data[i+2].num << endl;

    return 0;

}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1684 KB Output isn't correct
2 Halted 0 ms 0 KB -