Submission #1204076

#TimeUsernameProblemLanguageResultExecution timeMemory
1204076simona1230Fountain Parks (IOI21_parks)C++20
0 / 100
0 ms324 KiB
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=5*1e5+5;

struct fount
{
    int x,y,i;
    fount(){}
    fount(int _x,int _y,int _i)
    {
        x=_x;
        y=_y;
        i=_i;
    }
};

bool cmp(fount f1,fount f2)
{
    return f1.y<f2.y;
}

int n;
fount p[maxn];
int construct_roads(std::vector<int> x, std::vector<int> y)
{
    n=x.size();
    for(int i=0;i<x.size();i++)
    {
        p[i]={x[i],y[i],i};
    }

    sort(p,p+n,cmp);
    vector<int> v(n-1),u(n-1),a(n-1),b(n-1);
    for(int i=1;i<x.size();i++)
    {
        if(p[i-1].y+2!=p[i].y)return 0;
        v[i]=p[i-1].i;
        u[i]=p[i].i;

        a[i]=3;
        b[i]=p[i-1].y+1;
    }
    build(v,u,a,b);
    return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...