Submission #16779

#	Time	Username	Problem	Language	Result	Execution time	Memory
16779		kdh9949	Computer Network (BOI14_network)	C++98	25 / 100	134 ms	5588 KiB

network

#include "network.h"
#include <vector>
#include <stack>

using namespace std;

vector<int> d[1010];
stack<int> ans;

void findRoute (int N, int a, int b)
{
    int cur,dist,last;
    for(int i=1;i<=N;i++){
        if(i==a)continue;
        cur=ping(a,i);
        if(i==b)dist=cur;
        d[cur].push_back(i);
    }
    last=b;
    for(int i=dist-1;i>=0;i--){
        for(int j=0;j<d[i].size();j++){
            if(ping(last,d[i][j])==0){
                ans.push(last);
                last=d[i][j];
            }
        }
    }
    ans.push(last);
    while(!ans.empty())travelTo(ans.top()),ans.pop();
}

• Subtask 1: 25 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25