제출 #16366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
16366		suhgyuho_william	Computer Network (BOI14_network)	C++98	0 / 100	143 ms	5200 KiB

network

#include "network.h"
#include <map>
using namespace std;

map<int,int> path;
map<int,int>::iterator it;

void findRoute (int n, int a, int b)
{
    /*
     *  Obviously, this is not a good solution.
     *  Replace it with your own code.
     */

    int dist = ping(a, b);
    int x,y;

    path[dist+1]=b;
    int i;
    for(i=1;i<=n;i++){
        if(i==a || i==b) continue;
        x=ping(a,i);
        if(path.find(x+1)!=path.end()) continue;
        path[x+1]=i;
        it=path.find(x+1);
        it++;
        y=ping(i,it->second);
        if(it->first != x+y+2){
            path.erase(x+1);
        }
    }
    for(it=path.begin(); it!=path.end(); it++){
        travelTo(it->second);
    }
}

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