#746934 (C++17) No.1881 Everything is the same...

提出ソース

結果

問題	No.1881 Everything is the same...
ユーザー	heno239
提出日時	2022-03-18 23:21:34
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,796 bytes
コンパイル時間	2,311 ms
コンパイル使用メモリ	159,992 KB
実行使用メモリ	33,152 KB
最終ジャッジ日時	2024-10-03 08:35:54
合計ジャッジ時間	10,762 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	108 ms 32,384 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	112 ms 32,512 KB
testcase_10	WA	-
testcase_11	AC	123 ms 32,896 KB
testcase_12	AC	158 ms 33,024 KB
testcase_13	AC	156 ms 33,152 KB
testcase_14	AC	159 ms 32,984 KB
testcase_15	AC	165 ms 33,024 KB
testcase_16	AC	160 ms 33,024 KB
testcase_17	AC	166 ms 33,024 KB
testcase_18	AC	154 ms 33,024 KB
testcase_19	AC	158 ms 33,024 KB
testcase_20	AC	155 ms 33,040 KB
testcase_21	AC	159 ms 33,024 KB
testcase_22	AC	159 ms 32,896 KB
testcase_23	AC	159 ms 33,092 KB
testcase_24	AC	155 ms 33,152 KB
testcase_25	AC	154 ms 33,024 KB
testcase_26	AC	160 ms 33,024 KB
testcase_27	AC	162 ms 33,152 KB
testcase_28	AC	159 ms 33,080 KB
testcase_29	AC	160 ms 32,896 KB
testcase_30	AC	166 ms 33,024 KB
testcase_31	AC	160 ms 33,024 KB
testcase_32	WA	-
testcase_33	AC	157 ms 33,024 KB
testcase_34	AC	159 ms 32,896 KB
testcase_35	AC	161 ms 33,024 KB
testcase_36	AC	184 ms 32,948 KB
testcase_37	AC	159 ms 33,024 KB
testcase_38	AC	160 ms 33,144 KB
testcase_39	AC	159 ms 33,024 KB
testcase_40	AC	156 ms 32,940 KB
testcase_41	AC	157 ms 32,896 KB
testcase_42	WA	-
testcase_43	AC	103 ms 32,384 KB
testcase_44	AC	106 ms 32,512 KB
testcase_45	AC	102 ms 32,612 KB
testcase_46	AC	102 ms 32,512 KB
testcase_47	AC	103 ms 32,528 KB
testcase_48	WA	-
testcase_49	AC	101 ms 32,512 KB
testcase_50	AC	103 ms 32,512 KB
testcase_51	WA	-

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

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

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);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

int mex(vector<int>& v) {
	vector<bool> exi(v.size());
	rep(i, v.size())if (v[i] < v.size())exi[v[i]] = true;
	rep(i, v.size())if (!exi[i])return i;
	return v.size();
}
const int mn = 100005;
bool isp[mn];
int chp[mn];
vector<int> ps;

int g[mn];
vector<int> vg[mn];

int g2[mn];
vector<int> vg2[mn];
void init() {
	fill(isp + 2, isp + mn, true);
	fill(chp + 2, chp + mn, mod);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		chp[i] = i;
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
			chmin(chp[j], i);
		}
	}
	for (int i = 1; i < mn; i++) {
		g[i] = mex(vg[i]);
		for (int j = 2 * i; j < mn; j += i) {
			vg[j].push_back(g[i]);
		}
	}
	vg2[2].push_back(0);
	for (int i = 2; i < mn; i++) {
		g2[i] = mex(vg2[i]);
		for (int j = 2 * i; j < mn; j += i) {
			vg2[j].push_back(g2[i]);
		}
	}
	//cout << g2[2] << "\n";
}

int trans[mn];
void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	int x = 0;
	mt19937 mt(time(0));
	rep(i, n) {
		int cop = a[i];
		vector<int> ps;
		while (cop > 1) {
			int p = chp[cop];
			ps.push_back(p);
			while (cop % p == 0)cop /= p;
		}
		int r = a[i];
		for (int p : ps) {
			r = r / p * (p - 1);
		}
		if (a[i] == 1) {
			x ^= 0;
		}
		else if (isp[a[i]]) {
			x ^= g[r];
		}
		else {
			bool exi = false;
			int sz = lower_bound(all(ps), a[i]) - ps.begin();
			uniform_int_distribution<> ud(0, sz - 1);

			vector<int> vd;
			rep(_, 100) {
				int p = ud(mt);
				p = ps[p];
				if (a[i] % p) {
					int cnt = 1;
					int cur = p;
					cur = (ll)cur * p % a[i];
					while (cur != p) {
						cnt++;
						cur = (ll)cur * p % a[i];
					}
					vd.push_back(cnt);
				}
			}
			vd.push_back(2);
			sort(all(vd));
			vd.erase(unique(all(vd)), vd.end());

			vector<int> ds;
			for (int i = 1; i * i <= r; i++) {
				if (r % i == 0) {
					ds.push_back(i);
					ds.push_back(r / i);
				}
			}
			sort(all(ds));
			ds.erase(unique(all(ds)), ds.end());
			vector<int> dg(ds.size());
			rep(i, ds.size())trans[ds[i]] = i;
			rep(i, ds.size()) {
				vector<int> cur;
				for (int v : vd) {
					int cv = gcd(v, ds[i]);
					if (cv != 1) {
						int to = ds[i] / cv;
						cur.push_back(dg[trans[to]]);
					}
				}
				dg[i] = mex(cur);
			}

			x ^= dg.back();
		}
	}
	if (x) {
		cout << "Y\n";
	}
	else {
		cout << "X\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード