結果

問題 No.1015 おつりは要らないです
ユーザー ningenMeningenMe
提出日時 2020-04-03 21:48:32
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,009 bytes
コンパイル時間 1,881 ms
コンパイル使用メモリ 177,604 KB
実行使用メモリ 9,400 KB
最終ジャッジ日時 2024-07-03 02:05:08
合計ジャッジ時間 4,814 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 82 ms
9,064 KB
testcase_11 AC 82 ms
9,256 KB
testcase_12 AC 78 ms
8,988 KB
testcase_13 AC 81 ms
9,192 KB
testcase_14 AC 88 ms
9,372 KB
testcase_15 AC 79 ms
9,092 KB
testcase_16 AC 82 ms
9,192 KB
testcase_17 AC 85 ms
9,288 KB
testcase_18 AC 80 ms
9,092 KB
testcase_19 AC 77 ms
9,152 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 2 ms
6,944 KB
testcase_31 AC 54 ms
9,372 KB
testcase_32 AC 53 ms
9,376 KB
testcase_33 AC 71 ms
9,372 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 WA -
testcase_36 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    ll N,X,Y,Z; cin >> N >> X >> Y >> Z;
    vector<ll> A(N);
    for(int i = 0; i < N; ++i) cin >> A[i];
    vector<ll> B(N),S(N,0),T(N,0),U(N,0);
    for(int i = 0; i < N; ++i) {
        if(A[i]%1000) {
            A[i] -= A[i] % 1000;
        }
        A[i] += 1000;
        B[i] = A[i];
        S[i] = A[i] % 5000;
        A[i] -= A[i] % 5000;
        T[i] = A[i] % 10000;
        A[i] -= A[i] % 10000;
        U[i] = A[i];
        A[i] = 0;
    }
    PQR<pair<ll,int>> pq;
    for(int i = 0; i < N; ++i) {
        pq.push({S[i]/1000,i});
    }
    while (pq.size()){
        auto p = pq.top();
        pq.pop();
        if(p.first <= X) {
            X -= p.first;
        }
        else{
            T[p.second]+=5000;
            if(T[p.second]==10000){
                T[p.second]=0;
                U[p.second] += 10000;
            }
        }
    }
    Y += X / 5;
    for(int i = 0; i < N; ++i) {
        pq.push({T[i]/5000,i});
    }
    while (pq.size()){
        auto p = pq.top();
        pq.pop();
        if(p.first <= Y) {
            Y -= p.first;
        }
        else{
            U[p.second]+=10000;
        }
    }
    Z += Y/2;

    for(int i = 0; i < N; ++i) {
        pq.push({U[i]/10000,i});
    }
    while (pq.size()){
        auto p = pq.top();
        pq.pop();
        if(p.first <= Z) {
            Z -= p.first;
        }
        else{
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;

    

    return 0;
}
0