Codeforces Round #622 (Div. 2) B - Different Rules （思维）

🍁 🍁 🍁
做第一个写题解的崽

让排名靠前 就选第一场排名的前一位 和第二场的后面第二位 ，让排名靠后就尽量让平的多

inline void solve()
{
    int n, x, y;
    cin >> n >> x >> y;
    if (x > y)
        swap(x, y);
    int minn = 0, maxn = 0;
    if (y < n)
        minn = x - 1 - min(x - 1, n - y - 1) + 1;
    else if (x < n)
        minn = y - 1 - min(y - 1, n - x - 1) + 1;
    else
        minn = x;
    maxn = min(x - 1, n - y) + y;
    cout << minn << " " << maxn << endl;
}
int main()
{
    int T = 1;cin >> T;
    for (int i = 0; i < T; ++i)
        solve();
    return 0;
}