oj.uz

답안 #915065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915065 2024-01-23T09:34:49 Z boris_mihov Candies (JOI18_candies) C++17
100 / 100
 249 ms 18896 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <set>

typedef long long llong;
const int MAXN = 200000 + 10;
const int INF  = 1e9;

int n;
int a[MAXN];
llong answer[MAXN];

struct Range
{
    int l, r;
    llong sumActive;
    llong sumIn;    

    friend bool operator < (const Range &a, const Range &b)
    {
        return a.l < b.l || (a.l == b.l && a.r < b.r);
    }
};

struct Flip
{
    llong add;
    int idxL;
    int idxR;

    friend bool operator < (const Flip &a, const Flip &b)
    {
        return a.add < b.add || (a.add == b.add && a.idxL < b.idxL);
    }
};

std::set <Range> ranges;
std::set <Flip> addFlip;
std::set <std::pair <llong,int>> addAlone;
bool inAddAlone[MAXN];

void addFlips(Range range)
{
    // std::cout << "add flips: " << range.l << ' ' << 
    if (range.l > 1 && range.r < n)
    {
        addFlip.insert({a[range.l - 1] + a[range.r + 1] + range.sumIn - range.sumActive, range.l, range.r});
    }
}

void eraseFlips(Range range)
{
    if (range.l > 1 && range.r < n)
    {
        addFlip.erase(addFlip.find({a[range.l - 1] + a[range.r + 1] + range.sumIn - range.sumActive, range.l, range.r}));
    }
}

void addRange(int l, int r, llong sumActive, llong sumIn)
{
    if (l > 1)
    {
        if (inAddAlone[l - 1])
        {
            inAddAlone[l - 1] = false;
            addAlone.erase(addAlone.find({a[l - 1], l - 1}));
        } else
        {
            auto it = ranges.lower_bound({l, l, 0, 0});
            assert(it != ranges.begin());
            it = std::prev(it);

            assert(it->r == l - 2);
            eraseFlips(*it);
            sumActive += it->sumActive;
            sumIn += it->sumIn + a[l - 1];
            l = it->l;

            ranges.erase(it);
        }
    }

    if (r < n)
    {
        if (inAddAlone[r + 1])
        {
            inAddAlone[r + 1] = false;
            addAlone.erase(addAlone.find({a[r + 1], r + 1}));
        } else
        {
            auto it = ranges.upper_bound({r, r, 0, 0});
            assert(it != ranges.end());

            assert(it->l == r + 2);
            eraseFlips(*it);
            sumActive += it->sumActive;
            sumIn += it->sumIn + a[r + 1];
            r = it->r;

            ranges.erase(it);
        }
    }

    Range range = {l, r, sumActive, sumIn};
    addFlips(range);
    ranges.insert(range);
}

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        addAlone.insert({a[i], i});
        inAddAlone[i] = true;
    }

    int count = 0;
    llong res = 0;
    while (addFlip.size() || addAlone.size())
    {
        if (addFlip.empty() || (addAlone.size() && addAlone.rbegin()->first > addFlip.rbegin()->add))
        {
            auto [add, idx] = *addAlone.rbegin();
            addAlone.erase(addAlone.find(*addAlone.rbegin()));
            inAddAlone[idx] = false;
            res += add;

            addRange(idx, idx, a[idx], 0);
            count++;
        } else
        {
            auto [add, idxL, idxR] = *addFlip.rbegin();
            res += add;

            auto it = ranges.lower_bound({idxL, idxL - 1, 0, 0});
            assert(it != ranges.end());

            auto [l, r, sumActive, sumIn] = *it;
            assert(l == idxL && r == idxR);
            eraseFlips(*it);
            ranges.erase(it);

            addRange(idxL - 1, idxR + 1, sumIn + a[idxL - 1] + a[idxR + 1], sumActive);
            count++;
        }

        answer[count] = std::max(answer[count], res);
    }
}

void input()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }
}

void print()
{
    for (int i = 1 ; i <= (n + 1) / 2 ; ++i)
    {
        std::cout << answer[i] << '\n';
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();
    print();

    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2528 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2528 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2524 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2648 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2528 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2528 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2524 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2648 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 249 ms 18768 KB Output is correct
22 Correct 220 ms 18792 KB Output is correct
23 Correct 223 ms 18772 KB Output is correct
24 Correct 109 ms 18772 KB Output is correct
25 Correct 100 ms 18556 KB Output is correct
26 Correct 117 ms 18776 KB Output is correct
27 Correct 131 ms 18852 KB Output is correct
28 Correct 136 ms 18744 KB Output is correct
29 Correct 152 ms 18772 KB Output is correct
30 Correct 132 ms 18896 KB Output is correct
31 Correct 127 ms 18740 KB Output is correct
32 Correct 175 ms 18736 KB Output is correct
33 Correct 199 ms 18512 KB Output is correct
34 Correct 219 ms 18508 KB Output is correct
35 Correct 183 ms 18560 KB Output is correct
36 Correct 242 ms 18720 KB Output is correct
37 Correct 210 ms 18772 KB Output is correct
38 Correct 223 ms 18768 KB Output is correct
39 Correct 107 ms 18640 KB Output is correct
40 Correct 100 ms 18768 KB Output is correct
41 Correct 103 ms 18768 KB Output is correct
42 Correct 126 ms 18768 KB Output is correct
43 Correct 131 ms 18768 KB Output is correct
44 Correct 156 ms 18744 KB Output is correct
45 Correct 133 ms 18768 KB Output is correct
46 Correct 128 ms 18796 KB Output is correct
47 Correct 129 ms 18768 KB Output is correct
48 Correct 163 ms 18504 KB Output is correct
49 Correct 221 ms 18512 KB Output is correct
50 Correct 186 ms 18748 KB Output is correct