oj.uz

답안 #824581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824581 2023-08-14T07:58:39 Z pickle_juice2023 Knapsack (NOI18_knapsack) C++17
29 / 100
 26 ms 31700 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int MAX = 2002;
vector<pair<ll, ll>> a[MAX];
ll f[MAX][MAX], s, n, u, v, w, k, total;

void solve() {
    cin >> s >> n;
    for (int i = 1; i <= n; i++) {
        cin >> v >> w >> k;
        a[w].push_back({v, k});
    }
    for (int i = 1; i <= 2000; i++) sort(a[i].begin(), a[i].end(), greater<pair<ll, ll>>());
    for (int i = 1; i <= s; i++) {
        for (int j = 1; j <= s; j++) {
            total = 0;
            ll temp = 0;
            f[i][j] = f[i - 1][j];
            for (auto u : a[i]) {
                if (total + u.second * i <= j) {
                    total += u.second * i;
                    temp += u.second * u.first;
                    f[i][j] = max(f[i][j], temp + f[i - 1][j - total]);
                } else {
                    temp += (j - total) / i * u.first;
                    //total += (j - total) * i;
                    f[i][j] = max(f[i][j], temp + f[i - 1][0]);
                    break;
                }
            }
            f[i][j] = max(f[i][j], temp + f[i - 1][j - total]);
            //if (i > 19) cout << f[i][j] << " ";
        }
        //if (i > 19) cout << "\n";
    }
    cout << f[s][s];
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 17236 KB Output is correct
2 Correct 9 ms 17236 KB Output is correct
3 Correct 9 ms 17188 KB Output is correct
4 Correct 9 ms 17204 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 17 ms 31672 KB Output is correct
3 Correct 18 ms 31584 KB Output is correct
4 Correct 19 ms 31572 KB Output is correct
5 Correct 19 ms 31572 KB Output is correct
6 Correct 18 ms 31700 KB Output is correct
7 Correct 17 ms 31608 KB Output is correct
8 Correct 21 ms 31620 KB Output is correct
9 Correct 19 ms 31616 KB Output is correct
10 Correct 26 ms 31664 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 17 ms 31672 KB Output is correct
3 Correct 18 ms 31584 KB Output is correct
4 Correct 19 ms 31572 KB Output is correct
5 Correct 19 ms 31572 KB Output is correct
6 Correct 18 ms 31700 KB Output is correct
7 Correct 17 ms 31608 KB Output is correct
8 Correct 21 ms 31620 KB Output is correct
9 Correct 19 ms 31616 KB Output is correct
10 Correct 26 ms 31664 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 18 ms 31664 KB Output is correct
13 Correct 19 ms 31564 KB Output is correct
14 Correct 21 ms 31624 KB Output is correct
15 Incorrect 18 ms 31636 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 17236 KB Output is correct
2 Correct 9 ms 17236 KB Output is correct
3 Correct 9 ms 17188 KB Output is correct
4 Correct 9 ms 17204 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 17 ms 31672 KB Output is correct
7 Correct 18 ms 31584 KB Output is correct
8 Correct 19 ms 31572 KB Output is correct
9 Correct 19 ms 31572 KB Output is correct
10 Correct 18 ms 31700 KB Output is correct
11 Correct 17 ms 31608 KB Output is correct
12 Correct 21 ms 31620 KB Output is correct
13 Correct 19 ms 31616 KB Output is correct
14 Correct 26 ms 31664 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 18 ms 31664 KB Output is correct
17 Correct 19 ms 31564 KB Output is correct
18 Correct 21 ms 31624 KB Output is correct
19 Incorrect 18 ms 31636 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 17236 KB Output is correct
2 Correct 9 ms 17236 KB Output is correct
3 Correct 9 ms 17188 KB Output is correct
4 Correct 9 ms 17204 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 17 ms 31672 KB Output is correct
7 Correct 18 ms 31584 KB Output is correct
8 Correct 19 ms 31572 KB Output is correct
9 Correct 19 ms 31572 KB Output is correct
10 Correct 18 ms 31700 KB Output is correct
11 Correct 17 ms 31608 KB Output is correct
12 Correct 21 ms 31620 KB Output is correct
13 Correct 19 ms 31616 KB Output is correct
14 Correct 26 ms 31664 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 18 ms 31664 KB Output is correct
17 Correct 19 ms 31564 KB Output is correct
18 Correct 21 ms 31624 KB Output is correct
19 Incorrect 18 ms 31636 KB Output isn't correct
20 Halted 0 ms 0 KB -