제출 #752454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
752454		jamielim	Computer Network (BOI14_network)	C++14	100 / 100	97 ms	4488 KiB

network

#include "network.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> ii;
const int INF=1012345678;

map<int,vector<int> > dista;

void findRoute (int N, int a, int b){
	int d=ping(a,b)+1;
    for(int i=1;i<=N;i++){
		if(i==a||i==b)continue;
		int x=ping(i,a)+1;
		dista[x].pb(i);
	}
	int ans[d+1];
	ans[d]=b;
	int cur=b;
	for(int i=d-1;i>=1;i--){
		for(int j:dista[i]){
			int y=ping(j,cur);
			if(y==0){
				cur=j;
				ans[i]=j;
				break;
			}
		}
	}
	for(int i=1;i<=d;i++)travelTo(ans[i]);
}

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

grader.c: In function 'int main()':
grader.c:48:11: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf ("%d%d%d%d", &N, &a, &b, &M);
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
grader.c:51:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |             scanf("%d", &distance[u][v]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25