oj.uz

Submission #926911

# Submission time Handle Problem Language Result Execution time Memory
926911 2024-02-14T04:19:05 Z haru09 Knapsack (NOI18_knapsack) C++17
100 / 100
 50 ms 66456 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define task "code"

const int ar=2e3+5;
const ll mod=1e9+7;
int n,s;
vector<pair<int,int>> w[ar];
ll dp[ar][ar];
ll sum[ar][ar];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    if (fopen(task".inp","r"))
    {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    cin>>s>>n;
    for (int i=1;i<=n;i++)
    {
        int v,c,k;
        cin>>v>>c>>k;
        w[c].push_back({v,k});
    }
    for (int i=1;i<=s;i++)
    {
        sort(w[i].begin(),w[i].end(),greater<pair<int,int>>());
        sum[i][0]=0;
        int j=1;
        for (auto [v,k]:w[i])
        {
            int last=j;
            while(i*j<=s && j-last<k)
            {
                sum[i][i*j]=sum[i][i*(j-1)]+v;
                j++;
            }
        }
    }
    for (int i=1;i<=s;i++)
    {
        for (int j=1;j<=s;j++) dp[i][j]=dp[i-1][j];
        for (int j=i;j<=s;j+=i)
        {
            for (int k=j;k<=s;k++)
            {
                dp[i][k]=max(dp[i][k],dp[i-1][k-j]+sum[i][j]);
            }
        }
    }
    ll ans=0;
    for (int i=1;i<=s;i++) ans=max(ans,dp[s][i]);
    cout<<ans;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 40792 KB Output is correct
2 Correct 12 ms 40872 KB Output is correct
3 Correct 11 ms 40796 KB Output is correct
4 Correct 10 ms 40672 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 25 ms 63080 KB Output is correct
3 Correct 23 ms 63068 KB Output is correct
4 Correct 23 ms 63060 KB Output is correct
5 Correct 23 ms 63068 KB Output is correct
6 Correct 23 ms 63104 KB Output is correct
7 Correct 23 ms 63068 KB Output is correct
8 Correct 26 ms 63084 KB Output is correct
9 Correct 22 ms 63060 KB Output is correct
10 Correct 22 ms 63064 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 25 ms 63080 KB Output is correct
3 Correct 23 ms 63068 KB Output is correct
4 Correct 23 ms 63060 KB Output is correct
5 Correct 23 ms 63068 KB Output is correct
6 Correct 23 ms 63104 KB Output is correct
7 Correct 23 ms 63068 KB Output is correct
8 Correct 26 ms 63084 KB Output is correct
9 Correct 22 ms 63060 KB Output is correct
10 Correct 22 ms 63064 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 23 ms 63052 KB Output is correct
13 Correct 23 ms 63032 KB Output is correct
14 Correct 23 ms 63100 KB Output is correct
15 Correct 26 ms 63068 KB Output is correct
16 Correct 23 ms 63060 KB Output is correct
17 Correct 22 ms 63076 KB Output is correct
18 Correct 23 ms 63068 KB Output is correct
19 Correct 26 ms 63040 KB Output is correct
20 Correct 23 ms 63064 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 40792 KB Output is correct
2 Correct 12 ms 40872 KB Output is correct
3 Correct 11 ms 40796 KB Output is correct
4 Correct 10 ms 40672 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 25 ms 63080 KB Output is correct
7 Correct 23 ms 63068 KB Output is correct
8 Correct 23 ms 63060 KB Output is correct
9 Correct 23 ms 63068 KB Output is correct
10 Correct 23 ms 63104 KB Output is correct
11 Correct 23 ms 63068 KB Output is correct
12 Correct 26 ms 63084 KB Output is correct
13 Correct 22 ms 63060 KB Output is correct
14 Correct 22 ms 63064 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 23 ms 63052 KB Output is correct
17 Correct 23 ms 63032 KB Output is correct
18 Correct 23 ms 63100 KB Output is correct
19 Correct 26 ms 63068 KB Output is correct
20 Correct 23 ms 63060 KB Output is correct
21 Correct 22 ms 63076 KB Output is correct
22 Correct 23 ms 63068 KB Output is correct
23 Correct 26 ms 63040 KB Output is correct
24 Correct 23 ms 63064 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 22 ms 63056 KB Output is correct
27 Correct 23 ms 63056 KB Output is correct
28 Correct 23 ms 63068 KB Output is correct
29 Correct 23 ms 63116 KB Output is correct
30 Correct 23 ms 63092 KB Output is correct
31 Correct 23 ms 63068 KB Output is correct
32 Correct 23 ms 63068 KB Output is correct
33 Correct 23 ms 63088 KB Output is correct
34 Correct 23 ms 63088 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 40792 KB Output is correct
2 Correct 12 ms 40872 KB Output is correct
3 Correct 11 ms 40796 KB Output is correct
4 Correct 10 ms 40672 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 25 ms 63080 KB Output is correct
7 Correct 23 ms 63068 KB Output is correct
8 Correct 23 ms 63060 KB Output is correct
9 Correct 23 ms 63068 KB Output is correct
10 Correct 23 ms 63104 KB Output is correct
11 Correct 23 ms 63068 KB Output is correct
12 Correct 26 ms 63084 KB Output is correct
13 Correct 22 ms 63060 KB Output is correct
14 Correct 22 ms 63064 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 23 ms 63052 KB Output is correct
17 Correct 23 ms 63032 KB Output is correct
18 Correct 23 ms 63100 KB Output is correct
19 Correct 26 ms 63068 KB Output is correct
20 Correct 23 ms 63060 KB Output is correct
21 Correct 22 ms 63076 KB Output is correct
22 Correct 23 ms 63068 KB Output is correct
23 Correct 26 ms 63040 KB Output is correct
24 Correct 23 ms 63064 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 22 ms 63056 KB Output is correct
27 Correct 23 ms 63056 KB Output is correct
28 Correct 23 ms 63068 KB Output is correct
29 Correct 23 ms 63116 KB Output is correct
30 Correct 23 ms 63092 KB Output is correct
31 Correct 23 ms 63068 KB Output is correct
32 Correct 23 ms 63068 KB Output is correct
33 Correct 23 ms 63088 KB Output is correct
34 Correct 23 ms 63088 KB Output is correct
35 Correct 22 ms 2520 KB Output is correct
36 Correct 48 ms 65196 KB Output is correct
37 Correct 44 ms 64968 KB Output is correct
38 Correct 50 ms 65592 KB Output is correct
39 Correct 49 ms 66112 KB Output is correct
40 Correct 47 ms 66456 KB Output is correct
41 Correct 43 ms 65644 KB Output is correct
42 Correct 43 ms 65616 KB Output is correct
43 Correct 47 ms 66432 KB Output is correct
44 Correct 43 ms 65616 KB Output is correct
45 Correct 46 ms 66388 KB Output is correct
46 Correct 48 ms 65992 KB Output is correct
47 Correct 47 ms 66440 KB Output is correct
48 Correct 47 ms 66300 KB Output is correct
49 Correct 49 ms 66132 KB Output is correct
50 Correct 45 ms 66132 KB Output is correct