Submission #1308918

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308918		duongquanghai08	기지국 (IOI20_stations)	C++20	0 / 100	403 ms	508 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1003;
vector<int> adj[N];
int in[N], timer = 0;
void dfs(int u, int par) {
    in[u] = ++timer;
    for(auto v : adj[u]) {
        if(v == par) continue;
        dfs(v, u);
    }
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    for(int i = 0; i < n; i++) adj[i].clear();
    timer = 0;
    for(int i = 0; i < n - 1; i++) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    dfs(0, -1);
    vector<int> b;
    for(int i = 0; i < n; i++) b.push_back(in[i]);
    return b;
}

int find_next_station(int s, int t, vector<int> c) {
    sort(c.begin(), c.end());
	if(s > t) {
        for(auto x : c) if(x > s) return x;
        return c.back();
	}
    else {
        int ans = 0;
        for(auto x : c) {
            if(x <= t) ans = x;
        }
        if(ans == 0) return c[0];
        return ans;
    }
}

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