Submission #487181

#TimeUsernameProblemLanguageResultExecution timeMemory
487181MilosMilutinovicFountain Parks (IOI21_parks)C++17
5 / 100
59 ms7892 KiB
#include "parks.h" #include <bits/stdc++.h> using namespace std; int construct_roads(std::vector<int> x, std::vector<int> y) { if (x.size() == 1) { build({}, {}, {}, {}); return 1; } int n = x.size(); int mn = *min_element(x.begin(), x.end()); int mx = *min_element(x.begin(), x.end()); if (mn == 2 && mx == 2) { int p[n]; for (int i = 0; i < n; i++) p[i] = i; sort(p, p + n, [&](int i, int j) { return y[i] < y[j]; }); for (int i = 0; i + 1 < n; i++) if (y[p[i]] + 2 != y[p[i + 1]]) return 0; vector<int> u, v, a, b; for (int i = 0; i + 1 < n; i++) { u.push_back(p[i]); v.push_back(p[i + 1]); a.push_back(x[i] - 1); b.push_back(y[p[i]] + 1); } build(u, v, a, b); return 1; } }

Compilation message (stderr)

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
   32 | }
      | ^
#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...