oj.uz

Submission #916634

# Submission time Handle Problem Language Result Execution time Memory
916634 2024-01-26T07:58:04 Z Amr Knapsack (NOI18_knapsack) C++14
100 / 100
 70 ms 14424 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define S second
#define F first
#define all(x) (x).begin(),(x).end()
#define sz size()
#define Yes cout << "YES" << endl
#define No cout << "NO" << endl
#define pb(x) push_back(x);
#define endl '\n'
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N=3e5+7;
ll INF=INT_MAX,mod=1e9+7;
int TT=1;
ll power(ll x, unsigned int y)
{
    ll res = 1;
    x = x; // % mod;
    if (x == 0) return 0;
    while (y > 0)
    {
        if (y & 1) res = (res*x)  ; // % mod;
        y = y>>1;
        x = (x*x) ; // % mod;
    }
    return res;
}
ll dp[N];
vector<pair<ll,ll> > b[N];
void solve()
{
    memset(dp,-1,sizeof dp);
    ll n , s; cin >> n >> s; swap(n,s);
    for(int i = 1; i <= n; i++)
    {
        ll price , w , k ;cin >> price >> w >> k;
        b[w].push_back({price,k});
    }
    for(int i = 1; i <= s; i++) if(b[i].sz)sort(all(b[i]),greater<pair<ll,ll> > ());
    dp[0] = 0;
    for(int i = 1; i<= s; i++)
    {
        if(b[i].sz==0) continue;

        for(int j = s; j>= 0; j--)
        {
            ll c = 1;
            ll cursum = 0;
            ll alllst = 0;
            ll l= 0;
            while(j-i*c>=0&&l<b[i].sz)
            {
                cursum+=b[i][l].F;
                if(dp[j-i*c] !=-1)
                dp[j] = max(dp[j],dp[j-i*c]+cursum);
                if(alllst+b[i][l].S==c) alllst+=b[i][l].S,l++;
                c++;
            }
        }
    }
    ll mx = 0;
    for(int i = 1; i<=s; i++) mx = max(mx,dp[i]);
    cout << mx << endl;
}
int main(){
    //freopen("friday.in","r",stdin);
    //freopen("friday.out","w",stdout);
    fast;
    while(TT--)
        solve();

    return 0;
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:53:30: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             while(j-i*c>=0&&l<b[i].sz)
      |                              ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9816 KB Output is correct
2 Correct 5 ms 9816 KB Output is correct
3 Correct 6 ms 9820 KB Output is correct
4 Correct 6 ms 9804 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9820 KB Output is correct
2 Correct 5 ms 9820 KB Output is correct
3 Correct 5 ms 9820 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 5 ms 9844 KB Output is correct
6 Correct 6 ms 9688 KB Output is correct
7 Correct 6 ms 9856 KB Output is correct
8 Correct 7 ms 9820 KB Output is correct
9 Correct 6 ms 9820 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9820 KB Output is correct
2 Correct 5 ms 9820 KB Output is correct
3 Correct 5 ms 9820 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 5 ms 9844 KB Output is correct
6 Correct 6 ms 9688 KB Output is correct
7 Correct 6 ms 9856 KB Output is correct
8 Correct 7 ms 9820 KB Output is correct
9 Correct 6 ms 9820 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct
11 Correct 4 ms 9716 KB Output is correct
12 Correct 7 ms 9800 KB Output is correct
13 Correct 5 ms 9636 KB Output is correct
14 Correct 5 ms 9856 KB Output is correct
15 Correct 6 ms 9848 KB Output is correct
16 Correct 7 ms 9840 KB Output is correct
17 Correct 6 ms 9820 KB Output is correct
18 Correct 4 ms 9852 KB Output is correct
19 Correct 5 ms 9848 KB Output is correct
20 Correct 5 ms 9820 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9816 KB Output is correct
2 Correct 5 ms 9816 KB Output is correct
3 Correct 6 ms 9820 KB Output is correct
4 Correct 6 ms 9804 KB Output is correct
5 Correct 6 ms 9820 KB Output is correct
6 Correct 5 ms 9820 KB Output is correct
7 Correct 5 ms 9820 KB Output is correct
8 Correct 5 ms 9820 KB Output is correct
9 Correct 5 ms 9844 KB Output is correct
10 Correct 6 ms 9688 KB Output is correct
11 Correct 6 ms 9856 KB Output is correct
12 Correct 7 ms 9820 KB Output is correct
13 Correct 6 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 4 ms 9716 KB Output is correct
16 Correct 7 ms 9800 KB Output is correct
17 Correct 5 ms 9636 KB Output is correct
18 Correct 5 ms 9856 KB Output is correct
19 Correct 6 ms 9848 KB Output is correct
20 Correct 7 ms 9840 KB Output is correct
21 Correct 6 ms 9820 KB Output is correct
22 Correct 4 ms 9852 KB Output is correct
23 Correct 5 ms 9848 KB Output is correct
24 Correct 5 ms 9820 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 8 ms 9820 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 5 ms 9820 KB Output is correct
29 Correct 4 ms 9824 KB Output is correct
30 Correct 6 ms 9832 KB Output is correct
31 Correct 5 ms 9832 KB Output is correct
32 Correct 6 ms 9864 KB Output is correct
33 Correct 5 ms 9832 KB Output is correct
34 Correct 6 ms 9832 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9816 KB Output is correct
2 Correct 5 ms 9816 KB Output is correct
3 Correct 6 ms 9820 KB Output is correct
4 Correct 6 ms 9804 KB Output is correct
5 Correct 6 ms 9820 KB Output is correct
6 Correct 5 ms 9820 KB Output is correct
7 Correct 5 ms 9820 KB Output is correct
8 Correct 5 ms 9820 KB Output is correct
9 Correct 5 ms 9844 KB Output is correct
10 Correct 6 ms 9688 KB Output is correct
11 Correct 6 ms 9856 KB Output is correct
12 Correct 7 ms 9820 KB Output is correct
13 Correct 6 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 4 ms 9716 KB Output is correct
16 Correct 7 ms 9800 KB Output is correct
17 Correct 5 ms 9636 KB Output is correct
18 Correct 5 ms 9856 KB Output is correct
19 Correct 6 ms 9848 KB Output is correct
20 Correct 7 ms 9840 KB Output is correct
21 Correct 6 ms 9820 KB Output is correct
22 Correct 4 ms 9852 KB Output is correct
23 Correct 5 ms 9848 KB Output is correct
24 Correct 5 ms 9820 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 8 ms 9820 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 5 ms 9820 KB Output is correct
29 Correct 4 ms 9824 KB Output is correct
30 Correct 6 ms 9832 KB Output is correct
31 Correct 5 ms 9832 KB Output is correct
32 Correct 6 ms 9864 KB Output is correct
33 Correct 5 ms 9832 KB Output is correct
34 Correct 6 ms 9832 KB Output is correct
35 Correct 36 ms 12768 KB Output is correct
36 Correct 32 ms 13028 KB Output is correct
37 Correct 31 ms 12804 KB Output is correct
38 Correct 31 ms 12988 KB Output is correct
39 Correct 34 ms 13720 KB Output is correct
40 Correct 70 ms 14208 KB Output is correct
41 Correct 52 ms 13308 KB Output is correct
42 Correct 48 ms 13460 KB Output is correct
43 Correct 54 ms 13476 KB Output is correct
44 Correct 53 ms 13460 KB Output is correct
45 Correct 36 ms 14104 KB Output is correct
46 Correct 34 ms 13488 KB Output is correct
47 Correct 38 ms 14424 KB Output is correct
48 Correct 46 ms 14164 KB Output is correct
49 Correct 30 ms 13848 KB Output is correct
50 Correct 47 ms 13696 KB Output is correct