Submission #1324243

#TimeUsernameProblemLanguageResultExecution timeMemory
1324243jellybeanComputer Network (BOI14_network)C++20
100 / 100
52 ms4352 KiB
#include "network.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> dis[1002];

void findRoute (int N, int a, int b){
	int n = N, d = ping(a,b);
	
	for(int i=1; i<=n; i++){
		if(i == a or i == b) continue;
		int x = ping(a,i);
		dis[x].push_back(i);
	}
	
	int en = b;
	deque<int>ans;
	ans.push_front(b);
	for(int i=d-1; i>=0; i--){
		for(auto j: dis[i]){
			if(ping(j,en) == 0){
				en = j;
				ans.push_front(j);
				break;
			}
		}
	}
	
	for(int i=0; i<ans.size(); i++) travelTo(ans[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]
   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]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...