Submission #1066650

# Submission time Handle Problem Language Result Execution time Memory
1066650 2024-08-20T04:08:47 Z Muhammet Cyberland (APIO23_cyberland) C++17
0 / 100
26 ms 5468 KB
#include <bits/stdc++.h>
#include "cyberland.h"
 
using namespace std;
 
#define ff first
#define ss second
 
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector <pair<int,int>> v[n];
    for(int i = 0; i < m; i++){
        v[x[i]].push_back({y[i],c[i]});
        v[y[i]].push_back({x[i],c[i]});
    }
    vector <int> d(n,1e9);
    d[0] = 0;
    priority_queue <pair<int,int>> q;
    q.push({0,0});
    while(!q.empty()){
        pair <int,int> w1 = q.top();
        q.pop();
        w1.ff *= (-1);
        if(w1.ff != d[w1.ss]) continue;
        for(auto [i,w] : v[w1.ss]){
            if(d[i] > d[w1.ss] + w){
                d[i] = d[w1.ss] + w;
                q.push({-d[i],i});
            }
        }
    }
    if(d[h] == 1e9) d[h] = -1;
    double ans = (double)d[h];
    d.clear();
    for(int i = 0; i < n; i++){
        v[i].clear();
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 860 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 1116 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 1372 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 5468 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 1372 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 1112 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 1368 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 1368 KB Wrong Answer.
2 Halted 0 ms 0 KB -