제출 #1192040

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192040		alexdd	Stations (IOI20_stations)	C++20	5 / 100	304 ms	544 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> con[1005];
vector<int> sol;
int timer;
void dfs(int nod, int par)
{
    sol[nod] = timer++;
    for(int adj:con[nod])
    {
        if(adj==par)
            continue;
        dfs(adj,nod);
    }
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v)
{
    sol.resize(n);
    for(int i=0;i<n;i++)
        con[i].clear();
    for(int i=0;i<n-1;i++)
    {
        con[u[i]].push_back(v[i]);
        con[v[i]].push_back(u[i]);
    }
    int root=0;
    for(int i=0;i<n;i++)
        if(con[i].size() < con[root].size())
            root = i;
    timer=0;
    dfs(root,-1);
    return sol;
}
int find_next_station(int s, int t, std::vector<int> c)
{
    if(t < s)
    {
        assert(c[0] < s);
        return c[0];
    }
    assert(c[0] <= t);
    for(int i=1;i<c.size();i++)
        if(c[i] > t)
            return c[i-1];
    return c.back();
}

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