Submission #1045242

#	Time	Username	Problem	Language	Result	Execution time	Memory
1045242		VMaksimoski008	Stations (IOI20_stations)	C++17	0 / 100	535 ms	940 KiB

stations

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

const int maxn = 1005;
vector<int> graph[maxn], L;

void dfs(int u, int p) {
    for(int &v : graph[u]) {
        if(v == p) continue;
        L[v] = L[u] + 1;
        dfs(v, u);
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    for(int i=0; i<n; i++) graph[i].clear();
    for(int i=0; i<n-1; i++) {
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }
	L.resize(n);
    for(int i=0; i<n; i++) {
        if(graph[i].size() == 1) {
            dfs(i, i);
            break;
        }
    }
    return L;
}

int find_next_station(int s, int t, vector<int> c) {
	if(s < t) {
        for(int &x : c) if(x > s) return x;
        return -1;
    }

    for(int &x : c) if(x < s) return x;
    return -1;
}

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