oj.uz

Submission #865264

# Submission time Handle Problem Language Result Execution time Memory
865264 2023-10-24T06:55:25 Z jk410 Cyberland (APIO23_cyberland) C++17
44 / 100
 67 ms 11856 KB 
#include "cyberland.h"
#include <vector>
#include <queue>
#include <functional>
using namespace std;
struct edge{
    int v;
    double cost;
    bool operator<(const edge &tmp)const{
        return cost>tmp.cost;
    }
};
const int MAXK=100;
const double INF=1e15;
vector<edge> Adj[100000];
bool Ikeru[100000];
double Dist[100000];
priority_queue<edge> PQ;
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){
    for (int i=0; i<N; i++)
        Adj[i].clear();
    fill(Ikeru,Ikeru+N,false);
    fill(Dist,Dist+N,INF);
    while (!PQ.empty())
        PQ.pop();
    for (int i=0; i<M; i++){
        Adj[x[i]].push_back({y[i],(double)c[i]});
        Adj[y[i]].push_back({x[i],(double)c[i]});
    }
    function<void(int)> dfs=[&](int v){
        Ikeru[v]=true;
        if (v==H)
            return;
        for (edge i:Adj[v]){
            if (!Ikeru[i.v])
                dfs(i.v);
        }
    };
    dfs(0);
    if (!Ikeru[H])
        return -1;
    K=min(K,MAXK);
    for (int i=0; i<N; i++){
        if (Ikeru[i]&&!arr[i]){
            Dist[i]=0;
            PQ.push({i,0});
        }
    }
    Dist[0]=0;
    PQ.push({0,0});
    while (K--){
        while (!PQ.empty()){
            edge cur=PQ.top();
            PQ.pop();
            if (Dist[cur.v]<cur.cost||cur.v==H)
                continue;
            for (edge i:Adj[cur.v]){
                if (Dist[i.v]>cur.cost+i.cost){
                    Dist[i.v]=cur.cost+i.cost;
                    PQ.push({i.v,Dist[i.v]});
                }
            }
        }
        for (int i=0; i<N; i++){
            if (Ikeru[i]&&arr[i]==2){
                Dist[i]/=2;
                PQ.push({i,Dist[i]});
            }
        }
    }
    return Dist[H];
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4444 KB Correct.
2 Correct 23 ms 4700 KB Correct.
3 Correct 22 ms 4700 KB Correct.
4 Correct 24 ms 4700 KB Correct.
5 Correct 34 ms 4680 KB Correct.
6 Correct 19 ms 5212 KB Correct.
7 Correct 25 ms 5540 KB Correct.
8 Correct 15 ms 5564 KB Correct.
9 Correct 21 ms 4444 KB Correct.
10 Correct 23 ms 4440 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4408 KB Correct.
2 Correct 33 ms 4432 KB Correct.
3 Correct 21 ms 4444 KB Correct.
4 Correct 22 ms 4432 KB Correct.
5 Correct 32 ms 4556 KB Correct.
6 Correct 5 ms 4440 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4440 KB Correct.
2 Correct 21 ms 4700 KB Correct.
3 Correct 20 ms 4688 KB Correct.
4 Correct 24 ms 5972 KB Correct.
5 Correct 27 ms 4300 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 4444 KB Correct.
2 Correct 27 ms 4696 KB Correct.
3 Correct 46 ms 11856 KB Correct.
4 Correct 14 ms 5208 KB Correct.
5 Correct 20 ms 4444 KB Correct.
6 Correct 19 ms 4696 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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