Submission #1237551

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237551		karel	기지국 (IOI20_stations)	C++20	0 / 100	2180 ms	2162688 KiB

stations

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

#define pb push_back
#define all(a) begin(a), end(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

vvi edges;
int c = 0;

void dfs(int at, int from, vi &v)
{
    for(auto to: edges[at])
    {
        if(to != from)
        {
            dfs(to, at, v);
        }
    }
    v[at] = c++;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> labels;

    edges.resize(n);
    labels.resize(n);
    for(int i = 0; i < n - 1; i++)
    {
        edges[u[i]].push_back(v[i]);
        edges[v[i]].push_back(u[i]);
    }

    dfs(0, -1, labels);

	return labels;
}




int find_next_station(int s, int t, std::vector<int> c) {
    if(t > s)
        return c.back();

    return *lower_bound(all(c), t);
}

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