oj.uz

Submission #1003503

# Submission time Handle Problem Language Result Execution time Memory
1003503 2024-06-20T12:01:44 Z coolboy19521 Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 1 ms 2652 KB 
#include "bits/stdc++.h"
#include "crocodile.h"
#define i64 long long

using namespace std;

const i64 sz = 1e5 + 5;

vector<vector<i64>> aj[sz];
i64 f[sz], s[sz];

void dfs(int v, int p = -1) {
	if (1 == (int) aj[v].size()) {
		cout << "END " << v << '\n';
		return;
	}
	f[v] = s[v] = INT_MAX;
	for (auto& u : aj[v]) {
		int to = u[0];
		int we = u[1];
		if (to != p) {
			dfs(to, v);
			if (we + s[to] <= f[v]) {
				s[v] = f[v];
				f[v] = we + s[to];
			} else {
				s[v] = min(s[v], we + s[to]);
			}
		}
	}
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for (int i = 0; i < M; i ++) {
		int a = R[i][0];
		int b = R[i][1];
		aj[a].push_back({b, L[i]});
		aj[b].push_back({a, L[i]});
	}

	dfs(0);

	return s[0];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -