oj.uz

Submission #410917

# Submission time Handle Problem Language Result Execution time Memory
410917 2021-05-23T22:33:25 Z SuhaibSawalha1 Stations (IOI20_stations) C++17
0 / 100
 1351 ms 4524 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

int go[1000][1000];
vector<vector<int>> adj;
int U, V;

void dfs (int u, int p) {
	go[U][u] = V;
	for (int v : adj[u]) {
		if (v != p) {
			dfs(v, u);
		}
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> a(n);
	iota(a.begin(), a.end(), 0);
	adj.assign(n, {});
	for (int i = 0; i < n - 1; ++i) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	for (U = 0; U < n; ++U) {
		go[U][U] = U;
		for (int v : adj[U]) {
			V = v;
			dfs(V, U);
		}
	}
	return a;
}

int find_next_station(int s, int t, std::vector<int> c) {
	return go[s][t];
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

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