Submission #406572

#	Time	Username	Problem	Language	Result	Execution time	Memory
406572		priority_queue	Stations (IOI20_stations)	C++14	100 / 100	1140 ms	748 KiB

stations

#include <bits/stdc++.h>

#define forint(i, N) for (int i = 0; i < (N); i++)

using namespace std;

vector<int> value;
vector<bool> visited;

int minval = 0;

void go(vector< vector<int> >& graph, int n, bool odd) {

	visited[n] = true;

	if (odd) {
		for (auto& i : graph[n]) {
			if (!visited[i]) {
				go(graph, i, !odd);
			}
		}
		value[n] = minval;
		minval++;
	}
	else {
		value[n] = minval;
		minval++;
		for (auto& i : graph[n]) {
			if (!visited[i]) {
				go(graph, i, !odd);
			}
		}
	}
	
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector< vector<int> > graph(n);

	visited.clear();
	visited.resize(n);
	fill(visited.begin(), visited.end(), false);

	value.clear();
	value.resize(n);
	fill(value.begin(), value.end(), -1);

	forint(i, n - 1) {
		graph[u[i]].push_back(v[i]);
		graph[v[i]].push_back(u[i]);
	}

	minval = 0;
	go(graph, 0, true);

	return value;
}

int find_next_station(int s, int t, vector<int> c) {

	if (s < c[0]) {
		if (t < s || t > c[c.size() - 1]) {
			return c[c.size() - 1];
		}
		forint(i, c.size()) {
			if (c[i] >= t) {
				return c[i];
			}
		}
	}
	else {
		if (t > s || t < c[0]) {
			return c[0];
		}
		for (int i = c.size() - 1; i >= 0; i--) {
			if (t >= c[i]) {
				return c[i];
			}
		}
	}
	
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:3:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define forint(i, N) for (int i = 0; i < (N); i++)
      |                                        ^
stations.cpp:65:3: note: in expansion of macro 'forint'
   65 |   forint(i, c.size()) {
      |   ^~~~~~
stations.cpp:82:1: warning: control reaches end of non-void function [-Wreturn-type]
   82 | }
      | ^

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