Submission #198924

#	Time	Username	Problem	Language	Result	Execution time	Memory
198924		dimash241	Holding (COCI20_holding)	C++17	110 / 110	89 ms	104904 KiB

holding

# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 103;                                          
const int M = 10000/4+5;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, a[N], l, r, m;
int dp[N][N][M]; 
int sol[N][M];

int main () {
	SpeedForce;

	cin >> n >> l >> r >> m;
	m = min(n * n / 4 + 2, m);
	for (int i = 1; i <= n; i ++) {
		cin >> a[i];
	}
	int sum = accumulate(a + l, a + r + 1, 0);


	for (int i = l; i <= r; i++) {
        for (int j = l - 1; j > 0; j--) {
            for (int k = 0; k <= m; k++) {
                dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k]);
                dp[i][j][k] = max(dp[i][j][k], dp[i][j + 1][k]);
                int step = i - j;
                if (k >= step) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j + 1][k - step] + a[i] - a[j]);
            }
        }
    } 
    for (int i = l - 1; i <= r; i++)
        for (int j = 0; j <= m; j++) {
            sol[i][j] = dp[i][1][j];
            if (j)
            	sol[i][j] = max(sol[i][j], sol[i][j-1]);
        }
	memset(dp, 0, sizeof (dp));
	for (int i = r; i >= l; i--) {
        for (int j = r + 1; j <= n; j++) {
            for (int k = 0; k <= m; k++) {
                dp[i][j][k] = max(dp[i][j][k], dp[i + 1][j][k]);
                dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k]);
                int step = j - i;
                if (k >= step) dp[i][j][k] = max(dp[i][j][k], dp[i + 1][j - 1][k - step] + a[i] - a[j]);
            }
        }
    }
    int res = 0;
    for (int i = l - 1; i <= r; i++)
        for (int j = 0; j <= m; j++)
            res = max(res, sol[i][j] + dp[i + 1][n][m - j]);
    cout << sum - res << '\n';
	return Accepted;
}

// B...a

Compilation message (stderr)

holding.cpp: In function 'int main()':
holding.cpp:74:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = l - 1; i <= r; i++)
     ^~~
holding.cpp:80:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  memset(dp, 0, sizeof (dp));
  ^~~~~~

• Subtask 1: 22 / 22
• Subtask 2: 33 / 33
• Subtask 3: 33 / 33
• Subtask 4: 22 / 22