結果
問題 | No.1653 Squarefree |
ユーザー | keijak |
提出日時 | 2021-09-04 05:55:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 229 ms / 2,000 ms |
コード長 | 3,827 bytes |
コンパイル時間 | 2,427 ms |
コンパイル使用メモリ | 207,476 KB |
実行使用メモリ | 19,596 KB |
最終ジャッジ日時 | 2024-05-09 16:59:39 |
合計ジャッジ時間 | 9,717 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 207 ms
19,360 KB |
testcase_01 | AC | 12 ms
8,208 KB |
testcase_02 | AC | 13 ms
8,208 KB |
testcase_03 | AC | 14 ms
8,200 KB |
testcase_04 | AC | 13 ms
8,076 KB |
testcase_05 | AC | 12 ms
8,080 KB |
testcase_06 | AC | 12 ms
8,200 KB |
testcase_07 | AC | 12 ms
8,204 KB |
testcase_08 | AC | 12 ms
8,208 KB |
testcase_09 | AC | 14 ms
8,208 KB |
testcase_10 | AC | 14 ms
8,200 KB |
testcase_11 | AC | 182 ms
19,464 KB |
testcase_12 | AC | 189 ms
19,528 KB |
testcase_13 | AC | 199 ms
19,544 KB |
testcase_14 | AC | 198 ms
19,376 KB |
testcase_15 | AC | 201 ms
19,504 KB |
testcase_16 | AC | 209 ms
19,464 KB |
testcase_17 | AC | 188 ms
19,464 KB |
testcase_18 | AC | 194 ms
19,540 KB |
testcase_19 | AC | 201 ms
19,468 KB |
testcase_20 | AC | 195 ms
19,596 KB |
testcase_21 | AC | 203 ms
19,540 KB |
testcase_22 | AC | 210 ms
19,428 KB |
testcase_23 | AC | 202 ms
19,292 KB |
testcase_24 | AC | 229 ms
19,468 KB |
testcase_25 | AC | 205 ms
19,504 KB |
testcase_26 | AC | 199 ms
19,376 KB |
testcase_27 | AC | 211 ms
19,448 KB |
testcase_28 | AC | 208 ms
19,468 KB |
testcase_29 | AC | 204 ms
19,440 KB |
testcase_30 | AC | 211 ms
19,372 KB |
testcase_31 | AC | 199 ms
19,596 KB |
testcase_32 | AC | 209 ms
19,580 KB |
testcase_33 | AC | 203 ms
19,392 KB |
testcase_34 | AC | 201 ms
19,492 KB |
testcase_35 | AC | 198 ms
19,592 KB |
testcase_36 | AC | 13 ms
8,204 KB |
testcase_37 | AC | 13 ms
8,072 KB |
testcase_38 | AC | 12 ms
8,204 KB |
testcase_39 | AC | 13 ms
8,032 KB |
testcase_40 | AC | 12 ms
8,076 KB |
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template<typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template<typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template<typename T> inline int ssize(const T &a) { return (int) std::size(a); } template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x: a) is >> x; return is; } template<typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template<typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template<typename T, typename = void> struct is_iterable : std::false_type {}; template<typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type { }; template<typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } void print() { std::cout << "\n"; } template<class T> void print(const T &x) { std::cout << x << "\n"; } template<typename Head, typename... Tail> void print(const Head &head, Tail... tail) { std::cout << head << " "; print(tail...); } struct Input { template<typename T> operator T() const { T x; return (std::cin >> x), x; } } in; #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; struct PrimeSieve { std::vector<int> spf; // smallest prime factors table. std::vector<i64> primes; explicit PrimeSieve(int n) : spf(n + 1) { // O(n) for (int i = 2; i <= n; ++i) { if (spf[i] == 0) { spf[i] = i; primes.push_back(i); } for (const auto &p: primes) { if (i * p > n or p > spf[i]) break; spf[i * p] = p; } } } inline bool is_prime(int n) const { return spf[n] == n; } } sieve(1'000'005); // Returns floor(sqrt(x)). i64 floor_sqrt(i64 x) { assert(x >= 0); if (x <= 1) return x; i64 r = std::floor(sqrtl((long double) x)); while (r * r < x) ++r; while (r * r > x) --r; return r; } auto solve() { const i64 L = in, R = in; const i64 M = R - (L - 1); vector<i64> val(M, 0); REP(i, M) { val[i] = L + i; } vector<int> has_square(M, 0); for (auto p: sieve.primes) { for (i64 j = (L + p - 1) / p * p; j <= R; j += p) { assert(val[j - L] % p == 0); int cnt = 0; while (val[j - L] % p == 0) { val[j - L] /= p; ++cnt; } if (cnt >= 2) has_square[j - L] = true; } } // DUMP(has_square); // DUMP(val); int cnt = 0; REP(i, M) { if (has_square[i]) continue; i64 x = floor_sqrt(val[i]); if (x != 1 and x * x == val[i]) { has_square[i] = true; continue; } ++cnt; } return cnt; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << std::fixed << std::setprecision(15); int t = 1; REP(test_case, t) { auto ans = solve(); print(ans); } }