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>
using namespace std;
using i64 = long long;
const i64 inf = 1e18;
struct item{
i64 cost;
int cur,wh,node;
item(i64 _cost = 0,int _cur = 0,int _node = 0,int _wh = 0){
cost = _cost;
cur = _cur;
node = _node;
wh = _wh;
}
bool operator > (const item & i) const{
if(i.cost == cost){
return i.cur < cur;
}
return i.cost < cost;
}
};
i64 solve(int N, int M, int W, std::vector<int> T,
vector<int> X, vector<int> Y,
vector<int> A, vector<int> B, vector<int> C,
vector<int> L, vector<int> R){
assert(W == 0);
vector<vector<int>> adj(N);
for(int i = 0;i < M;i++){
adj[X[i]].push_back(i);
}
vector<i64> dist(M + 1,inf);
vector<bool> vis(M + 1,false);
priority_queue<item,vector<item>,greater<item>> pq;
pq.push(item(0,0,0,0));
// pq.push(item(1,0,0,0));
while(!pq.empty()){
auto top = pq.top();
pq.pop();
int u = top.node;
i64 cost = top.cost;
int wh = top.wh;
int time = top.cur;
if(vis[wh]) continue;
vis[wh] = true;
dist[wh] = cost;
int ind = 1;
for(int v : adj[u]){
if(A[v] >= time) pq.push(item(cost + C[v],B[v],Y[v],v + 1));
}
}
i64 ans = inf;
for(int i = 1;i <= M;i++){
if(Y[i - 1] == N - 1){
ans = min(ans,dist[i]);
}
}
if(ans == inf) return -1;
else return ans;
return 0;
}
Compilation message (stderr)
train.cpp: In function 'i64 solve(int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:56:8: warning: unused variable 'ind' [-Wunused-variable]
56 | int ind = 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |