#include "cyberland.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll oo = 1e18;
const int MAX = 1e5 + 5;
struct edge{
int u, c;
};
int n, k, f;
int A[MAX];
vector<edge> g[MAX];
bool visited[MAX];
vector<int> starts;
void dfs(int node){
visited[node] = 1;
for(auto& e:g[node]){
if(visited[e.u]) continue;
dfs(e.u);
}
}
double dist[MAX][32];
void dijkstra(){
set<pair<double, pair<int, int>>> st;
for (int i = 0; i < n; i++)
{
for (int j = 0; j <= k; j++)
{
dist[i][j] = oo;
}
}
for(int a:starts){
dist[a][k] = 0;
st.insert({a, {a, k}});
}
while(!st.empty()){
double d = st.begin()->first;
int node = st.begin()->second.first;
int l = st.begin()->second.second;
st.erase(st.begin());
for(auto& e:g[node]){
double b = d + e.c;
if(b < dist[e.u][l]){
st.erase({dist[e.u][l], {e.u, l}});
dist[e.u][l] = b;
st.insert({dist[e.u][l], {e.u, l}});
}
if(l == 0 || A[e.u] != 2) continue;
if(b / 2 < dist[e.u][l - 1]){
st.erase({dist[e.u][l - 1], {e.u, l - 1}});
dist[e.u][l - 1] = b / 2;
st.insert({dist[e.u][l - 1], {e.u, l - 1}});
}
}
}
}
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
n = N;
k = K;
f = H;
starts.clear();
for (int i = 0; i < n; i++)
{
A[i] = arr[i];
g[i].clear();
visited[i] = 0;
}
for (int i = 0; i < M; i++)
{
g[x[i]].push_back({y[i], c[i]});
g[y[i]].push_back({x[i], c[i]});
}
dfs(0);
starts.push_back(0);
for (int i = 0; i < n; i++)
{
if(visited[i] && A[i] == 0){
starts.push_back(i);
}
}
dijkstra();
double ans = oo;
for(int i = 0; i <= k; ++i){
ans = min(ans, dist[f][i]);
}
if(ans == oo){
return -1;
}
else{
return ans;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
22 ms |
2780 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
3092 KB |
Correct. |
2 |
Correct |
29 ms |
3084 KB |
Correct. |
3 |
Correct |
35 ms |
3016 KB |
Correct. |
4 |
Correct |
29 ms |
3000 KB |
Correct. |
5 |
Correct |
30 ms |
3028 KB |
Correct. |
6 |
Correct |
25 ms |
5844 KB |
Correct. |
7 |
Correct |
34 ms |
5872 KB |
Correct. |
8 |
Correct |
15 ms |
9124 KB |
Correct. |
9 |
Correct |
25 ms |
2744 KB |
Correct. |
10 |
Correct |
24 ms |
2760 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
26 ms |
2988 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1559 ms |
41336 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
3156 KB |
Correct. |
2 |
Correct |
26 ms |
3120 KB |
Correct. |
3 |
Correct |
23 ms |
3028 KB |
Correct. |
4 |
Correct |
24 ms |
5972 KB |
Correct. |
5 |
Correct |
29 ms |
2752 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
23 ms |
3116 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
330 ms |
3480 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3040 ms |
11708 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |