結果

問題 No.1746 Sqrt Integer Segments
ユーザー miscalc
提出日時 2021-11-18 01:08:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
MLE  
実行時間 -
コード長 2,934 bytes
コンパイル時間 2,342 ms
コンパイル使用メモリ 213,512 KB
最終ジャッジ日時 2025-01-25 19:16:24
ジャッジサーバーID
（参考情報） 		judge3 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 1 MLE * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
class eratosthenes
{
public:
  vector<bool> isprime;
  vector<ll> primes;
  vector<ll> primeid;
  vector<ll> minfactor;
  vector<ll> mobius;
  eratosthenes(ll N)
  {
    isprime.assign(N + 1, true);
    primeid.assign(N + 1, -1);
    minfactor.assign(N + 1, -1);
    mobius.assign(N + 1, 1);
    isprime.at(0) = false, isprime.at(1) = false;
    minfactor.at(1) = 1;
    for (ll p = 2; p <= N; p++)
    {
      if (!isprime.at(p))
        continue;
      primeid.at(p) = primes.size();
      primes.emplace_back(p);
      minfactor.at(p) = p;
      mobius.at(p) = -1;
      for (ll k = 2; k * p <= N; k++)
      {
        isprime.at(k * p) = false;
        if (minfactor.at(k * p) == -1)
          minfactor.at(k * p) = p;
        if (k % p == 0)
          mobius.at(k * p) = 0;
        else
          mobius.at(k * p) *= -1;
      }
    }
  }
  vector<pll> factorize(ll n)
  {
    vector<pll> ret;
    while (n > 1)
    {
      ll p = minfactor.at(n);
      ll e = 0;
      while (minfactor.at(n) == p)
      {
        n /= p;
        e++;
      }
      ret.emplace_back(make_pair(p, e));
    }
    return ret;
  }
};
const ll M = 1000000;
eratosthenes er(M);
const ll T = 78498;
using bs = bitset<T>;
bs f(ll a)
{
  bs ret = (bs)0;
  auto pes = er.factorize(a);
  for (auto pe : pes)
  {
    auto [p, e] = pe;
    if (e % 2 == 1)
      ret.set(er.primeid.at(p));
  }
  return ret;
}
int main()
{
  ll N;
  cin >> N;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }
  vector<bs> B(N);
  for (ll i = 0; i < N; i++)
  {
    B.at(i) = f(A.at(i));
  }
  vector<bs> S(N + 1);
  S.at(0) = (bs)0;
  for (ll i = 0; i < N; i++)
  {
    S.at(i + 1) = S.at(i) ^ B.at(i);
  }
  sort(S.begin(), S.end(), [&](bs b1, bs b2)
       {for (ll i = 0; i < T; i++)
  {
    if (!b1.test(i) && b2.test(i))
      return true;
    if (b1.test(i) && !b2.test(i))
      return false;
  }
  return true; });
  ll ans = 0;
  ll cnt = 1;
  for (ll i = 0; i < N; i++)
  {
    if (S.at(i) == S.at(i + 1))
      cnt++;
    else
    {
      ans += cnt * (cnt - 1) / 2;
      cnt = 1;
    }
  }
  ans += cnt * (cnt - 1) / 2;
  cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0