#856822 (C++17) No.1015 おつりは要らないです

• 問題: No.1015 おつりは要らないです
• ユーザー: commy
• 提出日時: 2023-04-07 01:57:25
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,545 bytes
• コンパイル時間: 859 ms
• コンパイル使用メモリ: 86,676 KB
• 最終ジャッジ日時: 2025-02-11 23:33:35
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 22 WA * 11

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n, x, y, z;
    cin >> n >> x >> y >> z;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    rep(i, 0, n) {
        ll t = a[i] % 1000;
        a[i] += 1000 - t;
    }
    sort(a.begin(), a.end(), [&](ll s, ll t) { return s % 5000 < t % 5000; });
    rep(i, 0, n) {
        ll t = (a[i] % 5000) / 1000;
        a[i] -= min(t, x) * 1000;
        x -= min(t, x);
    }
    y += x / 5;
    rep(i, 0, n) {
        ll t = a[i] % 5000;
        if (t) {
            a[i] += 5000 - t;
        }
    }
    sort(a.begin(), a.end(), [&](ll s, ll t) { return s % 10000 < t % 10000; });
    rep(i, 0, n) {
        ll t = (a[i] % 10000) / 5000;
        a[i] -= min(t, y) * 5000;
        y -= min(t, y);
    }
    z += y / 2;
    rep(i, 0, n) {
        ll t = a[i] % 10000;
        if (t) {
            a[i] += 10000 - t;
        }
    }
    rep(i, 0, n) {
        ll t = a[i] / 10000;
        a[i] -= min(t, z) * 10000;
        z -= min(t, z);
    }
    sort(a.begin(), a.end());
    print(a.back() == 0 ? "Yes" : "No");
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX