Submission #156175

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (int)n; ++i)

const double EPS = 1e-8;
const int INF = 100000000;

int N, M;
int a,b,c;

bool dfs(int k, int A, int B, int C)
{
    int sum = A*2+B*3+C*4;

    if(sum > M)
        return false;

    if(k == N) {
        if(sum == M) {
            a = A; b = B; c = C;
            return true;
        }
        else
            return false;
    }
    
    if(sum == M) {
        a = A; b = B; c = C;
        return true;
    }

    if(dfs(k+1, A, B, C+1)) {
        return true;
    }

    if(dfs(k+1, A, B+1, C)) {
        return true;
    }

    if(dfs(k+1, A+1, B, C)) {
        return true;
    }

    return false;
}

int main()
{
    cin >> N >> M;
    if(dfs(0, 0, 0, 0))
        cout << a << ' ' << b << ' ' << c << endl;
    else
        cout << "-1 -1 -1" << endl; 
    return 0;
}

Submission Info

Judge Result