oj.uz

Submission #224971

# Submission time Handle Problem Language Result Execution time Memory
224971 2020-04-19T07:28:53 Z NONAME Sličice (COCI19_slicice) C++17
90 / 90
 59 ms 6264 KB 
#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

ll n, m, K, a[N], b[N], f[505][505 * 505];

void solve() {
    cin >> n >> m >> K;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i <= m; i++)
        cin >> b[i];

    f[0][0] = 0;
    for (int i = 0; i < n; i++)
    for (int j = 0; j <= K; j++)
    for (int k = 0; j + k <= K && a[i] + k <= m; k++)
        f[i + 1][j + k] = max(f[i + 1][j + k], f[i][j] + b[a[i] + k]);

    cout << f[n][K];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
//        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

Subtask #1
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4352 KB Output is correct
3 Correct 56 ms 6264 KB Output is correct
4 Correct 58 ms 6136 KB Output is correct
5 Correct 57 ms 6136 KB Output is correct
6 Correct 56 ms 6136 KB Output is correct
7 Correct 54 ms 6136 KB Output is correct
8 Correct 57 ms 6136 KB Output is correct
9 Correct 54 ms 6188 KB Output is correct
10 Correct 59 ms 6264 KB Output is correct