結果
問題 | No.826 連絡網 |
ユーザー | 37zigen |
提出日時 | 2020-03-24 15:59:42 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 163 ms / 2,000 ms |
コード長 | 3,173 bytes |
コンパイル時間 | 2,143 ms |
コンパイル使用メモリ | 74,152 KB |
実行使用メモリ | 55,944 KB |
最終ジャッジ日時 | 2023-08-30 05:34:05 |
合計ジャッジ時間 | 6,714 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,464 KB |
testcase_01 | AC | 43 ms
49,200 KB |
testcase_02 | AC | 45 ms
49,248 KB |
testcase_03 | AC | 56 ms
50,492 KB |
testcase_04 | AC | 57 ms
50,884 KB |
testcase_05 | AC | 47 ms
49,256 KB |
testcase_06 | AC | 48 ms
49,348 KB |
testcase_07 | AC | 56 ms
50,876 KB |
testcase_08 | AC | 50 ms
47,260 KB |
testcase_09 | AC | 58 ms
50,976 KB |
testcase_10 | AC | 46 ms
49,048 KB |
testcase_11 | AC | 56 ms
50,560 KB |
testcase_12 | AC | 139 ms
54,140 KB |
testcase_13 | AC | 100 ms
51,840 KB |
testcase_14 | AC | 113 ms
53,208 KB |
testcase_15 | AC | 83 ms
51,620 KB |
testcase_16 | AC | 94 ms
51,360 KB |
testcase_17 | AC | 102 ms
51,892 KB |
testcase_18 | AC | 96 ms
51,652 KB |
testcase_19 | AC | 148 ms
53,916 KB |
testcase_20 | AC | 146 ms
53,532 KB |
testcase_21 | AC | 59 ms
50,904 KB |
testcase_22 | AC | 90 ms
51,820 KB |
testcase_23 | AC | 107 ms
52,016 KB |
testcase_24 | AC | 82 ms
51,760 KB |
testcase_25 | AC | 163 ms
55,944 KB |
testcase_26 | AC | 84 ms
51,304 KB |
testcase_27 | AC | 138 ms
53,152 KB |
testcase_28 | AC | 119 ms
53,580 KB |
testcase_29 | AC | 90 ms
51,668 KB |
testcase_30 | AC | 162 ms
53,620 KB |
testcase_31 | AC | 103 ms
51,884 KB |
ソースコード
import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) throws FileNotFoundException { long t = System.currentTimeMillis(); new Main().run(); System.err.println(System.currentTimeMillis() - t); } class DJSet{ int n; int[] upper; public DJSet(int n) { this.n=n; upper=new int[n]; Arrays.fill(upper, -1); } int root(int x) { return upper[x]<0?x:(upper[x]=root(upper[x])); } boolean equiv(int x,int y) { return root(x)==root(y); } void setUnion(int x,int y) { x=root(x);y=root(y); if(x==y)return; if(upper[x]<upper[y]) { x^=y;y^=x;x^=y; } upper[y]+=upper[x]; upper[x]=y; } int sz(int x) { return -upper[root(x)]; } } void run() { FastScanner sc = new FastScanner(); int N=sc.nextInt(); int P=sc.nextInt(); DJSet ds=new DJSet(N+1); for(int div=2;div<=N;++div) { for(int j=2*div;j<=N;j+=div)ds.setUnion(div, j);; } System.out.println(ds.sz(P)); } 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(); } }