結果

問題 No.826 連絡網
ユーザー watarimaycry2watarimaycry2
提出日時 2020-10-07 13:06:42
言語 Java21
(openjdk 21)
結果
AC  
実行時間 598 ms / 2,000 ms
コード長 4,395 bytes
コンパイル時間 2,722 ms
コンパイル使用メモリ 80,596 KB
実行使用メモリ 78,156 KB
最終ジャッジ日時 2024-07-20 03:22:56
合計ジャッジ時間 10,866 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 60 ms
50,256 KB
testcase_01 AC 59 ms
50,460 KB
testcase_02 AC 61 ms
50,696 KB
testcase_03 AC 85 ms
51,380 KB
testcase_04 AC 80 ms
51,996 KB
testcase_05 AC 64 ms
50,648 KB
testcase_06 AC 62 ms
51,052 KB
testcase_07 AC 79 ms
51,232 KB
testcase_08 AC 63 ms
52,720 KB
testcase_09 AC 69 ms
51,156 KB
testcase_10 AC 60 ms
50,556 KB
testcase_11 AC 66 ms
50,844 KB
testcase_12 AC 445 ms
69,972 KB
testcase_13 AC 222 ms
59,872 KB
testcase_14 AC 318 ms
67,540 KB
testcase_15 AC 124 ms
56,056 KB
testcase_16 AC 265 ms
67,072 KB
testcase_17 AC 216 ms
59,968 KB
testcase_18 AC 198 ms
59,708 KB
testcase_19 AC 494 ms
71,940 KB
testcase_20 AC 485 ms
71,916 KB
testcase_21 AC 81 ms
53,484 KB
testcase_22 AC 237 ms
59,484 KB
testcase_23 AC 283 ms
62,440 KB
testcase_24 AC 173 ms
56,716 KB
testcase_25 AC 584 ms
78,156 KB
testcase_26 AC 183 ms
58,992 KB
testcase_27 AC 448 ms
71,124 KB
testcase_28 AC 344 ms
66,560 KB
testcase_29 AC 220 ms
59,044 KB
testcase_30 AC 598 ms
77,988 KB
testcase_31 AC 267 ms
66,696 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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);
      for(int i = 2; i <= N; i++){
        if(isPrime(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 boolean isPrime(long val){
        if(val <= 1 || (val != 2 && val % 2 == 0)){
                return false;
        }else if(val == 2){
                return true;
        }
        double root = Math.floor(Math.sqrt(val));
        for(long i = 3; i <= root; i += 2){
                if(val % i == 0){
                        return false;
                }
        }
        return true;
}

	//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------------------------------------------
}
0