#695689 (C++17) No.1665 quotient replace

提出ソース

結果

問題	No.1665 quotient replace
ユーザー	PCTprobability
提出日時	2021-09-03 22:27:32
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	6,182 bytes
コンパイル時間	6,823 ms
コンパイル使用メモリ	309,944 KB
実行使用メモリ	39,296 KB
最終ジャッジ日時	2024-05-09 05:02:48
合計ジャッジ時間	14,552 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 10,752 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	6 ms 5,248 KB
testcase_04	AC	6 ms 5,376 KB
testcase_05	AC	3 ms 5,376 KB
testcase_06	AC	48 ms 5,376 KB
testcase_07	AC	10 ms 5,376 KB
testcase_08	AC	27 ms 5,376 KB
testcase_09	AC	181 ms 7,168 KB
testcase_10	AC	2,096 ms 39,296 KB
testcase_11	TLE	-
testcase_12	--	-
testcase_13	--	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
//#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 1000000009;
ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
//static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
ll binary_gcd(ll u, ll v){
    if(min(u, v) == 0) return u|v;
    int shift = __builtin_ctzll(u|v);
    u >>= __builtin_ctzll(u);
    while(v){
        v >>= __builtin_ctzll(v);
        if(u > v) swap(u, v);
        v -= u;
    }
    return u << shift;
}
 
ll pov(ll base, ll exp, ll mod){
	ll ret = 1;
	while(exp){
		if(exp&1) ret = (__int128)ret * base % mod;
		base = (__int128)base * base % mod;
		exp >>= 1;
	}
	return ret;
}
 
bool check_composite(ll n, int a, ll d, int s){
	ll x = pov(a, d, n);
	if(x == 1 || x == n-1) return 0;
	FOR(r, 0, s-1){
		x = (__int128)x * x % n;
		if(x == n-1) return 0;
	}
	return 1;
}
 
bool MillerRabin(ll n, int iter = 5){
	if(n < 4) return  n == 2 || n == 3;
	int s = __builtin_ctzll(n-1);
	ll d = (n-1) >> s;
	FOR(i, 0, iter){
		int a = rand() % (n-3) + 2;
		if(check_composite(n, a, d, s)) return 0;
	}
    return 1;
}
 
ll rho_pollard(ll n){
	if((n&1) == 0) return 2;
	ll x, y, c, g = 1;
	x = y = rand() % n + 1;
	c = rand() % n + 1;
	while(g == 1){
		x = ((__int128)x*x+c) % n;
		y = ((__int128)y*y+c) % n;
		y = ((__int128)y*y+c) % n;
		g = binary_gcd(abs(x-y), n);
	}
	return g;
}
 
void factorize(ll num, vector<ll> &facts){
	if(num == 1) return;
	if(MillerRabin(num)){
		facts.PB(num);
		return;
	}
	ll divis = rho_pollard(num);
	factorize(divis, facts);
	factorize(num/divis, facts);
}
int main() {
  cincout();
  ll n;
  cin>>n;
  ll ok=0;
  map<ll,ll> p,q;
  while(n--){
    ll x;
    cin>>x;
    if(q[x]){
      ok^=p[x];
      continue;
    }
    q[x]=1;
    vector<ll> now;
    factorize(x,now);
    map<ll,ll> m;
    for(auto e:now) m[e]++;
    ll ans=0;
    for(auto e:m) chmax(ans,e.se);
    ok^=ans;
    p[x]=ans;
  }
  if(ok==0){
    cout<<"black"<<endl;
  }
  else{
    cout<<"white"<<endl;
  }
}

yukicoder

結果

テストケース

ソースコード