oj.uz

Submission #526862

# Submission time Handle Problem Language Result Execution time Memory
526862 2022-02-16T11:58:03 Z elesis Knapsack (NOI18_knapsack) C++14
100 / 100
 66 ms 4952 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);
#define int long long 
#define pii pair<int,int> 
#define ff first
#define ss second
const int inf=1e9+7;
const int S=2007;
int dp[2007];
vector <pii> arr[2007];
//dp[i][j] represents the maximum value which can be obtained after choosing i objects with a total weight of j.
void solve()
{
    int N,W,ans=INT_MIN;
    cin>>W>>N;
        for(int i=0;i<N;i++)
    {
        int u,v,e;
        cin>>u>>v>>e;
        arr[v].push_back({u,e});
    }
    for(int i=1;i<=W;i++)
    {
        sort(arr[i].begin(),arr[i].end(),greater <pii> ());
        int cur=0; //the object we're traversing with weight i.
        for(int j=0;j<W/i;j++)
        {
            if(cur>=arr[i].size())
            {
                break;
            }
            for(int k=W;k>=i;k--)
            {
                dp[k]=max(dp[k],dp[k-i]+arr[i][cur].first);
                ans=max(ans,dp[k]);
            }
            arr[i][cur].second--;
            if(arr[i][cur].second==0) cur++;
        }
    }
    cout << ans << "\n";
}
signed main()
{
    fast
    clock_t start, end;
    start = clock();
    solve();
    end = clock();
    double time_taken=double(end-start)/double(CLOCKS_PER_SEC);
    //cout << "time taken" << " " << time_taken << "\n";
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:29:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             if(cur>=arr[i].size())
      |                ~~~^~~~~~~~~~~~~~~
knapsack.cpp: In function 'int main()':
knapsack.cpp:51:12: warning: unused variable 'time_taken' [-Wunused-variable]
   51 |     double time_taken=double(end-start)/double(CLOCKS_PER_SEC);
      |            ^~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 368 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 368 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 5 ms 380 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 360 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 332 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 368 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 5 ms 380 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 360 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 35 ms 3312 KB Output is correct
36 Correct 33 ms 3544 KB Output is correct
37 Correct 31 ms 3444 KB Output is correct
38 Correct 29 ms 3696 KB Output is correct
39 Correct 36 ms 4272 KB Output is correct
40 Correct 66 ms 4704 KB Output is correct
41 Correct 43 ms 3992 KB Output is correct
42 Correct 43 ms 3956 KB Output is correct
43 Correct 60 ms 3924 KB Output is correct
44 Correct 56 ms 3916 KB Output is correct
45 Correct 33 ms 4748 KB Output is correct
46 Correct 35 ms 4020 KB Output is correct
47 Correct 36 ms 4952 KB Output is correct
48 Correct 51 ms 4676 KB Output is correct
49 Correct 31 ms 4456 KB Output is correct
50 Correct 50 ms 4176 KB Output is correct