# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740080 | vjudge1 | Fountain Parks (IOI21_parks) | C++17 | 0 ms | 0 KiB |
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>
const int maxn = 2e5 + 100;
int ord[maxn];
int construct_roads(std::vector<int> x, std::vector<int> y){
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
for(int i=0; i<n; i++){
ord[i] = i;
}
// sort(ord, ord+n, [](int a, int b){
// return y[a] < y[b];
// });
bool ok = 1;
vector<int>u, v, a, b;
for(int i=1; i<n; i++){
if(y[i]-y[i-1] != 2) ok = 0;
u.push_back(ord[i-1]);
v.push_back(ord[i]);
a.push_back(1);
b.push_back(y[ord[i]]-1);
}
if(ok) build(u, v, a, b);
return ok;
}