제출 #29186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
29186		kavun	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	896 ms	173196 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> ii;
priority_queue <ii> Q;
vector<ii> adj[150010];
int mk[150010];


int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{

  for(int i = 0; i < M; i++)
    {
      int v = R[i][0], u = R[i][1], l = L[i];
      adj[v].push_back(make_pair(u,l));
      adj[u].push_back(make_pair(v,l));
    }

  for(int i = 0; i < K; i++)
    {
      Q.push(make_pair(0,P[i]));
      mk[P[i]] = 1;
    }

  while(!Q.empty())
    {
      int v = Q.top().second;
      int val = -Q.top().first;
      Q.pop();
      if(mk[v] == 1)
	{
	  for(int i = 0; i < adj[v].size(); i++)
	    Q.push(ii(-(adj[v][i].second + val),adj[v][i].first));
	  if(v == 0)
	    return val;
	}
      mk[v]++;
    }
  return -1;
}

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

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:34:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0; i < adj[v].size(); i++)
                     ^

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