oj.uz

Submission #750447

# Submission time Handle Problem Language Result Execution time Memory
750447 2023-05-29T14:09:30 Z Gurban Cyberland (APIO23_cyberland) C++17
8 / 100
 29 ms 8180 KB 
#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

using ld = long double;

const double inf = 1e15;
const int maxn=1e5+5;
const double eps = 0.00000001;
int D[maxn];
vector<pair<int,double>>E[maxn];

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 < N;i++) E[i].clear();
    for(int i = 0;i < M;i++){
        E[x[i]].push_back({y[i],c[i]});
        E[y[i]].push_back({x[i],c[i]});
    }
    for(int i = 1;i < N;i++) D[i] = 1e9;
    D[0] = 0;
    deque<int>deq;
    vector<bool>vis(N);
    deq.push_back(0);
    while(!deq.empty()){
        int x = deq.front();
        deq.pop_front();
        if(vis[x]) continue;
        vis[x] = 1;
        for(auto i : E[x]){
            if(D[x] + (arr[i.first] == 2) < D[i.first]){
                D[i.first] = D[x] + (arr[i.first] == 2);
                if(arr[i.first] != 2) deq.push_front(i.first);
                else deq.push_back(i.first);
            }
        }
    }
    vector<int>zeros = {0};
    vector<int>two;
    for(int i = 1;i < N;i++) if(!arr[i]) zeros.push_back(i);
    for(int i = 1;i < N;i++) if(arr[i] == 2) two.push_back(i);
    
    priority_queue<pair<double,int>>q;
    q.push({0,H});

    double ans = inf;
    double der = 1;

    for(int i = 0;i <= 0;i++){
        vector<double>dis(N,inf);
        vector<bool>vis(N,0);
        while(!q.empty()){
            int x = q.top().second;
            double len = -q.top().first;
            q.pop();
            if(vis[x]) continue;
            vis[x] = 1;
            for(auto j : E[x]){
                double now = j.second + len;
                if(dis[j.first] > now){
                    dis[j.first] = now;
                    if(arr[j.first] != 2 and j.first != H) q.push({-now,j.first}); 
                }
            }
        }
        for(auto j : zeros) ans = min(ans,dis[j]);
        // for(auto j : two) if(abs(dis[j] - inf) >= eps) q.push({-dis[j],j});
        der *= 2;
    }
    // if(abs(ans - inf) < eps) return -1;
    return ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 2876 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 2876 KB Correct.
2 Correct 25 ms 2864 KB Correct.
3 Correct 24 ms 2808 KB Correct.
4 Correct 24 ms 2772 KB Correct.
5 Correct 24 ms 2772 KB Correct.
6 Correct 21 ms 3716 KB Correct.
7 Correct 27 ms 3708 KB Correct.
8 Correct 14 ms 4624 KB Correct.
9 Correct 24 ms 2644 KB Correct.
10 Correct 23 ms 2736 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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