제출 #588992

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
588992		snasibov05	기지국 (IOI20_stations)	C++14	0 / 100	3065 ms	496 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int mx = 1e3;
const int mxl = 1e6;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {

    vector<vector<int>> ed(n);
    for (int i = 0; i < n-1; ++i) {
        ed[u[i]].push_back(v[i]);
        ed[v[i]].push_back(u[i]);
    }

    int rt = 0;
    for (int i = 0; i < n; ++i){
        if (ed[i].size() > ed[rt].size()) rt = i;
    }

    int x = 1;
    vector<int> label(n);
    for (auto to : ed[rt]){
        int prev = rt;
        int l = x * mx - 1;
        int cur = to;
        while (ed[cur].size() != 1){
            label[cur] = l--;
            if (ed[cur][0] == prev) cur = ed[cur][1];
            else cur = ed[cur][0];
        }
        label[cur] = l;
        x++;
    }

    label[rt] = mxl;

    return label;
}

int find_next_station(int s, int t, vector<int> c) {
    if (s == mxl){
        for (auto x : c){
            if (x / mx == t / mx) return x;
        }
    } else if (s / mx == t / mx){
        if (s > t){
            for (auto x : c){
                if (s > x) return x;
            }
        }
        else{
            for (auto x : c){
                if (s < x) return x;
            }
        }
    } else{
        for (auto x : c){
            if (s < x) return x;
        }
    }

    return c[0];
}

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