Submission #3784905


Source Code Expand

#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
using namespace std;
using ll = long long;
using lli = long long int;
ll MM = 1000000000;
ll mod = MM + 7;
#define INF (ll)1e18
int main(){
    int n; cin >> n;
    ll y; cin >> y;
    ll a = 0, b = 0, c = 0;
    for(int i = 0; i < 2000; i++){
        for(int j = 0; j < 2000; j++){
            if(10000*i + 5000*j + 1000*(n-i-j) == y){
                a = i;
                b = j;
                c = n-i-j;
                break;
            }
        }
    }
    if(a==0&&b==0&&c==0) cout << -1 << " " << -1 << " " << -1 << endl;
    else cout << a << " " << b << " " << c << endl;
}

Submission Info

Submission Time
Task B - Kagami Mochi
User Kant
Language C++14 (GCC 5.4.1)
Score 0
Code Size 698 Byte
Status WA
Exec Time 4 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
WA × 3
WA × 13
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 WA 4 ms 256 KB
a02 WA 4 ms 256 KB
a03 WA 4 ms 256 KB
b04 WA 4 ms 256 KB
b05 WA 4 ms 256 KB
b06 WA 4 ms 256 KB
b07 WA 4 ms 256 KB
b08 WA 4 ms 256 KB
b09 WA 4 ms 256 KB
b10 WA 4 ms 256 KB
b11 WA 4 ms 256 KB
b12 WA 4 ms 256 KB
b13 WA 4 ms 256 KB