結果

問題 No.1015 おつりは要らないです
ユーザー ningenMeningenMe
提出日時 2020-04-28 17:48:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,616 bytes
コンパイル時間 2,197 ms
コンパイル使用メモリ 207,964 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-25 01:27:48
合計ジャッジ時間 5,448 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 58 ms
5,248 KB
testcase_11 AC 61 ms
5,248 KB
testcase_12 AC 56 ms
5,248 KB
testcase_13 AC 59 ms
5,248 KB
testcase_14 AC 65 ms
5,248 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 49 ms
5,248 KB
testcase_21 AC 51 ms
5,248 KB
testcase_22 AC 50 ms
5,248 KB
testcase_23 AC 47 ms
5,248 KB
testcase_24 AC 52 ms
5,248 KB
testcase_25 AC 51 ms
5,248 KB
testcase_26 AC 49 ms
5,248 KB
testcase_27 AC 49 ms
5,248 KB
testcase_28 AC 48 ms
5,248 KB
testcase_29 AC 53 ms
5,248 KB
testcase_30 AC 2 ms
5,248 KB
testcase_31 AC 21 ms
5,248 KB
testcase_32 AC 21 ms
5,248 KB
testcase_33 WA -
testcase_34 AC 2 ms
5,248 KB
testcase_35 AC 2 ms
5,248 KB
testcase_36 AC 1 ms
5,248 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];
	sort(ALL(A),greater<>());
	for(int i = 0; i < N; ++i) {
		if(A[i]==-1) continue;
		if(A[i]>=10000) {
			ll k = min(A[i]/10000,Z);
			A[i] -= k*10000;
			Z -= k;
		}
	}
	sort(ALL(A),greater<>());
	for(int i = 0; i < N; ++i) {
		if(A[i]==-1) continue;
		if(A[i]<10000 && Z) {
			A[i] = -1;
			Z--;
		}
	}
	sort(ALL(A),greater<>());
	for(int i = 0; i < N; ++i) {
		if(A[i]==-1) continue;
		if(A[i]>=5000) {
			ll k = min(A[i]/5000,Y);
			A[i] -= k*5000;
			Y -= k;
		}
	}
	sort(ALL(A),greater<>());
	for(int i = 0; i < N; ++i) {
		if(A[i]==-1) continue;
		if(A[i]<5000 && Y) {
			A[i] = -1;
			Y--;
		}
	}
	sort(ALL(A),greater<>());
	for(int i = 0; i < N; ++i) {
		if(A[i]==-1) continue;
		if(A[i]>=1000) {
			ll k = min(A[i]/1000,X);
			A[i] -= k*1000;
			Y -= k;
		}
	}
	sort(ALL(A),greater<>());
	for(int i = 0; i < N; ++i) {
		if(A[i]==-1) continue;
		if(A[i]<1000 && X) {
			A[i] = -1;
			X--;
		}
	}
	int flg = 1;
	for(int i = 0; i < N; ++i) {
		if(A[i] != -1) flg = 0;
	}
	Yn(flg);
    return 0;
}
0