oj.uz

답안 #800370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800370 2023-08-01T13:49:14 Z GrindMachine Feast (NOI19_feast) C++17
12 / 100
 1000 ms 7644 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    vector<ll> b;
    b.pb(a[1]);
    
    for(int i = 2; i <= n; ++i){
        bool diff = false;
        if(a[i] < 0 and b.back() > 0) diff = true;
        if(a[i] > 0 and b.back() < 0) diff = true;
        if(diff){
            b.pb(a[i]);
        }
        else{
            b.back() += a[i];
        }
    } 

    if(b.front() <= 0){
        b.erase(b.begin());
    }
    if(sz(b) and b.back() <= 0){
        b.pop_back();
    }

    ll ans = 0;

    while(true){
        vector<ll> positives;
        rep(i,sz(b)){
            if(b[i] > 0){
                positives.pb(b[i]);
            }
        }

        sort(rall(positives));

        ll val = 0;
        rep(i,min((ll)sz(positives),k)){
            val += positives[i];
        }

        amax(ans,val);

        if(sz(positives) <= k) break;
        
        ll mx_neg = -inf2, pos = -1;
        rep(i,sz(b)){
            if(b[i] < 0){
                if(b[i] > mx_neg){
                    mx_neg = b[i];
                    pos = i;
                }
            }
        }

        b[pos] += b[pos-1];
        b[pos] += b[pos+1];
        b[pos-1] = b[pos+1] = 0;

        vector<ll> c;
        c.pb(b[0]);

        rep1(i,sz(b)-1){
            bool diff = false;
            if(b[i] < 0 and c.back() > 0) diff = true;
            if(b[i] > 0 and c.back() < 0) diff = true;
            if(diff){
                c.pb(b[i]);
            }
            else{
                c.back() += b[i];
            }
        }

        if(c.front() <= 0){
            c.erase(c.begin());
        }
        if(sz(c) and c.back() <= 0){
            c.pop_back();
        }

        b = c;
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

feast.cpp: In function 'void solve(int)':
feast.cpp:30:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 | #define rep(i, n) for(int i = 0; i < n; ++i)
      |                                    ^
feast.cpp:95:9: note: in expansion of macro 'rep'
   95 |         rep(i,sz(b)){
      |         ^~~
feast.cpp:110:26: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  110 |         if(sz(positives) <= k) break;
      |                          ^
feast.cpp:30:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 | #define rep(i, n) for(int i = 0; i < n; ++i)
      |                                    ^
feast.cpp:113:9: note: in expansion of macro 'rep'
  113 |         rep(i,sz(b)){
      |         ^~~
feast.cpp:31:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 | #define rep1(i, n) for(int i = 1; i <= n; ++i)
......
  129 |         rep1(i,sz(b)-1){
      |              ~~~~~~~~~               
feast.cpp:129:9: note: in expansion of macro 'rep1'
  129 |         rep1(i,sz(b)-1){
      |         ^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 2516 KB Output is correct
2 Correct 27 ms 2644 KB Output is correct
3 Correct 23 ms 2644 KB Output is correct
4 Correct 33 ms 2644 KB Output is correct
5 Correct 23 ms 2644 KB Output is correct
6 Correct 27 ms 2516 KB Output is correct
7 Correct 23 ms 2516 KB Output is correct
8 Correct 23 ms 2644 KB Output is correct
9 Correct 23 ms 2516 KB Output is correct
10 Correct 23 ms 2644 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 7644 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 2516 KB Output is correct
2 Correct 27 ms 2644 KB Output is correct
3 Correct 23 ms 2644 KB Output is correct
4 Correct 33 ms 2644 KB Output is correct
5 Correct 23 ms 2644 KB Output is correct
6 Correct 27 ms 2516 KB Output is correct
7 Correct 23 ms 2516 KB Output is correct
8 Correct 23 ms 2644 KB Output is correct
9 Correct 23 ms 2516 KB Output is correct
10 Correct 23 ms 2644 KB Output is correct
11 Correct 16 ms 2516 KB Output is correct
12 Correct 15 ms 2644 KB Output is correct
13 Correct 15 ms 2516 KB Output is correct
14 Correct 16 ms 2516 KB Output is correct
15 Correct 33 ms 2516 KB Output is correct
16 Correct 16 ms 2516 KB Output is correct
17 Correct 15 ms 2644 KB Output is correct
18 Correct 23 ms 2644 KB Output is correct
19 Correct 22 ms 2516 KB Output is correct
20 Correct 15 ms 2644 KB Output is correct
21 Execution timed out 1074 ms 7644 KB Time limit exceeded
22 Halted 0 ms 0 KB -