Submission #1948573
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> #include <iomanip> #include <cmath> #include <vector> #include <queue> #include <map> #include <set> #include <time.h> #define loop(i, num) for (int i = 0; i < num; i++) using namespace std; int n, m; int main() { cin >> n >> m; if (n * 10000 < m) { cout << -1 << ' ' << -1 << ' ' << -1 << endl; return 0; } loop (i, n) { if (i * 10000 > m) break; loop (j, n) { loop (k, n) { if (i * 10000 + j * 5000 + k * 1000 == m) { cout << i << ' ' << j << ' ' << k << endl; return 0; } } } } cout << -1 << ' ' << -1 << ' ' << -1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | vegetablewsr |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1012 Byte |
Status | WA |
Exec Time | 2098 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||||
Status |
|
|
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 | WA | 1 ms | 256 KB |
a02 | WA | 1 ms | 256 KB |
a03 | WA | 1 ms | 256 KB |
a04 | TLE | 2098 ms | 256 KB |
b05 | WA | 1 ms | 256 KB |
b06 | WA | 1 ms | 256 KB |
b07 | WA | 1 ms | 256 KB |
b08 | WA | 1 ms | 256 KB |
b09 | TLE | 2095 ms | 256 KB |
b10 | WA | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | WA | 1 ms | 256 KB |
b13 | WA | 1 ms | 256 KB |
b14 | WA | 1 ms | 256 KB |
b15 | TLE | 2031 ms | 256 KB |
b16 | WA | 1838 ms | 256 KB |
b17 | WA | 1894 ms | 256 KB |
b18 | WA | 1 ms | 256 KB |
b19 | WA | 2 ms | 256 KB |
b20 | WA | 3 ms | 256 KB |
b21 | WA | 1 ms | 256 KB |
b22 | WA | 1 ms | 256 KB |
b23 | WA | 1967 ms | 256 KB |
b24 | WA | 1839 ms | 256 KB |