oj.uz

Submission #1113941

# Submission time Handle Problem Language Result Execution time Memory
1113941 2024-11-17T21:39:10 Z lucascgar Cyberland (APIO23_cyberland) C++17
15 / 100
 3000 ms 82120 KB 
#include <bits/stdc++.h>

using namespace std;

/*

*/

typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long double, long double> pdd;

const int MAXN = 1e5+10, MAXK = 30+15;
const long long BIG = 1e18+8;

const long double PRECISION = 1e-7;

vector<pii> e[MAXN];

long double ds[MAXN][MAXK];

bool r[MAXN];

void dfs(int x){
    r[x] = 1;
    for (auto &[i,cst]:e[x]) if (!r[i]) dfs(i);
}

double solve(int n, int m, int k, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){

    for (int i=0;i<n;i++){
        e[i].clear();
        for (int j=0;j<=k;j++) ds[i][j]=BIG;
        r[i] = 0;
    }

    for (int i=0;i<m;i++){
        int a = x[i], b = y[i];
        e[a].emplace_back(b, c[i]);
        e[b].emplace_back(a,c[i]);
    }
    dfs(0);
    typedef tuple<long double, int, int> node;  // {dst, qntk, u}
    priority_queue<node, vector<node>, greater<>> q;
    for (int i=0;i<n;i++) if (!i || (r[i] && arr[i]==0)){
        ds[i][0] = 0;
        q.emplace(0, 0, i);
    }

    while (!q.empty()){
        auto [d, qk, u] = q.top();
        q.pop();
        if (ds[u][qk] != d) continue;

        if (u == H) continue;

        for (auto &[i, cs]:e[u]){
            long double nc = d+cs;
            // sem usar
            if (ds[i][qk]>nc){
                ds[i][qk] = nc;
                q.emplace(nc, qk, i);
            }

            // usando
            nc = (d+cs)/2.00;
            if (qk<k && arr[i] == 2 && ds[i][qk+1]> nc){
                ds[i][qk+1] = nc;
                q.emplace(nc, qk+1, i);
            }
        }
    }
    long double ans = BIG;
    for (int i=0;i<=k;i++) ans = min(ans, ds[H][i]);
 
    // cerr << ds[1][4] << '\n';

    if (ans == BIG) return -1;
    return ans;

}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 6348 KB Correct.
2 Correct 31 ms 6212 KB Correct.
3 Correct 29 ms 5456 KB Correct.
4 Correct 34 ms 5624 KB Correct.
5 Correct 34 ms 5712 KB Correct.
6 Correct 31 ms 13128 KB Correct.
7 Correct 41 ms 13080 KB Correct.
8 Correct 20 ms 19280 KB Correct.
9 Correct 29 ms 3548 KB Correct.
10 Correct 28 ms 3540 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6480 KB Correct.
2 Correct 28 ms 5712 KB Correct.
3 Correct 31 ms 6480 KB Correct.
4 Correct 28 ms 12540 KB Correct.
5 Correct 33 ms 4424 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 524 ms 7424 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 3026 ms 17852 KB Time limit exceeded
2 Halted 0 ms 0 KB -