oj.uz

답안 #224962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224962 2020-04-19T07:12:19 Z kartel Sličice (COCI19_slicice) C++14
90 / 90
 85 ms 5252 KB 
#include <bits/stdc++.h>
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define F first
#define S second
#define pb push_back
#define M ll(998244353)
#define inf ll(2e9+7)
#define N ll(2005)
#define sz(x) x.size()
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#define el '\n'
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> os;

ll f[N][N], a[N], cost[N], n, m, K, i, j, k;

int main()
{
//    in("input.txt");
//    out("output.txt");

    ios_base::sync_with_stdio(false);
    iostream::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> K;
    for (i = 1; i <= n; i++) cin >> a[i];
    for (i = 0; i <= m; i++) cin >> cost[i];

    f[0][0] = 0;

    for (i = 0; i < n; i++)
      for (j = 0; j <= m; j++)
    {
        if (a[i + 1] + j > m) break;
        for (k = 0; k <= K; k++)
        {
            f[i + 1][k + j] = max(f[i + 1][k + j], f[i][k] + cost[a[i + 1] + j]);
        }
    }

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

Subtask #1
90.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3328 KB Output is correct
2 Correct 7 ms 3456 KB Output is correct
3 Correct 75 ms 5112 KB Output is correct
4 Correct 78 ms 5240 KB Output is correct
5 Correct 79 ms 5240 KB Output is correct
6 Correct 78 ms 5240 KB Output is correct
7 Correct 77 ms 5112 KB Output is correct
8 Correct 81 ms 5240 KB Output is correct
9 Correct 74 ms 5112 KB Output is correct
10 Correct 85 ms 5252 KB Output is correct