結果

問題 No.1666 累乗数
ユーザー nok0nok0
提出日時 2021-09-03 22:25:01
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 15,246 bytes
コンパイル時間 5,746 ms
コンパイル使用メモリ 287,056 KB
実行使用メモリ 226,176 KB
最終ジャッジ日時 2024-05-09 04:56:46
合計ジャッジ時間 38,565 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,483 ms
226,176 KB
testcase_01 AC 1,489 ms
226,048 KB
testcase_02 AC 1,498 ms
226,048 KB
testcase_03 AC 1,487 ms
226,048 KB
testcase_04 AC 1,501 ms
226,048 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "/Users/nok0/Documents/Programming/nok0/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif

#pragma region Macros
// rep macro
#define foa(v, a) for(auto &v : a)
#define REPname(a, b, c, d, e, ...) e
#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define REP0(x) for(int i = 0; i < (x); ++i)
#define REP1(i, x) for(int i = 0; i < (x); ++i)
#define REP2(i, l, r) for(int i = (l); i < (r); ++i)
#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))
#define REPSname(a, b, c, ...) c
#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)
#define REPS0(x) for(int i = 1; i <= (x); ++i)
#define REPS1(i, x) for(int i = 1; i <= (x); ++i)
#define RREPname(a, b, c, d, e, ...) e
#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define RREP0(x) for(int i = (x)-1; i >= 0; --i)
#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)
#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)
#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))
#define RREPSname(a, b, c, ...) c
#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)
#define RREPS0(x) for(int i = (x); i >= 1; --i)
#define RREPS1(i, x) for(int i = (x); i >= 1; --i)

// name macro
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
template <class T = int>
using V = std::vector<T>;
template <class T = int>
using VV = std::vector<std::vector<T>>;
template <class T>
using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using ll = long long;
using ld = long double;
using int128 = __int128_t;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;

// input macro
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
	is >> p.first >> p.second;
	return is;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
	for(T &i : v) is >> i;
	return is;
}
std::istream &operator>>(std::istream &is, __int128_t &a) {
	std::string s;
	is >> s;
	__int128_t ret = 0;
	for(int i = 0; i < s.length(); i++)
		if('0' <= s[i] and s[i] <= '9')
			ret = 10 * ret + s[i] - '0';
	a = ret * (s[0] == '-' ? -1 : 1);
	return is;
}
#if __has_include(<atcoder/all>)
std::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
std::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
#endif
namespace scanner {
void scan(int &a) { std::cin >> a; }
void scan(long long &a) { std::cin >> a; }
void scan(std::string &a) { std::cin >> a; }
void scan(char &a) { std::cin >> a; }
void scan(char a[]) { std::scanf("%s", a); }
void scan(double &a) { std::cin >> a; }
void scan(long double &a) { std::cin >> a; }
template <class T, class U>
void scan(std::pair<T, U> &p) { std::cin >> p; }
template <class T>
void scan(std::vector<T> &a) { std::cin >> a; }
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail) {
	scan(head);
	INPUT(tail...);
}
}  // namespace scanner
#define VEC(type, name, size)     \
	std::vector<type> name(size); \
	scanner::INPUT(name)
#define VVEC(type, name, h, w)                                    \
	std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
	scanner::INPUT(name)
#define INT(...)     \
	int __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define LL(...)            \
	long long __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define STR(...)             \
	std::string __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define CHAR(...)     \
	char __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define DOUBLE(...)     \
	double __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define LD(...)              \
	long double __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)

