oj.uz

Submission #958561

# Submission time Handle Problem Language Result Execution time Memory
958561 2024-04-06T03:58:05 Z horiseun Stations (IOI20_stations) C++17
0 / 100
 580 ms 1068 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include "stations.h"
using namespace std;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<vector<int>> adj(n, vector<int>(0));
	for (int i = 0; i < n - 1; i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	vector<int> in(n, 0);
	int idx = 0;
	function<void(int, int)> dfs = [&] (int curr, int par) {
		in[curr] = idx++;
		for (int i : adj[curr]) {
			if (i == par) continue;
			dfs(i, curr);
		}
	};
	dfs(0, -1);
	return in;
}

int find_next_station(int s, int t, vector<int> c) {
	for (int i : c) {
		if (i == t) return i;
		if (i >= min(s, t) && i <= max(s, t)) return i;
	}
	return -1;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 580 ms 688 KB Output is correct
2 Incorrect 446 ms 944 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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