# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3670 | MiNu | Divide into triangle (kriii1_D) | C++98 | 0 ms | 1676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |