oj.uz

Submission #979533

# Submission time Handle Problem Language Result Execution time Memory
979533 2024-05-11T07:23:48 Z phoenix0423 Cyberland (APIO23_cyberland) C++17
15 / 100
 297 ms 103760 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#include "cyberland.h"
const int maxn = 2e5 + 5;
const double INF = 1e18;
const double eps = 1e-9;
vector<pll> adj[maxn];
int par[maxn], ok[maxn], in[maxn];
double dist[maxn][81];
int root(int x){ return x == par[x] ? x : par[x] = root(par[x]);}
void unite(int x, int y){
    x = root(x), y = root(y);
    if(x == y) return;
    par[x] = y;
}

struct info{
    double d;
    int pos, l;
    info(){}
    info(double _d, int _pos, int _l) : d(_d), pos(_pos), l(_l){}
    bool operator < (const info& other) const{
        return d < other.d;
    }
    bool operator > (const info& other) const{
        return d > other.d;
    }
};

priority_queue<info, vector<info>, greater<info>> q;

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) {
    k = min(k, 80);
    for(int i = 0; i < n; i++) adj[i].clear(), par[i] = i, ok[i] = 0, in[i] = 0;
    for(int i = 0; i < m; i++){
        adj[x[i]].pb({y[i], c[i]});
        adj[y[i]].pb({x[i], c[i]});
        unite(x[i], y[i]);
    }
    if(root(0) != root(h)) return -1;
    for(int i = 1; i < n; i++) for(int j = 0; j <= k; j++) dist[i][j] = INF;
    arr[0] = 0;
    for(int i = 0; i < n; i++){
        if(arr[i] == 0 && root(i) == root(0)){
            ok[i] = 1;
            // for(int j = 0; j <= k; j++) dist[i][j] = 0;
            // q.push(info(0, i, 0));
        }
    }
    q.push(info(0, 0, 0));
    while(!q.empty()){
        auto [d, pos, l] = q.top(); q.pop();
        if(dist[pos][l] < d || pos == h) continue;
        if(arr[pos] == 0 && ok[pos]) dist[pos][l] = d = 0, in[pos] = 1;
        for(auto [x, w] : adj[pos]){
            if(dist[x][l] > d + w){
                dist[x][l] = d + w;
                q.push(info(dist[x][l], x, l));
            }
        }
        if(arr[pos] == 2 && l < k){
            d /= 2, l++;
            if(dist[pos][l] < d) continue;
            for(auto [x, w] : adj[pos]){
                if(dist[x][l] > d + w){
                    dist[x][l] = d + w;
                    q.push(info(dist[x][l], x, l));
                }
            }
        }
    }
    for(int i = 0; i < n; i++) if(ok[i]) assert(in[i]);
    double ans = INF;
    for(int i = 0; i <= k; i++) ans = min(ans, dist[h][i]);
    return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 11356 KB Correct.
2 Correct 21 ms 11356 KB Correct.
3 Correct 20 ms 11352 KB Correct.
4 Correct 21 ms 11336 KB Correct.
5 Correct 21 ms 11356 KB Correct.
6 Correct 19 ms 16220 KB Correct.
7 Correct 27 ms 16192 KB Correct.
8 Correct 13 ms 23132 KB Correct.
9 Correct 20 ms 9304 KB Correct.
10 Correct 19 ms 9052 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 11356 KB Correct.
2 Correct 20 ms 11352 KB Correct.
3 Correct 19 ms 11356 KB Correct.
4 Correct 25 ms 16472 KB Correct.
5 Correct 17 ms 9024 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 57 ms 23824 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 228 ms 29416 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -