Submission #465246

#	Time	Username	Problem	Language	Result	Execution time	Memory
465246		MohamedFaresNebili	Crocodile's Underground City (IOI11_crocodile)	C++14	0 / 100	2083 ms	2636 KiB

crocodile

#include <bits/stdc++.h>
#include "crocodile.h"

using namespace std;

int n, m, k; vector<pair<int, long long>>adj[100000];
vector<int>ex; vector<bool>e;
long long dfs(int v, int p)
{
    if(e[v]) return 0;
    long long best=1e9, ans=1e9; int node=-1;
    for(auto u:adj[v]) {
        int to=u.first; long long w=u.second;
        if(to==p) continue;
		long long cnt=w+dfs(to, v);
        if(cnt<best) node=to, best=cnt;
    }
    for(auto u:adj[v]) {
        int to=u.first; long long w=u.second;
        if(to==p||to==node) continue;
        ans=min(ans, w+dfs(to, v));
    }
    return ans;
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    n=N, m=M, k=K; e.assign(n, false);
    for(int l=0;l<m;l++) {
        int a=R[l][0], b=R[l][1]; long long w=L[l];
        adj[a].push_back({b, w}); adj[b].push_back({a, w});
    }
    for(int l=0;l<k;l++) {
        int i=P[l]; e[i]=true; ex.push_back(i);
    }
    N=dfs(0, -1);
    return N;
}

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11