oj.uz

Submission #1105603

# Submission time Handle Problem Language Result Execution time Memory
1105603 2024-10-27T01:23:53 Z Faggi Sails (IOI07_sails) C++11
0 / 100
 44 ms 9044 KB 
#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 - 1;
        tot += b;
        a--;
        dp[a]++;
        if (lim >= 0) {
            dp[lim]--;
        }
    }

    for (i = MAXN - 2; i >= 0; i--) {
        dp[i] += dp[i + 1];
        seg[i + pot] = dp[i];
    }

    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.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4432 KB Output is correct
2 Incorrect 3 ms 4432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4612 KB Output is correct
2 Incorrect 3 ms 4432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 8784 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 25 ms 8964 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 9032 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 36 ms 9032 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 44 ms 9044 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -