제출 #813099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
813099		trangtranha28	악어의 지하 도시 (IOI11_crocodile)	C++14	100 / 100	373 ms	63504 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const int INF = 1e9 + 7;
vector <int> exits;
vector <pair <int, int> > adj[MAXN];
int n, m, dis[MAXN], dis2[MAXN], vis[MAXN];
 
int Dijkstra(){
    priority_queue <pair <int, int>,vector <pair <int, int> >, greater <pair <int, int> > > pq;
    memset(dis,63,sizeof(dis)); memset(dis2,63,sizeof(dis2));
    for(auto u : exits) dis[u]=0, dis2[u]=0, pq.push({0,u});
    while(!pq.empty()){
        int s = pq.top().second; pq.pop();
        if(vis[s]) continue; vis[s]=1;
        for(auto cur : adj[s]){
            int u = cur.first, w = cur.second;
            if(dis[u]>dis2[s]+w){
                dis2[u]=dis[u], dis[u]=dis2[s]+w;
                pq.push({dis2[u],u});
            }
            else if(dis2[u]>dis2[s]+w)
                dis2[u]=dis2[s]+w, pq.push({dis2[u],u});
        }
 
    }
    return dis2[0];
}
 
int travel_plan(int N, int M, int R[][2], int L[], int k, int p[]) {
    n = N, m = M;
    for(int i = 0; i < m; i++) {
        int a = R[i][0], b = R[i][1], c = L[i];
        adj[a].push_back({b,c}), adj[b].push_back({a,c});
    }
    for(int i = 0; i < k; i++) exits.push_back(p[i]);
    return Dijkstra();
}

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

crocodile.cpp: In function 'int Dijkstra()':
crocodile.cpp:16:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   16 |         if(vis[s]) continue; vis[s]=1;
      |         ^~
crocodile.cpp:16:30: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   16 |         if(vis[s]) continue; vis[s]=1;
      |                              ^~~

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11