Submission #740066

# Submission time Handle Problem Language Result Execution time Memory
740066 2023-05-12T04:25:21 Z veehz Computer Network (BOI14_network) C++17
100 / 100
94 ms 7984 KB
#include "network.h"

#include <bits/stdc++.h>
using namespace std;

void findRoute(int n, int a, int b) {
    vector<vector<int>> dist(n);
    dist[0].push_back(b);
    for(int i=1;i<=n;i++){
        if(i == b) continue;
        dist[ping(i,b)+1].push_back(i);
    }

    int cur = a, d = ping(a,b)+1;
    while(d){
        for(auto& i : dist[d-1]){
            if(ping(cur,i) == 0){
                travelTo(i);
                cur = i;
                d--;
                break;
            }
        }
    }
}

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]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 92 ms 7984 KB Output is correct
2 Correct 88 ms 7408 KB Output is correct
3 Correct 94 ms 7148 KB Output is correct
4 Correct 82 ms 7008 KB Output is correct
5 Correct 82 ms 6784 KB Output is correct
6 Correct 82 ms 6604 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 86 ms 6712 KB Output is correct
2 Correct 23 ms 2764 KB Output is correct
3 Correct 89 ms 7760 KB Output is correct
4 Correct 94 ms 6168 KB Output is correct
5 Correct 86 ms 7972 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 83 ms 6672 KB Output is correct
2 Correct 21 ms 2740 KB Output is correct
3 Correct 93 ms 7800 KB Output is correct
4 Correct 83 ms 6220 KB Output is correct
5 Correct 93 ms 7976 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 83 ms 6704 KB Output is correct
2 Correct 21 ms 2784 KB Output is correct
3 Correct 90 ms 7812 KB Output is correct
4 Correct 78 ms 6232 KB Output is correct
5 Correct 86 ms 7856 KB Output is correct