oj.uz

Submission #750981

# Submission time Handle Problem Language Result Execution time Memory
750981 2023-05-30T17:29:27 Z Hona_Nguyen Cyberland (APIO23_cyberland) C++17
49 / 100
 854 ms 137300 KB 
#include "cyberland.h"

#include <bits/stdc++.h>

using namespace std;


double sub_2_5(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr){
    struct ii{
        int id;
        double w;
    };
    struct cmp{
        bool operator () (ii A, ii B){
            return A.w > B.w;
        }
    };

    priority_queue<ii, vector<ii>, cmp> pq;

    vector<double> dp(N, (double)(1e15));
    vector<vector<pair<int,int>>> G(N);

    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]});
    }

    dp[0] = 0;
    pq.push({0,dp[0]});

    while(pq.size()){
        ii u = pq.top();
        pq.pop();
        if(dp[u.id] < u.w) continue;
        for(pair<int,int> v: G[u.id]){
            if(dp[u.id] + v.second < dp[v.first]){
                dp[v.first] = dp[u.id] + v.second;
                pq.push({v.first, dp[v.first]});
            }
        }
    }
    if(dp[H] == (double)(1e15)) dp[H] = -1;
    return dp[H];
}

double sub_3_6(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr){
    struct ii{
        int id;
        double w;
    };
    struct cmp{
        bool operator () (ii A, ii B){
            return A.w > B.w;
        }
    };

    priority_queue<ii, vector<ii>, cmp> pq;

    vector<double> dp(N, (double)(1e15));
    vector<vector<pair<int,int>>> G(N);

    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]});
    }

    dp[0] = 0;
    pq.push({0,dp[0]});

    vector<bool> vis(N,false);
    queue<int> Q;
    Q.push(0);
    vis[0] = true;

    while(Q.size()){
        int u = Q.front();
        Q.pop();
        for(pair<int,int> v: G[u]){
            if(vis[v.first] == true || v.first == H) continue;
            vis[v.first] = true;
            Q.push(v.first);
        }
    }

    for(int i=1;i<N;i++){
        if(arr[i] == 0 && vis[i] == true){
            dp[i] = 0;
            pq.push({i,dp[i]});
        }
    }

    while(pq.size()){
        ii u = pq.top();
        pq.pop();
        if(dp[u.id] < u.w) continue;
        for(pair<int,int> v: G[u.id]){
            if(dp[u.id] + v.second < dp[v.first]){
                dp[v.first] = dp[u.id] + v.second;
                pq.push({v.first, dp[v.first]});
            }
        }
    }
    if(dp[H] == (double)(1e15)) dp[H] = -1;
    return dp[H];
}

double ssub_1_4_7(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr){
    struct ii{
        int id;
        int div2;
        double w;
    };
    struct cmp{
        bool operator () (ii A, ii B){
            if(A.w == B.w) return A.div2 > B.div2;
            return A.w > B.w;
        }
    };

    priority_queue<ii, vector<ii>, cmp> pq;

    vector<vector<double>> dp(N+1, vector<double> (K+2, (double)(1e15)));
    vector<vector<int>> vis_go(N+1, vector<int> (K+1, 0));
    vector<vector<pair<int,int>>> G(N+1);

    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]});
    }

    dp[0][0] = 0.0;
    pq.push({0,0,dp[0][0]});

    vector<bool> vis(N+1,false);
    queue<int> Q;
    Q.push(0);
    vis[0] = true;

    while(Q.size()){
        int u = Q.front();
        Q.pop();
        for(pair<int,int> v: G[u]){
            if(vis[v.first] == true || v.first == H) continue;
            vis[v.first] = true;
            Q.push(v.first);
        }
    }

    for(int i=1;i<N;i++){
        if(arr[i] == 0 && vis[i] == true){
            dp[i][0] = 0.0;
            pq.push({i,0,dp[i][0]});
        }
    }

    while(pq.size()){
        ii u = pq.top();
        pq.pop();
        if(dp[u.id][u.div2] < u.w) continue;
        if(u.id == H) break;
        for(pair<int,int> v: G[u.id]){
            double tmp = dp[u.id][u.div2] + (double)(v.second);
            if(tmp < dp[v.first][u.div2]){
                dp[v.first][u.div2] = tmp;
                pq.push({v.first, u.div2, tmp});

            }

            tmp = tmp / (double)(2);
            if(u.div2 + 1 <= K && arr[v.first] == 2 && tmp < dp[v.first][u.div2+1]){
                dp[v.first][u.div2+1] = tmp;
                pq.push({v.first, u.div2+1, tmp});
            }
        }
    }

    double ans = (double)(1e15);
    for(int i=0;i<=K;i++) ans = min(ans, dp[H][i]);
    if(ans == (double)(1e15)) ans = -1;
    return ans;
}

