Submission #823975

# Submission time Handle Problem Language Result Execution time Memory
823975 2023-08-13T10:54:20 Z irmuun Computer Network (BOI14_network) C++17
0 / 100
69 ms 4272 KB
#include<bits/stdc++.h>
#include "network.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

void findRoute(int n,int a,int b){
    vector<int>v[n+1];
    v[0].pb(b);
    int hi;
    for(int i=1;i<=n;i++){
        if(i==b) continue;
        int x=ping(i,b);
        v[x].pb(i);
        if(i==a) hi=x;
    }
    while(hi){
        for(auto i:v[hi-1]){
            if(ping(a,i)==0){
                travelTo(i);
                hi--;
                a=i;
                break;
            }
        }
    }
}

Compilation message

network.cpp: In function 'void findRoute(int, int, int)':
network.cpp:16:9: warning: 'hi' may be used uninitialized in this function [-Wmaybe-uninitialized]
   16 |     int hi;
      |         ^~
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 time Memory Grader output
1 Incorrect 65 ms 4180 KB Message has not reached its target
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 4272 KB Message has not reached its target
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 4228 KB Message has not reached its target
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 4260 KB Message has not reached its target
2 Halted 0 ms 0 KB -