結果
問題 | No.812 Change of Class |
ユーザー | 37zigen |
提出日時 | 2020-03-23 17:18:58 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,353 ms / 4,000 ms |
コード長 | 3,868 bytes |
コンパイル時間 | 2,322 ms |
コンパイル使用メモリ | 78,072 KB |
実行使用メモリ | 76,888 KB |
最終ジャッジ日時 | 2023-09-03 16:22:45 |
合計ジャッジ時間 | 39,556 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 501 ms
58,996 KB |
testcase_01 | AC | 227 ms
44,140 KB |
testcase_02 | AC | 349 ms
51,552 KB |
testcase_03 | AC | 495 ms
61,196 KB |
testcase_04 | AC | 575 ms
66,816 KB |
testcase_05 | AC | 1,189 ms
75,512 KB |
testcase_06 | AC | 1,132 ms
60,000 KB |
testcase_07 | AC | 122 ms
44,200 KB |
testcase_08 | AC | 114 ms
54,556 KB |
testcase_09 | AC | 1,234 ms
61,344 KB |
testcase_10 | AC | 1,242 ms
65,780 KB |
testcase_11 | AC | 220 ms
48,536 KB |
testcase_12 | AC | 924 ms
62,156 KB |
testcase_13 | AC | 78 ms
36,532 KB |
testcase_14 | AC | 72 ms
35,008 KB |
testcase_15 | AC | 836 ms
57,236 KB |
testcase_16 | AC | 225 ms
43,272 KB |
testcase_17 | AC | 907 ms
57,448 KB |
testcase_18 | AC | 725 ms
51,952 KB |
testcase_19 | AC | 756 ms
59,012 KB |
testcase_20 | AC | 1,353 ms
65,004 KB |
testcase_21 | AC | 614 ms
50,300 KB |
testcase_22 | AC | 423 ms
46,088 KB |
testcase_23 | AC | 212 ms
43,056 KB |
testcase_24 | AC | 243 ms
42,932 KB |
testcase_25 | AC | 390 ms
48,976 KB |
testcase_26 | AC | 1,247 ms
59,368 KB |
testcase_27 | AC | 917 ms
60,236 KB |
testcase_28 | AC | 693 ms
56,516 KB |
testcase_29 | AC | 343 ms
44,820 KB |
testcase_30 | AC | 918 ms
72,408 KB |
testcase_31 | AC | 793 ms
52,164 KB |
testcase_32 | AC | 456 ms
50,464 KB |
testcase_33 | AC | 1,040 ms
61,664 KB |
testcase_34 | AC | 231 ms
43,596 KB |
testcase_35 | AC | 355 ms
48,736 KB |
testcase_36 | AC | 249 ms
43,244 KB |
testcase_37 | AC | 632 ms
50,788 KB |
testcase_38 | AC | 167 ms
45,224 KB |
testcase_39 | AC | 598 ms
50,760 KB |
testcase_40 | AC | 293 ms
44,476 KB |
testcase_41 | AC | 166 ms
45,084 KB |
testcase_42 | AC | 1,009 ms
58,980 KB |
testcase_43 | AC | 347 ms
49,776 KB |
testcase_44 | AC | 770 ms
52,436 KB |
testcase_45 | AC | 264 ms
43,248 KB |
testcase_46 | AC | 294 ms
50,188 KB |
testcase_47 | AC | 690 ms
52,480 KB |
testcase_48 | AC | 872 ms
56,252 KB |
testcase_49 | AC | 372 ms
48,260 KB |
testcase_50 | AC | 128 ms
37,984 KB |
testcase_51 | AC | 393 ms
48,964 KB |
testcase_52 | AC | 596 ms
58,072 KB |
testcase_53 | AC | 328 ms
45,340 KB |
testcase_54 | AC | 329 ms
44,368 KB |
testcase_55 | AC | 504 ms
66,292 KB |
testcase_56 | AC | 505 ms
76,888 KB |
testcase_57 | AC | 567 ms
69,220 KB |
testcase_58 | AC | 415 ms
68,212 KB |
testcase_59 | AC | 625 ms
70,940 KB |
testcase_60 | AC | 83 ms
52,480 KB |
testcase_61 | AC | 71 ms
50,720 KB |
testcase_62 | AC | 69 ms
35,120 KB |
ソースコード
import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.PriorityQueue; class Edge{ int dst; long cost; public Edge(int dst,long cost) { this.dst=dst; this.cost=cost; } } public class Main { public static void main(String[] args) throws FileNotFoundException { long t = System.currentTimeMillis(); new Main().run(); System.err.println(System.currentTimeMillis() - t); } long[] shortest_path(int src,ArrayList<Integer>[] g) { long[] dp=new long[g.length]; long INF=Long.MAX_VALUE/3; Arrays.fill(dp, INF); dp[src]=0; class S implements Comparable<S>{ int v; long d; public S(int v,long d) { this.v=v; this.d=d; } public int compareTo(S o) { return Long.compare(d, o.d); }; } PriorityQueue<S> pq=new PriorityQueue<>(); pq.add(new S(src, 0)); while(!pq.isEmpty()) { S s=pq.poll(); if(dp[s.v]<s.d)continue; for(int dst:g[s.v]) { if(dp[s.v]+1<dp[dst]) { dp[dst]=dp[s.v]+1; pq.add(new S(dst,dp[dst])); } } } return dp; } void run() { FastScanner sc = new FastScanner(); int N=sc.nextInt(); int M=sc.nextInt(); ArrayList<Integer>[] g=new ArrayList[N]; for(int i=0;i<N;++i)g[i]=new ArrayList<>(); for(int i=0;i<M;++i) { int p=sc.nextInt()-1; int q=sc.nextInt()-1; g[p].add(q); g[q].add(p); } int Q=sc.nextInt(); for(int q=0;q<Q;++q) { int a=sc.nextInt()-1; long[] dist=shortest_path(a, g); long max=0; int sz=0; for(int m=0;m<N;++m) { if(m==a||dist[m]==Long.MAX_VALUE/3)continue; ++sz; max=Math.max(max, dist[m]); } int d=0; while((1L<<d)<max)++d; System.out.println(sz+" "+d); } } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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() { return (int)nextLong(); } }