Submission #768093

#	Time	Username	Problem	Language	Result	Execution time	Memory
768093		3RR0R404	기지국 (IOI20_stations)	C++14	0 / 100	2757 ms	2097152 KiB

stations

#include <bits/stdc++.h>
using namespace std;
vector<int> child(1000,0);
int l=0;
set<int> visited;
int dfs(int node,int d,vector<int> L,vector<vector<int>> adj)
{
    visited.insert(node);
    L[node] = l;
    l++;
    for(auto p: adj[node])
    {
        if(visited.find(p)==visited.end())
        {
            continue;
        }
        child[d] += dfs(p,l,L,adj);
    }
    return child[d]+1;
}
vector<int> label(int n,int k,vector<int> u,vector<int> v)
{
    vector<vector<int>> adj(n);
    for(int i=0;i<n-1;i++)
    {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    vector<int> L(n,0);

    for(auto i: adj)
    {
        if(i.size() == 1)
        {  
            dfs(i[0],0,L,adj);
            break;
        }
    }
    return L;
}
int find_next_station(int s, int t, vector<int> c)
{
    sort(c.begin(),c.end());
    if(s+child[s]<t)
    {
        return c[0];
    }
    if(s>t)
    {
        return c[0];
    }
    return *(upper_bound(c.begin(),c.end(),t)-1);
}

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