Submission #1308935

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308935		duongquanghai08	기지국 (IOI20_stations)	C++20	100 / 100	394 ms	568 KiB

stations

#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
vector<int> adj[N];
int in[N];
int timer;
void dfs(int u, int p, int depth) {
    if (depth % 2 == 0) in[u] = timer++;
    for (int v : adj[u]) {
        if (v != p) dfs(v, u, depth + 1);
    }
    if (depth % 2 != 0) in[u] = timer++;
}
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, 0);
    vector<int> ans(n);
    for (int i = 0; i < n; i++) ans[i] = in[i];
    return ans;
}
int find_next_station(int s, int t, vector<int> c) {
    if(s < c[0]) {
        if (t < s) return c.back();
        for (int x : c) {
            if (x >= t) return x;
        }
        return c.back();
    }
    else {
        if (t > s) return c[0];
        for (int i = c.size() - 1; i >= 0; i--) {
            if (c[i] <= t) return c[i];
        }
        return c[0];
    }
}

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