// output-macro
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
	os << p.first << " " << p.second;
	return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {
	for(int i = 0; i < int(a.size()); ++i) {
		if(i) os << " ";
		os << a[i];
	}
	return os;
}
std::ostream &operator<<(std::ostream &dest, __int128_t &value) {
	std::ostream::sentry s(dest);
	if(s) {
		__uint128_t tmp = value < 0 ? -value : value;
		char buffer[128];
		char *d = std::end(buffer);
		do {
			--d;
			*d = "0123456789"[tmp % 10];
			tmp /= 10;
		} while(tmp != 0);
		if(value < 0) {
			--d;
			*d = '-';
		}
		int len = std::end(buffer) - d;
		if(dest.rdbuf()->sputn(d, len) != len) {
			dest.setstate(std::ios_base::badbit);
		}
	}
	return dest;
}
#if __has_include(<atcoder/all>)
std::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }
std::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }
#endif
template <class T>
void print(const T a) { std::cout << a << '\n'; }
template <class Head, class... Tail>
void print(Head H, Tail... T) {
	std::cout << H << ' ';
	print(T...);
}
template <class T>
void printel(const T a) { std::cout << a << '\n'; }
template <class T>
void printel(const std::vector<T> &a) {
	for(const auto &v : a)
		std::cout << v << '\n';
}
template <class Head, class... Tail>
void printel(Head H, Tail... T) {
	std::cout << H << '\n';
	printel(T...);
}
void Yes(const bool b = true) { std::cout << (b ? "Yes\n" : "No\n"); }
void No() { std::cout << "No\n"; }
void YES(const bool b = true) { std::cout << (b ? "YES\n" : "NO\n"); }
void NO() { std::cout << "NO\n"; }
void err(const bool b = true) {
	if(b) {
		std::cout << "-1\n", exit(0);
	}
}

//debug macro
namespace debugger {
template <class T>
void view(const std::vector<T> &a) {
	std::cerr << "{ ";
	for(const auto &v : a) {
		std::cerr << v << ", ";
	}
	std::cerr << "\b\b }";
}
template <class T>
void view(const std::vector<std::vector<T>> &a) {
	std::cerr << "{\n";
	for(const auto &v : a) {
		std::cerr << "\t";
		view(v);
		std::cerr << "\n";
	}
	std::cerr << "}";
}
template <class T, class U>
void view(const std::vector<std::pair<T, U>> &a) {
	std::cerr << "{\n";
	for(const auto &p : a) std::cerr << "\t(" << p.first << ", " << p.second << ")\n";
	std::cerr << "}";
}
template <class T, class U>
void view(const std::map<T, U> &m) {
	std::cerr << "{\n";
	for(const auto &p : m) std::cerr << "\t[" << p.first << "] : " << p.second << "\n";
	std::cerr << "}";
}
template <class T, class U>
void view(const std::pair<T, U> &p) { std::cerr << "(" << p.first << ", " << p.second << ")"; }
template <class T>
void view(const std::set<T> &s) {
	std::cerr << "{ ";
	for(auto &v : s) {
		view(v);
		std::cerr << ", ";
	}
	std::cerr << "\b\b }";
}

template <class T>
void view(const T &e) { std::cerr << e; }
}  // namespace debugger
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	debugger::view(H);
	std::cerr << ", ";
	debug_out(T...);
}
#define debug(...)                                                \
	do {                                                          \
		std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
		debug_out(__VA_ARGS__);                                   \
		std::cerr << "\b\b]\n";                                   \
	} while(false)
#else
#define debug(...) (void(0))
#endif

