結果
問題 | No.1653 Squarefree |
ユーザー | iiljj |
提出日時 | 2021-08-21 16:36:48 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 337 ms / 2,000 ms |
コード長 | 11,300 bytes |
コンパイル時間 | 1,524 ms |
コンパイル使用メモリ | 142,412 KB |
実行使用メモリ | 11,852 KB |
最終ジャッジ日時 | 2024-10-15 07:18:40 |
合計ジャッジ時間 | 10,999 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 319 ms
11,852 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 129 ms
10,880 KB |
testcase_12 | AC | 128 ms
11,008 KB |
testcase_13 | AC | 319 ms
11,848 KB |
testcase_14 | AC | 309 ms
11,844 KB |
testcase_15 | AC | 321 ms
11,844 KB |
testcase_16 | AC | 315 ms
11,716 KB |
testcase_17 | AC | 312 ms
11,716 KB |
testcase_18 | AC | 325 ms
11,780 KB |
testcase_19 | AC | 317 ms
11,816 KB |
testcase_20 | AC | 315 ms
11,844 KB |
testcase_21 | AC | 322 ms
11,844 KB |
testcase_22 | AC | 321 ms
11,848 KB |
testcase_23 | AC | 318 ms
11,712 KB |
testcase_24 | AC | 320 ms
11,804 KB |
testcase_25 | AC | 321 ms
11,712 KB |
testcase_26 | AC | 322 ms
11,696 KB |
testcase_27 | AC | 318 ms
11,840 KB |
testcase_28 | AC | 309 ms
11,684 KB |
testcase_29 | AC | 311 ms
11,716 KB |
testcase_30 | AC | 316 ms
11,804 KB |
testcase_31 | AC | 316 ms
11,720 KB |
testcase_32 | AC | 337 ms
11,716 KB |
testcase_33 | AC | 316 ms
11,716 KB |
testcase_34 | AC | 313 ms
11,848 KB |
testcase_35 | AC | 326 ms
11,720 KB |
testcase_36 | AC | 8 ms
5,424 KB |
testcase_37 | AC | 8 ms
5,552 KB |
testcase_38 | AC | 8 ms
5,424 KB |
testcase_39 | AC | 8 ms
5,424 KB |
testcase_40 | AC | 8 ms
5,428 KB |
ソースコード
/* #region Head */ // #include <bits/stdc++.h> #include <algorithm> #include <array> #include <bitset> #include <cassert> // assert.h #include <cmath> // math.h #include <cstring> #include <ctime> #include <deque> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <memory> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; template <class T> using vc = vector<T>; template <class T> using vvc = vc<vc<T>>; using vll = vc<ll>; using vvll = vvc<ll>; using vld = vc<ld>; using vvld = vvc<ld>; using vs = vc<string>; using vvs = vvc<string>; template <class T, class U> using um = unordered_map<T, U>; template <class T> using pq = priority_queue<T>; template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>; template <class T> using us = unordered_set<T>; #define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i)) #define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i)) #define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i)) #define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d)) #define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d)) #define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i)) #define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i)) #define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i)) #define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d)) #define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d)) #define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++) #define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++) #define ALL(x) begin(x), end(x) #define SIZE(x) ((ll)(x).size()) #define PERM(c) \ sort(ALL(c)); \ for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c))) #define UNIQ(v) v.erase(unique(ALL(v)), v.end()); #define CEIL(a, b) (((a) + (b)-1) / (b)) #define endl '\n' constexpr ll INF = 1'010'000'000'000'000'017LL; constexpr int IINF = 1'000'000'007LL; constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7 // constexpr ll MOD = 998244353; constexpr ld EPS = 1e-12; constexpr ld PI = 3.14159265358979323846; template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力 for (T &x : vec) is >> x; return is; } template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump) os << "{"; REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", "); os << "}"; return os; } template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline) REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " "); return os; } template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力 REP(i, 0, SIZE(arr)) is >> arr[i]; return is; } template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump) os << "{"; REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", "); os << "}"; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力 is >> pair_var.first >> pair_var.second; return is; } template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力 os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } // map, um, set, us 出力 template <class T> ostream &out_iter(ostream &os, const T &map_var) { os << "{"; REPI(itr, map_var) { os << *itr; auto itrcp = itr; if (++itrcp != map_var.end()) os << ", "; } return os << "}"; } template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) { return out_iter(os, map_var); } template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) { os << "{"; REPI(itr, map_var) { auto [key, value] = *itr; os << "(" << key << ", " << value << ")"; auto itrcp = itr; if (++itrcp != map_var.end()) os << ", "; } os << "}"; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); } template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); } template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) { pq<T> pq_cp(pq_var); os << "{"; if (!pq_cp.empty()) { os << pq_cp.top(), pq_cp.pop(); while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop(); } return os << "}"; } // tuple 出力 template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) { if constexpr (N < std::tuple_size_v<tuple<Args...>>) { os << get<N>(a); if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) { os << ' '; } else if constexpr (end_line) { os << '\n'; } return operator<<<N + 1, end_line>(os, a); } return os; } template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<<<0, true>(cout, a); } void pprint() { cout << endl; } template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) { cout << head; if (sizeof...(Tail) > 0) cout << ' '; pprint(move(tail)...); } // dump #define DUMPOUT cerr void dump_func() { DUMPOUT << endl; } template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) DUMPOUT << ", "; dump_func(move(tail)...); } // chmax (更新「される」かもしれない値が前) template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) { if (comp(xmax, x)) { xmax = x; return true; } return false; } // chmin (更新「される」かもしれない値が前) template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) { if (comp(x, xmin)) { xmin = x; return true; } return false; } // ローカル用 #ifndef ONLINE_JUDGE #define DEBUG_ #endif #ifdef DEBUG_ #define DEB #define dump(...) \ DUMPOUT << " " << string(#__VA_ARGS__) << ": " \ << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \ << " ", \ dump_func(__VA_ARGS__) #else #define DEB if (false) #define dump(...) #endif #define VAR(type, ...) \ type __VA_ARGS__; \ cin >> __VA_ARGS__; template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; } template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; } struct AtCoderInitialize { static constexpr int IOS_PREC = 15; static constexpr bool AUTOFLUSH = false; AtCoderInitialize() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); cout << fixed << setprecision(IOS_PREC); if (AUTOFLUSH) cout << unitbuf; } } ATCODER_INITIALIZE; void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; } void YN(bool p) { cout << (p ? "YES" : "NO") << endl; } /* #endregion */ // #include <atcoder/all> // using namespace atcoder; template <typename T = ll> vc<T> get_primes_eratosthenes(T n) { vc<char> iscomposite(n + 1, 0); // 合成数だとフラグが立つ vc<T> res; REPM(i, 2, n) { if (iscomposite[i]) continue; res.emplace_back(i); REPMD(j, i * i, n, i) iscomposite[j] = 1; } return res; } unsigned long long int_sqrt(unsigned long long s) { unsigned long long x0 = s >> 1; // Initial estimate if (!x0) return s; // Sanity check unsigned long long x1 = (x0 + s / x0) >> 1; // Update while (x1 < x0) { // This also checks for cycle x0 = x1; x1 = (x0 + s / x0) >> 1; } return x0; } template <class tProposition, typename T = ll> T binarySearchIntMax(T left, T right, tProposition p) { if (right < left) return -1; T mid; while (left + 1 < right) { mid = (left + right) / 2; if (p(mid)) left = mid; else // fn > 0 right = mid - 1; } if (p(right)) return right; else if (p(left)) return left; else return -1; } template <typename T = ll> T powll(T n, T t) { if (!t) return 1; T a = powll(n, t >> 1); // ⌊t/2⌋ 乗 a *= a; // ⌊t/2⌋*2 乗 if (t & 1) // ⌊t/2⌋*2 == t-1 のとき a *= n; // ⌊t/2⌋*2+1 乗 => t 乗 return a; } template <typename T = ll> T powll(T a, T b, T c, T d) { T ma = powl((ld)a / b, (ld)c / d) * 2; return binarySearchIntMax((T)0, ma, [&](T mid) { return powll(a, c) >= powll(mid, d) * powll(b, c); }); } // Problem void solve() { VAR(ll, L, R); // ll M = powll<ll>(R, 1, 1, 3); vll primes = get_primes_eratosthenes(M); vll values(R - L + 1); REP(i, 0, R - L + 1) { ll v = L + i; values[i] = v; } for (auto p : primes) { REPMD(j, CEIL(L, p) * p, R, p) { if (values[j - L] == -1) continue; int cnt = 0; while (values[j - L] % p == 0 && cnt < 2) { cnt++, values[j - L] /= p; } if (cnt >= 2) { // 素数 p で2回以上割れたので,平方数で割れることになる. // square-free ではないので除外する. values[j - L] = -1; } } } // 平方数判定 int ans = 0; REP(i, 0, R - L + 1) { if (values[i] == -1) continue; if (values[i] > 1) { // 平方数なら除外する ll s = int_sqrt(values[i]); if (s * s == values[i]) { values[i] = -1; continue; } } ans++; } pprint(ans); } // entry point int main() { solve(); return 0; }