#pragma once
#include <vector>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N1=1e5+100;
#define ll long long
vector<pair<int,int>> ma[N1];
ll dp[N1][2];
bool vis[N1],done_for[N1];
void dfs(int x,int p=-1)
{
if(done_for[x])
{
dp[x][0]=dp[x][1]=0;
return;
}
if(vis[x])
return;
vis[x]=1;
vector<ll> pos;
for(auto [w,y]:ma[x])
{
if(!vis[y])
{
dfs(y);
}
pos.push_back(dp[y][0]+w);
}
sort(begin(pos),end(pos));
if(pos.size()>=2)
dp[x][0]=pos[1];
}
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
for(int i=0;i<n;i++)
dp[i][0]=dp[i][1]=1e11;
for(int i=0;i<m;i++)
{
ma[r[i][0]].push_back({l[i],r[i][1]});
ma[r[i][1]].push_back({l[i],r[i][0]});
}
for(int i=0;i<k;i++)
done_for[p[i]]=1;
dfs(0);
// cout<<"Hola "<<dp[0][1]<<' '<<dp[0][0]<<endl;
return dp[0][0];
}
컴파일 시 표준 에러 (stderr) 메시지
crocodile.cpp:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |