oj.uz

Submission #625572

# Submission time Handle Problem Language Result Execution time Memory
625572 2022-08-10T15:06:07 Z Huy Knapsack (NOI18_knapsack) C++17
100 / 100
 66 ms 3680 KB 
/// punch then pray
#include<bits/stdc++.h>
//#define int long long
#define pii pair<int,int>
#define fi first
#define se second
/*#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")*/
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldb = long double;
const int N = (int)1e5 ;
const int maxN = (int)5e5 + 1;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const ll infty = 1e18 + 7;
const int base = (int)4e5;
const int block_size = 710;

void InputFile()
{
    //freopen("feast.in","r",stdin);
    //freopen("feast.out","w",stdout);
    //freopen("test.inp","r",stdin);
    //freopen("test.out","w",stdout);
}

void FastInput()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

struct Tdata
{
    int val,wei,cop;
};

int S,n;
Tdata a[maxN];
int dp[2][2001];
vector<int> save[2001];

bool FA(Tdata x,Tdata y)
{
    return x.val > y.val;
}

void Read()
{
    cin >> S >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i].val >> a[i].wei >> a[i].cop;
    }
    sort(a + 1,a + n + 1,FA);
    for(int i = 1;i <= n;i++)
    {
        while(save[a[i].wei].size() < (S / a[i].wei) && a[i].cop > 0)
        {
            save[a[i].wei].push_back(a[i].val);
            a[i].cop--;
        }
    }

    for(int i = 1;i <= S;i++)
    {
        int cur = i & 1;
        int pre = cur ^ 1;
        for(int j = 0;j <= S;j++)
        {
            dp[cur][j] = dp[pre][j];
            int used = 0;
            int sum = 0;
            for(int k : save[i])
            {
                sum += k;
                used++;
                if(used * i > j) break;
                dp[cur][j] = max(dp[cur][j],dp[pre][j-used*i] + sum);
            }
        }
    }
    cout << dp[S&1][S];
}

void Solve()
{

}


int32_t main()
{
    FastInput();
    //InputFile();
    //int sub_type;
    //cin >> sub_type;
    //Sieve()
    int test;
    //cin >> test;
    test = 1;
    while(test--)
    {
        Read();
        Solve();
        //Debug();
    }
}
////
/////
//////

Compilation message

knapsack.cpp: In function 'void Read()':
knapsack.cpp:63:37: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |         while(save[a[i].wei].size() < (S / a[i].wei) && a[i].cop > 0)
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 6 ms 392 KB Output is correct
9 Correct 5 ms 392 KB Output is correct
10 Correct 5 ms 400 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 5 ms 392 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 7 ms 340 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 6 ms 400 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 5 ms 340 KB Output is correct
24 Correct 5 ms 392 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 7 ms 388 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 11 ms 400 KB Output is correct
31 Correct 6 ms 396 KB Output is correct
32 Correct 5 ms 340 KB Output is correct
33 Correct 6 ms 340 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 28 ms 1484 KB Output is correct
36 Correct 36 ms 1452 KB Output is correct
37 Correct 32 ms 2524 KB Output is correct
38 Correct 34 ms 2900 KB Output is correct
39 Correct 42 ms 3680 KB Output is correct
40 Correct 59 ms 3660 KB Output is correct
41 Correct 46 ms 2948 KB Output is correct
42 Correct 54 ms 2956 KB Output is correct
43 Correct 66 ms 2880 KB Output is correct
44 Correct 51 ms 2988 KB Output is correct
45 Correct 42 ms 3588 KB Output is correct
46 Correct 31 ms 3428 KB Output is correct
47 Correct 44 ms 3564 KB Output is correct
48 Correct 54 ms 3616 KB Output is correct
49 Correct 33 ms 3404 KB Output is correct
50 Correct 47 ms 3428 KB Output is correct