oj.uz

답안 #448569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448569 2021-07-30T19:27:26 Z Aryan_Raina 컴퓨터 네트워크 (BOI14_network) C++17
0 / 100
 97 ms 4224 KB 
#include "network.h"
#include <bits/stdc++.h>
 
using namespace std;
 
void findRoute (int N, int a, int b) {
    int d[N+1];
    for (int i = 1; i <= N; i++) 
        if (a != i) d[i] = ping(a, i);
 
    d[a] = -1;
 
    int cur = a;
    while (cur != b) 
        for (int i = 1; i <= N; i++) 
            if (d[i] == d[cur]+1 && !ping(cur, i)) 
                travelTo(cur = 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

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 4128 KB Output is correct
2 Incorrect 97 ms 4208 KB Too many calls to ping
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 4220 KB Output is correct
2 Incorrect 24 ms 2764 KB Route is too long
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 4224 KB Output is correct
2 Incorrect 25 ms 2820 KB Route is too long
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 4136 KB Output is correct
2 Incorrect 24 ms 2812 KB Route is too long
3 Halted 0 ms 0 KB -