제출 #954865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
954865		ramalzaher	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	26 ms	7516 KiB

cyberland

#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std ;

double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
long long dis[N+4] , vis[N+4] , p[N+4] ;
vector<pair<long long ,long long > > v[N+4] ;
for(long long  i = 0; i < M ; i ++ ){

    v[x[i]].push_back({y[i] , c[i] }) ;
    v[y[i]].push_back({x[i] , c[i] }) ;
}
     for(long long  i = 0 ; i < N + 2 ; i ++ ) {dis[i] = 1e14 ;p[i] = -1; vis[i] = 0; }
 priority_queue<pair<long long ,long long >   , vector<pair<long long ,long long >  >, greater<pair<long long ,long long >    > > q;
   q.push({0 ,1 });dis[1] = 0 ;
   while(q.size()){
      long long  top = q.top().second ;
      q.pop() ; long long  node = top   ;
      if(vis[node])continue ;vis[node] =1 ;
      for(auto it : v[top]){
         if(it.second + dis[top] <= dis[it.first]){
            p[it.first] = top ;
            dis[it.first] = it.second+dis[top] ;
            q.push({dis[it.first] , it.first});
         }
      }
   }
    long long  ans = dis[H] ;
    if(ans >= 1e14 ){ans = -1 ;}
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:19:7: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   19 |       if(vis[node])continue ;vis[node] =1 ;
      |       ^~
cyberland.cpp:19:30: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   19 |       if(vis[node])continue ;vis[node] =1 ;
      |                              ^~~
cyberland.cpp:6:33: warning: variable 'p' set but not used [-Wunused-but-set-variable]
    6 | long long dis[N+4] , vis[N+4] , p[N+4] ;
      |                                 ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3