oj.uz

답안 #624927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624927 2022-08-09T06:50:54 Z Soul234 Holding (COCI20_holding) C++14
110 / 110
 80 ms 10540 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

const int MXN = 1e2+5, MXK = 1e4+5;
int dp[2][MXN][MXK];

int N, L, R, K, A[MXN], ansL[MXN][MXK];
int sum = 0;

void solve() {
    cin >> N >> L >> R >> K;
    FOR(i,1,N+1) {
        cin>>A[i];
        if(i >= L && i <= R) sum += A[i];
    }
    FOR(i,L,R+1) {
        memset(dp[i&1], 0, sizeof dp[i&1]);
        ROF(j,1,L) {
            F0R(k, K+1) {
                dp[i&1][j][k] = max(dp[(i-1)&1][j][k], dp[i&1][j+1][k]);
                if(k >= i-j) ckmax(dp[i&1][j][k], dp[(i-1)&1][j+1][k-i+j] + A[i] - A[j]);
                if(j == 1) ckmax(ansL[i][k], dp[i&1][j][k]);
            }
        }
    }
    int mx = ansL[R][K];
    ROF(i,L,R+1) {
        memset(dp[i&1], 0, sizeof dp[i&1]);
        FOR(j,R+1, N+1)
            F0R(k, K+1) {
                dp[i&1][j][k] = max(dp[(i+1)&1][j][k], dp[i&1][j-1][k]);
                if(k >= j-i) ckmax(dp[i&1][j][k], dp[(i+1)&1][j-1][k-j+i] + A[i] - A[j]);
                if(j == N && i <= R+1 && i >= L) ckmax(mx, ansL[i-1][K-k] + dp[i&1][j][k]);
            }
    }
    cout << sum - mx << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

holding.cpp: In function 'void setIO(std::string)':
holding.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
holding.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 8 ms 8524 KB Output is correct
3 Correct 10 ms 8532 KB Output is correct
4 Correct 10 ms 8592 KB Output is correct
5 Correct 9 ms 8556 KB Output is correct
6 Correct 9 ms 8604 KB Output is correct
7 Correct 8 ms 8720 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 8 ms 8524 KB Output is correct
3 Correct 10 ms 8532 KB Output is correct
4 Correct 10 ms 8592 KB Output is correct
5 Correct 9 ms 8556 KB Output is correct
6 Correct 9 ms 8604 KB Output is correct
7 Correct 8 ms 8720 KB Output is correct
8 Correct 15 ms 8532 KB Output is correct
9 Correct 15 ms 8604 KB Output is correct
10 Correct 20 ms 8652 KB Output is correct
11 Correct 20 ms 8660 KB Output is correct
12 Correct 27 ms 8660 KB Output is correct
13 Correct 31 ms 9572 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 8 ms 8524 KB Output is correct
3 Correct 10 ms 8532 KB Output is correct
4 Correct 10 ms 8592 KB Output is correct
5 Correct 9 ms 8556 KB Output is correct
6 Correct 9 ms 8604 KB Output is correct
7 Correct 8 ms 8720 KB Output is correct
8 Correct 15 ms 8532 KB Output is correct
9 Correct 15 ms 8604 KB Output is correct
10 Correct 20 ms 8652 KB Output is correct
11 Correct 20 ms 8660 KB Output is correct
12 Correct 27 ms 8660 KB Output is correct
13 Correct 31 ms 9572 KB Output is correct
14 Correct 4 ms 4436 KB Output is correct
15 Correct 6 ms 8572 KB Output is correct
16 Correct 9 ms 8588 KB Output is correct
17 Correct 8 ms 8520 KB Output is correct
18 Correct 12 ms 8532 KB Output is correct
19 Correct 39 ms 9440 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 8 ms 8524 KB Output is correct
3 Correct 10 ms 8532 KB Output is correct
4 Correct 10 ms 8592 KB Output is correct
5 Correct 9 ms 8556 KB Output is correct
6 Correct 9 ms 8604 KB Output is correct
7 Correct 8 ms 8720 KB Output is correct
8 Correct 15 ms 8532 KB Output is correct
9 Correct 15 ms 8604 KB Output is correct
10 Correct 20 ms 8652 KB Output is correct
11 Correct 20 ms 8660 KB Output is correct
12 Correct 27 ms 8660 KB Output is correct
13 Correct 31 ms 9572 KB Output is correct
14 Correct 4 ms 4436 KB Output is correct
15 Correct 6 ms 8572 KB Output is correct
16 Correct 9 ms 8588 KB Output is correct
17 Correct 8 ms 8520 KB Output is correct
18 Correct 12 ms 8532 KB Output is correct
19 Correct 39 ms 9440 KB Output is correct
20 Correct 12 ms 8548 KB Output is correct
21 Correct 5 ms 8532 KB Output is correct
22 Correct 9 ms 8532 KB Output is correct
23 Correct 6 ms 8532 KB Output is correct
24 Correct 49 ms 9016 KB Output is correct
25 Correct 80 ms 10540 KB Output is correct