oj.uz

Submission #1062666

# Submission time Handle Problem Language Result Execution time Memory
1062666 2024-08-17T09:41:18 Z j_vdd16 Distributing Candies (IOI21_candies) C++17
29 / 100
 87 ms 20060 KB 
#include "candies.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define ll long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;


// struct SegTree {
//     int n, N;
//     vector<set<int>> tree;

//     SegTree(int _n) {
//         int n = _n;
//         int N = 1;
//         while (N < n) N *= 2;

//         tree.resize(2 * N);

//     }
// };

vi distribute_candies(vi c, vi ls, vi rs, vi vs) {
    int n = c.size();
    int q = ls.size();

    vector<ll> cumul(q + 1, 0);
    vector<pair<ll, int>> sufMax(q + 1), sufMin(q + 1);

    for (int i = 0; i < q; i++) {
        ll v = vs[i];

        cumul[i + 1] = cumul[i] + v;
        cumul[i + 1] = max((ll)0, cumul[i + 1]);
    }

    sufMax.back() = {cumul[q], q};
    sufMin.back() = {cumul[q], q};
    for (int i = q - 1; i >= 0; i--) {
        sufMin[i] = sufMin[i + 1];
        sufMax[i] = sufMax[i + 1];
        if (cumul[i] < sufMin[i + 1].first) {
            sufMin[i].first = cumul[i];
            sufMin[i].second = i;
        }
        if (cumul[i] > sufMax[i + 1].first) {
            sufMax[i].first = cumul[i];
            sufMax[i].second = i;
        }
    }

    vi s(n);
    loop(i, n) {
        int l = 0, r = q;
        while (l < r) {
            int m = (l + r + 1) / 2;

            ll diff = sufMax[m].first - sufMin[m].first;
            if (diff < c[i]) {
                r = m - 1;
            }
            else { 
                l = m;
            }
        }

        if (sufMax[l].first - sufMin[l].first <= c[i] && l == 0) {
            s[i] = cumul.back();
            continue;
        }

        int lastMin = sufMin[l].second;
        int lastMax = sufMax[l].second;
        if (lastMin >= lastMax) {
            l = lastMin;
            s[i] = 0;
        }
        else {
            l = lastMax;
            s[i] = c[i];
        }

        s[i] += cumul.back() - cumul[l];
    }

    return s;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 32 ms 12784 KB Output is correct
4 Correct 35 ms 3744 KB Output is correct
5 Correct 78 ms 17232 KB Output is correct
6 Correct 73 ms 19284 KB Output is correct
7 Correct 85 ms 20060 KB Output is correct
8 Correct 69 ms 18528 KB Output is correct
9 Correct 87 ms 20000 KB Output is correct

Subtask #5
0 / 33.0

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