题解 | 小红的区间构造

#include <cstdint>
#include <iostream>
using namespace std;

int main() {
    uintmax_t n, k, x;
    cin >> n >> k >> x;
    // mx .. (m+n-1)x
    // (m-1)x+1 .. (m+n)x-1
    uintmax_t min_len = (n - 1) * x + 1;
    uintmax_t max_len = (n + 1) * x - 1;
    if (k < min_len || k > max_len) {
        cout << -1;
        return 0;
    }
    uintmax_t lower = x;
    uintmax_t diff = min(k - min_len, x - 1);
    lower -= diff;
    cout << lower << ' ' << lower + k -1;
}
// 64 位输出请用 printf("%lld")