Submission #432784

#TimeUsernameProblemLanguageResultExecution timeMemory
432784A_D기지국 (IOI20_stations)C++14
0 / 100
891 ms656 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> ret;
vector<vector<int>> g;
int timer;
void dfs(int u,int p)
{
    ret.push_back(timer++);
    for(auto x:g[u]){
        if(x==p)continue;
        dfs(x,u);
    }
}
vector<int> label(int n, int k,vector<int> u,vector<int> v){
    timer=0;
    g.clear();
    ret.clear();
    g.resize(n);
    for(int i=0;i<n-1;i++){
        g[u[i]].push_back(v[i]);
        g[v[i]].push_back(u[i]);
    }
    for(int i=0;i<n;i++){
        if(g[i].size()==1){
            dfs(i,i);
            break;
        }
    }
    return ret;
}

int find_next_station(int s, int t,vector<int> c){
    int mx=0,mn=1e9;
    for(auto x:c){
        mn=min(mn,x);
        mx=max(mx,x);
    }
    if(s<t)return mx;
    else return mn;
}
#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...