QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#802673#9864. Coinucup-team4435#WA 0ms3656kbC++232.4kb2024-12-07 14:23:062024-12-07 14:23:14

Judging History

你现在查看的是最新测评结果

  • [2024-12-07 14:23:14]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3656kb
  • [2024-12-07 14:23:06]
  • 提交

answer

#include "bits/stdc++.h"


#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 2e9;
const ll INF = 2e18;

void solve() {
    ll n, k; cin >> n >> k;

    auto check = [&] (ll x) {
        ll d = (x / k) + 1;
        ll res = 0;
        while (x >= k) {
            ll t = (x + k) / d - k + 1;
            res += t;
            x -= d * t;
            ll d2 = (x / k) + 1;
            d = d2;
        }
        res += (x + 1);
        return res;
    };

    ll total = check(n - 1);

    ll L = max(-1ll, n - k - 1);
    ll R = n - 1;
    while (R - L > 1) {
        ll M = (L + R) / 2;
        if (check(M) == total) {
            R = M;
        } else {
            L = M;
        }
    }
    cout << R + 1 << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3656kb

input:

4
6 2
8 3
10000 2
1919810 114514

output:

5
8
9999
1919805

result:

wrong answer 1st numbers differ - expected: '4', found: '5'