結果

問題 No.2074 Product is Square ?
ユーザー eQe
提出日時 2024-10-10 00:51:12
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 7,846 bytes
コンパイル時間 6,635 ms
コンパイル使用メモリ 335,644 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-10 00:51:22
合計ジャッジ時間 10,114 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
#include<atcoder/all>
namespace my{
void main();
void solve();
}
int main(){my::main();}
namespace my{
#define eb emplace_back
#define done(...) return pp(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define VL(n,...) vec<ll>__VA_ARGS__;setsize({n},__VA_ARGS__);lin(__VA_ARGS__)
#define FO(n) for(ll ij=0;ij<n;++ij)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
using namespace std;
using ll=int64_t;
auto range(bool s,ll a,ll b=1e18,ll c=1){if(b==1e18)b=a,(s?b:a)=0;return array{a-s,b,c};}
constexpr char nl=10;
constexpr char sp=32;
auto Yes(bool y){return y?"Yes":"No";}
auto No(){return Yes(0);}
template<class...A>auto max(const A&...a){return max(initializer_list<common_type_t<A...>>{a...});}
template<class A,class B>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  pair(const std::pair<A,B>&p):a(p.first),b(p.second){}
  bool operator==(const pair&p)const{return a==p.a&&b==p.b;}
  auto operator<=>(const pair&p)const{return a!=p.a?a<=>p.a:b<=>p.b;}
  friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<sp<<p.b;}
};
template<class F=less<>>auto&sort(auto&a,const F&f={}){ranges::sort(a,f);return a;}
template<class T,class U>ostream&operator<<(ostream&o,const std::pair<T,U>&p){return o<<p.first<<sp<<p.second;}
template<class T,class U>ostream&operator<<(ostream&o,const unordered_map<T,U>&m){fe(m,e)o<<e.first<<sp<<e.second<<nl;return o;}
template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;
template<class T>struct core_type{using type=T;};
template<vectorial V>struct core_type<V>{using type=typename core_type<typename V::value_type>::type;};
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?nl:sp);return o;}
template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){this->reserve(v.size());fe(v,e)this->eb(e);}
  vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}
  vec&operator^=(const vec&u){this->reserve(this->size()+u.size());fe(u,e)this->eb(e);return*this;}
  vec operator+(const vec&u)const{return vec(*this)+=u;}
  vec operator-(const vec&u)const{return vec(*this)-=u;}
  vec operator^(const vec&u)const{return vec(*this)^=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
  vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}
  auto scan(const auto&f)const{pair<typename core_type<V>::type,bool>r{};fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s
      =e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}
  auto max()const{return scan([](auto&a,const auto&b){a<b?a=b:0;}).a;}
};
template<class T=ll,size_t n,size_t i=0>auto make_vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1
    >(s,x);return vec<decltype(X)>(s[i],X);}}
