oj.uz

Submission #985027

# Submission time Handle Problem Language Result Execution time Memory
985027 2024-05-17T09:47:46 Z rshohruh Cyberland (APIO23_cyberland) C++17
0 / 100
 27 ms 4444 KB 
#include "cyberland.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using node = pair<int, ll>;


vector<vector<node>> g;
void dfs(int u, int p, vector<int>& res){
    if(u == p) return;
    res[u] = 1;
    for(auto [v, w]: g[u])
        if(!res[v])
            dfs(v, p, res);
}

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 x: arr) assert(x < 2);
    g.assign(N, vector<node>());
    vector<ll> h(N, 1e18);
    for(int i = 0; i < M; ++i){
        g[x[i]].emplace_back(y[i], c[i]);
        g[y[i]].emplace_back(x[i], c[i]);
    }
    vector<int> up(N), to(N);
    dfs(0, H, up);
    dfs(H, 0, to);

    priority_queue<node, vector<node>, greater<node>> b; 
    for(int i = 0; i < N; ++i)
        if(up[i] & to[i])
            b.emplace(i, 0);
    
    while(!b.empty()){
        auto [u, cur] = b.top();
        b.pop();
        if(h[u] <= cur) continue;
        h[u] = cur;
        for(auto [v, w]: g[u])
            b.emplace(v, cur+w);
    }
    
    return (h[H] == 1e18 ? -1 : h[H]);
}

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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