# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831544 | andrey27_sm | Fountain Parks (IOI21_parks) | C++17 | 123 ms | 23208 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;
vector<pair<int,int>> cons[200001];
int mask_l[200001];
vector<int> u;
vector<int> v;
vector<int> a;
vector<int> b;
int construct_roads(vector<int> x, vector<int> y) {
int n = x.size();
int l = 1e9;
int r = 0;
for (int i = 0; i < n; ++i)
{
cons[y[i]/2].push_back({x[i],i});
mask_l[y[i]/2]|=(1<<(x[i]/2-1));
}
for (int i = 0; i <= 100000; ++i)
{
if(mask_l[i]){
l = min(l,i);
r = max(r,i);
sort(cons[i].begin(), cons[i].end());
}
}
for (int i = l; i <= r; ++i)
{
if(i != l and (mask_l[i]&mask_l[i-1]) == 0) return 0;
}
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... |