제출 #819387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
819387		Alihan_8	Stations (IOI20_stations)	C++17	5 / 100	640 ms	720 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 = -1;
    for ( int i = 0; i < n; i++ ){
        if ( (int)g[i].size() == 1 ){
            r = i;
        }
    }
    vector <int> ans(n), used(n);
    used[r] = true;
    while ( true ){
        int nxt = -1;
        for ( auto to: g[r] ){
            if ( !used[to] ){
                nxt = to;
            }
        }
        if ( nxt == -1 ){
            break;
        }
        ans[nxt] = ans[r] + 1;
        used[nxt] = true;
        swap(r, nxt);
    }
    return ans;
}

int find_next_station(int s, int t, vector<int> c) {
    if ( (int)c.size() == 1 ){
        return c[0];
    }
    return s < t ? c[1] : c[0];
}

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