oj.uz

답안 #469733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469733 2021-09-01T16:45:43 Z Yazan_Alattar Knapsack (NOI18_knapsack) C++14
100 / 100
 321 ms 36320 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 2007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);

vector < pair <ll,ll> > v[M];
ll n, s, dp[M][M];

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> s >> n;
    for(int i = 1; i <= n; ++i){
        ll val, w, k;
        cin >> val >> w >> k;
        v[w].pb({val, k});
    }
    for(int i = 1; i <= s; ++i){
        sort(all(v[i]), greater < pair <ll,ll> > ());
        ll w = 0, add = 0;
        for(auto k : v[i]){
            ll rem = k.S;
            while(rem--){
                w += i;
                add += k.F;
                if(w > s) break;
                for(int j = w; j <= s; ++j)
                    dp[j][i] = max(dp[j][i], dp[j - w][i - 1] + add);
            }
            if(w > s) break;
        }
        for(int j = 1; j <= s; ++j) dp[j][i] = max(dp[j][i], dp[j][i - 1]);
    }
    ll ans = 0;
    for(int i = 1; i <= 2000; ++i) ans = max(ans, dp[i][s]);
    cout << ans << endl;
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 17228 KB Output is correct
2 Correct 21 ms 17228 KB Output is correct
3 Correct 22 ms 17228 KB Output is correct
4 Correct 21 ms 17132 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 72 ms 31748 KB Output is correct
3 Correct 73 ms 31752 KB Output is correct
4 Correct 69 ms 31704 KB Output is correct
5 Correct 71 ms 31672 KB Output is correct
6 Correct 74 ms 31728 KB Output is correct
7 Correct 73 ms 31776 KB Output is correct
8 Correct 72 ms 31656 KB Output is correct
9 Correct 71 ms 31676 KB Output is correct
10 Correct 72 ms 31692 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 72 ms 31748 KB Output is correct
3 Correct 73 ms 31752 KB Output is correct
4 Correct 69 ms 31704 KB Output is correct
5 Correct 71 ms 31672 KB Output is correct
6 Correct 74 ms 31728 KB Output is correct
7 Correct 73 ms 31776 KB Output is correct
8 Correct 72 ms 31656 KB Output is correct
9 Correct 71 ms 31676 KB Output is correct
10 Correct 72 ms 31692 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 95 ms 31688 KB Output is correct
13 Correct 77 ms 31704 KB Output is correct
14 Correct 79 ms 31676 KB Output is correct
15 Correct 71 ms 31704 KB Output is correct
16 Correct 69 ms 31724 KB Output is correct
17 Correct 64 ms 31684 KB Output is correct
18 Correct 65 ms 31752 KB Output is correct
19 Correct 69 ms 31708 KB Output is correct
20 Correct 63 ms 31692 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 17228 KB Output is correct
2 Correct 21 ms 17228 KB Output is correct
3 Correct 22 ms 17228 KB Output is correct
4 Correct 21 ms 17132 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 72 ms 31748 KB Output is correct
7 Correct 73 ms 31752 KB Output is correct
8 Correct 69 ms 31704 KB Output is correct
9 Correct 71 ms 31672 KB Output is correct
10 Correct 74 ms 31728 KB Output is correct
11 Correct 73 ms 31776 KB Output is correct
12 Correct 72 ms 31656 KB Output is correct
13 Correct 71 ms 31676 KB Output is correct
14 Correct 72 ms 31692 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 95 ms 31688 KB Output is correct
17 Correct 77 ms 31704 KB Output is correct
18 Correct 79 ms 31676 KB Output is correct
19 Correct 71 ms 31704 KB Output is correct
20 Correct 69 ms 31724 KB Output is correct
21 Correct 64 ms 31684 KB Output is correct
22 Correct 65 ms 31752 KB Output is correct
23 Correct 69 ms 31708 KB Output is correct
24 Correct 63 ms 31692 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 82 ms 31708 KB Output is correct
27 Correct 65 ms 31780 KB Output is correct
28 Correct 60 ms 31692 KB Output is correct
29 Correct 65 ms 31684 KB Output is correct
30 Correct 64 ms 31712 KB Output is correct
31 Correct 62 ms 31676 KB Output is correct
32 Correct 59 ms 31640 KB Output is correct
33 Correct 60 ms 31684 KB Output is correct
34 Correct 59 ms 31676 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 17228 KB Output is correct
2 Correct 21 ms 17228 KB Output is correct
3 Correct 22 ms 17228 KB Output is correct
4 Correct 21 ms 17132 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 72 ms 31748 KB Output is correct
7 Correct 73 ms 31752 KB Output is correct
8 Correct 69 ms 31704 KB Output is correct
9 Correct 71 ms 31672 KB Output is correct
10 Correct 74 ms 31728 KB Output is correct
11 Correct 73 ms 31776 KB Output is correct
12 Correct 72 ms 31656 KB Output is correct
13 Correct 71 ms 31676 KB Output is correct
14 Correct 72 ms 31692 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 95 ms 31688 KB Output is correct
17 Correct 77 ms 31704 KB Output is correct
18 Correct 79 ms 31676 KB Output is correct
19 Correct 71 ms 31704 KB Output is correct
20 Correct 69 ms 31724 KB Output is correct
21 Correct 64 ms 31684 KB Output is correct
22 Correct 65 ms 31752 KB Output is correct
23 Correct 69 ms 31708 KB Output is correct
24 Correct 63 ms 31692 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 82 ms 31708 KB Output is correct
27 Correct 65 ms 31780 KB Output is correct
28 Correct 60 ms 31692 KB Output is correct
29 Correct 65 ms 31684 KB Output is correct
30 Correct 64 ms 31712 KB Output is correct
31 Correct 62 ms 31676 KB Output is correct
32 Correct 59 ms 31640 KB Output is correct
33 Correct 60 ms 31684 KB Output is correct
34 Correct 59 ms 31676 KB Output is correct
35 Correct 37 ms 3332 KB Output is correct
36 Correct 133 ms 34716 KB Output is correct
37 Correct 130 ms 34544 KB Output is correct
38 Correct 98 ms 35016 KB Output is correct
39 Correct 105 ms 35672 KB Output is correct
40 Correct 282 ms 36148 KB Output is correct
41 Correct 219 ms 35260 KB Output is correct
42 Correct 260 ms 35316 KB Output is correct
43 Correct 321 ms 35348 KB Output is correct
44 Correct 263 ms 35224 KB Output is correct
45 Correct 124 ms 36116 KB Output is correct
46 Correct 113 ms 35432 KB Output is correct
47 Correct 144 ms 36320 KB Output is correct
48 Correct 218 ms 36044 KB Output is correct
49 Correct 106 ms 35912 KB Output is correct
50 Correct 203 ms 35636 KB Output is correct