Submission #230691


Source Code Expand

import java.util.Scanner;

public class Main
{
    private final static Main main = new Main();

    public static void main(String[] args)
    {
        main.answer();
    }

    private void answer()
    {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[][] array = new int[N][N];
        for(int i=0; i<N; ++i)
        {
            for(int j=0; j<N; ++j)
            {
                array[i][j] = i == j ? 0 : Integer.MAX_VALUE/3;
            }
        }
        for(int i=0; i<N-1; ++i)
        {
            int a = sc.nextInt()-1;
            int b = sc.nextInt()-1;
            array[a][b] = 1;
            array[b][a] = 1;
        }
        for(int k=0; k<N; ++k)
        {
            for(int i=0; i<N; ++i)
            {
                for(int j=0; j<N; ++j)
                {
                    array[i][j] = Math.min(array[i][j], array[i][k]+array[k][j]);
                }
            }
        }
        int Q = sc.nextInt();
        for(int i=0; i<Q; ++i)
        {
            System.out.println(array[sc.nextInt()-1][sc.nextInt()-1]+1);
        }
        sc.next();
    }
}

Submission Info

Submission Time
Task D - 閉路
User poxoq
Language Java (OpenJDK 1.7.0)
Score 0
Code Size 1185 Byte
Status MLE
Exec Time 2040 ms
Memory 276560 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
RE × 3
TLE × 2
MLE × 8
RE × 2
TLE × 6
MLE × 16
RE × 5
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt RE 446 ms 23272 KB
subtask0_sample02.txt RE 434 ms 23312 KB
subtask0_sample03.txt RE 446 ms 23300 KB
subtask1_01.txt MLE 1140 ms 276560 KB
subtask1_02.txt MLE 1151 ms 276528 KB
subtask1_03.txt RE 439 ms 23328 KB
subtask1_04.txt RE 471 ms 24888 KB
subtask1_05.txt TLE 2038 ms 30012 KB
subtask1_06.txt TLE 2040 ms 30112 KB
subtask1_07.txt MLE 1366 ms 276304 KB
subtask1_08.txt MLE 1179 ms 276396 KB
subtask1_09.txt MLE 1142 ms 276432 KB
subtask1_10.txt MLE 1165 ms 276528 KB
subtask1_11.txt MLE 1161 ms 276400 KB
subtask1_12.txt MLE 1162 ms 276528 KB
subtask2_01.txt MLE 1190 ms 276400 KB
subtask2_02.txt MLE 1483 ms 276404 KB
subtask2_03.txt TLE 2039 ms 37236 KB
subtask2_04.txt TLE 2038 ms 38168 KB
subtask2_05.txt TLE 2038 ms 30116 KB
subtask2_06.txt TLE 2038 ms 30060 KB
subtask2_07.txt MLE 1134 ms 276396 KB
subtask2_08.txt MLE 1124 ms 276284 KB
subtask2_09.txt MLE 1134 ms 276432 KB
subtask2_10.txt MLE 1124 ms 276396 KB
subtask2_11.txt MLE 1119 ms 276496 KB
subtask2_12.txt MLE 1102 ms 276404 KB