oj.uz

답안 #3625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
3625 2013-08-31T07:05:07 Z pl0892029 Divide into triangle (kriii1_D) C++
1 / 1
 0 ms 1092 KB 
#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("");
 }
}

Subtask #1
1.0 / 1.0

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