Submission #1327661

#	Time	Username	Problem	Language	Result	Execution time	Memory
1327661		aren_dance	컴퓨터 네트워크 (BOI14_network)	C++20	50 / 100	100 ms	4368 KiB

network

#include "network.h"
#include <bits/stdc++.h>
using namespace std;
void findRoute(int n,int a,int b){
  int d=ping(a,b);
  vector<pair<int,int>> u;
  for(int i=1;i<=n;++i){
    if(i==a)
    continue;
    if(i==b)
    continue;
    int x=ping(a,i);
    int y=ping(b,i);
    if(x+y==d-1){
      u.push_back({x,i});
    }
  }
  sort(u.begin(),u.end());
  if(u.empty()){
    travelTo(b);
  }
  travelTo(u[0].second);
  int cnt=1;
  int cur=u[0].second;
  for(int i=1;i<int(u.size());++i){
    if(u[i].first<cnt){
      continue;
    }
    if(u[i].first==cnt){
      if(ping(cur,u[i].second)==0){
        cur=u[i].second;
        travelTo(cur);
        cnt++;
      }
    }
  }
  travelTo(b);
}

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]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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