Submission #7093710

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define rep(X,N) for(ll X = 0; X < (N); X++)
#define pback push_back
#define mpair make_pair
#define MODN 1000000007

using namespace std;

#define ull long long

int main(){

    //鶴亀算
    //m - 2nが老人の数 + 赤ちゃんの数 * 2になるので
    //赤ちゃんの数を二分探索する

    int n,m;
    cin >> n >> m;

    int ok = 0;
    int ng = m - 2 * n;

    int adult,old;

    while(abs(ok - ng) > 1){

        int mid = (ok + ng) / 2;

        old = m - 2 * n - mid * 2;
        adult = n - mid - old;

        if(mid >= 0 && old >= 0 && adult >= 0){
            ok = mid;
        }else{
            ng = mid;
        }
    }

    old = m - n * 2 - ok * 2;
    adult = n - ok - old;

    if(adult >= 0 && old >= 0 && ok >= 0 && n == adult + old + ok){

        cout << adult << " " << old << " " << ok << endl;
    }else{

        cout << "-1 -1 -1" << endl;
    }


    return 0;
}

Submission Info

Judge Result