제출 #591798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
591798		SirCovidThe19th	기지국 (IOI20_stations)	C++17	0 / 100	3147 ms	2097152 KiB

stations

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

int ti; vector<int> ans, adj[1005];

void dfs(int i, int dep, int p){
    if (dep % 2 == 0) ans[i] = ti++;
    for (int to : adj[i]) if (to != p) dfs(to, dep + 1, i);
    if (dep % 2 == 1) ans[i] = ti++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v){
    for (int i = 0; i < n; i++) adj[i].clear();
    ti = 0; ans.assign(n, 0);
    
    for (int i = 0; i < n; i++){
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    dfs(0, 0, -1);
    return ans;
}
int find_next_station(int s, int t, vector<int> c){
    if (s > c[0]){ //tout layer
        if (t < c[0] or t > s) return c[0];
        return *prev(upper_bound(c.begin(), c.end(), t));
    }
    else{ //tin layer
        if (t < s or t > c.back()) return c.back();
        return *lower_bound(c.begin(), c.end(), t);
    }
}

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