제출 #826554

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

stations

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

#define endl '\n'
#define db double
#define ll __int128
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

vector <vector<int>> fx; vector <int> fy; int idx;

void dfs(int node, int parent)
{
    for(auto& u : fx[node]) if(u != parent)
    {
        dfs(u, node);
    }
    idx++; fy[node] = idx;
}

vector<int> label(int n, int k, vector<int> U, vector<int> V)
{
    fx.clear(); fx.assign(n, vector <int> ());
    fy.clear(); fy.assign(n, 0); idx = 0;
    for(int i = 0; i < n - 2; i++)
    {
        fx[V[i]].push_back(U[i]);
        fx[U[i]].push_back(V[i]);
    }
    dfs(0, -1);
    return fy;
}

int find_next_station(int s, int t, vector<int> c)
{
    int n = (int) c.size(); sort(all(c));

    for(int i = 0; i < n; i++)
    {
        if(c[i] >= t) return c[i];
    }

    return c[n-1];
}

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