| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 3625 | pl0892029 | Divide into triangle (kriii1_D) | C++98 | 0 ms | 1092 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>
using namespace std;
typedef struct point {
 int x,y,idx;
}point;
bool cmp(point A,point B) {
 return A.y == B.y ? A.x < B.x : A.y < B.y;
}
int main() {
 int n;
 scanf("%d",&n);
 point arr[1000];
 for(int i=0;i<3*n;i++) {
  scanf("%d %d",&arr[i].x,&arr[i].y);
  arr[i].idx = i+1;
 }
 sort(arr,arr+3*n,cmp);
 for(int i=0;i<n;i++) {
  for(int j=0;j<3;j++)
   printf("%d ",arr[3*i+j].idx);
  puts("");
 }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
