oj.uz

Submission #804423

# Submission time Handle Problem Language Result Execution time Memory
804423 2023-08-03T08:39:31 Z Theo830 Cyberland (APIO23_cyberland) C++17
15 / 100
 36 ms 9184 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i = a;i < b;i++)
#define ll long long
#define ii pair<ll,ll>
#define F first
#define S second
#define pb push_back
priority_queue<ii,vector<ii>,greater<ii> >pq;
bool v[100005] = {0};
ll dist[100005];
vector<vector<ii> >adj;
void dfs(ll idx){
    v[idx] = 1;
    for(auto x:adj[idx]){
        if(!v[x.F]){
            dfs(x.F);
        }
    }
}
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) {
    double ans;
    adj.assign(n+5,vector<ii>());
    f(i,0,n){
        v[i] = 0;
        dist[i] = 1e18;
    }
    f(i,0,m){
        adj[x[i]].pb(ii(y[i],c[i]));
        adj[y[i]].pb(ii(x[i],c[i]));
    }
    dfs(0);
    f(i,0,n){
        if((arr[i] == 0 && v[i]) || i == 0){
            pq.push(ii(0,i));
            dist[i] = 0;
        }
    }
    while(!pq.empty()){
        ii f = pq.top();
        pq.pop();
        ll w = f.F,u = f.S;
        if(dist[u] < w){
            continue;
        }
        for(auto x:adj[u]){
            if(dist[x.F] > dist[u] + x.S){
                dist[x.F] = dist[u] + x.S;
                pq.push(ii(dist[x.F],x.F));
            }
        }
    }
    ans = dist[h];
    if(dist[h] == 1e18){
        ans = -1;
    }
    return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 524 KB Correct.
2 Correct 25 ms 492 KB Correct.
3 Correct 20 ms 484 KB Correct.
4 Correct 21 ms 496 KB Correct.
5 Correct 21 ms 468 KB Correct.
6 Correct 26 ms 1632 KB Correct.
7 Correct 33 ms 1556 KB Correct.
8 Correct 10 ms 2644 KB Correct.
9 Correct 20 ms 376 KB Correct.
10 Correct 19 ms 372 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 468 KB Correct.
2 Correct 20 ms 480 KB Correct.
3 Correct 20 ms 544 KB Correct.
4 Correct 19 ms 1620 KB Correct.
5 Correct 18 ms 364 KB Correct.

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 552 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 1432 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

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