oj.uz

Submission #935453

# Submission time Handle Problem Language Result Execution time Memory
935453 2024-02-29T06:19:49 Z shinigami_09 Knapsack (NOI18_knapsack) C++17
49 / 100
 1000 ms 66148 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

// int dp[2001][100001];
map<pair<int,pair<int,int>>,int>dp;

int f(int n, int s, vector<int> &val, vector<int> &w, vector<int> &freq)
{
    if (s == 0)
        return 0;
    if (n == 0)
        return 0;
    if(dp.find({s,{n,freq[n-1]}})!=dp.end())return dp[{s,{n,freq[n-1]}}];
    int ans = 0;
    if (w[n - 1] <= s and freq[n - 1] > 0)
    {
        vector<int> temp = freq;
        temp[n - 1]--;
        ans = max(ans, val[n - 1] + f(n, s - w[n - 1], val, w, temp));
        ans = max(ans, f(n - 1, s, val, w, freq));
    }
    else
    {
        ans = max(ans, f(n - 1, s, val, w, freq));
    }
    return dp[{s,{n,freq[n-1]}}] = ans;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // memset(dp, -1, sizeof dp);
    dp.clear();
    int s, n;
    cin >> s >> n;

    vector<int> val(n), w(n), freq(n);
    for (int i = 0; i < n; i++)
    {
        cin >> val[i] >> w[i] >> freq[i];
    }

    cout << f(n, s, val, w, freq);

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 3 ms 1116 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 57 ms 12244 KB Output is correct
7 Correct 72 ms 13800 KB Output is correct
8 Correct 45 ms 10324 KB Output is correct
9 Correct 48 ms 10840 KB Output is correct
10 Correct 86 ms 16296 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 3 ms 1116 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 57 ms 12244 KB Output is correct
7 Correct 72 ms 13800 KB Output is correct
8 Correct 45 ms 10324 KB Output is correct
9 Correct 48 ms 10840 KB Output is correct
10 Correct 86 ms 16296 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 260 ms 41300 KB Output is correct
13 Correct 3 ms 1112 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 202 ms 24924 KB Output is correct
17 Correct 46 ms 10880 KB Output is correct
18 Correct 80 ms 15696 KB Output is correct
19 Correct 222 ms 28500 KB Output is correct
20 Correct 126 ms 19028 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 57 ms 12244 KB Output is correct
11 Correct 72 ms 13800 KB Output is correct
12 Correct 45 ms 10324 KB Output is correct
13 Correct 48 ms 10840 KB Output is correct
14 Correct 86 ms 16296 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 260 ms 41300 KB Output is correct
17 Correct 3 ms 1112 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 202 ms 24924 KB Output is correct
21 Correct 46 ms 10880 KB Output is correct
22 Correct 80 ms 15696 KB Output is correct
23 Correct 222 ms 28500 KB Output is correct
24 Correct 126 ms 19028 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Execution timed out 1089 ms 66148 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 57 ms 12244 KB Output is correct
11 Correct 72 ms 13800 KB Output is correct
12 Correct 45 ms 10324 KB Output is correct
13 Correct 48 ms 10840 KB Output is correct
14 Correct 86 ms 16296 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 260 ms 41300 KB Output is correct
17 Correct 3 ms 1112 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 202 ms 24924 KB Output is correct
21 Correct 46 ms 10880 KB Output is correct
22 Correct 80 ms 15696 KB Output is correct
23 Correct 222 ms 28500 KB Output is correct
24 Correct 126 ms 19028 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Execution timed out 1089 ms 66148 KB Time limit exceeded
27 Halted 0 ms 0 KB -