제출 #1292773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292773		kahoul	기지국 (IOI20_stations)	C++20	0 / 100	2 ms	540 KiB

stations

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

const int maxn = 1003;
vector<int> rel[maxn];
int in[maxn];
int out[maxn];

int t = 0;

void dfs (int u, int p) {
	in[u] = t++;
	for (auto v : rel[u]) {
		if ( v== p) continue;
		dfs(v,u );
	}
	out[u] = t;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	for (int i = 0; i < n; i++) {
		rel[i].clear();
	}

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

	for (int i = 0; i < n; i++) {
		labels[i] = (in[i] << 10) + out[i];
		cout << labels[i] <<'\n';
	}

	return labels;
}

typedef pair<int, int> pii;

pii find (int x) {
	pii ans = {x >> 10, x & ((1 << 10) - 1)};
	//cout << x << ' ' << ans.first << ' ' << ans.second << '\n';
	return ans;
}

int find_next_station(int u, int t, vector<int> adj) {
	auto [in, out] = find(u);
	auto [tin, tout] = find(t);

	int parent = 0;
	for (auto v : adj) {
		auto [vin, vout] = find(v);
		if (vin <= in && out <= vout) parent = v;
		else if (vin <= tin && tout <= vout) return v;
	}

	return parent;
}

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