This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
using namespace std;
const int mxN = 3e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
if (a < b) {a = b; return true;} return false;
}
int n , m , k;
vector<pair<int , int>> adj[mxN];
bool exitnode[mxN];
ll dp1[mxN] , dp2[mxN];
ll 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];
int v = r[i][1];
int c = l[i];
++u; ++v;
adj[u].pb({v , c});
adj[v].pb({u , c});
}
memset(dp1, 0x3f , sizeof dp1);
memset(dp2, 0x3f , sizeof dp2);
priority_queue <pair<ll , int>, vector <pair<ll , int>> , greater<pair<ll , int>>> pq;
for(int i = 0 ; i < k ; i++) {
exitnode[p[i] + 1] = true;
pq.push({dp1[p[i] + 1] = dp2[p[i] + 1] = 0 , p[i] + 1});
}
while(!pq.empty()) {
int u = pq.top().se;
ll d = pq.top().fi;
pq.pop();
if(d > dp2[u]) continue;
for(auto it : adj[u]) {
int v = it.fi;
int c = it.se;
if(dp1[v] > d + c) {
if(dp2[v] > dp1[v]) {
dp2[v] = dp1[v];
pq.push({dp2[v] , v});
}
dp1[v] = d + c;
}
else {
if(dp2[v] > d + c) {
dp2[v] = d + c;
pq.push({d + c , v});
}
}
}
}
return dp2[1];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |