#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 |
Correct |
0 ms |
1684 KB |
Output is correct |
2 |
Correct |
0 ms |
1684 KB |
Output is correct |
3 |
Correct |
0 ms |
1684 KB |
Output is correct |
4 |
Correct |
0 ms |
1684 KB |
Output is correct |
5 |
Correct |
0 ms |
1684 KB |
Output is correct |
6 |
Correct |
0 ms |
1684 KB |
Output is correct |
7 |
Correct |
0 ms |
1684 KB |
Output is correct |
8 |
Correct |
0 ms |
1684 KB |
Output is correct |
9 |
Correct |
0 ms |
1684 KB |
Output is correct |
10 |
Correct |
0 ms |
1684 KB |
Output is correct |
11 |
Correct |
0 ms |
1684 KB |
Output is correct |
12 |
Correct |
0 ms |
1684 KB |
Output is correct |
13 |
Correct |
0 ms |
1684 KB |
Output is correct |
14 |
Correct |
0 ms |
1684 KB |
Output is correct |
15 |
Correct |
0 ms |
1684 KB |
Output is correct |
16 |
Correct |
0 ms |
1684 KB |
Output is correct |
17 |
Correct |
0 ms |
1684 KB |
Output is correct |
18 |
Correct |
0 ms |
1684 KB |
Output is correct |
19 |
Correct |
0 ms |
1684 KB |
Output is correct |
20 |
Correct |
0 ms |
1684 KB |
Output is correct |