oj.uz

Submission #751865

# Submission time Handle Problem Language Result Execution time Memory
751865 2023-06-01T17:08:46 Z aryan12 Cyberland (APIO23_cyberland) C++17
68 / 100
 3000 ms 28220 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
#include <vector>
#define int long long
using namespace std;

const int N = 1e5 + 5, K = 31;
double dist[N][K];
vector<pair<int, double> > 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(int32_t n, int32_t m, int32_t k, int32_t h, 
    vector<int32_t> x, vector<int32_t> y, vector<int32_t> c, 
    vector<int32_t> arr) 
{
    H = h;
    k = min(k, 70);
    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] = 1e18;
        }
    }
    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<tuple<double, int, int> > pq;
    for(int i = 0; i < n; i++)
    {
        // cout << "source[i] = " << source[i] << "\n";
        if(source[i])
        {
            pq.push({0, i, 0});
            dist[i][0] = 0;
        }
    }
    while(!pq.empty())
    {
        auto [dis, node, cur_k] = pq.top();
        pq.pop();
        if(dist[node][cur_k] < dis || node == h)
        {
            continue;
        }
        for(auto [to, wt]: g[node])
        {
            if(a[to] == 0) continue;
            if(dist[to][cur_k] > dist[node][cur_k] + wt)
            {
                dist[to][cur_k] = dist[node][cur_k] + wt;
                pq.push({dist[to][cur_k], to, cur_k});
            }
            if(a[to] == 1 || cur_k == k) continue;
            if(dist[to][cur_k + 1] > (dist[node][cur_k] + wt) / 2.0)
            {
                dist[to][cur_k + 1] = (dist[node][cur_k] + wt) / 2.0;
                pq.push({dist[to][cur_k + 1], to, cur_k + 1});
            }
        }
    }
    double ans = 1e18;
    // 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 = 0; i <= k; i++)
    {
        ans = min(ans, dist[h][i]);
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2772 KB Correct.
2 Correct 20 ms 2788 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3028 KB Correct.
2 Correct 24 ms 3068 KB Correct.
3 Correct 25 ms 3024 KB Correct.
4 Correct 23 ms 3028 KB Correct.
5 Correct 24 ms 3028 KB Correct.
6 Correct 23 ms 5972 KB Correct.
7 Correct 27 ms 5976 KB Correct.
8 Correct 16 ms 9112 KB Correct.
9 Correct 26 ms 2772 KB Correct.
10 Correct 21 ms 2772 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3088 KB Correct.
2 Correct 33 ms 3104 KB Correct.
3 Correct 28 ms 3140 KB Correct.
4 Correct 27 ms 2772 KB Correct.
5 Correct 28 ms 2644 KB Correct.
6 Correct 10 ms 5484 KB Correct.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 22644 KB Correct.
2 Correct 476 ms 3128 KB Correct.
3 Correct 407 ms 3208 KB Correct.
4 Correct 456 ms 3116 KB Correct.
5 Correct 372 ms 2824 KB Correct.

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 3296 KB Correct.
2 Correct 121 ms 3124 KB Correct.
3 Correct 151 ms 3168 KB Correct.
4 Correct 1176 ms 6516 KB Correct.
5 Correct 26 ms 2644 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3196 KB Correct.
2 Correct 26 ms 3168 KB Correct.
3 Correct 55 ms 28220 KB Correct.
4 Correct 49 ms 5552 KB Correct.
5 Correct 25 ms 2756 KB Correct.
6 Correct 32 ms 3200 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3074 ms 12272 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3047 ms 12336 KB Time limit exceeded
2 Halted 0 ms 0 KB -