oj.uz

Submission #236040

# Submission time Handle Problem Language Result Execution time Memory
236040 2020-05-31T01:59:01 Z caoash Holding (COCI20_holding) C++14
110 / 110
 200 ms 225144 KB 
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 105;
const ld PI = 4*atan((ld)1);
ll a[MX]; ll dp[MX][MX][(MX*MX)/4];
int main() {
   setIO(); 
   int N,L,R,K; re(N,L,R,K);
   fax(i,N) re(a[i+1]);
   ckmin(K, (MX*MX)/4);
   fax(i,N+2){
     fax(j,N+2){
      fax(k,K+1){
         dp[i][j][k] = INF;
      }
     }
   }
   dp[L][L-1][0] = 0;
   fax(k,K+1){
      f0x(i,L,R+1){
         f0xd(j,1,L){
            if(dp[i][j][k] == INF){
               continue;
            }
            ckmin(dp[i+1][j][k], dp[i][j][k] + a[i]);
            ckmin(dp[i][j-1][k], dp[i][j][k]);
            if(k + abs(i-j) <= K) ckmin(dp[i+1][j-1][k+abs(i-j)], dp[i][j][k] + a[j]);
            ckmin(dp[i][R+1][k], dp[i][j][k]);
         }
         if(dp[i][0][k] != INF) {
            ckmin(dp[i+1][0][k], dp[i][0][k] + a[i]);
            ckmin(dp[i][R+1][k], dp[i][0][k]);
         }
         f0x(j,R+1,N+1){
            if(dp[i][j][k] == INF){
               continue;
            }
            ckmin(dp[i+1][j][k], dp[i][j][k] + a[i]);
            ckmin(dp[i][j+1][k], dp[i][j][k]);
            if(k + abs(i-j) <= K) ckmin(dp[i+1][j+1][k+abs(i-j)], dp[i][j][k] + a[j]);
         }
         if(dp[i][N+1][k] != INF) {
            ckmin(dp[i+1][N+1][k], dp[i][N+1][k] + a[i]);
         }
      }
   }
   /*
   fax(k,K+1){
      f0x(i,L,R+2){
         fax(j,N+2){
           if(dp[i][j][k] != INF) dbg(i,j,k,dp[i][j][k]); 
         }
      }
   }
   */
   ll ans = INF;
   fax(j,N+2){
      fax(k,K+1){
         ckmin(ans, dp[R+1][j][k]);
      }
   }
   pr(ans, "\n");
}

Compilation message

holding.cpp: In function 'void io::setIn(std::__cxx11::string)':
holding.cpp:133:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
holding.cpp: In function 'void io::setOut(std::__cxx11::string)':
holding.cpp:134:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 7 ms 4736 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 7 ms 4736 KB Output is correct
8 Correct 10 ms 12416 KB Output is correct
9 Correct 11 ms 13056 KB Output is correct
10 Correct 11 ms 13184 KB Output is correct
11 Correct 12 ms 15360 KB Output is correct
12 Correct 12 ms 13440 KB Output is correct
13 Correct 38 ms 59000 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 7 ms 4736 KB Output is correct
8 Correct 10 ms 12416 KB Output is correct
9 Correct 11 ms 13056 KB Output is correct
10 Correct 11 ms 13184 KB Output is correct
11 Correct 12 ms 15360 KB Output is correct
12 Correct 12 ms 13440 KB Output is correct
13 Correct 38 ms 59000 KB Output is correct
14 Correct 10 ms 11392 KB Output is correct
15 Correct 10 ms 12928 KB Output is correct
16 Correct 10 ms 12288 KB Output is correct
17 Correct 12 ms 14720 KB Output is correct
18 Correct 12 ms 16512 KB Output is correct
19 Correct 39 ms 59000 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 7 ms 4736 KB Output is correct
8 Correct 10 ms 12416 KB Output is correct
9 Correct 11 ms 13056 KB Output is correct
10 Correct 11 ms 13184 KB Output is correct
11 Correct 12 ms 15360 KB Output is correct
12 Correct 12 ms 13440 KB Output is correct
13 Correct 38 ms 59000 KB Output is correct
14 Correct 10 ms 11392 KB Output is correct
15 Correct 10 ms 12928 KB Output is correct
16 Correct 10 ms 12288 KB Output is correct
17 Correct 12 ms 14720 KB Output is correct
18 Correct 12 ms 16512 KB Output is correct
19 Correct 39 ms 59000 KB Output is correct
20 Correct 45 ms 74880 KB Output is correct
21 Correct 51 ms 95096 KB Output is correct
22 Correct 25 ms 45056 KB Output is correct
23 Correct 117 ms 225144 KB Output is correct
24 Correct 49 ms 67064 KB Output is correct
25 Correct 200 ms 225144 KB Output is correct