oj.uz

Submission #446372

# Submission time Handle Problem Language Result Execution time Memory
446372 2021-07-21T18:32:26 Z Bungmint Knapsack (NOI18_knapsack) C++17
73 / 100
 1000 ms 2796 KB 
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
using pl = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pl>;
using ld = long double;

#define all(v) (v).begin(), (v).end()
#define ar array
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound

template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
    return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v)
{
    os << '{';
    string sep;
    for (const T &x : v)
        os << sep << x, sep = ", ";
    return os << '}';
}
void dbg_out()
{
    cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

struct custom_hash
{
    static uint64_t splitmix64(uint64_t x)
    {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const
    {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

void setIO(string s)
{
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

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

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;

struct Product{
	int v, w, k;
};

void solve()
{
	int s, n;
	cin >> s >> n;
	vl dp(s+1, -1), nxt(s+1, -1);
	vector<Product> a(n);
	for (int i=0;i<n;++i) cin >> a[i].v >> a[i].w >> a[i].k;
	dp[0] = 0;
	for (int i=1;i<=n;++i){
		Product p = a[i-1];
		for (ll j=0;j<p.w;++j){
			multiset<ll, greater<ll>> vals;
			for (ll k=0;k*p.w+j<=s;++k){
				dbg(i, k, vals);
				if (k>=p.k+1){
					if (dp[j+(k-p.k-1)*p.w]!=-1){
						auto it = vals.lb(dp[j+(k-p.k-1)*p.w]-(k-p.k-1)*p.v);
						if (it!=vals.end())vals.erase(it);
					}
				}
				nxt[j+k*p.w] = dp[j+k*p.w];
				if (sz(vals)){
					nxt[j+k*p.w] = max(nxt[j+k*p.w], k*p.v + *vals.begin());
				}
				if (dp[j+k*p.w]!=-1) vals.insert(dp[j+k*p.w]-k*p.v);
			}
		}
		dp = nxt;
		dbg(dp);
	}
	ll res = 0;
	for (int i=0;i<=s;++i) res = max(res, dp[i]);
	cout << res << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message

knapsack.cpp: In function 'void setIO(std::string)':
knapsack.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:75:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 1 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 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 316 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 6 ms 332 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 7 ms 332 KB Output is correct
10 Correct 6 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 316 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 6 ms 332 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 7 ms 332 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 332 KB Output is correct
17 Correct 6 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Correct 7 ms 332 KB Output is correct
20 Correct 5 ms 320 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 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 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 6 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 6 ms 332 KB Output is correct
21 Correct 6 ms 332 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 7 ms 332 KB Output is correct
24 Correct 5 ms 320 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 24 ms 440 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 5 ms 332 KB Output is correct
32 Correct 5 ms 312 KB Output is correct
33 Correct 6 ms 332 KB Output is correct
34 Correct 6 ms 356 KB Output is correct

Subtask #5
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 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 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 6 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 6 ms 332 KB Output is correct
21 Correct 6 ms 332 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 7 ms 332 KB Output is correct
24 Correct 5 ms 320 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 24 ms 440 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 5 ms 332 KB Output is correct
32 Correct 5 ms 312 KB Output is correct
33 Correct 6 ms 332 KB Output is correct
34 Correct 6 ms 356 KB Output is correct
35 Correct 32 ms 2508 KB Output is correct
36 Execution timed out 1092 ms 2796 KB Time limit exceeded
37 Halted 0 ms 0 KB -