Submission #1209877

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209877		a.pendov	기지국 (IOI20_stations)	C++20	0 / 100	308 ms	568 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

const long long MAXN=1009;
long long sz[MAXN];
long long ans[MAXN];
bool vis[MAXN];
vector<int> edg[MAXN];

long long dfs(int start)
{
    sz[start]=1;
    vis[start]=1;
    for(auto i:edg[start])
    {
        if(vis[i])continue;
        sz[start]+=dfs(i);
    }
    return sz[start];
}

void solve(int start,bool b,int l,int r)
{
    vis[start]=0;
    if(b)
    {
        ans[start]=r;
        r--;
    }
    else
    {
        ans[start]=l;
        l++;
    }

    for(auto i:edg[start])
    {
        if(!vis[i])continue;
        solve(i,!b,l,l+sz[i]-1);
        l+=sz[i];
    }
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v)
{
    for(int i=0;i<n;i++)edg[i].clear();
    std::vector<int> labels(n);
    for(int i=0; i<n-1; i++)
    {
        edg[u[i]].push_back(v[i]);
        edg[v[i]].push_back(u[i]);
    }
    dfs(0);
    solve(0,1,0,n-1);
    for(int i=0; i<n; i++)labels[i]=ans[i];
    return labels;
}

int find_next_station(int s, int t, std::vector<int> c)
{
    sort(c.begin(),c.end());
    if(s<c[0])
    {
        if(t<s)return c[c.size()-1];
        if(t>=c[c.size()-1])return c[c.size()-1];
        for(int i=0; i<c.size()-1; i++)
        {
            if(t<=c[i])return c[i];
        }
    }
    else
    {
        if(t>s)return c[0];
        if(t<=c[0])return c[0];
        for(int i=c.size()-1; i>0; i--)
        {
            if(t<=c[i])return c[i];
        }
    }

    return c[0];
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61