oj.uz

답안 #490253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
490253 2021-11-26T15:39:25 Z cpp219 Holding (COCI20_holding) C++14
110 / 110
 80 ms 6744 KB 
#include<bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
#define debug(y) cout<<y,exit(0)
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 1e2 + 9;
const ll mod = 1e9 + 7;
const ll base = 31;

ll n,l,r,k,dp[N][N*N],prv[N][N*N],a[N];

int main(){
    ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    #define task "tst"
    if (fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        //freopen(task".out","w",stdout);
    }
    cin>>n>>l>>r>>k;
    for (ll i = 1;i <= n;i++) cin>>a[i];
    for (ll pos = r;pos >= l;pos--){
        for (ll cur = r;cur <= n;cur++){
            for (ll rm = 0;rm <= k;rm++){
                ll &res = dp[cur][rm];
                if (cur == r) res = prv[cur][rm] + a[pos];
                else{
                    ll d = abs(cur - pos);
                    res = min(dp[cur - 1][rm],prv[cur][rm] + a[pos]);
                    if (rm >= d) res = min(res,prv[cur - 1][rm - d] + a[cur]);
                }
            }
        }
        for (ll cur = l;cur > 0;cur--){
            for (ll rm = 0;rm <= k;rm++){
                ll &res = dp[cur][rm];
                if (cur == l) res = dp[n][rm];
                else{
                    ll d = abs(cur - pos);
                    res = min(dp[cur + 1][rm],prv[cur][rm] + a[pos]);
                    if (rm >= d) res = min(res,prv[cur + 1][rm - d] + a[cur]);
                }
            }
        }
        for (ll i = 1;i <= n;i++)
            for (ll j = 0;j <= k;j++) prv[i][j] = dp[i][j];
    }
    cout<<dp[1][k];
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

holding.cpp: In function 'int main()':
holding.cpp:19:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 728 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 21 ms 3628 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 728 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 21 ms 3628 KB Output is correct
14 Correct 1 ms 728 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 20 ms 3632 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 728 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 21 ms 3628 KB Output is correct
14 Correct 1 ms 728 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 20 ms 3632 KB Output is correct
20 Correct 2 ms 1368 KB Output is correct
21 Correct 2 ms 1624 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 5 ms 4056 KB Output is correct
24 Correct 2 ms 984 KB Output is correct
25 Correct 80 ms 6744 KB Output is correct