template<ll n,class...A>void setsize(const ll(&l)[n],A&...a){((a= make_vec(l,typename core_type<A>::type())),...);}
template<bool is_negative=false>struct infinity{
  template<integral T>constexpr operator T()const{return numeric_limits<T>::max()*(1-is_negative*2);}
  template<floating_point T>constexpr operator T()const{return static_cast<ll>(*this);}
  template<class T>constexpr bool operator==(T x)const{return static_cast<T>(*this)==x;}
  constexpr auto operator-()const{return infinity<!is_negative>();}
  template<class A,class B>constexpr operator pair<A,B>()const{return pair<A,B>{*this,*this};}
};
constexpr infinity oo;
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
void lin(auto&...a){(cin>>...>>a);}
template<char c=sp>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<nl;}
template<class T,class U=T>auto rle(const vec<T>&a){vec<pair<T,U>>r;fe(a,e)r.size()&&e==r.back().a?++r.back().b:r.eb(e,1).b;return r;}
template<class T,class U=T>auto rce(vec<T>a){return rle<T,U>(sort(a));}
struct montgomery64{
  using i64=__int64_t;
  using u64=__uint64_t;
  using u128=__uint128_t;
  static inline u64 N=998244353;
  static inline u64 N_inv;
  static inline u64 R2;
  static void set_mod(u64 N){
    assert(N<(1ULL<<63));
    assert(N&1);
    montgomery64::N=N;
    R2=-u128(N)%N;
    N_inv=N;
    fo(5)N_inv*=2-N*N_inv;
    assert(N*N_inv==1);
  }
  static u64 mod(){
    return N;
  }
  u64 a;
  montgomery64(const i64&a=0):a(reduce((u128)(a%(i64)N+N)*R2)){}
  static u64 reduce(const u128&T){
    u128 r=(T+u128(u64(T)*-N_inv)*N)>>64;
    return r>=N?r-N:r;
  }
  auto&operator+=(const montgomery64&b){if((a+=b.a)>=N)a-=N;return*this;}
  auto&operator-=(const montgomery64&b){if(i64(a-=b.a)<0)a+=N;return*this;}
  auto&operator*=(const montgomery64&b){a=reduce(u128(a)*b.a);return*this;}
  auto&operator/=(const montgomery64&b){*this*=b.inv();return*this;}
  auto operator+(const montgomery64&b)const{return montgomery64(*this)+=b;}
  auto operator-(const montgomery64&b)const{return montgomery64(*this)-=b;}
  auto operator*(const montgomery64&b)const{return montgomery64(*this)*=b;}
  auto operator/(const montgomery64&b)const{return montgomery64(*this)/=b;}
  bool operator==(const montgomery64&b)const{return a==b.a;}
  auto operator-()const{return montgomery64()-montgomery64(*this);}
  montgomery64 pow(u128 n)const{
    montgomery64 r{1},x{*this};
    while(n){
      if(n&1)r*=x;
      x*=x;
      n>>=1;
    }
    return r;
  }
  montgomery64 inv()const{
    u64 a=this->a,b=N,u=1,v=0;
    while(b)u-=a/b*v,swap(u,v),a-=a/b*b,swap(a,b);
    return u;
  }
  u64 val()const{
    return reduce(a);
  }
  friend istream&operator>>(istream&i,montgomery64&b){
    ll t;i>>t;b=t;
    return i;
  }
  friend ostream&operator<<(ostream&o,const montgomery64&b){
    return o<<b.val();
  }
};
ll rand(ll l=oo,ll r=oo){if(l!=oo&&r==oo)r=l,l=0;static ll a=495;a^=a<<7,a^=a>>9;ll t=a;return l<r?((t%=(r-l))<0?t+r-l:t)+l:a;}
template<class modular>bool miller_rabin(ll n,vec<ll>as){
  ll d=n-1;
  while(~d&1)d>>=1;
  if(modular::mod()!=n)modular::set_mod(n);
  modular one=1,minus_one=n-1;
  fe(as,a){
    if(a%n==0)continue;
    ll t=d;
    modular y=modular(a).pow(t);
    while(t!=n-1&&y!=one&&y!=minus_one)y*=y,t<<=1;
    if(y!=minus_one&&~t&1)return 0;
  }
  return 1;
}
bool is_prime(ll n){
  if(~n&1)return n==2;
  if(n<=1)return 0;
  if(n<4759123141LL)return miller_rabin<montgomery64>(n,{2,7,61});
  return miller_rabin<montgomery64>(n,{2,325,9375,28178,450775,9780504,1795265022});
}
template<class modular>ll pollard_rho(ll n){
  if(~n&1)return 2;
  if(is_prime(n))return n;
  if(modular::mod()!=n)modular::set_mod(n);
  modular R,one=1;
  auto f=[&](const modular&x){return x*x+R;};
  while(1){
    modular x,y,ys,q=one;
    R=rand(2,n),y=rand(2,n);
    ll g=1;
    constexpr ll m=128;
    for(ll r=1;g==1;r<<=1){
      x=y;
      fo(r)y=f(y);
      for(ll k=0;g==1&&k<r;k+=m){
        ys=y;
        for(ll i=0;i<m&&i<r-k;++i)q*=x-(y=f(y));
        g=std::gcd(q.val(),n);
      }
    }
    if(g==n)do g=std::gcd((x-(ys=f(ys))).val(),n);while(g==1);
    if(g!=n)return g;
  }
}
auto inner_factorize(ll n){
  if(n==1)return vec<ll>{};
  ll d=pollard_rho<montgomery64>(n);
  return d==n?vec<ll>{d}:inner_factorize(d)^inner_factorize(n/d);
}
auto factorize(ll n){
  return rce(inner_factorize(n));
}
void main(){io();ll T=1;lin(T);fo(T)solve();}
void solve(){
  LL(N);
  VL(N,a);
  unordered_map<ll,bool>mem;
  fo(i,N)fe(factorize(a[i]),p,q)mem[p]^=q&1;
  fe(mem,p,b)if(b)done(No());
  pp(Yes(1));
}}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0