oj.uz

Submission #318878

# Submission time Handle Problem Language Result Execution time Memory
318878 2020-11-03T11:49:46 Z leaked Holding (COCI20_holding) C++14
110 / 110
 285 ms 8356 KB 
#include<bits/stdc++.h>

using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//    #pragma GCC target("avx,avx2,fma")
//    #pragma GCC optimization ("unroll-loops")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define f first
#define vec vector
#define s second
#define p_b push_back
#define pb push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<long long,long long> pll;
typedef pair<int,int> pii;
typedef pair<long long,int> pli;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
//#define int long long
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
int inf = 1e9,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll RR=1e4;
const ll tx[8]={1,-1,2,-2,-1,-2};
const ll ty[8]={-2,-2,-1,-1,2,1};
const char rev_to[4]={'E','W','N','S'};
///////////////////fdsfsdfgdsjgdjfsgdsfsdkafsdaokfsdpofdckokfpgjvdsujbgdfpiodjOFCjs;igsd;cpjzckpdoskvgdok;a///////
const int ppp=73;
const int M=1e9+7;
///////////////////fdsfsdfgdsjgdjfsgdsfsdkafsdaokfsdpofdckokfpgjvdsujbgdfpiodjOFCjs;igsd;cpjzckpdoskvgdok;a///////
//const int ppp=73;
const int block=600;
const int OPEN=1;
const int CLOSE=0;
//typedef tree<pli,null_type,less<pli>,rb_tree_tag,tree_order_statistics_node_update> o_st;
auto rnd=bind(uniform_int_distribution<int>(1,5969699),mt19937(time(0)));
void bad(){
    cout<<"-1";
    exit(0);
}

signed main()
{
    fast_io;
    int n,l,r,k;
    cin>>n>>l>>r>>k;
    l--,r--;
    vec<int>a(n);
    for(auto &z : a)
        cin>>z;
    vec<vec<int>>dp(n+1,vec<int>(k+1,0));
    dp[0][0]=0;
    for(int i=l;i<=r;i++){
        vec<vec<int>>ndp(n+1,vec<int>(k+1,inf));
        for(int j=0;j<n;j++){
            for(int u=0;u+abs(i-j)<=k;u++){
                umin(ndp[j+1][u+abs(i-j)],dp[j][u]+a[j]);
            }
        }
        for(int t=0;t<=n;t++){
            for(int j=0;j<=k;j++){
                if(t)umin(ndp[t][j],ndp[t-1][j]);
                if(j)umin(ndp[t][j-1],ndp[t][j-1]);
//                debug()<<imie(n)
            }
        }
        swap(dp,ndp);
//        debug()<<imie(dp);
    }
    int ans=inf;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=k;j++){
            umin(ans,dp[i][j]);
//            debug()<<imie(i)imie(j)imie(dp[i][j]);
        }
    }
    cout<<ans;
    return 0;
}
/*
new_dp[j]+=dp[i]*m[i][j]


*/

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 692 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 692 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 508 KB Output is correct
10 Correct 1 ms 572 KB Output is correct
11 Correct 3 ms 552 KB Output is correct
12 Correct 2 ms 524 KB Output is correct
13 Correct 67 ms 4436 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 692 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 508 KB Output is correct
10 Correct 1 ms 572 KB Output is correct
11 Correct 3 ms 552 KB Output is correct
12 Correct 2 ms 524 KB Output is correct
13 Correct 67 ms 4436 KB Output is correct
14 Correct 1 ms 644 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 2 ms 476 KB Output is correct
19 Correct 83 ms 4432 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 692 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 508 KB Output is correct
10 Correct 1 ms 572 KB Output is correct
11 Correct 3 ms 552 KB Output is correct
12 Correct 2 ms 524 KB Output is correct
13 Correct 67 ms 4436 KB Output is correct
14 Correct 1 ms 644 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 2 ms 476 KB Output is correct
19 Correct 83 ms 4432 KB Output is correct
20 Correct 4 ms 864 KB Output is correct
21 Correct 3 ms 876 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 7 ms 3308 KB Output is correct
24 Correct 13 ms 620 KB Output is correct
25 Correct 285 ms 8356 KB Output is correct