oj.uz

Submission #488598

# Submission time Handle Problem Language Result Execution time Memory
488598 2021-11-19T18:03:39 Z A_D Knapsack (NOI18_knapsack) C++14
73 / 100
 207 ms 262148 KB 
#include <bits/stdc++.h>

#define int long long
#define ii pair<int,int>
#define F first
#define S second

using namespace std;
const int N=2e3+100;
const int NN=2e5+100;
const int M=2e4+100;
vector<int> vec;
vector<int> w;
int szz[N];
int sz;
pair<ii,int> a[NN];
int dp[M][N];
void solve()
{
    vec.push_back(0);
    w.push_back(0);
    int s,n;
    cin>>s>>n;
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i].F.F);
        scanf("%lld",&a[i].F.S);
        scanf("%lld",&a[i].S);
    }
    sort(a+1,a+n+1);
    reverse(a+1,a+n+1);
    for(int i=1;i<=n;i++){
//        cout<<a[i].S<<" "<<a[i].F.S<<" "<<szz[i]<<endl;
        while(a[i].S&&s>a[i].F.S*szz[a[i].F.S]){
            a[i].S--;
            szz[a[i].F.S]++;
            vec.push_back(a[i].F.F);
            w.push_back(a[i].F.S);
            sz++;
            if(sz>=M){
                return;
            }
        }
    }
    for(int i=1;i<=sz;i++){
        for(int j=1;j<w[i];j++){
            dp[i][j]=dp[i-1][j];
  //          cout<<dp[i][j]<<" ";
        }
        for(int j=w[i];j<=s;j++){
            dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+vec[i]);
    //        cout<<dp[i][j]<<" ";
        }
//        cout<<endl;
    }
    cout<<dp[sz][s]<<endl;
}
main()
{
//    cout<<INT_MAX<<endl;
    /*
    int ans=0;
    for(int i=1;i<=2000;i++){
        ans+=2000/i;
    }
    cout<<ans<<endl;
    */
    //freopen("face.in","r",stdin);
    //freopen("face.out","w",stdout);
    int t=1;
//    cin>>t;
    while(t--){
        solve();
    }
}

Compilation message

knapsack.cpp:57:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main()
      | ^~~~
knapsack.cpp: In function 'void solve()':
knapsack.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         scanf("%lld",&a[i].F.F);
      |         ~~~~~^~~~~~~~~~~~~~~~~~
knapsack.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         scanf("%lld",&a[i].F.S);
      |         ~~~~~^~~~~~~~~~~~~~~~~~
knapsack.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |         scanf("%lld",&a[i].S);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 1996 KB Output is correct
4 Correct 0 ms 204 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 16332 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 5 ms 4940 KB Output is correct
17 Correct 1 ms 1868 KB Output is correct
18 Correct 1 ms 2636 KB Output is correct
19 Correct 2 ms 3660 KB Output is correct
20 Correct 3 ms 3532 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 1996 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 1 ms 1868 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 9 ms 16332 KB Output is correct
17 Correct 1 ms 1868 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 1 ms 1868 KB Output is correct
22 Correct 1 ms 2636 KB Output is correct
23 Correct 2 ms 3660 KB Output is correct
24 Correct 3 ms 3532 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 19 ms 33100 KB Output is correct
27 Correct 1 ms 1868 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 8 ms 12492 KB Output is correct
31 Correct 1 ms 1868 KB Output is correct
32 Correct 1 ms 2508 KB Output is correct
33 Correct 2 ms 3284 KB Output is correct
34 Correct 2 ms 4556 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 1996 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 1 ms 1868 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 9 ms 16332 KB Output is correct
17 Correct 1 ms 1868 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 1 ms 1868 KB Output is correct
22 Correct 1 ms 2636 KB Output is correct
23 Correct 2 ms 3660 KB Output is correct
24 Correct 3 ms 3532 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 19 ms 33100 KB Output is correct
27 Correct 1 ms 1868 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 8 ms 12492 KB Output is correct
31 Correct 1 ms 1868 KB Output is correct
32 Correct 1 ms 2508 KB Output is correct
33 Correct 2 ms 3284 KB Output is correct
34 Correct 2 ms 4556 KB Output is correct
35 Correct 38 ms 3364 KB Output is correct
36 Correct 52 ms 36368 KB Output is correct
37 Correct 67 ms 36344 KB Output is correct
38 Correct 35 ms 3580 KB Output is correct
39 Correct 39 ms 3544 KB Output is correct
40 Runtime error 207 ms 262148 KB Execution killed with signal 9
41 Halted 0 ms 0 KB -