oj.uz

Submission #1030514

# Submission time Handle Problem Language Result Execution time Memory
1030514 2024-07-22T06:15:15 Z LmaoLmao Knapsack (NOI18_knapsack) C++17
37 / 100
 54 ms 47508 KB 
#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ii = pair<int, int>;
using aa = array<int,3>;

const int N = 1e6+5;
const int INF = 1e9;

ll dp[2005][2005];
vector<ii> m[2005];
int pre[2005][2005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,s;
    cin >> s >> n;
    for(int i=1;i<=s;i++) {
        for(int j=1;j<=s;j++) dp[i][j]=0;
    }
    for(int i=1;i<=n;i++) {
        int v,w,k;
        cin >> v >> w >> k;
        m[w].push_back({v,k});
    }
    for(int i=1;i<=s;i++) {
        sort(m[i].begin(),m[i].end(),greater<>());
    }
    for(int i=1;i<=s;i++) {
        int cur=0;
        for(ii x:m[i]) {
            int t=cur;
            cur+=x.second*i;
            cur=min(cur,s);
            for(int j=t+i;j<=cur;j+=i) {
                pre[i][j]=pre[i][j-i]+x.first;
            }
            if(cur>=s) break;
        }
        for(int j=1;j<=s;j++) pre[i][j]=max(pre[i][j],pre[i][j-1]);
    }
    ll ans=0;
    for(int i=1;i<=s;i++) {
        for(ll j=s;j>0;j--) {
            for(int k=1;i*k<=j;k++) {
                dp[i][j]=max(dp[i][j],dp[i-1][j-i*k]+pre[i][i*k]);
                ans=max(ans,dp[i][j]);
            }
            dp[i][j]=max(dp[i][j],dp[i-1][j]);
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 26972 KB Output is correct
2 Incorrect 19 ms 27060 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 49 ms 47408 KB Output is correct
3 Correct 39 ms 47440 KB Output is correct
4 Correct 39 ms 47440 KB Output is correct
5 Correct 39 ms 47484 KB Output is correct
6 Correct 40 ms 47508 KB Output is correct
7 Correct 40 ms 47452 KB Output is correct
8 Correct 54 ms 47464 KB Output is correct
9 Correct 39 ms 47452 KB Output is correct
10 Correct 40 ms 47452 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 49 ms 47408 KB Output is correct
3 Correct 39 ms 47440 KB Output is correct
4 Correct 39 ms 47440 KB Output is correct
5 Correct 39 ms 47484 KB Output is correct
6 Correct 40 ms 47508 KB Output is correct
7 Correct 40 ms 47452 KB Output is correct
8 Correct 54 ms 47464 KB Output is correct
9 Correct 39 ms 47452 KB Output is correct
10 Correct 40 ms 47452 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 39 ms 47448 KB Output is correct
13 Correct 43 ms 47440 KB Output is correct
14 Correct 38 ms 47452 KB Output is correct
15 Correct 40 ms 47452 KB Output is correct
16 Correct 40 ms 47440 KB Output is correct
17 Correct 41 ms 47420 KB Output is correct
18 Correct 42 ms 47492 KB Output is correct
19 Correct 39 ms 47448 KB Output is correct
20 Correct 40 ms 47300 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 26972 KB Output is correct
2 Incorrect 19 ms 27060 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 26972 KB Output is correct
2 Incorrect 19 ms 27060 KB Output isn't correct
3 Halted 0 ms 0 KB -