oj.uz

답안 #4109

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
4109 2013-09-01T14:09:57 Z jays Divide into triangle (kriii1_D) C++
1 / 1
 0 ms 1096 KB 
#include <algorithm>
#include <cstdio>

using namespace std;

struct Stake {
	int x, y, id;
	bool operator < (const Stake& s) const {
		return x != s.x ? x < s.x : y < s.y;
	}
};

int N;
Stake s[901];

int main() {
	scanf("%d", &N);
	for (int i = 0; i < 3 * N; ++i) {
		scanf("%d%d", &s[i].x, &s[i].y);
		s[i].id = i + 1;
	}
	sort(s, s + 3 * N);
	for (int i = 0; i < N; ++i)
		printf("%d %d %d\n", s[3*i].id, s[3*i+1].id, s[3*i+2].id);
	return 0;
}

Subtask #1
1.0 / 1.0

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