| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 3427 | cki86201 | Divide into triangle (kriii1_D) | C++98 | 0 ms | 1096 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<stdio.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<math.h>
#include<stdlib.h>
using namespace std;
struct point{
	point(){}
	point(int x,int y):x(x),y(y){}
	int x,y;
	bool operator<(const point &l)const{return x!=l.x?x<l.x:y<l.y;}
}p[920];
int N,o[930];
bool comp(const int &a,const int &b)
{
	return p[a]<p[b];
}
int main()
{
	int i;
	scanf("%d",&N);
	for(i=1;i<=3*N;i++){
		scanf("%d%d",&p[i].x,&p[i].y);
	}
	for(i=1;i<=3*N;i++){o[i]=i;}
	sort(o+1,o+1+3*N,comp);
	for(i=1;i<=N;i++){
		printf("%d %d %d\n",o[3*i-2],o[3*i-1],o[3*i]);
	}
	return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
