Submission #1473273

---

Source Code Expand

#include <iostream>
using namespace std;

using ll = long long;

ll N, M;

bool C(ll x) {
    ll to_s = max(0LL, x - N) * 2;
    return (M - to_s) >= 2 * x;
}

int main() {
    cin >> N >> M;

    ll ok = 0,
       ng = (N + M);
    while (ng - ok > 1) {
        ll mid = (ok + ng) / 2;
        if (C(mid)) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    cout << ok << endl;

    return 0;
}

Submission Info

Judge Result