提出 #73103395

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <array>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;

int main() {
    fastio; int T; cin >> T;
    for (int tc = 0; tc < T; tc++) {
        ll N, M; cin >> N >> M;
        vector<ll> v(N); ll sum = 0;
        for (auto& i : v) { cin >> i; sum += i; }
        map<ll,array<ll,3>> dp;
        auto calc = [&](auto calc, ll l, ll x) -> array<ll,3> {
            if (l < x) return { 0, 0, 0 };
            if (l < 2*x) return { 1, l, 0 };
            if (dp.count(l)) return dp[l];
            auto r1 = calc(calc, l/2, x), r2 = calc(calc, (l+1)/2, x);
            if (r1[0]+r2[0] > 1) return dp[l] = { r1[0]+r2[0], r1[1]+r2[1], r1[2]+r2[2]+1 };
            else dp[l] = { 1, l, 0 };
        };
        ll t = (N+M+1)/2;
        auto chk = [&](ll mid) {
            if (mid-1 > (sum-N-M)/t) return false;
            dp.clear();
            ll res = 0, cnt = 0, len = 0, cut = 0;
            for (auto i : v) {
                if (i >= mid) {
                    cnt++;
                    auto [s, l, c] = calc(calc, i, mid);
                    len += l; res += s; cut += c;
                }
            }
            if (cut > M) return cnt+M >= t;
            return res - max(0LL, (N+M-res)-(sum-len)) >= t;
        };
        ll st = 1, en = 1e9, ans = 0;
        while (st <= en) {
            ll mid = (st+en)/2;
            if (chk(mid)) {
                ans = mid;
                st = mid+1;
            }
            else {
                en = mid-1;
            }
        }
        cout << ans << "\n";
    }
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In lambda function:
./Main.cpp:28:9: warning: control reaches end of non-void function [-Wreturn-type]
   28 |         };
      |         ^

ジャッジ結果