double sub_1_4_7(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr){
    struct ii{
        int id;
        int div2;
        double w;
    };
    struct cmp{
        bool operator () (ii A, ii B){
            if(A.w == B.w) return A.div2 > B.div2;
            return A.w > B.w;
        }
    };

    priority_queue<ii, vector<ii>, cmp> pq;

    vector<vector<double>> dp(N+1, vector<double> (K+2, (double)(1e15)));
    vector<vector<int>> vis_go(N+1, vector<int> (K+1, 0));
    vector<vector<pair<int,int>>> G(N+1);

    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]});
    }

    dp[0][0] = 0.0;
    pq.push({0,0,dp[0][0]});

    vector<bool> vis(N+1,false);
    queue<int> Q;
    Q.push(0);
    vis[0] = true;

    while(Q.size()){
        int u = Q.front();
        Q.pop();
        for(pair<int,int> v: G[u]){
            if(vis[v.first] == true || v.first == H) continue;
            vis[v.first] = true;
            Q.push(v.first);
        }
    }

    for(int i=1;i<N;i++){
        if(arr[i] == 0 && vis[i] == true){
            dp[i][0] = 0.0;
            pq.push({i,0,dp[i][0]});
        }
    }

    while(pq.size()){
        ii u = pq.top();
        pq.pop();
        if(dp[u.id][u.div2] < u.w) continue;
        if(u.id == H) break;
        for(pair<int,int> v: G[u.id]){
            double tmp = u.w + (double)(v.second);
            if(tmp < dp[v.first][u.div2]){
                dp[v.first][u.div2] = tmp;
                pq.push({v.first, u.div2, tmp});

            }

            tmp = tmp / (double)(2);
            if(u.div2 + 1 <= K && arr[v.first] == 2 && tmp < dp[v.first][u.div2+1]){
                dp[v.first][u.div2+1] = tmp;
                pq.push({v.first, u.div2+1, tmp});
            }
        }
    }

    double ans = (double)(1e15);
    for(int i=0;i<=K;i++) ans = min(ans, dp[H][i]);
    if(ans == (double)(1e15)) ans = -1;
    return ans;
}

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){
    int check_sub_2_5 = 0;
    for(int i=0;i<N;i++) check_sub_2_5 += (arr[i] == 1);
    if(check_sub_2_5 == N) return sub_2_5(N,M,K,H,x,y,c,arr);

    int check_sub_3_6 = 0;
    for(int i=0;i<N;i++) check_sub_3_6 += (arr[i] != 2);
    if(check_sub_3_6 == N) return sub_3_6(N,M,K,H,x,y,c,arr);

    K = min(K, 100);

    if(K <= 100) return sub_1_4_7(N,M,K,H,x,y,c,arr);

    return -1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 424 KB Correct.
2 Correct 20 ms 416 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 468 KB Correct.
2 Correct 26 ms 468 KB Correct.
3 Correct 24 ms 456 KB Correct.
4 Correct 26 ms 468 KB Correct.
5 Correct 26 ms 444 KB Correct.
6 Correct 21 ms 1444 KB Correct.
7 Correct 28 ms 1480 KB Correct.
8 Correct 14 ms 2664 KB Correct.
9 Correct 25 ms 352 KB Correct.
10 Correct 24 ms 340 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 468 KB Correct.
2 Correct 26 ms 468 KB Correct.
3 Correct 26 ms 468 KB Correct.
4 Correct 28 ms 392 KB Correct.
5 Correct 27 ms 340 KB Correct.
6 Correct 5 ms 1364 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 36916 KB Correct.
2 Incorrect 178 ms 1272 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 468 KB Correct.
2 Correct 26 ms 452 KB Correct.
3 Correct 26 ms 460 KB Correct.
4 Correct 24 ms 1512 KB Correct.
5 Correct 22 ms 388 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 596 KB Correct.
2 Correct 23 ms 480 KB Correct.
3 Correct 45 ms 9036 KB Correct.
4 Correct 16 ms 1200 KB Correct.
5 Correct 25 ms 340 KB Correct.
6 Correct 23 ms 480 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 1612 KB Correct.
2 Correct 21 ms 2256 KB Correct.
3 Incorrect 75 ms 37344 KB Wrong Answer.
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 854 ms 7496 KB Correct.
2 Correct 92 ms 7672 KB Correct.
3 Correct 116 ms 137300 KB Correct.
4 Incorrect 157 ms 6288 KB Wrong Answer.
5 Halted 0 ms 0 KB -