Submission #320145

#	Time	Username	Problem	Language	Result	Execution time	Memory
320145		nickmet2004	Stations (IOI20_stations)	C++14	0 / 100	3122 ms	2097156 KiB

stations

#include<bits/stdc++.h>
#include "stations.h"
using namespace std;
const int N = 100005;
int n;
vector<int> adj[N] , R;
int dtime;
void dfs(int u , int p = -1){
    R[u] =1000 * dtime; dtime++;
    for(int v : adj[u])if(v ^ p)dfs(v ,u);
    R[u] += dtime;
}
vector<int> label(int n , int k ,vector<int> u , vector<int> v){
    for(int i = 0; i < n; ++i) adj[i].clear();
    for(int i = 0; i < n; ++i) adj[u[i]].emplace_back(v[i]) , adj[v[i]].emplace_back(u[i]);
    R.resize(n);
    dfs(0);
    return R;
}
int find_next_station(int s , int t , vector<int> c){
    reverse(c.begin() , c.end());
    for(int x : c){
        int in = x / 1000 , out = x % 1000;
        if(in <= t && t <= out) return x;
    }
    return c[c.size() - 1];
}
/*
int main (){
    cin >> n;
    for(int i =1; i < n; ++i){
        int u , v; cin >> u>> v;
        adj[u].emplace_back(v); adj[v].emplace_back(u);
    }
    vector<int> k = label(n , 1 , {3} , {3});
    cout << find_next_station(1 , 3 , {3 , 2 ,0}) << endl;
}
*/
//int main (){}

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