oj.uz

Submission #545433

# Submission time Handle Problem Language Result Execution time Memory
545433 2022-04-04T14:01:39 Z AA_Surely Knapsack (NOI18_knapsack) C++17
100 / 100
 98 ms 19412 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int MAXN = 2000 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

int s, n;
int dp[MAXN][MAXN];
VPII group[MAXN];

inline int get(int x, int y) {
    int ret = max(dp[x - 1][y], dp[x][y - 1]);
    if (group[x].empty()) return ret;

    int ptr = 0, cap = y, val = 0;
    int keep = 0;
    
    while(1) {
        if (ptr < group[x].size() && !group[x][ptr].S) {
            group[x][ptr].S = keep;
            keep = 0;
            ptr++;
        }
        
        //if (x == 15 && y == 15) cout << ptr << endl;
        if (ptr >= group[x].size()) break;
        cap -= x; group[x][ptr].S--; val += group[x][ptr].F;
        keep++;

        if (cap < 0) break;
        //if (x == 15 && y == 15) cout << "ret is max(ret, " << dp[x - 1][cap] + val << ") " << endl;
        ret = max(ret, dp[x - 1][cap] + val);
    }
    if (ptr < group[x].size()) group[x][ptr].S += keep;

    return ret;
}

int main() {
    IOS;
    
    cin >> s >> n;
    int v, w, k;
    F0R(i, n) {
        cin >> v >> w >> k;
        group[w].pb({v, k});
    }

    FOR(i, 1, s + 1) sort(RALL(group[i]));
    FOR(i, 1, s + 1) FOR(j, 1, s + 1) 
        dp[i][j] = get(i, j);
    
    //cout << dp[15][15] << endl;
    cout << dp[s][s];
}

Compilation message

