Submission #1105600

#	Time	Username	Problem	Language	Result	Execution time	Memory
1105600		Faggi	Sails (IOI07_sails)	C++11	0 / 100	44 ms	9328 KiB

sails

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 1e5;
const int MAXS = 262144;
ll seg[MAXS], dp[MAXN], vf[MAXN],pot=131072, dpCalc[MAXN+1];
void calc(ll x, ll nod)
{
    if (nod >= pot)
    {
        vf[nod - pot] = x;
        return;
    }
    ll iz, der, mid, maD;
    mid = x / 2ll;
    iz = mid;
    der = mid;
    if (der + der < x)
        der++;
    maD = seg[nod * 2 + 1];
    if (maD < der)
    {
        iz += der - maD;
        der = maD;
    }
    if (iz > 0)
        calc(iz, nod * 2);
    if (der > 0)
        calc(der, nod * 2 + 1);
}
int main()
{
    ll n, i, tot = 0, a, b, res = 0, lim;
    cin >> n;
    for (i = 2; i <= MAXN; i++)
    {
        dpCalc[i] = dpCalc[i - 1] + (i - 1);
    }
    for (i = 0; i < n; i++)
    {
        cin >> a >> b;
        lim = a - b;
        lim--;
        tot += b;
        a--;
        dp[a]++;
        if (lim >= 0)
            dp[lim]--;
    }
    for (i = MAXN - 2; i >= 0; i--)
    {
        dp[i] += dp[i + 1];
    }
    for (i = pot; i < MAXS; i++)
    {
        seg[i] = dp[i - pot];
    }
    for (i = pot - 1; i > 0; i--)
    {
        seg[i] = seg[i * 2] + seg[i * 2 + 1];
    }
    calc(tot, 1);
    for (i = MAXN - 1; i >= 0; i--)
    {
        res += dpCalc[vf[i]];
    }
    cout << res;
    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