oj.uz

Submission #752469

# Submission time Handle Problem Language Result Execution time Memory
752469 2023-06-03T04:35:47 Z bachhoangxuan Cyberland (APIO23_cyberland) C++17
15 / 100
 1472 ms 21304 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]*(arr[v]?1.0/arr[v]:0)+w;
            int nk=k+(arr[v]==2);
            if(dist[v][nk]>nd){
                dist[v][nk]=nd;
                pq.push({nd,{v,nk}});
            }
            if(dist[u][k]+w<dist[v][k]){
                dist[v][k]=dist[u][k]+w;
                pq.push({dist[u][k]+w,{v,k}});
            }
        }
    }
    return -1;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 440 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 800 KB Correct.
2 Correct 29 ms 700 KB Correct.
3 Correct 27 ms 676 KB Correct.
4 Correct 28 ms 704 KB Correct.
5 Correct 29 ms 680 KB Correct.
6 Correct 21 ms 3864 KB Correct.
7 Correct 31 ms 3736 KB Correct.
8 Correct 18 ms 7524 KB Correct.
9 Correct 27 ms 416 KB Correct.
10 Correct 30 ms 532 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 700 KB Correct.
2 Correct 30 ms 664 KB Correct.
3 Correct 30 ms 684 KB Correct.
4 Correct 27 ms 3700 KB Correct.
5 Correct 29 ms 424 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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