| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 824713 | andrei_boaca | 분수 공원 (IOI21_parks) | C++17 | 168 ms | 28720 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>
//#include "grader.cpp"
using namespace std;
typedef pair<int,int> pii;
map<pii,int> ind;
struct point
{
int x,y;
} v[200005];
int k;
vector<int> myy[200005];
int construct_roads(std::vector<int> X, std::vector<int> Y)
{
k=X.size();
int xmax=0;
for(int i=0;i<k;i++)
{
v[i]={X[i],Y[i]};
ind[{X[i],Y[i]}]=i;
xmax=max(xmax,X[i]);
myy[X[i]].push_back(Y[i]);
}
if(xmax<=2)
{
sort(myy[2].begin(),myy[2].end());
vector<int> U,V,a,b;
for(int i=1;i<myy[2].size();i++)
{
if(myy[2][i]-myy[2][i-1]!=2)
return 0;
int x=2;
int yu=myy[2][i-1];
int yv=myy[2][i];
U.push_back(ind[{x,yu}]);
V.push_back(ind[{x,yv}]);
a.push_back(x-1);
b.push_back(yv-1);
}
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... | ||||
