Submission #4668999

---

Source Code Expand

from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq
import itertools
import operator


inf = float('inf')


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_list_of_int():
    return [int(i) for i in input().split()]


def get_list_of_float():
    return [float(f) for f in input().split()]


def get_list_of_char():
    return list(input().strip())


def get_data(n, order=None, **kwargs):
    if not order:
        order = range(len(kwargs))
    it = iter(order)
    var, fn = zip(*sorted(sorted(kwargs.items()), key=lambda _: next(it)))

    rows = []
    for _ in range(n):
        rows.append(input().split())
    columns = zip(*rows)
    exec("global "+", ".join(var)+"\n"+"\n".join(
        v+"=list(map(fn[{}], data[{}]))".format(i, i)
        for i, v in enumerate(var)),
        globals(),
        {"fn": list(fn), "data": list(columns)}
    )
    return


# inputs
N, Y = 0, 0


def set_inputs():
    global N, Y
    N, Y = get_list_of_int()
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    for i, j in itertools.combinations(range(N+2), 2):
        x, y, z = i, j - i - 1, N - j + 1
        if x * 10000 + y * 5000 + z * 1000 == Y:
            print(x, y, z)
            break
    else:
        print(-1, -1, -1)
    return


if __name__ == '__main__':
    main()

Submission Info

Judge Result