Submission #3670

#TimeUsernameProblemLanguageResultExecution timeMemory
3670MiNuDivide into triangle (kriii1_D)C++98
1 / 1
0 ms1676 KiB
#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 timeMemoryGrader output
Fetching results...