oj.uz

Submission #804535

# Submission time Handle Problem Language Result Execution time Memory
804535 2023-08-03T09:37:31 Z Theo830 Cyberland (APIO23_cyberland) C++17
44 / 100
 3000 ms 41464 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i = a;i < b;i++)
#define ll long long
#define ii pair<ll,ll>
#define id pair<double,ll>
#define F first
#define S second
#define pb push_back
priority_queue<id,vector<id>,greater<id> >pq;
bool v[100005] = {0};
double dist[100005][31];
vector<vector<ii> >adj;
ll H;
void dfs(ll idx){
    v[idx] = 1;
    for(auto x:adj[idx]){
        if(!v[x.F] && x.F != H){
            dfs(x.F);
        }
    }
}
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) {
    double ans;
    H = h;
    adj.assign(n+5,vector<ii>());
    f(i,0,n){
        v[i] = 0;
        f(j,0,k+1){
            dist[i][j] = 1e18;
        }
    }
    f(i,0,m){
        adj[x[i]].pb(ii(y[i],c[i]));
        adj[y[i]].pb(ii(x[i],c[i]));
    }
    dfs(0);
    f(i,0,n){
        if((arr[i] == 0 && v[i]) || i == 0){
            pq.push(id(0,(k+1) * i));
            dist[i][0] = 0;
        }
    }
    while(!pq.empty()){
        id f = pq.top();
        pq.pop();
        ll w = f.F,u = f.S / (k+1);
        ll ek = f.S % (k+1);
        if(dist[u][ek] < w){
            continue;
        }
        if(arr[u] == 2 && ek+1 <= k && dist[u][ek+1] > dist[u][ek] / 2){
            dist[u][ek+1] = dist[u][ek] / 2;
            pq.push(id(dist[u][ek+1],(k+1)*u + ek+1));
        }
        for(auto x:adj[u]){
            if(dist[x.F][ek] > dist[u][ek] + x.S){
                dist[x.F][ek] = dist[u][ek] + x.S;
                pq.push(id(dist[x.F][ek],(k+1) * x.F + ek));
            }
        }
    }
    ans = 1e18;
    f(j,0,k+1){
        ans = min(ans,dist[h][j]);
    }
    if(ans == 1e18){
        ans = -1;
    }
    return ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 792 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 1400 KB Correct.
2 Correct 24 ms 1376 KB Correct.
3 Correct 23 ms 1356 KB Correct.
4 Correct 23 ms 1296 KB Correct.
5 Correct 24 ms 1368 KB Correct.
6 Correct 21 ms 4428 KB Correct.
7 Correct 27 ms 4288 KB Correct.
8 Correct 14 ms 7636 KB Correct.
9 Correct 22 ms 1004 KB Correct.
10 Correct 20 ms 1024 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1328 KB Correct.
2 Correct 26 ms 1372 KB Correct.
3 Correct 22 ms 1408 KB Correct.
4 Correct 29 ms 968 KB Correct.
5 Correct 28 ms 964 KB Correct.
6 Correct 8 ms 3496 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1356 KB Correct.
2 Correct 25 ms 1388 KB Correct.
3 Correct 24 ms 1440 KB Correct.
4 Correct 25 ms 4576 KB Correct.
5 Correct 19 ms 1016 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1396 KB Correct.
2 Correct 20 ms 1344 KB Correct.
3 Correct 42 ms 27968 KB Correct.
4 Correct 17 ms 3720 KB Correct.
5 Correct 21 ms 972 KB Correct.
6 Correct 26 ms 1440 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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