結果
| 問題 |
No.1746 Sqrt Integer Segments
|
| ユーザー |
 tokusakurai
|
| 提出日時 | 2021-11-20 10:45:40 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 208 ms / 2,000 ms |
| コード長 | 8,863 bytes |
| コンパイル時間 | 2,089 ms |
| コンパイル使用メモリ | 208,180 KB |
| 最終ジャッジ日時 | 2025-01-25 21:25:52 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 28 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;
template <typename T>
vector<T> divisors(const T &n) {
vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return ret;
}
template <typename T>
vector<pair<T, int>> prime_factor(T n) {
vector<pair<T, int>> ret;
for (T i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) cnt++, n /= i;
if (cnt > 0) ret.emplace_back(i, cnt);
}
if (n > 1) ret.emplace_back(n, 1);
return ret;
}
template <typename T>
bool is_prime(const T &n) {
if (n == 1) return false;
for (T i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
// 1,2,...,nのうちkと互いに素である自然数の個数
template <typename T>
T coprime(T n, T k) {
vector<pair<T, int>> ps = prime_factor(k);
int m = ps.size();
T ret = 0;
for (int i = 0; i < (1 << m); i++) {
T prd = 1;
for (int j = 0; j < m; j++) {
if ((i >> j) & 1) prd *= ps[j].first;
}
ret += (__builtin_parity(i) ? -1 : 1) * (n / prd);
}
return ret;
}
vector<bool> Eratosthenes(const int &n) {
vector<bool> ret(n + 1, true);
if (n >= 0) ret[0] = false;
if (n >= 1) ret[1] = false;
for (int i = 2; i * i <= n; i++) {
if (!ret[i]) continue;
for (int j = i + i; j <= n; j += i) ret[j] = false;
}
return ret;
}
vector<int> Eratosthenes2(const int &n) {
vector<int> ret(n + 1);
iota(begin(ret), end(ret), 0);
if (n >= 0) ret[0] = -1;
if (n >= 1) ret[1] = -1;
for (int i = 2; i * i <= n; i++) {
if (ret[i] < i) continue;
for (int j = i + i; j <= n; j += i) ret[j] = min(ret[j], i);
}
return ret;
}
struct Random_Number_Generator {
mt19937_64 mt;
Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
int64_t operator()(int64_t l, int64_t r) {
uniform_int_distribution<int64_t> dist(l, r - 1);
return dist(mt);
}
int64_t operator()(int64_t r) { return (*this)(0, r); }
} rng;
using ull = unsigned long long;
struct Rolling_Hash {
const ull mod = (1ULL << 61) - 1;
ull calc_mod(ull x) const {
ull ret = (x >> 61) + (x & mod);
return ret - (ret >= mod ? mod : 0);
}
ull mul(ull x, ull y) const {
x = calc_mod(x), y = calc_mod(y);
ull x1 = x >> 31, x2 = x & ((1ULL << 31) - 1), y1 = y >> 31, y2 = y & ((1ULL << 31) - 1);
ull z = x1 * y2 + x2 * y1, z1 = z >> 30, z2 = z & ((1ULL << 30) - 1);
return calc_mod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));
}
ull pow(ull x, ull n) const {
ull ret = 1;
for (; n > 0; n >>= 1, x = mul(x, x)) {
if (n & 1) ret = mul(ret, x);
}
return ret;
}
ull base; //基数
vector<ull> hashed, pw;
void set_base() { //基数は乱数を用いて生成する
Random_Number_Generator rng;
while (true) {
ull k = rng(mod);
if (gcd(mod - 1, k) != 1) continue;
base = pow(3, k);
if (base < 256) continue;
break;
}
}
Rolling_Hash(const string &s) {
set_base();
int n = s.size();
hashed.resize(n + 1), pw.resize(n + 1);
hashed[0] = 0, pw[0] = 1;
for (int i = 0; i < n; i++) {
pw[i + 1] = mul(pw[i], base);
hashed[i + 1] = mul(hashed[i], base) + s[i];
if (hashed[i + 1] >= mod) hashed[i + 1] -= mod;
}
}
ull query(int l, int r) const { //文字列の[l,r)の部分のハッシュ値
ull ret = hashed[r] + mod - mul(hashed[l], pw[r - l]);
return ret - (ret >= mod ? mod : 0);
}
ull get_hash(const string &s) const {
ull ret = 0;
for (int i = 0; i < (int)s.size(); i++) {
ret = mul(ret, base) + s[i];
if (ret >= mod) ret -= mod;
}
return ret;
}
};
template <typename T>
struct Array_Hash {
const ull mod = (1ULL << 61) - 1;
ull calc_mod(ull x) const {
ull ret = (x >> 61) + (x & mod);
return ret - (ret >= mod ? mod : 0);
}
ull mul(ull x, ull y) const {
x = calc_mod(x), y = calc_mod(y);
ull x1 = x >> 31, x2 = x & ((1ULL << 31) - 1), y1 = y >> 31, y2 = y & ((1ULL << 31) - 1);
ull z = x1 * y2 + x2 * y1, z1 = z >> 30, z2 = z & ((1ULL << 30) - 1);
return calc_mod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));
}
ull pow(ull x, ull n) const {
ull ret = 1;
for (; n > 0; n >>= 1, x = mul(x, x)) {
if (n & 1) ret = mul(ret, x);
}
return ret;
}
ull base;
vector<ull> pw;
void set_base(T m) {
while (true) {
ull k = rng(mod);
if (gcd(mod - 1, k) != 1) continue;
base = pow(3, k);
if (base <= ull(m)) continue;
break;
}
}
Array_Hash(int n, T m) { //配列の長さ、要素の最大値
set_base(m);
pw.resize(n + 1);
pw[0] = 1;
for (int i = 0; i < n; i++) pw[i + 1] = mul(pw[i], base);
}
ull get_hash(const vector<T> &v) const {
ull ret = 0;
for (int i = 0; i < (int)v.size(); i++) {
ret += mul(v[i], pw[i]);
if (ret >= mod) ret -= mod;
}
return ret;
}
};
int main() {
int N;
cin >> N;
int M = 1000000;
vector<int> ps = Eratosthenes2(M);
Array_Hash ah(M + 1, 1);
map<ull, ll> mp;
ull x = 0;
vector<int> c(M + 1, 0);
rep(i, N + 1) {
mp[x]++;
if (i == N) break;
int a;
cin >> a;
while (a > 1) {
int t = ps[a];
if (c[t] == 0) {
x += ah.pw[t];
} else {
x += ah.mod - ah.pw[t];
}
c[t] ^= 1;
if (x >= ah.mod) x -= ah.mod;
a /= t;
}
}
ll ans = 0;
each(e, mp) ans += e.second * (e.second - 1) / 2;
cout << ans << '\n';
}