oj.uz

Submission #1092889

# Submission time Handle Problem Language Result Execution time Memory
1092889 2024-09-25T09:49:38 Z huyngo Stations (IOI20_stations) C++17
0 / 100
 608 ms 684 KB 
#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) {
	std::vector<int> labels(n);
	vector<vector<int>> adj(n);
	for (int i = 0; i < n - 1; ++i) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	for (int i = 0; i < n; ++i)
		sort(adj[i].begin(), adj[i].end());
	int dtime = -1;
	auto dfs = [&](auto self, int u, int p) -> void {
		labels[u] = ++dtime;
		for (int v : adj[u]) if (v != p) {
			self(self, v, u);
		}
		};
	dfs(dfs, 0, -1);
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if (t < s)
		return *min_element(c.begin(), c.end());
	int id = upper_bound(c.begin(), c.end(), t) - c.begin() - 1;
	return c[id];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 356 ms 684 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 286 ms 684 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 388 ms 684 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 608 ms 684 KB Output is correct
2 Correct 455 ms 684 KB Output is correct
3 Incorrect 423 ms 684 KB Wrong query response.
4 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 367 ms 684 KB Wrong query response.
2 Halted 0 ms 0 KB -