oj.uz

Submission #216934

# Submission time Handle Problem Language Result Execution time Memory
216934 2020-03-28T13:24:05 Z bharat2002 Computer Network (BOI14_network) C++14
0 / 100
 139 ms 4312 KB 
/*input

*/
#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;
	}
	vector<int> vals;
	for(int i=1;i<=n;i++)
	{
		if(dista[i] + distb[i]==dista[b])
		{
			vals.push_back(i);
		}
	}
	sort(vals.begin(), vals.end(), sf);
	for(auto i:vals)
	{
		travelTo(i);
	}
}

Compilation message

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
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 4216 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 127 ms 4312 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 120 ms 4216 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 123 ms 4232 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -