oj.uz

Submission #870704

# Submission time Handle Problem Language Result Execution time Memory
870704 2023-11-09T00:44:02 Z amogususus Holding (COCI20_holding) C++17
110 / 110
 16 ms 37208 KB 
#pragma GCC optimize("O2,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
#define ll int
#define ld long double
#define pb push_back
#define prec fixed<<setprecision
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
using namespace std;
const int maxN=103;
const int mod=998244353;
ll n,l,r,z,a[maxN],f[102][102][2503],g[102][102][2503];
void Enter(){
    cin>>n>>l>>r>>z;
    z=min(z,n*n/4);
    ll res=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        if(l<=i&&i<=r)res+=a[i];
    }
    //f[i][j][k]=so tien giam bot lon nhat khi thay [L,j] bang cac ptu trong [1,i] voi chi phi k, swap(a[i],a[j])
    // tuong tu voi g
    for(int i=1;i<l;i++)for(int j=l;j<=r;j++)for(int k=0;k<=z;k++){
        f[i][j][k]=max(f[i][j-1][k],f[i-1][j][k]);
        if(k>=j-i)f[i][j][k]=max(f[i][j][k],f[i-1][j-1][k-j+i]+a[j]-a[i]);
    }
    for(int i=n;i>r;i--)for(int j=r;j>=l;j--)for(int k=0;k<=z;k++){
        g[j][i][k]=max(g[j+1][i][k],g[j][i+1][k]);
        if(k>=i-j)g[j][i][k]=max(g[j][i][k],g[j+1][i+1][k+j-i]+a[j]-a[i]);
    }
    ll x=max(f[l-1][r][z],g[l][r+1][z]);
    for(int i=l;i<=r;i++)for(int k=0;k<=z;k++)x=max(x,f[l-1][i][k]+g[i+1][r+1][z-k]);
    cout<<res-x;
}
//amogus
signed main(){
    open("DEBT");
    cin.tie(nullptr);ios_base::sync_with_stdio(NULL);
    //ll t=1;cin>>t;while(t--)
    Enter();
}

Compilation message

holding.cpp: In function 'int main()':
holding.cpp:11:54: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
      |                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
holding.cpp:40:5: note: in expansion of macro 'open'
   40 |     open("DEBT");
      |     ^~~~
holding.cpp:11:87: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
      |                                                                                ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
holding.cpp:40:5: note: in expansion of macro 'open'
   40 |     open("DEBT");
      |     ^~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 10332 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 1 ms 2140 KB Output is correct
13 Correct 3 ms 11356 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 10332 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 1 ms 2140 KB Output is correct
13 Correct 3 ms 11356 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 3292 KB Output is correct
16 Correct 1 ms 5724 KB Output is correct
17 Correct 1 ms 3756 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 3 ms 11328 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 10332 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 1 ms 2140 KB Output is correct
13 Correct 3 ms 11356 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 3292 KB Output is correct
16 Correct 1 ms 5724 KB Output is correct
17 Correct 1 ms 3756 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 3 ms 11328 KB Output is correct
20 Correct 4 ms 15964 KB Output is correct
21 Correct 2 ms 4956 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 3 ms 4700 KB Output is correct
24 Correct 6 ms 23132 KB Output is correct
25 Correct 16 ms 37208 KB Output is correct