結果

問題 No.1666 累乗数
ユーザー rniyarniya
提出日時 2021-09-06 17:47:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 766 ms / 2,000 ms
コード長 5,868 bytes
コンパイル時間 2,173 ms
コンパイル使用メモリ 205,452 KB
実行使用メモリ 25,096 KB
最終ジャッジ日時 2023-08-24 05:36:54
合計ジャッジ時間 19,014 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 747 ms
23,968 KB
testcase_01 AC 744 ms
24,132 KB
testcase_02 AC 746 ms
24,760 KB
testcase_03 AC 746 ms
25,084 KB
testcase_04 AC 747 ms
24,208 KB
testcase_05 AC 765 ms
24,124 KB
testcase_06 AC 764 ms
23,732 KB
testcase_07 AC 764 ms
23,988 KB
testcase_08 AC 764 ms
24,272 KB
testcase_09 AC 753 ms
24,712 KB
testcase_10 AC 752 ms
24,272 KB
testcase_11 AC 752 ms
24,124 KB
testcase_12 AC 755 ms
23,564 KB
testcase_13 AC 765 ms
23,572 KB
testcase_14 AC 764 ms
23,608 KB
testcase_15 AC 764 ms
24,780 KB
testcase_16 AC 766 ms
23,640 KB
testcase_17 AC 759 ms
25,096 KB
testcase_18 AC 759 ms
24,200 KB
testcase_19 AC 758 ms
24,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 = 1000010;
vector<ll> nosq;

ll sqrt_ll(ll x) {  // \sqrt{x} 以下の最大の数
    ll lb = 1, ub = x + 1;
    while (ub - lb > 1) {
        ll mid = (ub + lb) >> 1;
        (2 * IINF / mid < mid || mid * mid > x ? ub : lb) = mid;
    }
    return lb;
}

ll calc(ll x) {  // x 以下の累乗数の個数
    ll res = upper_bound(nosq.begin(), nosq.end(), x) - nosq.begin();
    res += sqrt_ll(x);
    return res;
}

ll solve(int K) {
    ll lb = 0, ub = ll(K) * K;
    while (ub - lb > 1) {
        ll mid = (ub + lb) >> 1LL;
        (calc(mid) >= K ? ub : lb) = mid;
    }
    return ub;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<ll> tmp;
    for (ll i = 2; i < MAX; i++) {
        ll power = i * i * i;
        for (; power <= IINF; power *= i) {
            tmp.emplace_back(power);
            if (2 * IINF / power < i) break;
        }
    }
    sort(tmp.begin(), tmp.end());
    tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
    for (ll& x : tmp) {
        ll y = sqrt_ll(x);
        if (x != y * y) nosq.emplace_back(x);
    }

    int T;
    cin >> T;
    for (; T--;) {
        int K;
        cin >> K;
        cout << solve(K) << '\n';
    }
    return 0;
}
0