Submission #1949071


Source Code Expand

/**
 * @Author:      H S-J
 * @DateTime:    2018-01-07 20:01:27
 * @Description: 
 */
#include <bits/stdc++.h>
using namespace std;
#define MST(a, b) memset(a, b, sizeof(a));
#define CLR(a) MST(a, 0);
#define DBG(x) cout << '#' << " = " << (x) << endl;
#define ALL(x) x.begin(), x.end()
#define INS(x) inserter(x, x.begin())
#define lson(x) (x) << 1
#define rson(x) (x) << 1|1
#define pb push_back
#define rep(x, y, z) for (int x = y; x < z; ++x)
#define ech(x, y, z) for (auto x = z.begin(), y = z.end(); x != y; ++x)
#define lowbit(x) (x & (-x))
#define opr operator
#define _st first
#define _nd second
#define prior_q1(x) priority_queue<x>
#define prior_q2(x) priority_queue<x, vector<x>, greater<x> >
typedef long long LL;
typedef stringstream strstm;
struct FastIO {
    static const int S = 1310720;
    int wpos;
    char wbuf[S];
    FastIO() : wpos(0) {}
    inline int xchar() {
        static char buf[S];
        static int len = 0, pos = 0;
        if (pos == len)
            pos = 0, len = fread(buf, 1, S, stdin);
        if (pos == len) return -1;
        return buf[pos ++];
    }
    inline int xuint() {
        int c = xchar(), x = 0;
        while (c <= 32) c = xchar();
        for (; '0' <= c && c <= '9'; c = xchar()) x = x * 10 + c - '0';
        return x;
    }
    inline int xint() {
        int s = 1, c = xchar(), x = 0;
        while (c <= 32) c = xchar();
        if (c == '-') s = -1, c = xchar();
        for (; '0' <= c && c <= '9'; c = xchar()) x = x * 10 + c - '0';
        return x * s;
    }
    inline LL xlongint() {
        LL s = 1, c = xchar(), x = 0;
        while (c <= 32) c = xchar();
        if (c == '-') s = -1, c = xchar();
        for (; '0' <= c && c <= '9'; c = xchar()) x = x * 10 + c - '0';
        return x * s;
    }
    inline void xstring(char *s) {
        int c = xchar();
        while (c <= 32) c = xchar();
        for (; c> 32; c = xchar()) * s++ = c;
        *s = 0;
    }
    inline void wchar(int x) {
        if (wpos == S) fwrite(wbuf, 1, S, stdout), wpos = 0;
        wbuf[wpos ++] = x;
    }
    inline void wint(LL x) {
        if (x < 0) wchar('-'), x = -x;
        char s[24];
        int n = 0;
        while (x || !n) s[n ++] = '0' + x % 10, x /= 10;
        while (n--) wchar(s[n]);
    }
    inline void wstring(const char *s) {
        while (*s) wchar(*s++);
    }
    ~FastIO() {
        if (wpos) fwrite(wbuf, 1, wpos, stdout), wpos = 0;
    }
} io;
LL n, y;
const int aa = 10000, bb = 5000, cc = 1000;
int main(int argc, char const *argv[]) {
	ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> y;
    int ta = y/aa, tb = y/bb, tc = y/cc;
    bool flag = 1;
    rep(i, 0, ta+1) rep(j, 0, tb+1) rep(k, 0, tc+1) {
        if((i*aa + j*bb + k*cc) == y && ((i+j+k) == n)) {
            flag = 0;
            cout << i << " " << j << " " << k << endl;
            goto nest;
        }
    }
    nest:
    if(flag) cout << "-1 -1 -1" << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Otoshidama
User s1j1n
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3037 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
TLE × 1
AC × 16
TLE × 8
Set Name Test Cases
Sample a01, a02, a03, a04
All a01, a02, a03, a04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24
Case Name Status Exec Time Memory
a01 AC 1 ms 256 KB
a02 AC 1 ms 256 KB
a03 AC 2 ms 256 KB
a04 TLE 2103 ms 256 KB
b05 AC 1 ms 256 KB
b06 AC 1 ms 256 KB
b07 AC 1 ms 256 KB
b08 AC 1 ms 256 KB
b09 TLE 2103 ms 256 KB
b10 AC 108 ms 256 KB
b11 TLE 2103 ms 256 KB
b12 AC 1 ms 256 KB
b13 AC 2 ms 256 KB
b14 AC 3 ms 256 KB
b15 TLE 2103 ms 256 KB
b16 TLE 2103 ms 256 KB
b17 TLE 2103 ms 256 KB
b18 AC 1 ms 256 KB
b19 AC 28 ms 256 KB
b20 AC 9 ms 256 KB
b21 AC 110 ms 256 KB
b22 AC 103 ms 256 KB
b23 TLE 2103 ms 256 KB
b24 TLE 2103 ms 256 KB