oj.uz

답안 #5975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
5975 2014-06-08T11:18:37 Z baneling100 컴퓨터 네트워크 (BOI14_network) C++
50 / 100
 132 ms 5076 KB 
#include "network.h"

int Ans[1001], Dist;

int findBottom(int x)
{
    int i;

    for(i=x ; i>=0 ; i--)
        if(Ans[i])
            return i;
    return 0;
}

int findTop(int x)
{
    int i;

    for(i=x ; i<=Dist+1 ; i++)
        if(Ans[i])
            return i;
    return 0;
}

void findRoute (int N, int a, int b)
{
    int i, x, y, c, d;

    Dist=ping(a,b);
    Ans[0]=a;
    Ans[Dist+1]=b;
    for(i=1 ; i<=N ; i++)
        if(i!=a && i!=b)
        {
            x=ping(a,i);
            y=ping(i,b);
            if(Dist==x+y+1 && Ans[x+1]==0)
            {
                c=findBottom(x);
                d=findTop(x+2);
                if(x-c==ping(Ans[c],i) && d-x-2==ping(i,Ans[d]))
                    Ans[x+1]=i;
            }
        }
    for(i=1 ; i<=Dist+1 ; i++)
        travelTo(Ans[i]);
}

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 124 ms 5076 KB Output isn't correct - Too many calls to ping
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 5076 KB Output is correct
2 Correct 20 ms 5076 KB Output is correct
3 Correct 116 ms 5076 KB Output is correct
4 Correct 108 ms 5076 KB Output is correct
5 Correct 132 ms 5076 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 5076 KB Output is correct
2 Correct 28 ms 5076 KB Output is correct
3 Correct 116 ms 5076 KB Output is correct
4 Correct 104 ms 5076 KB Output is correct
5 Correct 120 ms 5076 KB Output is correct

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 108 ms 5076 KB Output isn't correct - Too many calls to ping
2 Halted 0 ms 0 KB -