結果

問題 No.1255 ハイレーツ・オブ・ボリビアン
ユーザー packer_jppacker_jp
提出日時 2020-10-12 13:19:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,015 bytes
コンパイル時間 1,910 ms
コンパイル使用メモリ 208,420 KB
実行使用メモリ 6,272 KB
最終ジャッジ日時 2024-07-20 17:57:31
合計ジャッジ時間 12,192 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 1,150 ms
6,144 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 86 ms
6,144 KB
testcase_14 TLE -
testcase_15 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << #a " = " << (a) << endl
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int sign(int a) { return (a > 0) - (a < 0); }
int cdiv(int a, int b) { return (a - 1 + b) / b; }
template<typename T> void fin(T a) {
    cout << a << endl;
    exit(0);
}
template<typename T> T sq(T a) { return a * a; }
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

int safe_mod(long long a, int m) {
    a %= m;
    if (a < 0) { a += m; }
    return a;
};

int mod_inv(long long a, int m) {
    long long b = m, x = 1, u = 0;
    while (b) {
        int t = a / b;
        std::swap(a -= t * b, b);
        std::swap(x -= t * u, u);
    }
    return safe_mod(x, m);
};

int mod_pow(long long a, long long n, int m) {
    if (n < 0) { return mod_inv(mod_pow(a, -n, m), m); }
    long long ret = 1, mul = a;
    while (n) {
        if (n & 1) { (ret *= mul) %= m; }
        (mul *= mul) %= m, n >>= 1;
    }
    return ret;
}

int mod_log(long long a, long long b, int m) {
    a %= m, b %= m;
    std::map<int, int> mp;
    int rt;
    long long ap = 1;
    for (rt = 0; rt * rt < m; rt++) {
        if (!mp.count(ap)) { mp[ap] = rt; }
        (ap *= a) %= m;
    }
    ap = mod_inv(ap, m);
    for (int i = 0; i < rt; i++) {
        if (mp.count(b)) {
            long long ret = i * rt + mp[b];
            if (ret > 0) { return ret; }
        }
        (b *= ap) %= m;
    }
    return -1;
}

signed main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        if (N == 1) {
            cout << 1 << endl;
            continue;
        }
        cout << mod_log(2, 1, 2 * N - 1) << endl;
    }
}
0