#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5, K = 68;
double dist[N][K];
vector<pair<int, int> > g[N];
bool vis[N], source[N];
int a[N], H;
void dfs(int node)
{
vis[node] = true;
if(a[node] == 0)
{
source[node] = true;
}
if(node == H)
{
return;
}
for(auto [to, wt]: g[node])
{
if(!vis[to])
{
dfs(to);
}
}
}
double solve(int n, int m, int k, int h,
vector<int> x, vector<int> y, vector<int> c,
vector<int> arr)
{
H = h;
k = min(k, 67);
for(int i = 0; i <= n; i++)
{
source[i] = false;
vis[i] = false;
if(i != n) a[i] = arr[i];
g[i].clear();
for(int j = 0; j <= k; j++)
{
dist[i][j] = 1e14;
}
}
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);
source[0] = true;
if(!vis[H])
{
return -1;
}
priority_queue<pair<double, int> > pq;
for(int i = 0; i < n; i++)
{
// cout << "source[i] = " << source[i] << "\n";
if(source[i])
{
pq.push({0, i});
dist[i][0] = 0;
}
}
while(!pq.empty())
{
auto [dis, p] = pq.top();
pq.pop();
int cur_k = p / 100000, node = p % 100000;
dis = -dis;
if(dist[node][cur_k] < dis || node == h)
{
continue;
}
for(auto [to, wt]: g[node])
{
if(a[to] == 0) continue;
double wt_d = wt;
if(dist[to][cur_k] > dist[node][cur_k] + wt_d)
{
dist[to][cur_k] = dist[node][cur_k] + wt_d;
pq.push({-dist[to][cur_k], to + 100000 * cur_k});
}
if(a[to] == 1 || cur_k == k) continue;
if(dist[to][cur_k + 1] > (dist[node][cur_k] + wt_d) / 2.0)
{
dist[to][cur_k + 1] = (dist[node][cur_k] + wt_d) / 2.0;
pq.push({-dist[to][cur_k + 1], to + 100000 * (cur_k + 1)});
}
}
}
double ans = min(dist[h][0], dist[h][k]);
ans = min(ans, dist[h][1]);
// for(int i = 0; i < n; i++)
// {
// for(int j = 0; j <= k; j++)
// {
// cout << "dist[" << i << "][" << j << "] = " << dist[i][j] << "\n";
// }
// }
// for(int i = 1; i <= k; i++)
// {
// ans = min(ans, dist[h][i]);
// }
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
2772 KB |
Correct. |
2 |
Correct |
22 ms |
2824 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
3288 KB |
Correct. |
2 |
Correct |
28 ms |
3296 KB |
Correct. |
3 |
Correct |
26 ms |
3352 KB |
Correct. |
4 |
Correct |
29 ms |
3328 KB |
Correct. |
5 |
Correct |
27 ms |
3352 KB |
Correct. |
6 |
Correct |
29 ms |
8660 KB |
Correct. |
7 |
Correct |
33 ms |
8508 KB |
Correct. |
8 |
Correct |
18 ms |
14620 KB |
Correct. |
9 |
Correct |
25 ms |
2772 KB |
Correct. |
10 |
Correct |
23 ms |
2784 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
3324 KB |
Correct. |
2 |
Correct |
27 ms |
3284 KB |
Correct. |
3 |
Correct |
26 ms |
3380 KB |
Correct. |
4 |
Correct |
26 ms |
2796 KB |
Correct. |
5 |
Correct |
29 ms |
2784 KB |
Correct. |
6 |
Correct |
9 ms |
7652 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
175 ms |
40260 KB |
Correct. |
2 |
Incorrect |
202 ms |
3572 KB |
Wrong Answer. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
3412 KB |
Correct. |
2 |
Correct |
24 ms |
3284 KB |
Correct. |
3 |
Correct |
28 ms |
3412 KB |
Correct. |
4 |
Correct |
28 ms |
8744 KB |
Correct. |
5 |
Correct |
21 ms |
2788 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
25 ms |
3396 KB |
Correct. |
2 |
Correct |
29 ms |
3412 KB |
Correct. |
3 |
Correct |
60 ms |
48500 KB |
Correct. |
4 |
Correct |
19 ms |
7124 KB |
Correct. |
5 |
Correct |
25 ms |
2804 KB |
Correct. |
6 |
Correct |
24 ms |
3412 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
194 ms |
3936 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
649 ms |
5336 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |