oj.uz

Submission #16367

# Submission time Handle Problem Language Result Execution time Memory
16367 2015-08-21T16:33:12 Z suhgyuho_william Computer Network (BOI14_network) C++
25 / 100
 135 ms 5200 KB 
#include "network.h"
#include <map>
using namespace std;

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

void findRoute (int n, int a, int b)
{
    int dist = ping(a, b);
    int x,y;
    int i;

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

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 5200 KB Output is correct
2 Correct 135 ms 5200 KB Output is correct
3 Correct 64 ms 5200 KB Output is correct
4 Correct 128 ms 5200 KB Output is correct
5 Correct 112 ms 5200 KB Output is correct
6 Correct 93 ms 5200 KB Output is correct
7 Correct 0 ms 5200 KB Output is correct
8 Correct 0 ms 5200 KB Output is correct
9 Correct 0 ms 5200 KB Output is correct
10 Correct 0 ms 5200 KB Output is correct

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 113 ms 5200 KB Output isn't correct - Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 5200 KB Output isn't correct - Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 5200 KB Output isn't correct - Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -