oj.uz

답안 #823846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823846 2023-08-13T08:39:06 Z irmuun 컴퓨터 네트워크 (BOI14_network) C++17
25 / 100
 70 ms 7892 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>route;
    int dist=ping(a,b);
    dist++;
    vector<int>v(dist);
    for(int i=1;i<=N;i++){
        if(a==i||b==i) continue;
        int x=ping(a,i),y=ping(b,i);
        x++,y++;
        if(x+y==dist){
            v[x-1]=i;
        }
    }
    v[dist-1]=b;
    for(int i=0;i<dist;i++){
        travelTo(v[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
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 7892 KB Output is correct
2 Correct 66 ms 7404 KB Output is correct
3 Correct 62 ms 6988 KB Output is correct
4 Correct 60 ms 6924 KB Output is correct
5 Correct 62 ms 6676 KB Output is correct
6 Correct 70 ms 6680 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 63 ms 6588 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 64 ms 6592 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 64 ms 6596 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -