Submission #1365746

#	Time	Username	Problem	Language	Result	Execution time	Memory
1365746		Warinchai	Computer Network (BOI14_network)	C++20	0 / 100	37 ms	4476 KiB

network

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

int dis[1005];
vector<int>tot[1005];

void findRoute (int N, int a, int b)
{
    for(int i=1;i<=N;i++)tot[i].clear(),dis[i]=0;
    //cerr<<"work\n";
    for(int i=1;i<N;i++){
        dis[i]=ping(i,N)+1;
        tot[dis[i]].push_back(i);
    }
    //cerr<<"wtf\n";
    int prv=a;
    vector<int>ans;
    for(int i=dis[a]-1;i>0;i--){
        int nxt=0;
        for(auto x:tot[i]){
            //cerr<<"try:"<<x<<"\n";
            if(ping(prv,x)==0){
                prv=x;
                break;
            }
        }
        travelTo(prv);
    }
    assert(ping(prv,b)==0);
    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