oj.uz

Submission #986648

# Submission time Handle Problem Language Result Execution time Memory
986648 2024-05-21T01:38:18 Z CSQ31 Cyberland (APIO23_cyberland) C++17
15 / 100
 272 ms 35308 KB 
#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std;
 
typedef long double ld;
ld dist[31][111111];
ld pw[31];
struct node{
    int v,k;
    ld dist = 0;
    node(int _k,int _v,ld _dist = 0){
        v = _v;
        k = _k;
        dist = _dist;
    }
};
 
struct comp
{
    bool operator() (node const &a, node const &b) { return a.dist - b.dist > 1e-10; }
};
vector<pair<int,int>>adj[111111];
double solve(int n, int m,int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
    priority_queue<node,vector<node>,comp>pq;
    for(int j=0;j<n;j++){
        adj[j].clear();
        for(int i=0;i<=30;i++){
            dist[i][j] = 1e15;
        }
    }
    pw[0] = 1;
    for(int i=1;i<=30;i++)pw[i] = pw[i-1]*2;
    for(int i=0;i<m;i++){
        adj[x[i]].push_back({y[i],c[i]});
        adj[y[i]].push_back({x[i],c[i]});
    }
 
    for(int i=0;i<=K;i++){
        dist[i][H] = 0;
        pq.push(node(i,H));
    }
    while(!pq.empty()){
        node tmp = pq.top();
        int v = tmp.v;
        int k = tmp.k;
        //cout<<v<<" "<<k<<" "<<tmp.dist<<" "<<dist[k][v]<<'\n';
        pq.pop();
        if(abs(tmp.dist - dist[k][v]) > 1e-10)continue;
        if(arr[v] == 0)continue;
 
        for(pair<int,int>x : adj[v]){
            int u = x.first;
            ld w = x.second;
            w /= pw[k];
            if(dist[k][u] - dist[k][v] - w > 1e-10){
                dist[k][u] = dist[k][v] + w;
                pq.push(node(k,u,dist[k][u]));
            }
            if(arr[u] == 2 && k-1 >= 0 ){
                if(dist[k-1][u] - dist[k][v] - w > 1e-10){
                    dist[k-1][u] = dist[k][v] + w;
                    pq.push(node(k-1,u,dist[k-1][u]));
                }
 
            }
        }
    }
    ld ans = dist[0][0];
    queue<int>q;
    vector<int>vis(n,0);
    q.push(0);
    vis[0] = 1;
    while(!q.empty()){
        int v = q.front();
        q.pop();
        if(arr[v] == 0)ans = min(ans,dist[0][v]);
        for(pair<int,int>x:adj[v]){
            int u = x.first;
            if(!vis[u]){
                q.push(u);
                vis[u] = 1;
            }
        }
    }
    if(!vis[H])return -1;
    return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 3884 KB Correct.
2 Correct 242 ms 4316 KB Correct.
3 Correct 213 ms 3864 KB Correct.
4 Correct 223 ms 3676 KB Correct.
5 Correct 236 ms 3856 KB Correct.
6 Correct 203 ms 9128 KB Correct.
7 Correct 272 ms 8636 KB Correct.
8 Correct 115 ms 14172 KB Correct.
9 Correct 199 ms 3416 KB Correct.
10 Correct 199 ms 3376 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 3920 KB Correct.
2 Correct 154 ms 3860 KB Correct.
3 Correct 144 ms 3932 KB Correct.
4 Correct 156 ms 9516 KB Correct.
5 Correct 119 ms 4116 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 6748 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -