結果
問題 | No.1653 Squarefree |
ユーザー | rniya |
提出日時 | 2021-08-20 22:19:45 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,397 bytes |
コンパイル時間 | 1,982 ms |
コンパイル使用メモリ | 202,888 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-14 08:18:50 |
合計ジャッジ時間 | 8,729 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 108 ms
5,248 KB |
testcase_02 | AC | 100 ms
5,248 KB |
testcase_03 | AC | 100 ms
5,248 KB |
testcase_04 | AC | 101 ms
5,248 KB |
testcase_05 | AC | 98 ms
5,248 KB |
testcase_06 | AC | 102 ms
5,248 KB |
testcase_07 | AC | 101 ms
5,248 KB |
testcase_08 | AC | 100 ms
5,248 KB |
testcase_09 | AC | 104 ms
5,248 KB |
testcase_10 | AC | 101 ms
5,248 KB |
testcase_11 | AC | 155 ms
5,248 KB |
testcase_12 | AC | 154 ms
5,248 KB |
testcase_13 | AC | 155 ms
5,248 KB |
testcase_14 | AC | 157 ms
5,248 KB |
testcase_15 | AC | 161 ms
5,248 KB |
testcase_16 | AC | 158 ms
5,248 KB |
testcase_17 | AC | 159 ms
5,248 KB |
testcase_18 | AC | 156 ms
5,248 KB |
testcase_19 | AC | 158 ms
5,248 KB |
testcase_20 | AC | 157 ms
5,248 KB |
testcase_21 | AC | 158 ms
5,248 KB |
testcase_22 | AC | 157 ms
5,248 KB |
testcase_23 | AC | 156 ms
5,248 KB |
testcase_24 | AC | 156 ms
5,248 KB |
testcase_25 | AC | 157 ms
5,248 KB |
testcase_26 | AC | 154 ms
5,248 KB |
testcase_27 | AC | 156 ms
5,248 KB |
testcase_28 | AC | 154 ms
5,248 KB |
testcase_29 | AC | 155 ms
5,248 KB |
testcase_30 | AC | 155 ms
5,248 KB |
testcase_31 | AC | 158 ms
5,248 KB |
testcase_32 | AC | 157 ms
5,248 KB |
testcase_33 | AC | 156 ms
5,248 KB |
testcase_34 | AC | 154 ms
5,248 KB |
testcase_35 | AC | 158 ms
5,248 KB |
testcase_36 | AC | 104 ms
5,248 KB |
testcase_37 | AC | 101 ms
5,248 KB |
testcase_38 | AC | 102 ms
5,248 KB |
testcase_39 | AC | 101 ms
5,248 KB |
testcase_40 | AC | 104 ms
5,248 KB |
ソースコード
#define LOCAL #include <bits/stdc++.h> using namespace std; #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(), (x).end() template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <int i, typename T> void print_tuple(ostream&, const T&) {} template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << ','; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << '{'; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << '}'; } void debug_out() { cerr << '\n'; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) \ cerr << " "; \ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \ cerr << " "; \ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); } int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); } int popcount(signed t) { return __builtin_popcount(t); } int popcount(long long t) { return __builtin_popcountll(t); } bool ispow2(int i) { return i && (i & -i) == i; } template <class T> T ceil(T x, T y) { assert(y >= 1); return (x > 0 ? (x + y - 1) / y : x / y); } template <class T> T floor(T x, T y) { assert(y >= 1); return (x > 0 ? x / y : (x - y + 1) / y); } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } #pragma endregion const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = {'D', 'R', 'U', 'L'}; const long long MOD = 1000000007; // const long long MOD = 998244353; const int MAX = 10000010; int main() { cin.tie(0); ios::sync_with_stdio(false); ll L, R; cin >> L >> R; vector<bool> check(R - L + 1, true); for (int i = 2; i < MAX; i++) { ll x = ll(i) * i; ll l = ceil(L, x) * x - L; for (ll j = l; j <= R - L; j += x) check[j] = false; } auto calc = [](ll x) { if (x == 1) return true; int lb = 0, ub = INF; while (ub - lb > 1) { int mid = (ub + lb) >> 1; (ll(mid) * mid >= x ? ub : lb) = mid; } return ll(ub) * ub != x; }; int ans = 0; for (int i = 0; i <= R - L; i++) { if (check[i]) { ans += calc(i + L); } } cout << ans << '\n'; return 0; }