oj.uz

답안 #823901

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823901 2023-08-13T09:55:15 Z irmuun 컴퓨터 네트워크 (BOI14_network) C++17
25 / 100
 70 ms 11816 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){
    int p[n+1][n+1];
    vector<int>adj[n+1];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==j){
                p[i][j]=-1;
                continue;
            }
            p[i][j]=ping(i,j);
            if(p[i][j]==0){
                adj[i].pb(j);
                adj[j].pb(i);
            }
        }
    }
    queue<ll>q;
    int par[n+1];
    fill(par,par+n+1,-1);
    par[a]=0;
    q.push(a);
    while(!q.empty()){
        int x=q.front();
        q.pop();
        for(auto y:adj[x]){
            if(par[y]==-1){
                par[y]=x;
                q.push(y);
            }
        }
    }
    vector<int>v;
    while(b!=a){
        v.pb(b);
        b=par[b];
    }
    reverse(all(v));
    for(int i=0;i<v.size();i++){
        travelTo(v[i]);
    }
}

Compilation message

network.cpp: In function 'void findRoute(int, int, int)':
network.cpp:50:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
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 Incorrect 67 ms 8140 KB Too many calls to ping
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 8436 KB Output is correct
2 Correct 17 ms 3948 KB Output is correct
3 Correct 69 ms 11696 KB Output is correct
4 Correct 63 ms 10200 KB Output is correct
5 Correct 70 ms 11816 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 8240 KB Too many calls to ping
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 61 ms 8136 KB Too many calls to ping
2 Halted 0 ms 0 KB -