제출 #977348

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977348		aykhn	기지국 (IOI20_stations)	C++17	76 / 100	565 ms	1532 KiB

stations

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

using namespace std;

const int MXN = 1e3 + 5;

int in[MXN], out[MXN], tim = -1;
vector<int> adj[MXN];
vector<int> labels;

void dfs(int a, int p, int w)
{
	in[a] = ++tim;
	for (int v : adj[a])
	{
		if (v == p) continue;
		dfs(v, a, w ^ 1);
	}
	out[a] = ++tim;
	if (w) labels[a] = in[a];
	else labels[a] = out[a];
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) 
{
	tim = -1;
	for (int i = 0; i < n; i++)
	{
		in[i] = out[i] = 0;
		adj[i].clear();
	}
	for (int i = 0; i < n - 1; i++) adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
	labels.assign(n, 0);
	dfs(0, 0, 0);
	return labels;
}

int find_next_station(int s, int t, vector<int> c)
{
	sort(c.begin(), c.end());
	for (int x : c) if (x == t) return t;
	if (s == 0) 
	{
		reverse(c.begin(), c.end());
		for (int x : c) if (x <= t) return x;
	}
	int sz = c.size();
	if (sz == 1) return c[0];
	else if (s < c[0])
	{
		if (!(s + 1 <= t && t <= c[sz - 2])) return c[sz - 1];
		c.pop_back();
		for (int x : c) if (t <= x) return x;
	}
	else
	{
		if (!(c[1] <= t && t <= s - 1)) return c[0];
		c.erase(c.begin());
		reverse(c.begin(), c.end());
		for (int x : c) if (x <= t) return x;
	}
}

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

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

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