knapsack.cpp: In function 'int get(int, int)':
knapsack.cpp:47:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         if (ptr < group[x].size() && !group[x][ptr].S) {
      |             ~~~~^~~~~~~~~~~~~~~~~
knapsack.cpp:54:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         if (ptr >= group[x].size()) break;
      |             ~~~~^~~~~~~~~~~~~~~~~~
knapsack.cpp:62:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     if (ptr < group[x].size()) group[x][ptr].S += keep;
      |         ~~~~^~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10048 KB Output is correct
2 Correct 10 ms 10068 KB Output is correct
3 Correct 10 ms 9980 KB Output is correct
4 Correct 11 ms 10016 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 25 ms 16008 KB Output is correct
3 Correct 23 ms 15948 KB Output is correct
4 Correct 21 ms 15968 KB Output is correct
5 Correct 20 ms 16024 KB Output is correct
6 Correct 21 ms 16076 KB Output is correct
7 Correct 22 ms 15980 KB Output is correct
8 Correct 21 ms 16004 KB Output is correct
9 Correct 21 ms 15944 KB Output is correct
10 Correct 22 ms 15952 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 25 ms 16008 KB Output is correct
3 Correct 23 ms 15948 KB Output is correct
4 Correct 21 ms 15968 KB Output is correct
5 Correct 20 ms 16024 KB Output is correct
6 Correct 21 ms 16076 KB Output is correct
7 Correct 22 ms 15980 KB Output is correct
8 Correct 21 ms 16004 KB Output is correct
9 Correct 21 ms 15944 KB Output is correct
10 Correct 22 ms 15952 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 24 ms 16028 KB Output is correct
13 Correct 22 ms 15992 KB Output is correct
14 Correct 20 ms 15964 KB Output is correct
15 Correct 22 ms 16032 KB Output is correct
16 Correct 24 ms 15988 KB Output is correct
17 Correct 22 ms 16028 KB Output is correct
18 Correct 21 ms 15956 KB Output is correct
19 Correct 27 ms 16076 KB Output is correct
20 Correct 23 ms 15952 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10048 KB Output is correct
2 Correct 10 ms 10068 KB Output is correct
3 Correct 10 ms 9980 KB Output is correct
4 Correct 11 ms 10016 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 25 ms 16008 KB Output is correct
7 Correct 23 ms 15948 KB Output is correct
8 Correct 21 ms 15968 KB Output is correct
9 Correct 20 ms 16024 KB Output is correct
10 Correct 21 ms 16076 KB Output is correct
11 Correct 22 ms 15980 KB Output is correct
12 Correct 21 ms 16004 KB Output is correct
13 Correct 21 ms 15944 KB Output is correct
14 Correct 22 ms 15952 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 24 ms 16028 KB Output is correct
17 Correct 22 ms 15992 KB Output is correct
18 Correct 20 ms 15964 KB Output is correct
19 Correct 22 ms 16032 KB Output is correct
20 Correct 24 ms 15988 KB Output is correct
21 Correct 22 ms 16028 KB Output is correct
22 Correct 21 ms 15956 KB Output is correct
23 Correct 27 ms 16076 KB Output is correct
24 Correct 23 ms 15952 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 28 ms 15948 KB Output is correct
27 Correct 22 ms 16060 KB Output is correct
28 Correct 20 ms 15996 KB Output is correct
29 Correct 21 ms 15948 KB Output is correct
30 Correct 23 ms 15996 KB Output is correct
31 Correct 21 ms 15948 KB Output is correct
32 Correct 24 ms 16016 KB Output is correct
33 Correct 22 ms 15976 KB Output is correct
34 Correct 23 ms 15980 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10048 KB Output is correct
2 Correct 10 ms 10068 KB Output is correct
3 Correct 10 ms 9980 KB Output is correct
4 Correct 11 ms 10016 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 25 ms 16008 KB Output is correct
7 Correct 23 ms 15948 KB Output is correct
8 Correct 21 ms 15968 KB Output is correct
9 Correct 20 ms 16024 KB Output is correct
10 Correct 21 ms 16076 KB Output is correct
11 Correct 22 ms 15980 KB Output is correct
12 Correct 21 ms 16004 KB Output is correct
13 Correct 21 ms 15944 KB Output is correct
14 Correct 22 ms 15952 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 24 ms 16028 KB Output is correct
17 Correct 22 ms 15992 KB Output is correct
18 Correct 20 ms 15964 KB Output is correct
19 Correct 22 ms 16032 KB Output is correct
20 Correct 24 ms 15988 KB Output is correct
21 Correct 22 ms 16028 KB Output is correct
22 Correct 21 ms 15956 KB Output is correct
23 Correct 27 ms 16076 KB Output is correct
24 Correct 23 ms 15952 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 28 ms 15948 KB Output is correct
27 Correct 22 ms 16060 KB Output is correct
28 Correct 20 ms 15996 KB Output is correct
29 Correct 21 ms 15948 KB Output is correct
30 Correct 23 ms 15996 KB Output is correct
31 Correct 21 ms 15948 KB Output is correct
32 Correct 24 ms 16016 KB Output is correct
33 Correct 22 ms 15976 KB Output is correct
34 Correct 23 ms 15980 KB Output is correct
35 Correct 30 ms 2356 KB Output is correct
36 Correct 68 ms 18284 KB Output is correct
37 Correct 52 ms 17992 KB Output is correct
38 Correct 52 ms 18364 KB Output is correct
39 Correct 72 ms 19072 KB Output is correct
40 Correct 98 ms 19324 KB Output is correct
41 Correct 74 ms 18452 KB Output is correct
42 Correct 70 ms 18508 KB Output is correct
43 Correct 87 ms 18496 KB Output is correct
44 Correct 89 ms 18540 KB Output is correct
45 Correct 59 ms 19368 KB Output is correct
46 Correct 56 ms 18884 KB Output is correct
47 Correct 64 ms 19412 KB Output is correct
48 Correct 79 ms 19336 KB Output is correct
49 Correct 62 ms 19044 KB Output is correct
50 Correct 77 ms 18980 KB Output is correct