# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3626 | BalloonCollector | Divide into triangle (kriii1_D) | C++98 | 0 ms | 1208 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair <int, int> ii;
typedef pair <ii, int> iii;
vector < iii > v;
int main(){
int n;
scanf("%d", &n);
for(int i=0; i< 3*n; i++){
int x, y;
scanf("%d %d", &x, &y);
v.push_back(iii(ii(x, y), i+1));
}
sort(v.begin(), v.end());
for(int i=0; i<n; i++){
for(int j=0; j<3; j++)
printf("%d ", v[3*i+j].second);
puts("");
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |