제출 #959064

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959064		The_Samurai	기지국 (IOI20_stations)	C++17	0 / 100	3 ms	704 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> h(n), 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;
			h[v] = h[u] + 1;
			dfs(dfs, v);
			tout[u] = tout[v];
		}
	};
	dfs(dfs, 0);
	// for (int i = 0; i < n; i++) ans[i] = h[i] % 2 ? tout[i] * 2 + 1 : tin[i] * 2;
	// for (int i = 0; i < n; i++) cout << ans[i] << ' ';
	// cout << endl;
	return ans;
}


int find_next_station(int s, int t, std::vector<int> c) {
	sort(c.begin(), c.end());
	// cout << '\t' << s << ' ' << t << endl;
	// cout << '\t';
	// for (int u: c) cout << u << ' ';
	// cout << endl;
	if (s % 2 == 0) {
		for (int u: c) {
			if (s <= t and t <= u) return u;
		}
		return c.back();
	} else {
		reverse(c.begin(), c.end());
		for (int u: c) {
			if (u == c.back()) return u;
			if (u <= t and t <= s) return u;
		}
	}
}

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

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

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