제출 #546439

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
546439		jhwest2	Stations (IOI20_stations)	C++17	100 / 100	811 ms	880 KiB

stations

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

const int M = 1e3 + 10;

int N[M], D[M], X[M];
vector<int> G[M];

int g = 0;
void dfs(int p, int u) {
	D[u] = D[p] + 1;
	X[u] = N[u] = ++g;
	for (int x : G[u]) if (p != x) {
		dfs(u, x);
		X[u] = max(X[u], X[x]);
	}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	g = 0;
	for (int i = 0; i < n; i++) {
		G[i].clear();
		N[i] = 0; X[i] = 0; D[i] = 0;
	}
	for (int i = 0; i < n - 1; i++) {
		G[u[i]].push_back(v[i]);
		G[v[i]].push_back(u[i]);
	}
	dfs(0, 0);

	for (int i = 0; i < n; i++) {
		if (D[i] % 2 == 0) {
			N[i] = X[i];
		}
	}
	vector<tuple<int, int, int>> V;
	for (int i = 0; i < n; i++) {
		V.emplace_back(N[i], -D[i], i);
	}
	sort(V.begin(), V.end());

	vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		auto [a, b, c] = V[i];
		labels[c] = i;
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if (s < c[0]) {
		if (s < t && t <= c[0]) {
			return c[0];
		}
		for (int i = 1; i + 1 < c.size(); i++) {
			if (c[i - 1] < t && t <= c[i]) {
				return c[i];
			}
		}
		return c.back();
	}
	else {
		for (int i = 1; i + 1 < c.size(); i++) {
			if (c[i] <= t && t < c[i + 1]) {
				return c[i];
			}
		}
		if (c.back() <= t && t < s) {
			return c.back();
		}
		return c[0];
	}
}

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:56:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for (int i = 1; i + 1 < c.size(); i++) {
      |                   ~~~~~~^~~~~~~~~~
stations.cpp:64:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |   for (int i = 1; i + 1 < c.size(); i++) {
      |                   ~~~~~~^~~~~~~~~~

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