oj.uz

Submission #752487

# Submission time Handle Problem Language Result Execution time Memory
752487 2023-06-03T05:08:28 Z bachhoangxuan Cyberland (APIO23_cyberland) C++17
44 / 100
 227 ms 28148 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pdi pair<double,int>
#define fi first
#define se second
const double inf=1e18;
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,67);
    vector<vector<double>> dist(N,vector<double>(K+1,inf));
    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]});
    }
    vector<int> vis(N,0);
    dist[0][0]=0;vis[0]=1;
    queue<int> q;q.push(0);
    while(!q.empty()){
        int u=q.front();q.pop();
        if(arr[u]==0) dist[u][0]=0;
        if(u==T) continue;
        for(auto [v,w]:edge[u]){
            if(vis[v]) continue;
            vis[v]=1;q.push(v);
        }
    }
    bool ok=false;
    double res=1e14;
    for(int k=0;k<K;k++){
        priority_queue<pdi,vector<pdi>,greater<pdi>> pq;
        for(int i=0;i<N;i++){
            if(i!=T && dist[i][k]!=inf) pq.push({dist[i][k],i});
        }
        while(!pq.empty()){
            auto [d,u]=pq.top();pq.pop();
            if(u==T){
                res=min(res,d);
                ok=true;continue;
            }
            if(d!=dist[u][k]) continue;
            for(auto [v,w]:edge[u]){
                double nd=dist[u][k]*(arr[u]?1.0/arr[u]:0)+w;
                if(arr[u]==2) dist[v][k+1]=min(dist[v][k+1],nd);
                if(dist[u][k]+w<dist[v][k]){
                    dist[v][k]=dist[u][k]+w;
                    pq.push({dist[u][k]+w,v});
                }
            }
        }
    }
    if(ok) return res;
    else return -1;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 684 KB Correct.
2 Correct 35 ms 724 KB Correct.
3 Correct 32 ms 684 KB Correct.
4 Correct 32 ms 596 KB Correct.
5 Correct 33 ms 692 KB Correct.
6 Correct 27 ms 3992 KB Correct.
7 Correct 38 ms 3884 KB Correct.
8 Correct 18 ms 7668 KB Correct.
9 Correct 31 ms 428 KB Correct.
10 Correct 30 ms 440 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 696 KB Correct.
2 Correct 32 ms 688 KB Correct.
3 Correct 31 ms 724 KB Correct.
4 Correct 34 ms 416 KB Correct.
5 Correct 34 ms 416 KB Correct.
6 Correct 7 ms 3412 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 21728 KB Correct.
2 Incorrect 112 ms 700 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 724 KB Correct.
2 Correct 32 ms 724 KB Correct.
3 Correct 32 ms 700 KB Correct.
4 Correct 29 ms 3668 KB Correct.
5 Correct 27 ms 416 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 704 KB Correct.
2 Correct 26 ms 800 KB Correct.
3 Correct 65 ms 28148 KB Correct.
4 Correct 21 ms 2468 KB Correct.
5 Correct 30 ms 396 KB Correct.
6 Correct 29 ms 724 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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