제출 #959045

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959045		The_Samurai	기지국 (IOI20_stations)	C++17	52.32 / 100	600 ms	1512 KiB

stations

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

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<vector<int>> adj(n);
	vector<bool> vis(n);
	for (int i = 0; i < n - 1; i++) {
		adj[u[i]].emplace_back(v[i]);
		adj[v[i]].emplace_back(u[i]);
	}
	int z = 0;
	vector<int> tin(n), tout(n), ans(n);
	auto dfs = [&](auto &dfs, int u) -> void {
		tin[u] = tout[u] = z++;
		vis[u] = true;
		for (int v: adj[u]) {
			if (vis[v]) continue;
			dfs(dfs, v);
			tout[u] = tout[v];
		}
	};
	dfs(dfs, 0);
	for (int i = 0; i < n; i++) ans[i] = tin[i] * 1000 + tout[i];
	// cout << '\t';
	// for (int i = 0; i < n; i++) cout << tin[i] << ' ';
	// cout << endl;
	// for (int i = 0; i < n - 1; i++) cout << tin[u[i]] << ' ' << tin[v[i]] << endl;
	return ans;
}

bool is_par(int v1, int v2) {
	int tin1 = v1 / 1000, tout1 = v1 % 1000;
	int tin2 = v2 / 1000, tout2 = v2 % 1000;
	return tin1 <= tin2 and tout2 <= tout1;
}

int find_next_station(int s, int t, std::vector<int> c) {
	// cout << '\t' << s << ' ' << t << endl;
	// cout << '\t';
	// for (int x: c) cout << x << ' ';
	// cout << endl;
	for (int u: c) {
		if (is_par(s, u) and is_par(u, t)) return u;
	}
	for (int u: c) {
		if (is_par(u, s)) return u;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^

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