제출 #1274827

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1274827		gustavo_d	Sails (IOI07_sails)	C++20	0 / 100	1094 ms	2908 KiB

sails

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

typedef long long ll;

const int MAXN = 1e5;
const int MAXH = 1e5;

ll H[MAXN], qty[MAXN];
ll h[MAXH+1];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int n; cin >> n;
    for (int i=0; i<n; i++) {
        cin >> H[i] >> qty[i];
        for (int j=H[i]-qty[i]+1; j<=H[i]; j++) {
            h[j]++;
        }
    }

    vector<tuple<ll, ll, ll>> freq; freq.emplace_back(1, 1, h[1]);
    for (int i=2; i<=MAXH; i++) {
        auto [l, r, f] = freq.back();
        f *= (r-l+1);
        freq.pop_back();
        f += h[i]; r++;
        while (!freq.empty() and f/(r-l+1) > get<2> (freq.back())) {
            auto [l2, r2, f2] = freq.back();
            freq.pop_back();
            l = l2; f += f2;
        }
        ll more = f % (r-l+1); ll less = r-l+1-more;
        if (more != 0) freq.emplace_back(l, l+more-1, f / (r-l+1) + 1);
        freq.emplace_back(r-less+1, r, f / (r-l+1));
    }

    ll ans = 0;
    for (auto [l, r, f] : freq) {
        if (f == 0) continue;
        // cout << l << " até " << r << " com " << f << endl;
        ans += f*(f-1)/2 * (r-l+1);
    }
    cout << ans << '\n';

    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10