結果
| 問題 | No.1255 ハイレーツ・オブ・ボリビアン |
| ユーザー |
 haruki_K
|
| 提出日時 | 2020-10-09 22:37:56 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,064 ms / 2,000 ms |
| コード長 | 7,785 bytes |
| コンパイル時間 | 2,342 ms |
| コンパイル使用メモリ | 208,848 KB |
| 実行使用メモリ | 5,948 KB |
| 最終ジャッジ日時 | 2023-09-30 14:43:20 |
| 合計ジャッジ時間 | 7,424 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,384 KB |
| testcase_01 | AC | 1 ms
4,380 KB |
| testcase_02 | AC | 2 ms
4,380 KB |
| testcase_03 | AC | 2 ms
4,380 KB |
| testcase_04 | AC | 2 ms
4,376 KB |
| testcase_05 | AC | 5 ms
4,380 KB |
| testcase_06 | AC | 6 ms
4,376 KB |
| testcase_07 | AC | 5 ms
4,380 KB |
| testcase_08 | AC | 505 ms
5,716 KB |
| testcase_09 | AC | 547 ms
5,720 KB |
| testcase_10 | AC | 547 ms
5,608 KB |
| testcase_11 | AC | 527 ms
5,892 KB |
| testcase_12 | AC | 540 ms
5,772 KB |
| testcase_13 | AC | 47 ms
5,948 KB |
| testcase_14 | AC | 1,064 ms
5,652 KB |
| testcase_15 | AC | 510 ms
5,584 KB |
ソースコード
// >>> 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 double ld
#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 pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
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> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) 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) {
using S = typename iterator_traits<It>::value_type;
using T = conditional_t<is_signed_v<S>,i64,u64>;
return accumulate(b,e,T{});
}
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(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> Int rand(Int a, Int b) { // [a,b]
static mt19937_64 mt{random_device{}()};
return uniform_int_distribution<Int>(a,b)(mt);
}
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<
// >>> runtime modint
template <int id> class runtime_modint {
using i32 = int32_t;
using i64 = int64_t;
using M = runtime_modint;
i32 x;
public:
static i32& mod() { static i32 mod = 0; return mod; }
runtime_modint(i64 x = 0)
: x((assert(mod() > 0), ((x%=mod()) < 0 ? x+mod() : x))) { }
i64 val() const { return x; }
bool operator==(M const& r) const { return x == r.x; }
bool operator!=(M const& r) const { return x != r.x; }
M operator+() const { return *this; }
M operator-() const { return M()-*this; }
M& operator+=(M const& r) { i64 t = i64(x) + r.x; if (t >= mod()) t -= mod(); x = t; return *this; }
M& operator-=(M const& r) { i64 t = i64(x) + mod()-r.x; if (t >= mod()) t -= mod(); x = t; return *this; }
M& operator*=(M const& r) { return *this = *this * r; }
M operator*(M const& r) const { M t; t.x = (i64(x)*r.x) % mod(); return t; }
M& operator/=(M const& r) { return *this *= r.inv(); }
M operator+(M const& r) const { return M(*this) += r; }
M operator-(M const& r) const { return M(*this) -= r; }
M operator/(M const& r) const { return M(*this) /= r; }
friend M operator+(i64 x, M const& y) { return M(x)+y; }
friend M operator-(i64 x, M const& y) { return M(x)-y; }
friend M operator*(i64 x, M const& y) { return M(x)*y; }
friend M operator/(i64 x, M const& y) { return M(x)/y; }
M pow(i64 n) const {
if (n < 0) return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
return r;
}
M inv() const {
assert(x > 0);
i64 t = 1, v = x, q = 0, r = 0;
while (v != 1) {
q = mod() / v; r = mod() % v;
if (r * 2 < v) {
t *= -q; t %= mod(); v = r;
} else {
t *= q + 1; t %= mod(); v -= r;
}
}
if (t < 0) t += mod();
M y; y.x = t; return y;
}
static i64 gen() { // assume mod():prime
if (mod() == 2) return 1;
vector<int> ps;
int n = mod()-1;
for (int i = 2; i*i <= n; ++i) {
if (n % i) continue;
ps.push_back(i);
do n /= i; while (n % i == 0);
}
if (n > 1) ps.push_back(n);
n = mod()-1;
auto check = [&](M g) {
for (int p : ps) if (g.pow(n/p) == 1) return false;
return true;
};
for (int g = 2; g <= n; ++g) if (check(g)) return g;
return -1;
}
int log(M y) {
assert(x > 0);
int s = 1; while (s*s < mod()) s++;
unordered_map<int,int> m;
M c = 1;
for (int i = 0; i < s; ++i) {
if (!m.count(c.val())) m[c.val()] = i;
c *= *this;
if (c.val() == 1) return i+1;
}
M d = pow(-s);
c = y;
for (int i = 0; i < s; ++i) {
if (m.count(c.val())) {
int ans = i*s + m[c.val()];
if (ans > 0) return ans;
}
c *= d;
}
return -1;
}
#ifdef LOCAL
friend string to_s(M r) { return to_s(r.val(), M::mod()); }
#endif
friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; }
};
using mint = runtime_modint<-1>;
// <<<
int32_t main() {
int t; cin >> t;
while (t--) {
int n; cin >> n;
if (n == 1) {
cout << 1 << "\n";
} else {
mint::mod() = 2*n-1;
cout << mint(2).log(1) << "\n";
}
}
}