Submission #1950630

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

void solve(int N, int Y) {
    map<ii,ii> m;
    for (int a=0;a<=N;++a) {
        for (int ab=a;ab<=N;++ab) {
            int z = 1000*a + 5000*(ab-a);
            m[ii(ab,z)] = ii(a,ab-a);
        }
    }
    for(int c=0;c<=N;++c) {
        int z = Y - 10000*c;
        if (z<0) break;
        ii k(N-c, z);
        if (found(m,k)) {
            ii p = m[k];
            printf("%d %d %d\n", c, p.second, p.first);
            return;
        }
    }
    printf("-1 -1 -1\n");
}

int main() {
    int N,Y; cin>>N>>Y;
    solve(N,Y);
    return 0;
}

Submission Info

Judge Result