제출 #1072956

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1072956		Ignut	기지국 (IOI20_stations)	C++17	5 / 100	617 ms	936 KiB

stations

// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 1111;

vector<int> tree[N];

vector<int> order;

void dfs(int v, int par) {
    order.push_back(v);
    for (int to : tree[v])
        if (to != par)
            dfs(to, v);
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    order.clear();
    for (int i = 0; i < n; i ++) {
        tree[i].clear();
    }

    for (int i = 0; i < n - 1; i ++) {
        tree[u[i]].push_back(v[i]);
        tree[v[i]].push_back(u[i]);
    }
    int start = 0;
    for (int i = 0; i < n; i ++)
        if (tree[i].size() == 1)
            start = i;
    dfs(start, -1);

    vector<int> lbl(n);
    for (int i = 0; i < n; i ++) lbl[order[i]] = i;

    return lbl;
}



int find_next_station(int s, int t, vector<int> c) {
    if (c.size() == 1)
        return c[0];
    int mn = min(c[0], c[1]);
    int mx = max(c[0], c[1]);
    if (s < t) return mx;
    return mn;
}

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