// vector macro
template <class T>
int lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }
template <class T>
int ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }
template <class T>
void UNIQUE(std::vector<T> &a) {
	std::sort(a.begin(), a.end());
	a.erase(std::unique(a.begin(), a.end()), a.end());
}
template <class T>
std::vector<T> press(std::vector<T> &a) {
	auto res = a;
	UNIQUE(res);
	for(auto &v : a)
		v = lb(res, v);
	return res;
}
#define SORTname(a, b, c, ...) c
#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)
#define SORT0(a) std::sort((a).begin(), (a).end())
#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })
template <class T>
void ADD(std::vector<T> &a, const T x = 1) {
	for(auto &v : a) v += x;
}
template <class T>
void SUB(std::vector<T> &a, const T x = 1) {
	for(auto &v : a) v -= x;
}
template <class T>
void MUL(std::vector<T> &a, const T x) {
	for(auto &v : a) v *= x;
}
template <class T>
void DIV(std::vector<T> &a, const T x) {
	for(auto &v : a) v /= x;
}
std::vector<std::pair<char, int>> rle(const string &s) {
	int n = s.size();
	std::vector<std::pair<char, int>> ret;
	for(int l = 0; l < n;) {
		int r = l + 1;
		for(; r < n and s[l] == s[r]; r++) {}
		ret.emplace_back(s[l], r - l);
		l = r;
	}
	return ret;
}
template <class T>
std::vector<std::pair<T, int>> rle(const std::vector<T> &v) {
	int n = v.size();
	std::vector<std::pair<T, int>> ret;
	for(int l = 0; l < n;) {
		int r = l + 1;
		for(; r < n and v[l] == v[r]; r++) {}
		ret.emplace_back(v[l], r - l);
		l = r;
	}
	return ret;
}

// math macro
template <class T, class U>
inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <class T, class U>
inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <class T>
T divup(T x, T y) { return (x + y - 1) / y; }
template <class T>
T POW(T a, long long n) {
	T ret = 1;
	while(n) {
		if(n & 1) ret *= a;
		a *= a;
		n >>= 1;
	}
	return ret;
}
// modpow
long long POW(long long a, long long n, const int mod) {
	long long ret = 1;
	a = (a % mod + mod) % mod;
	while(n) {
		if(n & 1) (ret *= a) %= mod;
		(a *= a) %= mod;
		n >>= 1;
	}
	return ret;
}

// others
struct fast_io {
	fast_io() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} fast_io_;
const int inf = 1e9;
const ll INF = 1e18;
#pragma endregion

void main_();

int main() {
	main_();
	return 0;
}
#line 2 "a.cpp"

#pragma region datastructure Binary Trie
#line 8 "a.cpp"

template <class T, unsigned char BIT_SIZE = 30, bool multi = true>
struct LazyBinaryTrie {
	using u64 = unsigned long long int;

public:
	LazyBinaryTrie() : root(new node(0)) {}

	u64 count(const T x) { return count(root, x); }

	void insert(const T x, const u64 k = 1) {
		if(multi == false and count(x)) return;
		insert(root, x, k);
	}

	void erase(const T x, const u64 k = 1) {
		if(!count(x)) return;
		erase(root, x, k);
	}

	u64 lower_bound(const T x) { return lower_bound(root, x); }

	u64 upper_bound(const T x) { return lower_bound(x + 1); }

	void xor_all(const T x) { root->lazy ^= x; }

	T xor_min(const T x) { return xor_min(root, x); }

	T xor_max(const T x) { return xor_min(x ^ MAX) ^ MAX; }

	T operator[](const u64 k) {
		assert(0 <= k and k < size());
		return operator_func(root, k);
	}

	T min_element() { return (*this)[0]; }

	T max_element() { return (*this)[size() - 1]; }

	u64 size() const noexcept { return cnt(root); }

	bool empty() const noexcept { return cnt(root) == 0; }

	void dump() {
		std::cerr << "[";
		if(!size()) std::cerr << ']';
		for(int i = 0; i < size(); i++)
			std::cerr << (*this)[i] << ",]"[i == size() - 1];
		std::cerr << '\n';
	}

private:
	struct node;
	using node_ptr = std::unique_ptr<node>;

	struct node {
		T cnt, lazy;
		node_ptr descend[2];
		node(T cnt) : cnt(cnt), lazy(0), descend{nullptr, nullptr} {}
	};

	node_ptr root;

	const T MAX = (1ull << BIT_SIZE) - 1;

	u64 cnt(const node_ptr &t) const { return t != nullptr ? t->cnt : 0; }

	u64 count(node_ptr &t, const T x, const unsigned char i = BIT_SIZE - 1) {
		eval(t, i);
		const T bit = x >> i & 1;
		if(t->descend[bit] != nullptr)
			return (i ? count(t->descend[bit], x, i - 1) : cnt(t->descend[bit]));
		else
			return 0;
	}

