結果
問題 | No.826 連絡網 |
ユーザー | watarimaycry2 |
提出日時 | 2020-10-07 13:10:20 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 608 ms / 2,000 ms |
コード長 | 5,202 bytes |
コンパイル時間 | 2,597 ms |
コンパイル使用メモリ | 77,732 KB |
実行使用メモリ | 98,468 KB |
最終ジャッジ日時 | 2023-09-27 09:15:50 |
合計ジャッジ時間 | 12,549 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
49,436 KB |
testcase_01 | AC | 46 ms
49,496 KB |
testcase_02 | AC | 50 ms
49,584 KB |
testcase_03 | AC | 85 ms
51,972 KB |
testcase_04 | AC | 83 ms
51,844 KB |
testcase_05 | AC | 68 ms
52,112 KB |
testcase_06 | AC | 68 ms
51,188 KB |
testcase_07 | AC | 88 ms
52,068 KB |
testcase_08 | AC | 67 ms
51,292 KB |
testcase_09 | AC | 82 ms
52,088 KB |
testcase_10 | AC | 57 ms
51,212 KB |
testcase_11 | AC | 80 ms
52,492 KB |
testcase_12 | AC | 545 ms
88,280 KB |
testcase_13 | AC | 323 ms
72,368 KB |
testcase_14 | AC | 494 ms
89,040 KB |
testcase_15 | AC | 145 ms
59,392 KB |
testcase_16 | AC | 367 ms
75,440 KB |
testcase_17 | AC | 367 ms
74,576 KB |
testcase_18 | AC | 256 ms
63,816 KB |
testcase_19 | AC | 569 ms
93,696 KB |
testcase_20 | AC | 567 ms
92,096 KB |
testcase_21 | AC | 78 ms
51,780 KB |
testcase_22 | AC | 356 ms
71,924 KB |
testcase_23 | AC | 397 ms
75,832 KB |
testcase_24 | AC | 230 ms
66,056 KB |
testcase_25 | AC | 592 ms
98,400 KB |
testcase_26 | AC | 253 ms
64,560 KB |
testcase_27 | AC | 576 ms
88,800 KB |
testcase_28 | AC | 589 ms
82,768 KB |
testcase_29 | AC | 328 ms
73,824 KB |
testcase_30 | AC | 608 ms
98,468 KB |
testcase_31 | AC | 367 ms
73,868 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ static void solve(){//Here is the main function ArrayList<Integer> one = nextIntArray(); int N = one.get(0); int P = one.get(1); UnionFind uf = new UnionFind(N + 1); HashSet<Integer> set = sieveOfEratos(N); for(int i = 2; i <= N; i++){ if(set.contains(i)){ for(int j = 2; i * j <= N; j++){ uf.doUnion(i, i * j); } } } myout(uf.getSize(P)); } //Method addition frame start static class UnionFind{ int[] list; UnionFind(int size){ list = new int[size]; for(int i = 0; i < size; i++){ list[i] = -1; } } boolean isSame(int mae, int ato){ return getRootIndex(mae) == getRootIndex(ato); } int getRootIndex(int index){ if(list[index] < 0){ return index; }else{ list[index] = getRootIndex(list[index]); return list[index]; } } void doUnion(int mae, int ato){ int maeRoot = getRootIndex(mae); int atoRoot = getRootIndex(ato); if(!isSame(maeRoot, atoRoot)){ if(maeRoot >= atoRoot){ list[maeRoot] += list[atoRoot]; list[atoRoot] = maeRoot; }else{ list[atoRoot] += list[maeRoot]; list[maeRoot] = atoRoot; } } } int getSize(int index){ return -list[getRootIndex(index)]; } } static HashSet<Integer> sieveOfEratos(int val){ HashSet<Integer> primes = new HashSet<>(); HashSet<Integer> nums = new HashSet<>(); int[] used = {2, 3, 5, 7, 11}; int underPrime = 13; if(val <= 1){ return nums; } for(int i = 0; i < used.length; i++){ if(used[i] <= val){ nums.add(used[i]); } } for(int i = underPrime; i <= val; i += 2){ boolean continued = false; for(int j = 0; j < used.length; j++){ if(i % used[j] == 0){ continued = true; break; } } if(continued){ continue; } nums.add(i); } int i = 2; while(i <= Math.sqrt(val)){ if(!nums.contains(i)){ if(i == 2){ i++; }else{ i += 2; } continue; } int count = 1; while(i * count <= val){ if(i <= 11 && Arrays.asList(used).contains(i)){ break; } if(count == 1){ primes.add(i); } nums.remove(i * count); count++; } if(i == 2){ i++; }else{ i += 2; } } Iterator<Integer> it = primes.iterator(); while(it.hasNext()){ nums.add(it.next()); } return nums; } //Method addition frame end //Don't have to see. start------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.add(read); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap<Integer, String> CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextStrArray(){return myconv(next(), 8);} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<Integer> nextIntArray(){ ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<>(input.size()); for(int i = 0; i < input.size(); i++){ ret.add(Integer.parseInt(input.get(i))); } return ret; } static ArrayList<Long> nextLongArray(){ ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<>(input.size()); for(int i = 0; i < input.size(); i++){ ret.add(Long.parseLong(input.get(i))); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof ArrayList){ return String.join(joinString, (ArrayList)list); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //Don't have to see. end------------------------------------------ }