#615739 (C++17) No.1383 Numbers of Product

提出ソース

結果

問題	No.1383 Numbers of Product
ユーザー	haruki_K
提出日時	2021-02-10 05:22:58
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,611 bytes
コンパイル時間	2,340 ms
コンパイル使用メモリ	211,432 KB
実行使用メモリ	68,352 KB
最終ジャッジ日時	2024-07-07 14:10:49
合計ジャッジ時間	23,297 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	38 ms 5,248 KB
testcase_01	AC	38 ms 5,376 KB
testcase_02	AC	38 ms 5,376 KB
testcase_03	AC	39 ms 5,376 KB
testcase_04	AC	38 ms 5,376 KB
testcase_05	AC	38 ms 5,376 KB
testcase_06	AC	39 ms 5,376 KB
testcase_07	AC	511 ms 43,136 KB
testcase_08	AC	500 ms 42,624 KB
testcase_09	AC	268 ms 51,968 KB
testcase_10	AC	813 ms 67,456 KB
testcase_11	AC	797 ms 66,688 KB
testcase_12	AC	805 ms 67,328 KB
testcase_13	AC	780 ms 64,768 KB
testcase_14	AC	661 ms 55,296 KB
testcase_15	AC	539 ms 45,440 KB
testcase_16	AC	804 ms 66,688 KB
testcase_17	AC	39 ms 5,376 KB
testcase_18	AC	39 ms 5,376 KB
testcase_19	AC	39 ms 5,376 KB
testcase_20	AC	39 ms 5,376 KB
testcase_21	AC	39 ms 5,376 KB
testcase_22	AC	39 ms 5,376 KB
testcase_23	AC	39 ms 5,376 KB
testcase_24	AC	39 ms 5,376 KB
testcase_25	AC	38 ms 5,376 KB
testcase_26	AC	39 ms 5,376 KB
testcase_27	AC	39 ms 5,376 KB
testcase_28	AC	43 ms 5,376 KB
testcase_29	AC	635 ms 53,248 KB
testcase_30	AC	816 ms 68,224 KB
testcase_31	AC	39 ms 5,376 KB
testcase_32	AC	113 ms 16,768 KB
testcase_33	AC	39 ms 5,376 KB
testcase_34	AC	39 ms 5,376 KB
testcase_35	AC	327 ms 62,592 KB
testcase_36	AC	711 ms 60,032 KB
testcase_37	AC	812 ms 68,224 KB
testcase_38	AC	818 ms 68,224 KB
testcase_39	AC	353 ms 68,352 KB
testcase_40	AC	354 ms 68,352 KB
testcase_41	AC	815 ms 68,352 KB
testcase_42	AC	822 ms 68,352 KB
testcase_43	AC	809 ms 68,352 KB
testcase_44	AC	349 ms 68,224 KB
testcase_45	AC	818 ms 68,224 KB
testcase_46	AC	39 ms 5,376 KB
testcase_47	AC	809 ms 66,816 KB
testcase_48	AC	817 ms 67,200 KB
testcase_49	AC	815 ms 67,968 KB
testcase_50	WA	-
testcase_51	AC	39 ms 5,376 KB
testcase_52	AC	39 ms 5,376 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
int64_t mod(int64_t x, int64_t m) { assert(m != 0); return (x %= m) < 0 ? x+m : x; }
const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
const int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class A, class B> pair<A, B> operator+(pair<A, B> const& p, pair<A, B> const& q) { return { p.first + q.first, p.second + q.second }; }
template <class A, class B> pair<A, B> operator-(pair<A, B> const& p, pair<A, B> const& q) { return { p.first - q.first, p.second - q.second }; }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
// <<<
constexpr int mul(int x, int y) {
    if (x == 0 || y == 0) return 0;
    int sgn = 1;
    if (x < 0) sgn = -sgn, x = -x;
    if (y < 0) sgn = -sgn, y = -y;
    int p = (x > INF/y ? INF : x*y);
    if (sgn < 0) p = -p;
    return p;
}
constexpr int add(int x, int y) {
    x = clamp(x, -INF, +INF);
    y = clamp(y, -INF, +INF);
    return clamp(x + y, -INF, +INF);
}

int32_t main() {
    int n, k, m; cin >> n >> k >> m;

    map<int, int> cnt;
    rep1 (a, int(1e6)) {
        int prod = mul(a, a+k);
        for (int b = 2; ; b++) {
            int x = add(a, mul(b, k));
            prod = mul(prod, x);
            if (prod > n) break;
            cnt[prod]++;
        }
    }
    dump(cnt);

    auto g = [&](int x) {
        int l = 0, r = INF32;
        while (l+1 < r) {
            auto m = (l+r)/2;
            (mul(m, m+k) <= x ? l : r) = m;
        }
        return l;
    };

    if (m == 1) {
        int ans = 0;
        ans += g(n);
        dump(ans);
        for (auto [x, num] : cnt) {
            if (num != 1) continue;
            int a = g(x);
            if (mul(a, a+k) == x) {
                ans--;
            } else {
                ans++;
            }
        }
        cout << ans << "\n";
    } else {
        int ans = 0;
        for (auto [x, num] : cnt) {
            if (num == m or num == m-1) {
                int a = g(x);
                if (mul(a, a+k) == x) num++;
                if (num == m) ans++;
            }
        }
        cout << ans << "\n";
    }
}

yukicoder

結果

テストケース

ソースコード