Submission #258894

#	Time	Username	Problem	Language	Result	Execution time	Memory
258894		amiratou	악어의 지하 도시 (IOI11_crocodile)	C++14	46 / 100	160 ms	262148 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
#define sz(x) x.size()
const int INF = (int)(1e18);

vector<pair<int,int> > vec[100005];
ll dp[100005];

void dfs(int node,int p){
	dp[node]=INF;
	multiset<ll> myset;
	for(auto it:vec[node])
		if(it.fi!=p)
			dfs(it.fi,node),myset.insert(dp[it.fi]+it.se);
	if(!sz(myset))dp[node]=0;
	else if(sz(myset)>=2)dp[node]=*next(myset.begin());
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for (int i = 0; i < M; ++i)
	{
		vec[R[i][0]].pb({R[i][1],L[i]});
		vec[R[i][1]].pb({R[i][0],L[i]});
	}
	dfs(0,0);
	return dp[0];
}

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