Submission #1196059

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196059		prideliqueee	컴퓨터 네트워크 (BOI14_network)	C++20	0 / 100	52 ms	4416 KiB

network

#include<bits/stdc++.h>
#include "network.h"
using namespace std;
#define f first
#define s second
void findRoute (int N, int a, int b)
{
    int sum=ping(a,b);
    vector<pair<int,int>> v;
    vector<int> dist[sum];
    int mx=0;
    for(int i=1;i<=N;i++)
    {
        if(i==a||i==b)
        continue;
        int dist1=ping(a,i);
        if(dist1<sum)
        dist[dist1].push_back(i);
        
    }
    int prev=a;
    if(sum==0)
    travelTo(b);
    for(int i=0;i<sum;i++)
    {
        for(auto x:dist[i])
        {
            int dist1,dist2;
            if(i==0)
            dist1=0;
            else
            dist1=ping(x,prev);
            if(dist1!=0)
            continue;
            dist2=ping(x,b);
            if(dist2+i!=sum-1);
            continue;
            prev=x;
            travelTo(x);
            break;
        }
    }
    travelTo(b);
}

Compilation message (stderr)

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
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25