oj.uz

Submission #8089

# Submission time Handle Problem Language Result Execution time Memory
8089 2014-08-29T12:45:07 Z gs14004 Divide into triangle (kriii1_D) C++
1 / 1
 0 ms 1096 KB 
#include <cstdio>
#include <algorithm>
using namespace std;

struct pt{int x,y,o;}a[907];
int cmp(pt a, pt b){return a.x < b.x;}

int n;

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

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory 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