제출 #354684

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

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1e3 + 7;

vector < int > lb, adj[N];
int num;

void dfs( int v, int pr ) {
	lb[v] = num++;
	// cout << "v -> " << v << ' ' << num - 1 << endl;
	for ( auto u: adj[v] ) {
		if ( u != pr ) {
			dfs(u, v);
		}
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for ( int i = 0; i < n; i++ ) {
		adj[i].clear();
	}
	for ( int i = 0; i < n - 1; i++ ) {
		int x = u[i], y = v[i];
		adj[x].push_back(y);
		adj[y].push_back(x);
	}
	num = 0;
	lb.clear();
	lb.resize(n);
	dfs(0, -1);
	return lb;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int pr = c[0];
	for ( auto x: c ) {
		if ( x == pr ) {
			continue;
		}
		if ( x > t ) {
			break;
		}
		pr = x;
	}
	return pr;
}

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