oj.uz

Submission #773061

# Submission time Handle Problem Language Result Execution time Memory
773061 2023-07-04T14:32:59 Z AmirElarbi Cyberland (APIO23_cyberland) C++17
0 / 100
 25 ms 10092 KB 
#include <bits/stdc++.h>
#define ve vector
#define vi vector<int>
#define vii vector<ii>
#define ii pair<int,int>
#define fi first
#define se second
#define ll long long
#define INF 1e18+7
#define pb push_back
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag,
    tree_order_statistics_node_update>;
const int MOD = 1e9+7;
const int nax = 2e5+5;
const int MAXL = 20+5;

#include "cyberland.h"

vii adj[nax];
double solve(int n, int m, int k, int h, vi x, vi y, vi c, vi arr) {
    for (int i = 0; i < m; ++i)
    {
        adj[x[i]].pb({y[i], c[i]});
        adj[y[i]].pb({x[i], c[i]});
    }
    ve<ll> dist(n, INF);
    priority_queue<pair<ll,int>, ve<pair<ll,int>>, greater<pair<ll,int>>> pq;
    for (int i = 0; i < n; ++i)
    {
        if(arr[i] == 2 || !i){
            dist[i] = 0;
            pq.push({0, i});        
        }
    }
    /*while(!pq.empty()){
        int u = pq.top().se;
        ll cst = pq.top().fi;
        pq.pop();
        if(dist[u] != cst) continue;
        for(auto x : adj[u]){
            if(dist[u]+x.se < dist[x.fi]){
                dist[x.fi] = dist[u]+x.se;
                pq.push({x.fi, dist[x.fi]});
            }
        }
    }*/
    return dist[h];
}

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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