Submission #216938

#	Time	Username	Problem	Language	Result	Execution time	Memory
216938		bharat2002	컴퓨터 네트워크 (BOI14_network)	C++14	25 / 100	138 ms	8568 KiB

network

#include "network.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e3 + 100;
int dista[N], distb[N];
bool sf(int a, int b)
{
	return dista[a]<dista[b];
}
void findRoute(int n, int a, int b)
{
	for(int i=1;i<=n;i++)
	{
		if(i==a) continue;
		dista[i]=ping(i, a) +1;
	}
	for(int i=1;i<=n;i++)
	{
		if(i==b) continue;
		distb[i]=ping(i, b) + 1;
	}
	distb[b]=0;
	vector<int> vals;
	for(int i=1;i<=n;i++)
	{
		if(dista[i] + distb[i]==dista[b]&&i!=a)
		{
			vals.push_back(i);
		}
	}
	sort(vals.begin(), vals.end(), sf);
	int prev=0;
	for(auto i:vals)
	{
		assert(dista[i]==prev+1);prev++;
		travelTo(i);
	}
}

Compilation message (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]
     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]
             scanf("%d", &distance[u][v]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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