Submission #401111

#	Time	Username	Problem	Language	Result	Execution time	Memory
401111		dxz05	기지국 (IOI20_stations)	C++14	0 / 100	3054 ms	2097156 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1011;

vector<int> g[MAXN];

int tin[MAXN], timer = 0;
void dfs(int v, int p){
    tin[v] = timer++;
    for (int u : g[v]){
        if (u != p) dfs(u, v);
    }
}

vector<int> label(int n, int k, vector<int> U, vector<int> V) {
    for (int i = 0; i < n - 1; i++){
        g[U[i]].push_back(V[i]);
    }

    dfs(0, -1);

	vector<int> labels(n, 0);
	for (int i = 0; i < n; i++){
        labels[i] = tin[i];
	}

	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    if (c[0] >= t) return c[0];
    int pos = upper_bound(c.begin(), c.end(), t) - c.begin() - 1;
    return c[pos];
}

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