//#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define fi first
#define se second
int const n=1e5+3;
bitset<n> out;
vpi adj[n];
ll dfs(int now, int par)
{
ll mn=2e18;
trav(chi,adj[now])
{
if(chi.fi==par)continue;
mn=min(mn,dfs(chi.fi,now)+(ll)chi.se);
}
if(out[now])return 0;
return mn;
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
F0R(i,K)
{
out[P[i]]=1;
}
F0R(i,M)
{
int u=R[i][0];
int v=R[i][1];
adj[u].pb({v,L[i]});
adj[v].pb({u,L[i]});
}
return (int)dfs(0,-1);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
