Submission #230700


Source Code Expand

import java.util.*;
public class Main {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        List<Integer> x = new ArrayList<Integer>();
        List<Integer> y = new ArrayList<Integer>();
        Map<Integer,Integer> v = new HashMap<Integer,Integer>();
        List<Integer> next = new ArrayList<Integer>();
        List<Integer> tmpNext = new ArrayList<Integer>();
        for(int i=0;i<n-1;i++){
            x.add(s.nextInt());
            y.add(s.nextInt());
        }
        int Q = s.nextInt();
        if(Q!=1){
            return;
        }
        int a = s.nextInt();
        int b = s.nextInt();
        v.put(a,0);
        next.add(a);
        for(int score=1;!v.containsKey(b);score++){
            for(int i=0;i<n-1;i++){
                int xx = x.get(i);
                int yy = y.get(i);
                if(next.contains(xx)){
                    v.put(yy, score);
                    tmpNext.add(yy);
                    x.remove(i);
                    y.remove(i);
                }else if(next.contains(yy)){
                    v.put(xx, score);
                    tmpNext.add(xx);
                    x.remove(i);
                    y.remove(i);
                }
            }
            next = new ArrayList<Integer>(tmpNext);
        }
        System.out.println(v.get(b)+1);
    }


}

Submission Info

Submission Time
Task D - 閉路
User gecko655
Language Java (OpenJDK 1.7.0)
Score 0
Code Size 1437 Byte
Status WA
Exec Time 1030 ms
Memory 43428 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 3
RE × 12
WA × 15
RE × 12
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 WA 356 ms 23480 KB
subtask0_sample02.txt WA 360 ms 23228 KB
subtask0_sample03.txt WA 377 ms 23224 KB
subtask1_01.txt RE 983 ms 42724 KB
subtask1_02.txt RE 969 ms 43012 KB
subtask1_03.txt RE 357 ms 23480 KB
subtask1_04.txt RE 372 ms 23864 KB
subtask1_05.txt RE 470 ms 25912 KB
subtask1_06.txt RE 470 ms 26548 KB
subtask1_07.txt RE 968 ms 43428 KB
subtask1_08.txt RE 975 ms 42728 KB
subtask1_09.txt RE 987 ms 43420 KB
subtask1_10.txt RE 986 ms 42892 KB
subtask1_11.txt RE 980 ms 43280 KB
subtask1_12.txt RE 975 ms 43180 KB
subtask2_01.txt WA 948 ms 42952 KB
subtask2_02.txt WA 957 ms 43388 KB
subtask2_03.txt WA 362 ms 23348 KB
subtask2_04.txt WA 370 ms 23856 KB
subtask2_05.txt WA 469 ms 25876 KB
subtask2_06.txt WA 457 ms 25528 KB
subtask2_07.txt WA 956 ms 42848 KB
subtask2_08.txt WA 960 ms 43276 KB
subtask2_09.txt WA 1030 ms 42632 KB
subtask2_10.txt WA 1005 ms 42952 KB
subtask2_11.txt WA 985 ms 43168 KB
subtask2_12.txt WA 934 ms 42660 KB