結果

問題 No.826 連絡網
ユーザー watarimaycry2watarimaycry2
提出日時 2020-10-07 13:09:10
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,289 bytes
コンパイル時間 2,930 ms
コンパイル使用メモリ 78,608 KB
実行使用メモリ 100,288 KB
最終ジャッジ日時 2023-09-27 09:15:36
合計ジャッジ時間 12,613 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,528 KB
testcase_01 AC 44 ms
49,472 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
権限があれば一括ダウンロードができます

ソースコード

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);
      HashSet<Integer> set = sieveOfEratos(N);
      for(int i = 2; i <= N; i++){
        if(set.contains(i)){
          for(int j = 2; i * j <= N; j++){
            if(uf.getRootIndex(i * j) != i * j){
              continue;
            }
            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------------------------------------------
}
0