Submission #419488

#	Time	Username	Problem	Language	Result	Execution time	Memory
419488		vkgainz	Stations (IOI20_stations)	C++17	100 / 100	1097 ms	744 KiB

stations

#include <bits/stdc++.h>
using namespace std;

vector<int> st, en, d;
vector<vector<int>> adj;
int t;
void dfs(int curr, int par) {
    st[curr] = t++;
    for(int next : adj[curr]) {
        if(next == par) continue;
        d[next] = d[curr] + 1;
        dfs(next, curr);
    }
    en[curr] = t++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    adj.clear(), st.clear(), en.clear(), d.clear();
    adj.resize(n);
    st.resize(n);
    en.resize(n);
    d.resize(n);
    for(int i = 0; i < n - 1; i++) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    vector<int> ans(n);
    t = 0;
    dfs(0, -1);
    for(int i = 0; i < n; i++) {
        if(d[i] % 2 == 0) ans[i] = st[i] / 2;
        else ans[i] = en[i] / 2;
    }
    return ans;
}

int find_next_station(int s, int t, vector<int> c) {
    if(c[0] < s) {
        for(int i = (int) c.size() - 1; i >= 1; i--) {
            if(t >= c[i] && t <= s) return c[i];
        }
        return c[0];
    }
    else {
        for(int i = 0; i < (int) c.size() - 1; i++) {
            if(t <= c[i] && t >= s) return c[i];
        }
        return c.back();
    }
    return -1;
}

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