Submission #780863

#	Time	Username	Problem	Language	Result	Execution time	Memory
780863		kamelfanger83	Stations (IOI20_stations)	C++17	0 / 100	1930 ms	2097152 KiB

stations

#include "stations.h"
#include <vector>

using namespace std;

vector<pair<int, int>> prepost;
vector<vector<int>> cons;
int C = 0;

void dfs(int i, int from){
    prepost[i].first = C++;
    for (int c : cons[i]){
        if (c == from) continue;
        dfs(c, i);
    }
    prepost[i].second = C;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    vector<int> labels(n);
    cons.resize(n);
    for (int i = 0; i < n - 1; ++i) {
        cons[u[i]].push_back(v[i]);
        cons[v[i]].push_back(u[i]);
    }
    int l = -1;
    for (int i = 0; i < n; ++i) if (cons[i].size() == 1) l = i;

    prepost.resize(n);
    dfs(l, -1);

    for (int i = 0; i < n; ++i) {
        labels[i] = prepost[i].first;
    }

    return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    if (c.size() == 1) return c[0];
    if (s < t) return max(c[0], c[1]);
    return min(c[0], c[1]);
}

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