oj.uz

답안 #330819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330819 2020-11-26T16:24:37 Z two_sides Feast (NOI19_feast) C++17
30 / 100
 314 ms 14444 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

struct block {
    ll val;
    block *prev, *next;

    block(ll val): val(val) {
        prev = next = nullptr;
    }
};

using blockpt = block*;

struct compare {
    bool operator () (const blockpt &x,
    const blockpt &y) const {
        return abs(x->val) != abs(y->val) ?
        abs(x->val) < abs(y->val) : x < y;
    }
};

const int N = 3e5 + 5;

set <block*, compare> blocks;
int a[N]; block *b[N];

bool sign(const int &x) {
    return x <= 0 ? 0 : 1;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, k, m = 0, p = 0;
    cin >> n >> k;
    for (int i = 1; i <= n; cin >> a[i++]);
    for (int i = 1; i <= n; ) {
        int j = i; ll sum = 0;
        while (j <= n && sign(a[i])
        == sign(a[j])) sum += a[j++];
        if (sum > 0 || m > 0) {
            b[m++] = new block(sum);
            blocks.insert(b[m - 1]);
        }
        i = j; p += sum > 0;
    }
    for (int i = 1; i < m; i++) {
        b[i]->prev = b[i - 1];
        b[i - 1]->next = b[i];
    }
    while (p > k && blocks.size()) {
        blockpt it = *blocks.begin();
        blocks.erase(it);
        if (it->val > 0) p--;
        if (it->prev) {
            blocks.erase(it->prev);
            if (it->prev->val > 0) p--;
            it->val += it->prev->val;
            it->prev = it->prev->prev;
            if (it->prev)
                it->prev->next = it;
        }
        if (it->next) {
            blocks.erase(it->next);
            if (it->next->val > 0) p--;
            it->val += it->next->val;
            it->next = it->next->next;
            if (it->next)
                it->next->prev = it;
        }
        if (it->val <= 0) {
            if (!it->prev)
                it->next->prev = 0;
            else if (!it->next)
                it->prev->next = 0;
            else blocks.insert(it);
        }
        else {
            blocks.insert(it); p++;
        }
    }
    ll res = 0;
    for (auto it : blocks)
        res += max(0ll, it->val);
    cout << res << '\n';
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 1644 KB Output is correct
2 Correct 33 ms 1516 KB Output is correct
3 Correct 34 ms 1516 KB Output is correct
4 Correct 33 ms 1516 KB Output is correct
5 Correct 34 ms 1516 KB Output is correct
6 Correct 35 ms 1644 KB Output is correct
7 Correct 34 ms 1516 KB Output is correct
8 Correct 33 ms 1516 KB Output is correct
9 Correct 33 ms 1516 KB Output is correct
10 Correct 33 ms 1516 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 1516 KB Output is correct
2 Correct 23 ms 1516 KB Output is correct
3 Correct 22 ms 1516 KB Output is correct
4 Correct 24 ms 1516 KB Output is correct
5 Correct 33 ms 1516 KB Output is correct
6 Correct 22 ms 1516 KB Output is correct
7 Correct 23 ms 1516 KB Output is correct
8 Correct 33 ms 1516 KB Output is correct
9 Correct 35 ms 1516 KB Output is correct
10 Correct 22 ms 1516 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 14344 KB Output is correct
2 Correct 286 ms 14188 KB Output is correct
3 Correct 287 ms 14188 KB Output is correct
4 Correct 300 ms 14100 KB Output is correct
5 Correct 299 ms 14148 KB Output is correct
6 Correct 314 ms 14392 KB Output is correct
7 Correct 292 ms 14444 KB Output is correct
8 Correct 287 ms 14188 KB Output is correct
9 Correct 301 ms 14420 KB Output is correct
10 Correct 296 ms 14420 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 1644 KB Output is correct
2 Correct 33 ms 1516 KB Output is correct
3 Correct 34 ms 1516 KB Output is correct
4 Correct 33 ms 1516 KB Output is correct
5 Correct 34 ms 1516 KB Output is correct
6 Correct 35 ms 1644 KB Output is correct
7 Correct 34 ms 1516 KB Output is correct
8 Correct 33 ms 1516 KB Output is correct
9 Correct 33 ms 1516 KB Output is correct
10 Correct 33 ms 1516 KB Output is correct
11 Correct 24 ms 1516 KB Output is correct
12 Correct 23 ms 1516 KB Output is correct
13 Correct 22 ms 1516 KB Output is correct
14 Correct 24 ms 1516 KB Output is correct
15 Correct 33 ms 1516 KB Output is correct
16 Correct 22 ms 1516 KB Output is correct
17 Correct 23 ms 1516 KB Output is correct
18 Correct 33 ms 1516 KB Output is correct
19 Correct 35 ms 1516 KB Output is correct
20 Correct 22 ms 1516 KB Output is correct
21 Correct 293 ms 14344 KB Output is correct
22 Correct 286 ms 14188 KB Output is correct
23 Correct 287 ms 14188 KB Output is correct
24 Correct 300 ms 14100 KB Output is correct
25 Correct 299 ms 14148 KB Output is correct
26 Correct 314 ms 14392 KB Output is correct
27 Correct 292 ms 14444 KB Output is correct
28 Correct 287 ms 14188 KB Output is correct
29 Correct 301 ms 14420 KB Output is correct
30 Correct 296 ms 14420 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Incorrect 1 ms 364 KB Output isn't correct
36 Halted 0 ms 0 KB -