Submission #1035416

#TimeUsernameProblemLanguageResultExecution timeMemory
1035416Mr_Husanboy기지국 (IOI20_stations)C++17
5 / 100
594 ms780 KiB
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second

template<typename T>
int len(T &a){return a.size();}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());


vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<vector<int>> g(n);
	for(int i = 0; i < n - 1;i ++){
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	}

	int st = 0;
	for(int i = 1; i < n; i ++) if(len(g[i]) == 1) st = i;
	vector<int> res(n);
	int cur = 0;
	auto dfs = [&](auto &dfs, int i, int p = -1)->void{
		res[i] = cur ++;
		for(auto u : g[i]){
			if(u == p) continue;
			dfs(dfs, u, i);
		}
	};	
	dfs(dfs, st);
	return res;
}

int find_next_station(int s, int t, vector<int> c) {
	if(len(c) == 1){
		return c[0];
	}
	return (t > s ? c[1] : c[0]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...