Submission #928959

#TimeUsernameProblemLanguageResultExecution timeMemory
928959WhisperSličice (COCI19_slicice)C++17
90 / 90
71 ms2412 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define int long long #define FOR(i, a, b) for ( int i = a ; i <= b ; i++ ) #define FORD(i, a, b) for (int i = b; i >= a; i --) #define REP(i, n) for (int i = 0; i < n; ++i) #define REPD(i, n) for (int i = n - 1; i >= 0; --i) #define pii pair<int , int> #define fi first #define se second #define Lg(x) 31 - __builtin_clz(x) #define MASK(i) (1LL << (i)) #define BIT(x, i) (((x) >> (i)) & 1) constexpr ll LINF = (1ll << 60); constexpr int INF = (1ll << 30); constexpr int MAX = 5e2 + 5; constexpr int Mod = 1e9 + 7; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void setupIO(){ #define name "Whisper" //Phu Trong from Nguyen Tat Thanh High School for gifted student srand(time(NULL)); cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr); //freopen(name".inp", "r", stdin); //freopen(name".out", "w", stdout); cout << fixed << setprecision(10); } template <class X, class Y> bool minimize(X &x, const Y &y){ X eps = 1e-9; if (x > y + eps) {x = y; return 1;} return 0; } template <class X, class Y> bool maximize(X &x, const Y &y){ X eps = 1e-9; if (x + eps < y) {x = y; return 1;} return 0; } int nArr, numCard, numK; int a[MAX], b[MAX]; int dp[MAX][MAX]; void Whisper(){ cin >> nArr >> numCard >> numK; for (int i = 1; i <= nArr; ++i) cin >> a[i]; for (int i = 0; i <= numCard; ++i) cin >> b[i]; for (int i = 1; i <= nArr; ++i){ for (int v = 0; v <= numK; ++v){ for (int pre_v = 0; pre_v <= v; ++pre_v){ maximize(dp[i][v], dp[i - 1][pre_v] + b[a[i] + (v - pre_v)]); } } } int ans = 0; for (int i = 1; i <= numK; ++i){ maximize(ans, dp[nArr][i]); } cout << ans; } signed main(){ setupIO(); int Test = 1; // cin >> Test; for ( int i = 1 ; i <= Test ; i++ ){ Whisper(); if (i < Test) cout << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...