oj.uz

Submission #982008

# Submission time Handle Problem Language Result Execution time Memory
982008 2024-05-13T18:00:36 Z Amirreza_Fakhri Knapsack (NOI18_knapsack) C++17
12 / 100
 10 ms 25692 KB 
// In the name of the God
#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2")

const int inf = 1e9+7;
const int mod = 998244353;
const int maxw = 2e3+5, maxv = 1e6+5;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int s, n, dp[maxw*15][maxw];
vector <pii> va[maxv];
vector <int> we[maxw];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> s >> n;
    for (int i = 0; i < n; i++) {
        int v, w, k; cin >> v >> w >> k;
        va[v].pb(mp(w, k));
        // while (k--) we[w].pb(v);
    }
    for (int i = 1; i < maxv; i++) {
        for (pii p : va[i]) {
            int w = p.F, k = p.S;
            int left = s/w-we[w].size();
            while (left and k) {
                we[w].pb(i);
                left--, k--;
            }
        }
    }
    int cnt = 1;
    for (int i = 1; i <= s; i++) {
        for (int j : we[i]) {
            for (int k = 1; k <= s; k++) {
                dp[cnt][k] = dp[cnt-1][k];
                if (i <= k) {
                    smax(dp[cnt][k], dp[cnt-1][k-i]+j);
                }
            }
            cnt++;
        }
    }
    cout << dp[cnt-1][s] << '\n';
    return 0;
}





/*
srand(time(0));
cout << (rand()%1900) + 1 << ' ' << (rand()%2)+5 << '\n';
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25692 KB Output is correct
2 Correct 8 ms 25156 KB Output is correct
3 Correct 8 ms 25180 KB Output is correct
4 Correct 8 ms 25180 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 25180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 25180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25692 KB Output is correct
2 Correct 8 ms 25156 KB Output is correct
3 Correct 8 ms 25180 KB Output is correct
4 Correct 8 ms 25180 KB Output is correct
5 Incorrect 10 ms 25180 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25692 KB Output is correct
2 Correct 8 ms 25156 KB Output is correct
3 Correct 8 ms 25180 KB Output is correct
4 Correct 8 ms 25180 KB Output is correct
5 Incorrect 10 ms 25180 KB Output isn't correct
6 Halted 0 ms 0 KB -