oj.uz

Submission #497269

# Submission time Handle Problem Language Result Execution time Memory
497269 2021-12-22T22:15:29 Z RandomLB Knapsack (NOI18_knapsack) C++17
100 / 100
 41 ms 3656 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<double, double> point;
typedef tuple<int, int, int> tp;  //-------LL
typedef unordered_set<ll> uset;
typedef priority_queue<pll, vector<pll>, greater<pll>> djk;
typedef long long C;
typedef complex<C> P;
#define pb push_back
#define ms(a,b) memset(a,b,sizeof(a))
#define maxE(a) *max_element(a, a+sizeof(a)/sizeof(a[0]))
#define minE(a) *min_element(a, a+sizeof(a)/sizeof(a[0]))
#define F first
#define S second
#define siz(a) (int)a.size()
#define len(a) (int)a.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bits(x) __builtin_popcount(x)
#define vvll vector<vector<ll>>
#define FOR(a, n) for (int a = 0; a < n; a++)
#define fin(s) {cout << s << "\n"; return;}
#define finm(s) {cout << s << "\n"; return 0;}
#define X real()
#define Y imag()
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cout << vars << " = ";
    string delim = "";
    (..., (cout << delim << values, delim = ", "));
    cout << endl;
}
template<class T>
istream& operator >> (istream& is, complex<T>& p) {
  T value;
  is >> value; p.real(value);
  is >> value; p.imag(value);
  return is;
}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1e9+7;
const double pie = 2*acos(0.0);
//------------------------------------------------------------
const int MAX = 2005;
int dp[MAX];
vector<pi> use[MAX];

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int s, n;
    cin >> s >> n;
    bool curr = 1;
    for (int i = 1; i <= n; i++){
        int v, w, k;
        cin >> v >> w >> k;
        use[w].pb({v, k});
    }
    for (int i = 1; i <= s; i++){
        sort(rall(use[i]));
        int curr = 0;
        for (int j = 0; j < siz(use[i]); j++){
            curr += use[i][j].S;
            if (curr >= s/i){
                while (siz(use[i]) > j+1) use[i].pop_back();
                break;
            }
        }
    }
    for (int i = 1; i <= s; i++){
        for (auto[v, k]: use[i]){
            k = min(k, s/i);
            int curr = 0;
            while (k){
                int sz = min((1<<curr), k); curr++;
                for (int j = s; j >= i*sz; j--) dp[j] = max(dp[j], dp[j-i*sz] + sz*v);
                k -= sz;
            }
        }
    }
    cout << dp[s] << "\n";
}

/* stuff you should look for
	* int overflow, array bounds
	* test case inputs don't carry over (DON'T RETURN EARLY)
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:61:10: warning: unused variable 'curr' [-Wunused-variable]
   61 |     bool curr = 1;
      |          ^~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 356 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 364 KB Output is correct

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 360 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 25 ms 2280 KB Output is correct
36 Correct 29 ms 2148 KB Output is correct
37 Correct 39 ms 2408 KB Output is correct
38 Correct 27 ms 2616 KB Output is correct
39 Correct 33 ms 3292 KB Output is correct
40 Correct 35 ms 3608 KB Output is correct
41 Correct 32 ms 2768 KB Output is correct
42 Correct 34 ms 2812 KB Output is correct
43 Correct 41 ms 2844 KB Output is correct
44 Correct 35 ms 2852 KB Output is correct
45 Correct 35 ms 3652 KB Output is correct
46 Correct 34 ms 3092 KB Output is correct
47 Correct 37 ms 3656 KB Output is correct
48 Correct 34 ms 3492 KB Output is correct
49 Correct 32 ms 3404 KB Output is correct
50 Correct 39 ms 3236 KB Output is correct