War Strategy

    1#include <bits/stdc++.h>
    2using namespace std;
    3typedef long long ll;
    4const long long INF = 1e17; //❄️
    5void solve() {
    6    int n, m, k; cin >> n >> m >> k;
    7    int l = k - 1, r = n - k;
    8    if (l > r) swap(l, r);
    9    int best = 1;
    10    for (int i = 0; i <= r; i++) {
    11        int l_time = m - 2 * i + 1;
    12        if (l_time < 0) break; 
    13        int l_max = min({l, i, l_time});
    14        if (l_max < 0) continue;
    15        int cnt = 1 + l_max + i;
    16        if (cnt > best) best = cnt;
    17    }
    18    cout << best << '\n';
    19}
    20int main() {
    21    ios::sync_with_stdio(0); cin.tie(0); 
    22    int t; cin >> t;
    23    while (t--) {
    24        solve();
    25    }
    26    return 0;
    27}