| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 530721 | Icebear16 | Fountain Parks (IOI21_parks) | C++17 | 55 ms | 8272 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>
int construct_roads(std::vector<int> x, std::vector<int> y) {
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}else{
std::vector<int> u, v, a, b;
bool flag=true;
std::vector<int> p;
p=y;
std::vector<int> t(x.size(),0);
sort(p.begin(),p.end());
int m=p[0];
for(int i=1;i<x.size();i++){
if(p[i]%2==1 || p[i]-p[i-1]!=2){
flag=false;
break;
}
}
if(flag==true){
for(int i=0;i<x.size();i++){
t[(y[i]-m)/2]=i;
}
for(int i=0;i<x.size()-1;i++){
u.push_back(t[i]);
v.push_back(t[i+1]);
a.push_back(x[i]+1);
b.push_back(p[i]+1);
}
build(u, v, a, b);
return 1;
}else{
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... | ||||
