제출 #29259

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

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define forr(i,A,B) for(int i=A;i<B;++i)
#define space ' '
#define endl '\n'
#define LL long long
#define exit adsjdsa
using namespace std;
int exit[100005];
vector <pair<int,int> > adj[100005];
int weight[100005];
int vis[100005];
int ans,n;

void dijkstra(){
	priority_queue <pair<int,int> > pq;
	forr(i,0,n){
		if(exit[i]){
			pq.push(mp(0,i));
			vis[i]=1;
		}
	}
	while(!pq.empty()){
		int v=pq.top().nd;
		int w=-pq.top().st;
		pq.pop();
		if(vis[v]==1){
			weight[v]=-w;
			forr(i,0,adj[v].size()){
				pq.push(mp(-w-adj[v][i].st,adj[v][i].nd));
			}
		}
		vis[v]++;
	}
	ans=-weight[0];
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
	forr(i,0,M){
		adj[R[i][0]].pb(mp(L[i],R[i][1]));
		adj[R[i][1]].pb(mp(L[i],R[i][0]));
	}
	forr(i,0,K){
		exit[P[i]]=1;
	}
	n=N;
	dijkstra();
	return ans;
}

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

crocodile.cpp: In function 'void dijkstra()':
crocodile.cpp:8:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define forr(i,A,B) for(int i=A;i<B;++i)
                                  ^
crocodile.cpp:34:4: note: in expansion of macro 'forr'
    forr(i,0,adj[v].size()){
    ^

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