| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 440932 | ogibogi2004 | Fountain Parks (IOI21_parks) | C++17 | 68 ms | 8116 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;
struct point
{
int x,y,idx;
bool operator<(point const& other)const
{
return y<other.y;
}
};
int construct_roads(vector<int> x, vector<int> y) {
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
vector<point>v;
int n=x.size();
for(int i=0;i<n;i++)
{
v.push_back({x[i],y[i],i});
}
sort(v.begin(),v.end());
for(int i=1;i<v.size();i++)
{
if(v[i].y-v[i-1].y!=2)return 0;
}
vector<int>ans1,ans2,ans3,ans4;
for(int i=1;i<v.size();i++)
{
ans1.push_back(v[i-1].idx);
ans2.push_back(v[i].idx);
ans3.push_back(v[i].x+1);
ans4.push_back(v[i-1].y+1);
}
build(ans1,ans2,ans3,ans4);
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... | ||||
