#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int N;
cin >> N;
vector<pair<long long, int> > V;
for (int i=0; i<3*N; i++) {
int x, y;
cin >> x >> y;
V.push_back(pair<long long, int>(x*9328932855LL+y*953287581LL, i+1));
}
sort(V.begin(), V.end());
for (int i=0; i<3*N; i+=3)
printf("%d %d %d\n", V[i].second, V[i+1].second, V[i+2].second);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1680 KB |
Output is correct |
2 |
Correct |
0 ms |
1680 KB |
Output is correct |
3 |
Correct |
0 ms |
1680 KB |
Output is correct |
4 |
Correct |
0 ms |
1680 KB |
Output is correct |
5 |
Correct |
0 ms |
1680 KB |
Output is correct |
6 |
Correct |
0 ms |
1680 KB |
Output is correct |
7 |
Correct |
0 ms |
1680 KB |
Output is correct |
8 |
Correct |
0 ms |
1680 KB |
Output is correct |
9 |
Correct |
0 ms |
1680 KB |
Output is correct |
10 |
Correct |
0 ms |
1680 KB |
Output is correct |
11 |
Correct |
0 ms |
1680 KB |
Output is correct |
12 |
Correct |
0 ms |
1680 KB |
Output is correct |
13 |
Correct |
0 ms |
1680 KB |
Output is correct |
14 |
Correct |
0 ms |
1680 KB |
Output is correct |
15 |
Correct |
0 ms |
1680 KB |
Output is correct |
16 |
Correct |
0 ms |
1680 KB |
Output is correct |
17 |
Correct |
0 ms |
1680 KB |
Output is correct |
18 |
Correct |
0 ms |
1680 KB |
Output is correct |
19 |
Correct |
0 ms |
1680 KB |
Output is correct |
20 |
Correct |
0 ms |
1680 KB |
Output is correct |