oj.uz

답안 #486247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486247 2021-11-11T03:22:04 Z joshualiu555 Knapsack (NOI18_knapsack) C++14
100 / 100
 407 ms 4976 KB 
/*
  _____                                     _        _
 / ____|                                   | |      | |
| |  __ _ __ __ _ ___ ___ _   _ _ __   ___ | |_ __ _| |_ ___
| | |_ | '__/ _` / __/ __| | | | '_ \ / _ \| __/ _` | __/ _ \
| |__| | | | (_| \__ \__ \ |_| | |_) | (_) | || (_| | || (_) |
 \_____|_|  \__,_|___/___/\__, | .__/ \___/ \__\__,_|\__\___/
                           __/ | |
                          |___/|_|
*/

#include <fstream>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <utility>
#include <array>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <cstring>
#include <climits>
#include <bitset>
#include <string>
#include <sstream>

using namespace std;

#define FOR(i, x, s) for (int i = x; i < s; i++)
#define TRAV(it, x) for (auto it = x.begin(); it != x.end(); it++)

using ll = long long;
const int INF = 2e5 + 5;
const int MOD = 1e9 + 7;
// DURL
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};

ll S, N;
map<ll, vector<pair<ll, ll>>> weight_group;
ll dp[2005];

int main()
{
    std::ios_base::sync_with_stdio(false); cin.tie(0);

//    ifstream cin(".in");
//    ofstream cout(".out");

    cin >> S >> N;
    for (ll i = 0; i < N; i++) {
        ll V, W, K;
        cin >> V >> W >> K;
        weight_group[W].push_back(make_pair(V, K));
    }

    for (ll i = 0; i <= S; i++) {
        if (weight_group[i].empty()) continue;
        sort(weight_group[i].rbegin(), weight_group[i].rend());

        ll id = 0;
        ll current = i;
        ll left = weight_group[i][id].second;
        while (current <= S) {
            if (id == weight_group[i].size()) break;
            for (ll j = S; j >= i; j--) {
                dp[j] = max(dp[j], dp[j - i] + weight_group[i][id].first);
            }
            left--;
            if (left == 0) {
                id++;
                left = weight_group[i][id].second;
            }
            current += i;
        }
    }

    cout << dp[S];

    return 0;
}

/*
 *
*/

//

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:69:20: 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]
   69 |             if (id == weight_group[i].size()) break;
      |                 ~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 440 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 440 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 5 ms 444 KB Output is correct
17 Correct 3 ms 444 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 4 ms 460 KB Output is correct
20 Correct 5 ms 480 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 7 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 5 ms 444 KB Output is correct
21 Correct 3 ms 444 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 5 ms 480 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 16 ms 456 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 14 ms 460 KB Output is correct
31 Correct 3 ms 564 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 4 ms 460 KB Output is correct
34 Correct 6 ms 460 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 7 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 5 ms 444 KB Output is correct
21 Correct 3 ms 444 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 5 ms 480 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 16 ms 456 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 14 ms 460 KB Output is correct
31 Correct 3 ms 564 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 4 ms 460 KB Output is correct
34 Correct 6 ms 460 KB Output is correct
35 Correct 33 ms 3344 KB Output is correct
36 Correct 45 ms 3524 KB Output is correct
37 Correct 46 ms 3312 KB Output is correct
38 Correct 28 ms 3596 KB Output is correct
39 Correct 34 ms 4156 KB Output is correct
40 Correct 344 ms 4960 KB Output is correct
41 Correct 193 ms 4204 KB Output is correct
42 Correct 243 ms 4220 KB Output is correct
43 Correct 407 ms 4208 KB Output is correct
44 Correct 316 ms 4216 KB Output is correct
45 Correct 69 ms 4712 KB Output is correct
46 Correct 32 ms 4040 KB Output is correct
47 Correct 83 ms 4976 KB Output is correct
48 Correct 162 ms 4688 KB Output is correct
49 Correct 34 ms 4420 KB Output is correct
50 Correct 142 ms 4200 KB Output is correct