Submission #155095

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<vector>
#include<fstream>
#include<sstream>
#include<time.h>
using namespace std;
#define INF 500000001
#define CONST 1000000007
#define PI 3.14159265358979323846
#define EPS (1e-8)
#define PB push_back
#define sz(a) ((int)(a).size())
#define rep(i,n) for(int i=0;i<(int) (n);i++)
#define SORT(a) sort((a).begin(),(a).end())
typedef long long ll;
typedef long double lb;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
int n,m;
int a,b,c;
int main(){
  cin>>n>>m;
  rep(i,m/3 +1){
    int t=(m-i*3);
    int s=n-i;
    if(t%2==0&&t/2>s){
      int j=t/2-s;
      cout<<s-j<<" "<<i<<" "<<j<<endl;
      return 0;
    }
  }
  cout<<"-1 -1 -1"<<endl;
}

Submission Info

Judge Result