# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984768 | Rafiullah | Cyberland (APIO23_cyberland) | C++17 | 48 ms | 12532 KiB |
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 "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
map<int,vector<int>> graph;
map<pair<int,int>,int> weight;
for(int i = 0 ;i <x.size() ;i ++){
int a = x[i];
int b = y[i];
int cc = c[i];
weight[{min(a,b),max(a,b)}] = cc;
graph[a].push_back(b);
graph[b].push_back(a);
}
int dist[N];
for(int i = 1 ;i <N ;i ++)dist[i] = 1e9;
dist[0] = 0;
priority_queue<pair<int,int>> pq;
pq.push({0,0});
while(pq.size()>0){
int node = pq.top().second;
pq.pop();
for(int child:graph[node]){
int W = dist[node] + weight[{min(child,node),max(child,node)}];
if(arr[child] == 0){
W = 0;
}
if(W<dist[child]){
dist[child] = W;
pq.push({dist[child],child});
}
}
}
if(dist[H] == 1e9)dist[H] = -1;
return dist[H];
}
Compilation message (stderr)
# | 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... |
# | 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... |