結果

問題 No.812 Change of Class
ユーザー OlandOland
提出日時 2019-04-12 22:47:31
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,120 bytes
コンパイル時間 3,019 ms
コンパイル使用メモリ 81,484 KB
実行使用メモリ 91,136 KB
最終ジャッジ日時 2024-06-12 19:45:53
合計ジャッジ時間 32,153 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 87 ms
39,904 KB
testcase_08 AC 83 ms
39,120 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 158 ms
49,880 KB
testcase_12 WA -
testcase_13 AC 59 ms
38,100 KB
testcase_14 AC 57 ms
37,648 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 130 ms
42,860 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 AC 93 ms
40,632 KB
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 AC 585 ms
70,152 KB
testcase_56 AC 574 ms
89,076 KB
testcase_57 AC 633 ms
84,620 KB
testcase_58 AC 394 ms
62,372 KB
testcase_59 AC 649 ms
91,136 KB
testcase_60 AC 59 ms
37,464 KB
testcase_61 AC 77 ms
39,960 KB
testcase_62 AC 76 ms
39,908 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.Map.Entry;

public class Main {
	
	final boolean isDebug = false;
	String fileName = "input.txt";
	FastScanner sc;
	PrintWriter out;
	final int MOD = (int)1e9+7;
	final int INF = Integer.MAX_VALUE / 2;
	
	void solve() throws Exception{
		int N = sc.nextInt();
		int M = sc.nextInt();
		ArrayList<ArrayList<Integer>> G = new ArrayList<>();
		for(int i = 0; i < N; i++) G.add(new ArrayList<>());
		for(int i = 0; i < M; i++){
			int p = sc.nextInt()-1;
			int q = sc.nextInt()-1;
			G.get(p).add(q);
			G.get(q).add(p);
		}
		
		int Q = sc.nextInt();
		int[] visited = new int[N];
		for(int i = 0; i < Q; i++){
			int A = sc.nextInt()-1;
			Arrays.fill(visited, -1);
			visited[A] = 0;
			Deque<List<Integer>> queue = new ArrayDeque<List<Integer>>();
			queue.addLast(Arrays.asList(A, 0));
			int max = 0;
			int cnt = 0;
			
			while(queue.size() != 0){
				List<Integer> e = queue.removeFirst();
				int u = e.get(0);
				int d = e.get(1);
				for(int v : G.get(u)){
					if(visited[v] == -1){
						cnt++;
						visited[v] = d+1;
						max = Math.max(max, d+1);
						queue.addLast(Arrays.asList(v, d+1));
					}
				}
			}
			if(max <= 1) System.out.println(cnt + " 0");
			else if(max == 2) System.out.println(cnt + " 1");
			else if(max % 2 == 1){
				System.out.println(cnt + " " + ((max + 1) / 2));
			}else{
				System.out.println(cnt + " " + (max / 2));
			}
		}
	}
	
	/* end solve */
	
	/* main */
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		long S = System.currentTimeMillis();
		sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		if(isDebug){
			System.out.println("---Debug---");
			System.out.printf("%8d ms", (G-S));
		}
	}
	/* end main */
}
/* end Main */

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
    	if (hasNextByte()) return buffer[ptr++];
    	else return -1;
    }
    private static boolean isPrintableChar(int c){
    	return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(buffer[ptr]))
    		ptr++; return hasNextByte();
    }
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
    	return Double.parseDouble(next());
    }
}
0