oj.uz

답안 #734009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734009 2023-05-01T13:31:15 Z benjaminkleyn 사탕 분배 (IOI21_candies) C++17
100 / 100
 540 ms 25264 KB 
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll M[1000000] = {0}, m[1000000] = {0}, lazy[1000000] = {0};

void push(int v)
{
    M[2 * v] += lazy[v];
    M[2 * v + 1] += lazy[v];

    m[2 * v] += lazy[v];
    m[2 * v + 1] += lazy[v];

    lazy[2 * v] += lazy[v];
    lazy[2 * v + 1] += lazy[v];
    lazy[v] = 0;
}

void update(int v, int tl, int tr, int l, int r, ll dx)
{
    if (r < tl || tr < l)
        return;
    if (l <= tl && tr <= r)
    {
        M[v] += dx;
        m[v] += dx;
        lazy[v] += dx;
        return;
    }

    push(v);
    int tm = (tl + tr) / 2;
    update(2 * v, tl, tm, l, r, dx);
    update(2 * v + 1, tm + 1, tr, l, r, dx);
    M[v] = max(M[2 * v], M[2 * v + 1]);
    m[v] = min(m[2 * v], m[2 * v + 1]);
}

ll Find(int v, int tl, int tr, ll Mx, ll Mn, int c)
{
    if (tl == tr)
        return tl;

    push(v);
    int tm = (tl + tr) / 2;
    if (max(Mx, M[2 * v + 1]) - min(Mn, m[2 * v + 1]) <= c)
        return Find(2 * v, tl, tm, max(Mx, M[2 * v + 1]), min(Mn, m[2 * v + 1]), c);
    return Find(2 * v + 1, tm + 1, tr, Mx, Mn, c);
}

ll Max(int v, int tl, int tr, int l, int r)
{
    if (r < tl || tr < l)
        return LLONG_MIN;
    if (l <= tl && tr <= r)
        return M[v];

    push(v);
    int tm = (tl + tr) / 2;
    return max(
        Max(2 * v, tl, tm, l, r),
        Max(2 * v + 1, tm + 1, tr, l, r)
    );
}

ll Min(int v, int tl, int tr, int l, int r)
{
    if (r < tl || tr < l)
        return LLONG_MAX;
    if (l <= tl && tr <= r)
        return m[v];

    push(v);
    int tm = (tl + tr) / 2;
    return min(
        Min(2 * v, tl, tm, l, r),
        Min(2 * v + 1, tm + 1, tr, l, r)
    );
}

struct Event
{
    int idx, val, time;
};
bool operator<(const Event &A, const Event &B)
{
    return A.idx < B.idx;
}

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) 
{
    int n = c.size(), q = v.size();

    vector<Event> events;
    events.push_back({-2, 1000000000, -2});
    events.push_back({-1, -1000000000, -1});
    for (int i = 0; i < q; i++)
    {
        events.push_back({l[i], v[i], i});
        events.push_back({r[i] + 1, -v[i], i});
    }
    sort(events.begin(), events.end());
    vector<int> s(n);
    int j = 0; 
    ll sum = 0;
    for (int i = 0; i < n; i++)
    {
        while (j < events.size() && events[j].idx <= i)
        {
            sum += events[j].val;
            update(1, 0, q + 1, events[j].time + 2, q + 1, events[j].val);
            j++;
        }
        int idx = Find(1, 0, q + 1, sum, sum, c[i]);

        if (Max(1, 0, q + 1, idx + 1, q + 1) <= Max(1, 0, q + 1, idx, idx))
            s[i] = Max(1, 0, q + 1, q + 1, q + 1) - Min(1, 0, q + 1, idx + 1, q + 1);
        else
            s[i] = c[i] - (Max(1, 0, q + 1, idx + 1, q + 1) - Max(1, 0, q + 1, q + 1, q + 1));
    }

    return s;
}

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:110:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |         while (j < events.size() && events[j].idx <= i)
      |                ~~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 6 ms 600 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 463 ms 24496 KB Output is correct
2 Correct 513 ms 25112 KB Output is correct
3 Correct 540 ms 25048 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 252 ms 22156 KB Output is correct
3 Correct 172 ms 4752 KB Output is correct
4 Correct 488 ms 25136 KB Output is correct
5 Correct 428 ms 25136 KB Output is correct
6 Correct 456 ms 25264 KB Output is correct
7 Correct 441 ms 25096 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 114 ms 22176 KB Output is correct
4 Correct 133 ms 3012 KB Output is correct
5 Correct 340 ms 24348 KB Output is correct
6 Correct 357 ms 24568 KB Output is correct
7 Correct 342 ms 24420 KB Output is correct
8 Correct 326 ms 25160 KB Output is correct
9 Correct 326 ms 25056 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 463 ms 24496 KB Output is correct
7 Correct 513 ms 25112 KB Output is correct
8 Correct 540 ms 25048 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 252 ms 22156 KB Output is correct
11 Correct 172 ms 4752 KB Output is correct
12 Correct 488 ms 25136 KB Output is correct
13 Correct 428 ms 25136 KB Output is correct
14 Correct 456 ms 25264 KB Output is correct
15 Correct 441 ms 25096 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 114 ms 22176 KB Output is correct
19 Correct 133 ms 3012 KB Output is correct
20 Correct 340 ms 24348 KB Output is correct
21 Correct 357 ms 24568 KB Output is correct
22 Correct 342 ms 24420 KB Output is correct
23 Correct 326 ms 25160 KB Output is correct
24 Correct 326 ms 25056 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 142 ms 3680 KB Output is correct
27 Correct 248 ms 22860 KB Output is correct
28 Correct 461 ms 25136 KB Output is correct
29 Correct 469 ms 25156 KB Output is correct
30 Correct 454 ms 24856 KB Output is correct
31 Correct 442 ms 24600 KB Output is correct
32 Correct 470 ms 24544 KB Output is correct