Submission #1192034

#TimeUsernameProblemLanguageResultExecution timeMemory
1192034alexdd기지국 (IOI20_stations)C++20
0 / 100
305 ms556 KiB
#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]);
    }
    dfs(0,-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];
    }
    for(int i=0;i<c.size();i++)
        if(c[i] >= t)
            return c[i];
    assert(0);
}
#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...