oj.uz

Submission #804451

# Submission time Handle Problem Language Result Execution time Memory
804451 2023-08-03T08:47:32 Z Theo830 Cyberland (APIO23_cyberland) C++17
44 / 100
 36 ms 9464 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;
ll H;
void dfs(ll idx){
    v[idx] = 1;
    for(auto x:adj[idx]){
        if(!v[x.F] && x.F != H){
            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;
    H = h;
    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 596 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 588 KB Correct.
2 Correct 23 ms 604 KB Correct.
3 Correct 22 ms 532 KB Correct.
4 Correct 25 ms 592 KB Correct.
5 Correct 22 ms 656 KB Correct.
6 Correct 19 ms 1744 KB Correct.
7 Correct 24 ms 1532 KB Correct.
8 Correct 11 ms 2748 KB Correct.
9 Correct 21 ms 468 KB Correct.
10 Correct 20 ms 448 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 620 KB Correct.
2 Correct 25 ms 708 KB Correct.
3 Correct 27 ms 696 KB Correct.
4 Correct 21 ms 468 KB Correct.
5 Correct 22 ms 528 KB Correct.
6 Correct 5 ms 1504 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 600 KB Correct.
2 Correct 21 ms 600 KB Correct.
3 Correct 22 ms 700 KB Correct.
4 Correct 21 ms 1784 KB Correct.
5 Correct 18 ms 400 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 636 KB Correct.
2 Correct 19 ms 708 KB Correct.
3 Correct 36 ms 9464 KB Correct.
4 Correct 15 ms 1768 KB Correct.
5 Correct 20 ms 468 KB Correct.
6 Correct 24 ms 768 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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