oj.uz

Submission #752413

# Submission time Handle Problem Language Result Execution time Memory
752413 2023-06-03T02:33:15 Z bachhoangxuan Cyberland (APIO23_cyberland) C++17
20 / 100
 572 ms 21200 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pdi pair<double,pii>
#define fi first
#define se second

double solve(int N, int M, int K, int T, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    K=min(K,100);
    vector<vector<double>> dist(N,vector<double>(K+1,1e14));
    vector<vector<pii>> edge(N);
    for(int i=0;i<M;i++){
        edge[x[i]].push_back({y[i],c[i]});
        edge[y[i]].push_back({x[i],c[i]});
    }
    priority_queue<pdi,vector<pdi>,greater<pdi>> pq;
    dist[0][0]=0;pq.push({0,{0,0}});
    while(!pq.empty()){
        auto [d,x]=pq.top();pq.pop();
        int u=x.fi,k=x.se;
        if(u==T) return d;
        if(k==K) continue;
        for(auto [v,w]:edge[u]){
            double nd=(dist[u][k]+w)*(arr[v]?1.0/arr[v]:0);
            if(dist[v][k+1]>nd){
                dist[v][k+1]=nd;
                pq.push({nd,{v,k+1}});
            }
        }
    }
    return -1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 468 KB Correct.
2 Correct 20 ms 424 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 776 KB Correct.
2 Correct 80 ms 728 KB Correct.
3 Correct 68 ms 736 KB Correct.
4 Correct 71 ms 916 KB Correct.
5 Correct 68 ms 780 KB Correct.
6 Correct 46 ms 4016 KB Correct.
7 Correct 99 ms 3812 KB Correct.
8 Correct 57 ms 8024 KB Correct.
9 Correct 56 ms 428 KB Correct.
10 Correct 53 ms 424 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 996 KB Correct.
2 Correct 62 ms 840 KB Correct.
3 Correct 78 ms 820 KB Correct.
4 Correct 74 ms 3836 KB Correct.
5 Correct 52 ms 432 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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