Submission #1209301

#TimeUsernameProblemLanguageResultExecution timeMemory
1209301banganFountain Parks (IOI21_parks)C++20
5 / 100
35 ms7084 KiB
#include "parks.h" #include <bits/stdc++.h> int construct_roads(std::vector<int> x, std::vector<int> y) { int n = x.size(); { int max = *std::max_element(x.begin(), x.end()); assert(max == 2); } std::vector<int> ord(n); iota(ord.begin(), ord.end(), 0); std::sort(ord.begin(), ord.end(), [&](int i, int j) { return y[i] < y[j]; }); std::vector<int> v, u; std::vector<int> a, b; for (int ith = 0; ith + 1 < n; ith++) { int i = ord[ith]; int j = ord[ith + 1]; if (y[j] - y[i] != 2) { return 0; } v.push_back(i); u.push_back(j); a.push_back(1); b.push_back(y[i] + 1); } build(v, u, a, b); return 1; }
#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...