oj.uz

Submission #3670

# Submission time Handle Problem Language Result Execution time Memory
3670 2013-08-31T07:31:11 Z MiNu Divide into triangle (kriii1_D) C++
1 / 1
 0 ms 1676 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;

int main()
{
    int n;
    cin >> n;

    map<pair<int,int>, int> pts;
    for ( int i=0 ; i<3*n ; ++i )
    {
        pair<int,int> p;
        cin >> p.first >> p.second;
        pts[p] = i;
    }

    map<pair<int,int>, int>::iterator it = pts.begin();
    for ( int i=0 ; it != pts.end() ; ++i, ++it )
    {
        printf("%d ", it->second+1);
        if ( (i+1)%3==0 ) puts("");
    }

    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct
4 Correct 0 ms 1676 KB Output is correct
5 Correct 0 ms 1676 KB Output is correct
6 Correct 0 ms 1676 KB Output is correct
7 Correct 0 ms 1676 KB Output is correct
8 Correct 0 ms 1676 KB Output is correct
9 Correct 0 ms 1676 KB Output is correct
10 Correct 0 ms 1676 KB Output is correct
11 Correct 0 ms 1676 KB Output is correct
12 Correct 0 ms 1676 KB Output is correct
13 Correct 0 ms 1676 KB Output is correct
14 Correct 0 ms 1676 KB Output is correct
15 Correct 0 ms 1676 KB Output is correct
16 Correct 0 ms 1676 KB Output is correct
17 Correct 0 ms 1676 KB Output is correct
18 Correct 0 ms 1676 KB Output is correct
19 Correct 0 ms 1676 KB Output is correct
20 Correct 0 ms 1676 KB Output is correct