oj.uz

Submission #849112

# Submission time Handle Problem Language Result Execution time Memory
849112 2023-09-14T06:11:45 Z adhityamv Cyberland (APIO23_cyberland) C++17
44 / 100
 33 ms 11856 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=100000;
vector<pair<int,double>> edges[N];
bool visited[N]={};
double ans[N];
void dfs(int u,int h){
    for(auto v:edges[u]){
        if(v.first==h) continue;
        if(!visited[v.first]){
            visited[v.first]=true;
            dfs(v.first, h);
        }
    }
}
double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> a){
    for(int i=0;i<n;i++) ans[i]=-1;
    for(int i=0;i<m;i++){
        edges[x[i]].push_back(make_pair(y[i],(double) c[i]));
        edges[y[i]].push_back(make_pair(x[i],(double) c[i]));
    }
    priority_queue<pair<double,int>,vector<pair<double,int>>,greater<pair<double,int>>> pq;
    ans[0]=0;
    visited[0]=true;
    dfs(0,h);
    pq.push(make_pair(0,0));
    for(int i=0;i<n;i++){
        if(a[i]==0 && visited[i]){
            ans[i]=0;
            pq.push(make_pair(0,i));
        }
    }
    while(!pq.empty()){
        auto u=pq.top();
        pq.pop();
        if(u.first==h) continue;
        if(u.first!=ans[u.second]) continue;
        for(auto v:edges[u.second]){
            if(ans[v.first]==-1 || ans[v.first]>u.first+v.second){
                ans[v.first]=u.first+v.second;
                pq.push(make_pair(ans[v.first],v.first));
            }
        }
    }
    double fans=ans[h];
    for(int i=0;i<n;i++){
        edges[i].clear();
        visited[i]=false;
        ans[i]=0;
    }
    return fans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3928 KB Correct.
2 Correct 21 ms 3676 KB Correct.
3 Correct 20 ms 3672 KB Correct.
4 Correct 21 ms 3672 KB Correct.
5 Correct 22 ms 3680 KB Correct.
6 Correct 22 ms 4440 KB Correct.
7 Correct 25 ms 4512 KB Correct.
8 Correct 11 ms 5360 KB Correct.
9 Correct 20 ms 3420 KB Correct.
10 Correct 20 ms 3420 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3672 KB Correct.
2 Correct 22 ms 4440 KB Correct.
3 Correct 20 ms 4440 KB Correct.
4 Correct 25 ms 4440 KB Correct.
5 Correct 22 ms 4692 KB Correct.
6 Correct 5 ms 4440 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3672 KB Correct.
2 Correct 21 ms 4032 KB Correct.
3 Correct 23 ms 3932 KB Correct.
4 Correct 20 ms 4952 KB Correct.
5 Correct 17 ms 3416 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3672 KB Correct.
2 Correct 18 ms 4676 KB Correct.
3 Correct 33 ms 11856 KB Correct.
4 Correct 14 ms 5464 KB Correct.
5 Correct 20 ms 4440 KB Correct.
6 Correct 19 ms 4696 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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