oj.uz

Submission #806691

# Submission time Handle Problem Language Result Execution time Memory
806691 2023-08-04T08:57:18 Z TheSahib Cyberland (APIO23_cyberland) C++17
15 / 100
 3000 ms 21496 KB 
#include "cyberland.h"
#include <bits/stdc++.h>

#define ll long long
using namespace std;

const ll oo = 1e18;
const int MAX = 1e5 + 5;

struct edge{
    int u, c;
};

int n, k, f;
int A[MAX];
vector<edge> g[MAX];
bool visited[MAX];

vector<int> starts;
void dfs(int node){
    visited[node] = 1;
    for(auto& e:g[node]){
        if(visited[e.u]) continue;
        dfs(e.u);
    }
}

double dist[MAX][32];
bool comp(int a, int b){
    return dist[a % n][a / n] < dist[b % n][b / n];
}

void dijkstra(){
    set<int, decltype(&comp)> st(&comp);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= k; j++)
        {
            dist[i][j] = oo;
        }
    }
    
    for(int a:starts){
        dist[a][k] = 0;
        st.insert(a + k * n);
    }
    while(!st.empty()){
        int idx = *st.begin();
        st.erase(st.begin());
        
        int node = idx % n;
        int l = idx / n;
        double d = dist[node][l];


        for(auto& e:g[node]){
            double b = d + e.c;
            
            if(b < dist[e.u][l]){
                idx = e.u + l * n;
                st.erase(idx);
                dist[e.u][l] = b;
                st.insert(idx);
            }
            if(l == 0 || A[e.u] != 2) continue;
            if(b / 2 < dist[e.u][l - 1]){
                idx = e.u + (l - 1) * n;
                st.erase(idx);
                dist[e.u][l - 1] = b / 2;
                st.insert(idx);
            }
        }
    }
}


double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    n = N;
    k = K;
    f = H;
    starts.clear();
    for (int i = 0; i < n; i++)
    {
        A[i] = arr[i];
        g[i].clear();
        visited[i] = 0;
    }
    
    for (int i = 0; i < M; i++)
    {
        g[x[i]].push_back({y[i], c[i]});
        g[y[i]].push_back({x[i], c[i]});
    }
    g[f].clear();
    dfs(0);
    starts.push_back(0);
    for (int i = 0; i < n; i++)
    {
        if(visited[i] && A[i] == 0){
            starts.push_back(i);
        }
    }
    dijkstra();
    double ans = oo;
    for(int i = 0; i <= k; ++i){
        ans = min(ans, dist[f][i]);
    }
    if(ans == oo){
        return -1;
    }
    else{
        return ans;
    }
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3208 KB Correct.
2 Correct 34 ms 3028 KB Correct.
3 Correct 32 ms 3068 KB Correct.
4 Correct 33 ms 3056 KB Correct.
5 Correct 40 ms 3040 KB Correct.
6 Correct 30 ms 5916 KB Correct.
7 Correct 43 ms 5780 KB Correct.
8 Correct 20 ms 9044 KB Correct.
9 Correct 26 ms 2644 KB Correct.
10 Correct 32 ms 2760 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3059 ms 21496 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3028 KB Correct.
2 Correct 29 ms 3028 KB Correct.
3 Correct 26 ms 3092 KB Correct.
4 Correct 31 ms 5944 KB Correct.
5 Correct 28 ms 2644 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3072 ms 3180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3064 ms 10768 KB Time limit exceeded
2 Halted 0 ms 0 KB -