oj.uz

Submission #752438

# Submission time Handle Problem Language Result Execution time Memory
752438 2023-06-03T03:21:42 Z jamielim Computer Network (BOI14_network) C++14
0 / 100
 91 ms 4288 KB 
#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;

int dista[1005];
set<int> found;

void findRoute (int N, int a, int b){
	int d=ping(a,b)+1;
	found.insert(0);
	found.insert(d);
	memset(dista,-1,sizeof(dista));
	dista[0]=a;
	dista[d]=b;
    for(int i=1;i<=N;i++){
		if(i==a||i==b)continue;
		int x=ping(i,a)+1;
		if(dista[x]!=-1)continue;
		auto it=found.upper_bound(x);
		int y=ping(i,dista[*it])+1;
		if(x+y==(*it)){
			dista[x]=i;
			found.insert(x);
		}
	}
	for(int i=0;i<=d;i++)travelTo(dista[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]
   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
0 / 25.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 25.0

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