Submission #550596

#	Time	Username	Problem	Language	Result	Execution time	Memory
550596		krit3379	기지국 (IOI20_stations)	C++17	0 / 100	788 ms	5408 KiB

stations

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

int st[N],en[N],sz;
vector<int> g[N];

void dfs(int s,int f){
    st[s]=++sz;
    for(auto x:g[s]){
        if(x==f)continue;
        dfs(x,s);
    }
    en[s]=sz;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v){
    int i,a,b;
    vector<int> vec;
    for(i=0;i<n;i++)g[i].clear(),vec.push_back(i);
    for(i=0;i<n-1;i++){
        a=u[i],b=v[i];
        g[a].push_back(b);
        g[b].push_back(a);
    }
    sz=0;
    dfs(0,-1);
    return vec;
}

int find_next_station(int s, int t,vector<int> c){
    if(st[s]<=st[t]&&st[t]<=en[s]){
        for(auto x:c){
            if(st[s]<=st[x]&&st[x]<=st[t]&&st[t]<=en[x])return x;
        }
    }
    else{
        for(auto x:c){
            if(st[x]<st[s])return x;
        }
    }
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:43:1: warning: control reaches end of non-void function [-Wreturn-type]
   43 | }
      | ^

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