제출 #497255

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497255		FerThugGato12500	악어의 지하 도시 (IOI11_crocodile)	C++17	100 / 100	454 ms	59180 KiB

crocodile

#include<bits/stdc++.h>
using namespace std;
#include "crocodile.h"
const int lmt = 100005;

struct wer{
    int i;
    long long x;
};

bool operator < (const wer &a, const wer &b){
    return a.x > b.x;
}

bool mark[lmt];
bool vis[lmt];
vector< pair<int, int> > ed[lmt];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    for(int i = 0; i <M; i++){
        ed[R[i][0]].push_back({R[i][1],L[i]});
        ed[R[i][1]].push_back({R[i][0],L[i]});
    }
    priority_queue<wer> mqun;
    for(int i = 0; i < K; i++){
        mqun.push({P[i],0});
        mark[P[i]] = true;
    }
    while(mqun.size()){
        int ind = mqun.top().i;
        long long v = mqun.top().x; mqun.pop();
 //       cout<<ind<<" "<<v<<" : ";
        if(mark[ind]){
        //    cout<<"a\n";
            if(ind==0){
                return (int)(v);
            }
            if(!vis[ind]){
                vis[ind] = true;
                for(int i = 0; i < ed[ind].size(); i++){
                    int to = ed[ind][i].first;
                    long long vs = v+ed[ind][i].second;
                    if(!vis[to]){
                        mqun.push({to,vs});
                    }
                }
            }
        }else {
            mark[ind] = true;
   //         cout<<"b\n";
        }
    }
}

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

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:40:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |                 for(int i = 0; i < ed[ind].size(); i++){
      |                                ~~^~~~~~~~~~~~~~~~
crocodile.cpp:24:25: warning: control reaches end of non-void function [-Wreturn-type]
   24 |     priority_queue<wer> mqun;
      |                         ^~~~

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