제출 #819680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
819680		Alihan_8	기지국 (IOI20_stations)	C++17	16 / 100	666 ms	712 KiB

stations

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define pb push_back
#define ln '\n'
//#define int long long

template <class _T>
bool chmin(_T &x, const _T &y){
    bool flag = false;
    if ( x > y ){
        x = y; flag |= true;
    }
    return flag;
}

template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag = false;
    if ( x < y ){
        x = y; flag |= true;
    }
    return flag;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    vector <int> g[n];
    for ( int i = 0; i + 1 < n; i++ ){
        g[u[i]].pb(v[i]);
        g[v[i]].pb(u[i]);
    }
    int r = 0;
    for ( int i = 0; i < n; i++ ){
        if ( (int)g[i].size() > 2 ){
            r = i;
        }
    }
    vector <int> ans(n, -1);
    ans[r] = 0;
    auto &a = g[r];
    for ( int i = 0; i < (int)a.size(); i++ ){
        function <void(int,int)> dfs = [&](int x, int depth){
            ans[x] = depth + i * 1000;
            for ( auto to: g[x] ){
                if ( ans[to] != -1 ){
                    continue;
                }
                dfs(to, depth + 1);
            }
        }; dfs(a[i], 1);
    }
    return ans;
}

int find_next_station(int s, int t, vector<int> c) {
    const int f = 1e3;
    if ( !s ) return t / f * f + 1;
    if ( (s + f - 1) / f != (t + f - 1) / f ){
        return (s - 1) % f ? s - 1 : 0;
    }
    return s < t ? s + 1 : !(s - 1 % f) ? 0 : s - 1;
}

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