	void eval(node_ptr &t, const unsigned char i = BIT_SIZE - 1) {
		if(t->lazy >> i & 1) std::swap(t->descend[0], t->descend[1]);
		if(t->descend[0]) t->descend[0]->lazy ^= t->lazy;
		if(t->descend[1]) t->descend[1]->lazy ^= t->lazy;
		t->lazy = 0;
	}

	void insert(node_ptr &t, const T x, const u64 k, const unsigned char i = BIT_SIZE - 1) {
		t->cnt += k;
		eval(t, i);
		const T bit = x >> i & 1;
		if(!t->descend[bit]) t->descend[bit] = std::make_unique<node>(0);
		if(i)
			insert(t->descend[bit], x, k, i - 1);
		else
			t->descend[bit]->cnt += k;
	}

	void erase(node_ptr &t, const T x, const u64 k, const unsigned char i = BIT_SIZE - 1) {
		t->cnt -= k;
		eval(t, i);
		const T bit = x >> i & 1;
		if(i)
			erase(t->descend[bit], x, k, i - 1);
		else
			t->descend[bit]->cnt -= k;
	}

	u64 lower_bound(node_ptr &t, const T x, const unsigned char i = BIT_SIZE - 1) {
		u64 ret = 0;
		eval(t, i);
		if(cnt(t) == 0) return ret;
		const T bit = x >> i & 1;
		if(t->descend[bit]) {
			if(bit) ret += cnt(t->descend[0]);
			return ret += (i ? lower_bound(t->descend[bit], x, i - 1) : 0);
		} else
			return bit ? ret + cnt(t->descend[0]) : ret;
	}

	T xor_min(node_ptr &t, const T x, const unsigned char i = BIT_SIZE - 1) {
		eval(t, i);
		const T bit = x >> i & 1;
		if(i == 0)
			return !cnt(t->descend[bit]);
		if(cnt(t->descend[bit]))
			return xor_min(t->descend[bit], x, i - 1);
		else {
			if(t->descend[!bit] == nullptr) t->descend[bit] = std::make_unique<node>(0);
			return xor_min(t->descend[!bit], x, i - 1) + (1ull << i);
		}
	}

	T operator_func(node_ptr &t, u64 k, const unsigned char i = BIT_SIZE - 1) {
		eval(t, i);
		if(i == 0) return k >= cnt(t->descend[0]);
		if(k < cnt(t->descend[0]))
			return operator_func(t->descend[0], k, i - 1);
		else {
			k -= cnt(t->descend[0]);
			return operator_func(t->descend[1], k, i - 1) | (1ULL << i);
		}
	}
};
#pragma endregion

const int M = 1000000;
void main_() {
	set<ll> tmp2;
	REPS(i, M) {
		for(int k = 2; POW((int128)i, k) <= INF; k++) {
			tmp2.insert(POW(ll(i), k));
			if(i == 1) break;
		}
	}
	set<pll> bt;
	int cur = 0;
	foa(v, tmp2) {
		bt.insert({v, cur++});
	}
	set<int> tmp;
	REPS(i, M) {
		int k = sqrt(i);
		if(k * k == i)
			tmp.insert(k * i);
	}
	set<pii> bt2;
	cur = 0;
	foa(v, tmp) {
		bt2.insert({v, cur++});
	}
	INT(t);
	while(t--) {
		LL(n);
		ll ok = INF, ng = 0;
		while(ok - ng > 1) {
			ll mid = (ok + ng) >> 1;
			ll cnt = bt.upper_bound({mid, inf * 2})->second;
			ll x = sqrt(mid);
			while(POW(x + 1, 2) <= mid) x++;
			while(POW(x, 2) > mid) x--;
			cnt += max((ll)x - M - bt2.upper_bound({x, 0})->second + bt2.upper_bound({M, 0})->second, 0ll);
			(cnt >= n ? ok : ng) = mid;
		}
		print(ok);
	}
}
0