oj.uz

Submission #750477

# Submission time Handle Problem Language Result Execution time Memory
750477 2023-05-29T14:38:00 Z Gurban Cyberland (APIO23_cyberland) C++17
8 / 100
 33 ms 7756 KB 
#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const ll inf = 1e18;
const int maxn=1e5+5;
// const double eps = 0.00000001;
int D[maxn];
vector<pair<int,ll>>E[maxn];

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    for(int i = 0;i < N;i++) E[i].clear();
    for(int i = 0;i < M;i++){
        E[x[i]].push_back({y[i],c[i]});
        E[y[i]].push_back({x[i],c[i]});
    }
    
    ll ans = inf;
    
    priority_queue<pair<ll,int>>q;
    vector<ll>dis(N,inf);
    vector<bool>vis(N,0);

    dis[H] = 0;
    q.push({0,H});
    while(!q.empty()){
        int x = q.top().second;
        q.pop();
        if(vis[x]) continue;
        vis[x] = 1;
        for(auto i : E[x]){
            if(dis[i.first] > dis[x] + i.second){
                dis[i.first] = dis[x] + i.second;
                q.push({-dis[i.first],i.first});
            }
        }
    }

    ans = dis[0];
    for(int i = 0;i < N;i++) if(arr[i] == 0) ans = min(ans,dis[i]);

    return ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 2772 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2868 KB Correct.
2 Correct 26 ms 2748 KB Correct.
3 Correct 22 ms 2772 KB Correct.
4 Correct 33 ms 2772 KB Correct.
5 Correct 30 ms 2836 KB Correct.
6 Correct 20 ms 3668 KB Correct.
7 Correct 26 ms 3552 KB Correct.
8 Correct 13 ms 4496 KB Correct.
9 Correct 21 ms 2644 KB Correct.
10 Correct 26 ms 2724 KB Correct.

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 2828 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 7756 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 2884 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 2900 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 2900 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 2900 KB Wrong Answer.
2 Halted 0 ms 0 KB -