oj.uz

Submission #1048189

# Submission time Handle Problem Language Result Execution time Memory
1048189 2024-08-08T04:33:00 Z FCGVHBN Knapsack (NOI18_knapsack) C++14
49 / 100
 1000 ms 2396 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int memo(int index,int wei,int n,int s,vector<vector<int> >&info,vector<vector<int> >&dp){
    if(index==n){
        return 0;
    }
    if(dp[index][wei]!=-1){
        return dp[index][wei];
    }
    int nt=memo(index+1,wei,n,s,info,dp);
    int t=0;
        for(int i=0;i<info[index][2];i++){
            if((i+1)*info[index][1]+wei<=s){
                t=max(t,(i+1)*info[index][0]+memo(index+1,wei+(i+1)*info[index][1],n,s,info,dp));
            }
    }
    return dp[index][wei]=max(t,nt);
}

signed main() {
    int s,n;
    cin>>s>>n;
    vector<vector<int> >info(n);
    for(int i=0;i<n;i++){
        int v,w,k;
        cin>>v>>w>>k;
        info[i].push_back(v);
        info[i].push_back(w);
        info[i].push_back(k);
    }
    vector<vector<int> >dp(n,vector<int>(s+1,-1));
    cout<<memo(0,0,n,s,info,dp)<<endl;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 3 ms 2020 KB Output is correct
8 Correct 3 ms 2396 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 3 ms 2020 KB Output is correct
8 Correct 3 ms 2396 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 3 ms 1972 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 25 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 136 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 3 ms 2020 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 3 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 3 ms 1972 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 485 ms 2012 KB Output is correct
27 Correct 1 ms 1884 KB Output is correct
28 Correct 1 ms 1884 KB Output is correct
29 Execution timed out 1094 ms 1884 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 25 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 136 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 3 ms 2020 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 3 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 3 ms 1972 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 485 ms 2012 KB Output is correct
27 Correct 1 ms 1884 KB Output is correct
28 Correct 1 ms 1884 KB Output is correct
29 Execution timed out 1094 ms 1884 KB Time limit exceeded
30 Halted 0 ms 0 KB -