結果
問題 | No.826 連絡網 |
ユーザー | Oland |
提出日時 | 2019-05-03 21:51:45 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,853 ms / 2,000 ms |
コード長 | 4,268 bytes |
コンパイル時間 | 2,943 ms |
コンパイル使用メモリ | 79,100 KB |
実行使用メモリ | 282,100 KB |
最終ジャッジ日時 | 2023-08-30 06:05:38 |
合計ジャッジ時間 | 20,849 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
49,152 KB |
testcase_01 | AC | 40 ms
49,096 KB |
testcase_02 | AC | 45 ms
49,492 KB |
testcase_03 | AC | 79 ms
52,440 KB |
testcase_04 | AC | 84 ms
54,920 KB |
testcase_05 | AC | 59 ms
50,684 KB |
testcase_06 | AC | 60 ms
50,388 KB |
testcase_07 | AC | 74 ms
52,568 KB |
testcase_08 | AC | 60 ms
50,540 KB |
testcase_09 | AC | 75 ms
54,600 KB |
testcase_10 | AC | 52 ms
49,548 KB |
testcase_11 | AC | 76 ms
52,140 KB |
testcase_12 | AC | 1,226 ms
222,512 KB |
testcase_13 | AC | 526 ms
111,576 KB |
testcase_14 | AC | 1,027 ms
171,412 KB |
testcase_15 | AC | 211 ms
64,164 KB |
testcase_16 | AC | 642 ms
137,920 KB |
testcase_17 | AC | 547 ms
109,836 KB |
testcase_18 | AC | 458 ms
106,916 KB |
testcase_19 | AC | 1,434 ms
242,164 KB |
testcase_20 | AC | 1,259 ms
244,748 KB |
testcase_21 | AC | 93 ms
54,640 KB |
testcase_22 | AC | 575 ms
110,248 KB |
testcase_23 | AC | 667 ms
139,584 KB |
testcase_24 | AC | 405 ms
86,432 KB |
testcase_25 | AC | 1,822 ms
282,100 KB |
testcase_26 | AC | 392 ms
92,504 KB |
testcase_27 | AC | 1,249 ms
224,432 KB |
testcase_28 | AC | 1,022 ms
170,260 KB |
testcase_29 | AC | 537 ms
111,452 KB |
testcase_30 | AC | 1,853 ms
278,940 KB |
testcase_31 | AC | 638 ms
136,900 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.Map.Entry; import java.util.stream.Collectors; @SuppressWarnings("unused") public class Main { //final boolean isDebug = true; 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 P = sc.nextInt(); ArrayList<ArrayList<Integer>> G = new ArrayList<>(); for(int i = 0; i <= N; i++) G.add(new ArrayList<>()); boolean[] isPrime = new boolean[N+1]; Arrays.fill(isPrime, true); if(N >= 0) isPrime[0] = false; if(N >= 1) isPrime[1] = false; for(int i = 2; i <= N; i++){ if(isPrime[i]){ for(int j = i + i; j <= N; j += i){ isPrime[j] = false; G.get(i).add(j); G.get(j).add(i); } } } boolean[] visited = new boolean[N+1]; int count = 1; Arrays.fill(visited, false); Deque<Integer> queue = new ArrayDeque<Integer>(); queue.addFirst(P); visited[P] = true; while(queue.size() != 0){ int q = queue.removeFirst(); for(int next : G.get(q)){ if(!visited[next]){ visited[next] = true; count++; queue.addFirst(next); } } } System.out.println(count); } /* 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 String nextLine() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(b != 10) { 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()); } }