| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 587993 | Clan328 | Fountain Parks (IOI21_parks) | C++17 | 1 ms | 212 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>
using namespace std;
#define pb push_back
int construct_roads(std::vector<int> x, std::vector<int> y) {
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
std::vector<int> u, v, a, b;
vector<pair<int, int>> yi(y.size());
for (int i = 0; i < y.size(); i++) {
yi[i] = {y[i], i};
}
sort(yi.begin(), yi.end());
bool res = true;
for (int i = 0; i < y.size()-1; i++) {
res &= yi[i].first+2 == yi[i+1].first;
u.pb(yi[i].second);
v.pb(yi[i+1].second);
a.pb(3);
b.pb(yi[i].second+1);
}
if (!res) return 0;
// int maxY = 0;
// for (int i = 0; i < y.size(); i++) maxY = max(maxY, y[i]);
// vvi mat(maxY/2-1, vi(3)), matIdx(maxY/2-1, vi(3));
// for (int i = 0; i < x.size(); i++) {
// mat[x[i]/2-1][y[i]/2-1] = 1;
// matIdx[x[i]/2-1][y[i]/2-1] = i;
// }
build(u, v, a, b);
return 1;
}
Compilation message (stderr)
| # | 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... | ||||
