oj.uz

답안 #4210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
4210 2013-09-05T09:18:38 Z zorrapower Divide into triangle (kriii1_D) C++
1 / 1
 0 ms 1088 KB 
#include <stdio.h>

typedef struct pointType{
	int x;
	int y;
	int index;
	int sumXY;
}pointType;

int main(void){
	int N;
	int currentIndex=0;
	pointType point[900]={0,};

	scanf("%d", &N);
	for(int i=0; i<3*N; i++){
		scanf("%d %d", &point[i].x, &point[i].y);
		point[i].index=++currentIndex;
		point[i].sumXY=point[i].x + point[i].y;
	}

	for(int i=0; i<3*N; i++){
		for(int j=i; j<3*N; j++){
			if(point[i].sumXY > point[j].sumXY){
				pointType tmp;
				tmp=point[i];
				point[i]=point[j];
				point[j]=tmp;
			}
		}
	}

	for(int i=0; i<3*N; i++){
		printf("%d ", point[i].index);
		if(i%3==2)
			printf("\n");
	}

	return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 0 ms 1088 KB Output is correct
16 Correct 0 ms 1088 KB Output is correct
17 Correct 0 ms 1088 KB Output is correct
18 Correct 0 ms 1088 KB Output is correct
19 Correct 0 ms 1088 KB Output is correct
20 Correct 0 ms 1088 KB Output is correct