結果

問題 No.2756 GCD Teleporter
ユーザー 👑 binapbinap
提出日時 2024-05-10 22:59:27
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 156 ms / 2,000 ms
コード長 3,361 bytes
コンパイル時間 4,552 ms
コンパイル使用メモリ 273,216 KB
実行使用メモリ 20,660 KB
最終ジャッジ日時 2024-05-10 22:59:37
合計ジャッジ時間 9,299 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
7,900 KB
testcase_01 AC 4 ms
7,968 KB
testcase_02 AC 5 ms
7,988 KB
testcase_03 AC 4 ms
7,992 KB
testcase_04 AC 15 ms
8,592 KB
testcase_05 AC 49 ms
11,176 KB
testcase_06 AC 128 ms
16,668 KB
testcase_07 AC 94 ms
14,908 KB
testcase_08 AC 87 ms
14,452 KB
testcase_09 AC 80 ms
13,488 KB
testcase_10 AC 111 ms
15,936 KB
testcase_11 AC 156 ms
18,004 KB
testcase_12 AC 31 ms
10,152 KB
testcase_13 AC 140 ms
18,520 KB
testcase_14 AC 131 ms
17,664 KB
testcase_15 AC 31 ms
10,264 KB
testcase_16 AC 73 ms
13,484 KB
testcase_17 AC 89 ms
14,744 KB
testcase_18 AC 29 ms
10,180 KB
testcase_19 AC 148 ms
18,624 KB
testcase_20 AC 134 ms
17,604 KB
testcase_21 AC 64 ms
12,396 KB
testcase_22 AC 137 ms
17,860 KB
testcase_23 AC 20 ms
9,132 KB
testcase_24 AC 108 ms
15,632 KB
testcase_25 AC 115 ms
16,096 KB
testcase_26 AC 129 ms
17,444 KB
testcase_27 AC 136 ms
18,032 KB
testcase_28 AC 82 ms
13,204 KB
testcase_29 AC 108 ms
15,892 KB
testcase_30 AC 138 ms
18,340 KB
testcase_31 AC 62 ms
12,380 KB
testcase_32 AC 136 ms
17,336 KB
testcase_33 AC 55 ms
11,712 KB
testcase_34 AC 20 ms
9,364 KB
testcase_35 AC 129 ms
17,624 KB
testcase_36 AC 124 ms
17,608 KB
testcase_37 AC 4 ms
7,868 KB
testcase_38 AC 156 ms
18,300 KB
testcase_39 AC 156 ms
20,660 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
  int n;
  vector<int> f, primes;
  Sieve(int n=1):n(n), f(n+1) {
    f[0] = f[1] = -1;
    for (ll i = 2; i <= n; ++i) {
      if (f[i]) continue;
      primes.push_back(i);
      f[i] = i;
      for (ll j = i*i; j <= n; j += i) {
        if (!f[j]) f[j] = i;
      }
    }
  }
  bool isPrime(int x) { return f[x] == x;}
  vector<int> factorList(int x) {
    vector<int> res;
    while (x != 1) {
      res.push_back(f[x]);
      x /= f[x];
    }
    return res;
  }
  vector<pair<ll,int>> factor(ll x) {
    vector<pair<ll,int>> res;
    for (int p : primes) {
      int y = 0;
      while (x%p == 0) x /= p, ++y;
      if (y != 0) res.emplace_back(p,y);
    }
    if (x != 1) res.emplace_back(x,1);
    return res;
  }
	int num_of_divisors(long long x){
		auto f = factor(x);
		long long res = 1;
		for(auto [p, val] : f){
			res *= val + 1;
		}
		return res;
	}
	set<long long> divisors(long long x){
		set<long long> se = {1};
		auto f = factor(x);
		for(auto [key, value] : f){
			set<long long> old = se;
			for(long long y : old){
				rep(i, value + 1){
					se.insert(y);
					y *= key;
				}
			}
		}
		return se;
	}
};

const int M = 200000;

int main(){
	Sieve sieve(500);
	int n;
	cin >> n;
	vector<int> a(n);
	cin >> a;
	auto p = sieve.primes;
	int m = p.size();
	vector<vector<int>> v(M + 1);
	rep(i, n){
		rep(j, m){
			bool success = false;
			while(a[i] % p[j] == 0){
				success = true;
				a[i] /= p[j];
			}
			if(success) v[p[j]].push_back(i);
		}
		if(a[i] > 1) v[a[i]].push_back(i);
	}
	dsu uf(n);
	bool two = false;
	bool three = false;
	rep(j, M + 1){
		int sz = v[j].size();
		if(j == 2 and sz >= 1) two = true;
		if(j == 3 and sz >= 1) three = true;
		rep(k, sz - 1) uf.merge(v[j][k], v[j][k + 1]);
	}
	int sz = uf.groups().size();
	if(sz == 1){
		cout << "0\n";
		return 0;
	}
	if(two){
		cout << (sz - 1) * 2 << "\n";
		return 0;
	}
	if(three && sz == 2){
		cout << 3 << "\n";
		return 0;
	}
	cout << 2 * sz << "\n";
	return 0;
}
0