Submission #1244659

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244659		qwusha	Stations (IOI20_stations)	C++20	10 / 100	313 ms	600 KiB

stations

#include "stations.h"

#include <iostream>
#include <bits/stdc++.h>

#define fi first
#define se second

using namespace std;

int inf = 1e9 + 7;

vector<vector<int>> g;
vector<int> par;

vector<int> tin, tout;
int curt = 0;

void dfs(int v, int p = -1) {
    tin[v] = curt;
    curt++;
    par[v] = p;
    for (auto u : g[v]) {
        if (u != p) {
            dfs(u, v);

        }
    }
    tout[v] = curt;
}

vector<int> label(int n, int k, vector<int> v, vector<int> u) {
    vector<int> res(n);
    g.assign(n, {});
    par.assign(n , -1);
    tin.assign(n, -1);
    tout.assign(n, -1);
    for (int i = 0; i < n - 1; i++) {
        g[v[i]].push_back(u[i]);
        g[u[i]].push_back(v[i]);
    }
    dfs(0);
    for (int i = 0; i < n; i++) {
        res[i] = tin[i] * 1000 + tout[i];
    }
    return res;
}



int find_next_station(int s, int t, vector<int> c) {
    int tins = s / 1000, touts = s % 1000;
    int tint = t / 1000, toutt = t % 1000;
    if (c.size() == 1) {
        return c[0];
    }
    int p = -1;
    for (auto el : c) {
        int tinel = el / 1000, toutel = el % 1000;
        if (tinel <= tins && touts <= toutel)
            p = el;
        if (tinel <= tint && toutt <= toutel && p != el) {
            return el;
        }
    }
    return p;
}

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