oj.uz

Submission #755874

# Submission time Handle Problem Language Result Execution time Memory
755874 2023-06-10T17:07:07 Z HaciyevAlik Cyberland (APIO23_cyberland) C++17
15 / 100
 1256 ms 8708 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
const int mx=1e5+5;
vector<pair<int,int>> g[mx];
int used[mx];
long dis[mx];
set<int> s;
void dfs(int u,int fin,vector<int>& arr) {
    used[u]=1;
    if(!arr[u]) {
        s.insert(u);
    }
    for(int i=0;i<int(g[u].size());++i){
        int v=g[u][i].ff;
        if(!used[v]&&v!=fin) {
            dfs(v,fin,arr);
        }
    }
}
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<mx;++i) g[i].clear();
    memset(used,0,sizeof(used));
    for(int i=0;i<M;++i) {
        g[x[i]].pb({y[i],c[i]});
        g[y[i]].pb({x[i],c[i]});
    }
    dfs(0,H,arr);
    memset(used,0,sizeof(used));
    set<int>::iterator it;
    priority_queue<pair<long,int>> pq;
    for(it=s.begin();it!=s.end();++it) {
        pq.push({*it,0});
    }
    for(int i=0;i<mx;++i) dis[i]=1e10;
    dis[0]=0;
    pq.push({0,0});
    while(!pq.empty()) {
        int u=pq.top().ss; pq.pop();
        if(used[u]) continue;
        used[u]=1;
        for(int i=0;i<int(g[u].size());++i){
            int v=g[u][i].ff,w=g[u][i].ss;
            if(dis[u]+w<dis[v]) {
                dis[v]=dis[u]+w;
                pq.push({-dis[v],v});
            }
        }
    }
    if(dis[H]==1e10) {
        return -1;
    } else {
        return dis[H];
    }
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3984 KB Correct.
2 Correct 38 ms 3960 KB Correct.
3 Correct 37 ms 3952 KB Correct.
4 Correct 37 ms 3924 KB Correct.
5 Correct 38 ms 3916 KB Correct.
6 Correct 22 ms 4564 KB Correct.
7 Correct 30 ms 4672 KB Correct.
8 Correct 14 ms 5204 KB Correct.
9 Correct 146 ms 3872 KB Correct.
10 Correct 158 ms 3876 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4000 KB Correct.
2 Correct 41 ms 3972 KB Correct.
3 Correct 38 ms 4012 KB Correct.
4 Correct 25 ms 4836 KB Correct.
5 Correct 143 ms 3868 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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