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 "parks.h"
#include "bits/stdc++.h"
using namespace std;
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
int construct_roads(vector<int> x, vector<int> y) {
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
vector<int> u, v, a, b;
vector<pair<int, int>> points;
map<pair<int, int>, int> idx;
for(int i = 0; i < sz(x); ++i) {
idx[{x[i], y[i]}] = i;
points.push_back({x[i], y[i]});
}
sort(all(points));
for(int i = 0; i + 1 < sz(points); ++i) {
if(points[i].second + 2 < points[i + 1].second) return 0;
u.push_back(idx[points[i]]), v.push_back(idx[points[i + 1]]);
a.push_back(points[i].first - 1);
b.push_back(points[i].second + 1);
}
build(u, v, a, b);
return 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |