Submission #780943

#	Time	Username	Problem	Language	Result	Execution time	Memory
780943		Blagoj	Stations (IOI20_stations)	C++17	0 / 100	3046 ms	2097152 KiB

stations

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

using namespace std;

vector<int> g[1005];
int in[1005], out[1005], parent[1005], timer = 0;

void dfs(int n, int p) {
	in[n] = timer++;
	parent[n] = p;
	for (auto x : g[n]) if (x != p) dfs(x, n);
	out[n] = timer - 1;
}
 
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	for (int i = 0; i < u.size(); i++) {
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	}
	dfs(0, -1);
	vector<int> labels(n);
	for (int i = 0; i < n; i++) labels[i] = i;
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	for (auto x : c) if (in[x] <= in[t] && in[t] <= out[x]) return x;
	return parent[s];
}

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:17:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for (int i = 0; i < u.size(); i++) {
      |                  ~~^~~~~~~~~~

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