Submission #1216837

#TimeUsernameProblemLanguageResultExecution timeMemory
1216837MateiKing80Roads (CEOI20_roads)C++20
15 / 100
23 ms1096 KiB
#include <bits/extc++.h> using namespace std; using pii = pair<int, int>; #define fr first #define sc second pii pts[200000]; int dx, dy; bool cmp(pii a, pii b) { int va = a.fr * dy - a.sc * dx; int vb = b.fr * dy - b.sc * dx; if (va != vb) return va < vb; return a < b; } signed main() { int n; cin >> n; for (int i = 0; i < 2 * n; i ++) cin >> pts[i].fr >> pts[i].sc; dx = pts[0].fr - pts[1].fr; dy = pts[0].sc - pts[1].sc; sort(pts, pts + 2 * n, cmp); for (int i = 0; i < n - 1; i ++) cout << pts[2 * i + 1].fr << " " << pts[2 * i + 1].sc << " " << pts[2 * i + 2].fr << " " << pts[2 * i + 2].sc << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...