Submission #247432

# Submission time Handle Problem Language Result Execution time Memory
247432 2020-07-11T11:17:40 Z ritikpatel05 Sličice (COCI19_slicice) C++17
90 / 90
250 ms 2552 KB
/*
	Author: Ritik Patel
*/
 
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& STL DEBUGGER &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
// #define _GLIBCXX_DEBUG       // Iterator safety; out-of-bounds access for Containers, etc.
// #pragma GCC optimize "trapv" // abort() on (signed) integer overflow.
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& LIBRARIES &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
#include <bits/stdc++.h>
using namespace std;
 
/*#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
template<typename T, typename V = __gnu_pbds::null_type>
using ordered_set = __gnu_pbds::tree<T, V, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>; 
*/
//find_by_order()->returns an iterator to the k-th largest element(0-based indexing)
//order_of_key()->Number of items that are strictly smaller than our item
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& DEFINES &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
#define int long long int
// #define ll long long int
#define all(i) i.begin(), i.end()
#define sz(a) (int)a.size()
 
// #define ld long double
// const ld PI  = 3.141592;
const int dx4[4] = {0, 1, 0, -1};
const int dy4[4] = {-1, 0, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dy8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& DEBUG &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
#define XOX
vector<string> vec_splitter(string s) {
    for(char& c: s) c = c == ','?  ' ': c;
    stringstream ss; ss << s;
    vector<string> res;
    for(string z; ss >> z; res.push_back(z));
    return res;
}
 
void debug_out(vector<string> __attribute__ ((unused)) args, __attribute__ ((unused)) int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
    if(idx > 0) cerr << ", ";
    stringstream ss; ss << H;
    cerr << args[idx] << " = " << ss.str();
    debug_out(args, idx + 1, T...);
}
 
#ifdef XOX
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __VA_ARGS__)
#else
#define debug(...) 42
#endif
 
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& CODE &&&&&&&&&&&&&&&&&&&&&&&&&&&

int N, M, K;
const int MAXN = 505;
int score[MAXN];
int curr[MAXN];

int memo[MAXN][MAXN];
const int MX = 1e10;

int dp(int id, int left){
    if(left < 0){
        return -MX;
    }
    if(id == N){
        if(left == 0){
            return 0;
        } else {
            return -MX;
        }
    }
    auto &res = memo[id][left];
    if(res != -1){
        return res;
    }
    res = 0;
    int togive = M - curr[id];
    for(int i = 0; i <= togive; ++i){
        res = max(res, dp(id + 1, left - i) + score[curr[id] + i]);
    }
    return res;
}


void solve(){
    memset(memo, -1, sizeof(memo));
    cin >> N >> M >> K;
    for(int i = 0; i < N; ++i){
        cin >> curr[i];
    }
    for(int i = 0; i <= M; ++i){
        cin >> score[i];
    }
    cout << dp(0, K) << '\n';
}
 
 
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); 
    int T = 1; 
    // cin >> T;
    for(int i = 1; i <= T; ++i){
        // brute();
        solve();
    }
    return 0;
}
 
/*
Sample inp
*/
# Verdict Execution time Memory Grader output
1 Correct 9 ms 2304 KB Output is correct
2 Correct 7 ms 2432 KB Output is correct
3 Correct 230 ms 2304 KB Output is correct
4 Correct 240 ms 2424 KB Output is correct
5 Correct 237 ms 2552 KB Output is correct
6 Correct 231 ms 2424 KB Output is correct
7 Correct 229 ms 2424 KB Output is correct
8 Correct 250 ms 2424 KB Output is correct
9 Correct 226 ms 2552 KB Output is correct
10 Correct 241 ms 2424 KB Output is correct