oj.uz

Submission #672155

# Submission time Handle Problem Language Result Execution time Memory
672155 2022-12-14T21:44:27 Z Hacv16 Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 117 ms 190884 KB 
#include<bits/stdc++.h>
#include "crocodile.h"
using namespace std;

const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;

#define fr first
#define sc second

int dp[MAX], ans;
bool ex[MAX];
vector<int> adj[MAX], w[MAX];

void calcdp(int u, int p){
	if(adj[u].size() == 1){
		if(ex[u]) dp[u] = 0;
		else dp[u] = INF;

		return;
	}

	dp[u] = INF;

	for(int i = 0; i < (int) adj[u].size(); i++){
		int v = adj[u][i], c = w[u][i];

		if(v == p) continue;
		calcdp(v, u);

		dp[u] = min(dp[u], dp[v] + c);
	}
}

void dfs(int u, int p){
	pair<int, int> f1 = {INF, INF}, f2 = f1;

	for(int i = 0; i < (int) adj[u].size(); i++){
		int v = adj[u][i], c = w[u][i];

		if(v == p) continue;

		pair<int, int> cur = {dp[v] + c, v};

		if(cur < f1){ swap(f1, f2); swap(cur, f1); }
		else if(cur < f2){ swap(f2, cur); }
	}

	ans += f2.fr;
	dfs(f2.sc, u);
}

int travel_plan(int n, int m, int R[][2], int L[], int k, int P[]){
	for(int i = 0; i < m; i++){
		int u = R[i][0], v = R[i][1];
		adj[u].push_back(v);
		adj[v].push_back(u);
		w[u].push_back(L[i]);
		w[v].push_back(L[i]);
	}

	for(int i = 0; i < k; i++)
		ex[P[i]] = true;

	calcdp(0, -1);
	dfs(0, -1);

	return ans;
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 190884 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 190884 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 190884 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -