oj.uz

답안 #750483

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750483 2023-05-29T14:48:00 Z Gurban 사이버랜드 (APIO23_cyberland) C++17
15 / 100
 40 ms 7588 KB 
#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const ll inf = 1e18;
const int maxn=1e5+5;
// const double eps = 0.00000001;
int D[maxn];
vector<pair<int,ll>>E[maxn];

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    for(int i = 0;i < N;i++) E[i].clear();
    for(int i = 0;i < M;i++){
        E[x[i]].push_back({y[i],c[i]});
        E[y[i]].push_back({x[i],c[i]});
    }
    

    arr[0] = 0;

    ll ans = inf;
    
    priority_queue<pair<ll,int>>q;
    vector<ll>dis(N,inf);
    vector<bool>vis(N,0);

    dis[H] = 0;
    q.push({0,H});
    while(!q.empty()){
        int x = q.top().second;
        q.pop();
        if(arr[x] == 0) return dis[x];
        if(vis[x]) continue;
        vis[x] = 1;
        for(auto i : E[x]){
            if(dis[i.first] > dis[x] + i.second){
                dis[i.first] = dis[x] + i.second;
                q.push({-dis[i.first],i.first});
            }
        }
    }

    // ans = dis[0];
    // for(int i = 0;i < N;i++) if(arr[i] == 0) ans = min(ans,dis[i]);

    return -1;
}

Compilation message

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:25:8: warning: unused variable 'ans' [-Wunused-variable]
   25 |     ll ans = inf;
      |        ^~~

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 2772 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2872 KB Correct.
2 Correct 20 ms 2772 KB Correct.
3 Correct 21 ms 2872 KB Correct.
4 Correct 21 ms 2772 KB Correct.
5 Correct 20 ms 2800 KB Correct.
6 Correct 26 ms 3568 KB Correct.
7 Correct 22 ms 3628 KB Correct.
8 Correct 16 ms 4384 KB Correct.
9 Correct 20 ms 2744 KB Correct.
10 Correct 21 ms 2644 KB Correct.

Subtask #3
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 2812 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 7588 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2900 KB Correct.
2 Correct 24 ms 2936 KB Correct.
3 Correct 21 ms 2928 KB Correct.
4 Correct 24 ms 3980 KB Correct.
5 Correct 19 ms 2740 KB Correct.

Subtask #6
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 2860 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 2916 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 2932 KB Wrong Answer.
2 Halted 0 ms 0 KB -