Submission #336000

#	Time	Username	Problem	Language	Result	Execution time	Memory
336000		richyrich	Stations (IOI20_stations)	C++17	0 / 100	3049 ms	2097156 KiB

stations

#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4+3;
const int inf = 1e9;
int ans[N], timer;
vector<vector<int>> adj(N);
void dfs(int x, int par) {
    for(int y : adj[x]) {
        if(y==par) continue;
        dfs(y, x);
    }
    ans[x] = timer++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    timer = 0;
    for(int i = 0; i < n-1; i++) {
        adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
    }
    for(int i = 0; i < n; i++) {
        if(adj[i].size()==1) {
            dfs(i, -1);
            break;
        }
    }
    std::vector<int> labels(n);
    for(int i = 0; i < n; i++) labels[i] = ans[i];
    return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if(s > t) return c[0];
    else return c[c.size()-1];
}

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