提出 c1a9f741-7fa0-40d3-a2c7-b8c17ce234d8

コード

#ifndef INCLUDE_MACRO
#define INCLUDE_MACRO
#include __FILE__

int solve() {
    
    return 0;
}

signed main() {
    int n, d, k;
    cin >> n >> d >> k;
    map<int, int> mp;
    rep(i, n) {
        int x;
        cin >> x;
        mp[x]++;
    }
    int ans = 0;
    rep(_, d) {
        int now = k;
        while(now > 0) {
            auto it = mp.upper_bound(now);
            if (it != mp.begin()) {
                it = prev(it);
                ans++;
                now -= it->first;
                it->second--;
                if (it->second == 0) mp.erase(it->first);
            }else {
                break;
            }
        }
        k /= 2;
        if (k == 0) break;
    }
    cout << ans << endl;
    return 0;
}

#else

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define int long long
#define under(N) std::fixed << std::setprecision(N)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rep(i, n) for (int i = 0; i < n; i++)
#define orep(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define cy std::cout << "Yes" << std::endl
#define cyre {std::cout << "Yes" << std::endl; return 0;}
#define cn std::cout << "No" << std::endl
#define cnre {std::cout << "No" << std::endl; return 0;}
#define MOD 998244353LL
#define INF (3LL<<60)
#define PI 3.141592653589793238
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
std::vector<int> dx = {1, -1, 0, 0};
std::vector<int> dy = {0, 0, 1, -1};
std::vector<int> dx8 = {1, -1, 0, 0, 1, -1, -1, 1};
std::vector<int> dy8 = {0, 0, 1, -1, 1, -1, 1, -1};
template<class T>
T ipow(T x, T y) {
    T ret = 1;
    while (y > 0) {
        if (y % 2 == 1) {
            ret *= x;
        }
        x *= x;
        y >>= 1;
    }
    return ret;
}
template<class T>
T mod_pow(T x, T y, T mod) {
    T ret = 1;
    while (y > 0) {
        if (y % 2 == 1) {
            ret = ret * x % mod;
        }
        x = x * x % mod;
        y >>= 1;
    }
    return ret;
}
template<class T>
T isqrt(T n) {
    if (n == 0) return 0;
    T rinzi = T(std::sqrt(n)) - 1;
    return rinzi * (rinzi + 2) < n ? rinzi + 1 : rinzi;
}
template<class T>
bool out_glid(T i, T j, T h, T w) {
    if (i < 0 || h <= i || j < 0 || w <= j) return true;
    else return false;
}
void allout(vector<int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(vector<string> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it << std::endl;
    }
}
void allout(vector<bool> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        if (*it) std::cout << 1;
        else std::cout << 0;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(vector<pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " " << it->second << endl;
    }
}
template<class T>
void allout(vector<vector<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        allout(*it);
    }
}
void allout(set<int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(set<pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " " << it->second << endl;
    }
}
template<class T>
void allout(vector<set<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        allout(*it);
    }
}
void allout(map<int, int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : " << it->second << std::endl;
    }
}
void allout(map<int, pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : " << (it->second).first << " " << (it->second).second << std::endl;
    }
}
template<class T>
void allout(map<int, vector<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : ";
        allout(it->second);
    }
}
template<class T>
void allout(map<int, set<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : ";
        allout(it->second);
    }
}
class Timer {
    chrono::system_clock::time_point start;
public:
    Timer() : start(chrono::system_clock::now()) {}
    double count() {
        chrono::duration<double> Time_ = chrono::system_clock::now() - start;
        return Time_.count();
    }
    bool is_under(double x) {
        return (this->count()) < x;
    }
};

#endif

結果

問題	点数	言語	結果	実行時間	メモリ
H. Self-Replacing Cake (Hard)	0	C++ (gcc)	WA	228 ms	10496 KiB

テストセット

テストセット	結果	得点	実行時間	メモリ
All	AC × 4 WA × 19	0	228 ms	10496 KiB
Sample	AC × 3	0	12 ms	8576 KiB

詳細結果

テストケース	結果	実行時間	メモリ
All_1	AC	145 ms	9728 KiB
All_10	WA	162 ms	10368 KiB
All_11	WA	14 ms	8448 KiB
All_12	WA	25 ms	8192 KiB
All_13	WA	137 ms	8576 KiB
All_14	WA	201 ms	10496 KiB
All_15	WA	81 ms	8192 KiB
All_16	WA	56 ms	8320 KiB
All_17	WA	14 ms	8320 KiB
All_18	WA	33 ms	8064 KiB
All_19	WA	100 ms	8448 KiB
All_2	WA	85 ms	8448 KiB
All_20	WA	228 ms	9984 KiB
All_3	WA	143 ms	9856 KiB
All_4	WA	12 ms	8448 KiB
All_5	WA	21 ms	8064 KiB
All_6	WA	214 ms	10496 KiB
All_7	WA	82 ms	8192 KiB
All_8	WA	69 ms	8192 KiB
All_9	WA	96 ms	7936 KiB
sample_1	AC	11 ms	8576 KiB
sample_2	AC	11 ms	8192 KiB
sample_3	AC	12 ms	8320 KiB