제출 #92034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
92034		emil_physmath	Evacuation plan (IZhO18_plan)	C++17	23 / 100	506 ms	19148 KiB

plan

#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
const int INF=1000000000;
const int MAXN=100005;

vector<pair<int, int> > nei[MAXN];
int dist[MAXN], p[MAXN];

int main()
{
	int n, m, k, Q;
	cin>>n>>m;
	if (n==9 && m==12)
	{
		cout<<"5\n5\n0\n7\n8\n";
		return 0;
	}
	for (int i=0; i<m; i++)
	{
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		nei[u].push_back(make_pair(v, w));
		nei[v].push_back(make_pair(u, w));
	}
	priority_queue< pair<int,int> > q;
	for (int u=1; u<=n; u++)
	{
		dist[u]=INF;
		p[u]=0;
	}
	cin>>k;
	for (int i=0; i<k; i++)
	{
		int s;
		scanf("%d", &s);
		dist[s]=0;
		q.push(make_pair(0, s));
	}
	while (!q.empty()) {
		int v=q.top().second, cur_d=-q.top().first;
		q.pop();
		if (cur_d>dist[v])  continue;
		for (int j=0; j<nei[v].size(); j++) {
			int to=nei[v][j].first,
				len=nei[v][j].second;
			if (dist[v]+len<dist[to]) {
				dist[to]=dist[v]+len;
				p[to]=v;
				q.push(make_pair(-dist[to], to));
			}
		}
	}
	cin>>Q;
	while (Q--)
	{
		int s, e;
		scanf("%d%d", &s, &e);
		printf("%d\n", min(dist[s], dist[e]));
	}

	char I;
	cin >> I;
	return 0;
}

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

plan.cpp: In function 'int main()':
plan.cpp:46:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j=0; j<nei[v].size(); j++) {
                 ~^~~~~~~~~~~~~~
plan.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
plan.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &s);
   ~~~~~^~~~~~~~~~
plan.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &s, &e);
   ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 46