oj.uz

답안 #484677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484677 2021-11-05T03:23:05 Z Qkake Knapsack (NOI18_knapsack) C++17
73 / 100
 145 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

typedef pair<int, int> pi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pli> vli;
typedef vector<pil> vil;

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int oo = 1000000007;
const int MX = 100001;
const ld PI = 4 * atan((ld)1);

int n, s;
vi v, w, t;
bool avai;
vpi val[MX]; set<int> p;

void solve() {
	cin >> s >> n;
	v.resize(n + 1); w.resize(n + 1); t.resize(n + 1); avai = false;
	for (int i = 1; i <= n; i++) { 
		cin >> v[i] >> w[i] >> t[i]; if (t[i] != 1) avai = true; 
		val[w[i]].pb({v[i], t[i]}); p.insert(w[i]);
	}

	if (!avai) {
		vector<vl> dp(n + 1, vl(s + 1, 0)); ll res = 0;
		for (int i = 0; i < n; i++) for (int j = 0; j <= s; j++) {
			dp[i + 1][j] = dp[i][j];
			if (j - w[i + 1] >= 0) dp[i + 1][j] = max(dp[i][j], dp[i][j - w[i + 1]] + v[i + 1]); 
		}
		for (int j = 0; j <= s; j++) res = max(res, dp[n][j]);
		cout << res; return;
	}

	vector<vl> dp(sz(p) + 1, vl(s + 1, 0));
	int i = 0;
	for (int wi = 0; wi <= s; wi++) if (sz(val[wi])) {
		vpi sta = val[wi]; sort(all(sta), greater<pi>());
		for (int j = 0; j <= s; j++) {
			dp[i + 1][j] = dp[i][j];
			int times = 1, cnt = 1, used = 0; ll value = 0;
			while (j - times * wi >= 0 && used < sz(sta)) {
				value += sta[used].f;
				dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - times * wi] + value);
				if (cnt == sta[used].s) { used++; cnt = 0; }
				times++; cnt++;
			}
		}
		i++;
	}
	ll res = 0;
	for (int j = 0; j <= s; j++) res = max(res, dp[sz(p)][j]);
	cout << res;
}

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

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4300 KB Output is correct
4 Correct 3 ms 4200 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 3 ms 4172 KB Output is correct
7 Correct 3 ms 4200 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4196 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4300 KB Output is correct
4 Correct 3 ms 4200 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 3 ms 4172 KB Output is correct
7 Correct 3 ms 4200 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4196 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 5 ms 2636 KB Output is correct
13 Correct 3 ms 4200 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 3 ms 4172 KB Output is correct
17 Correct 3 ms 4204 KB Output is correct
18 Correct 4 ms 4172 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 3 ms 4208 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 4172 KB Output is correct
7 Correct 3 ms 4300 KB Output is correct
8 Correct 3 ms 4200 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 3 ms 4200 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 3 ms 4196 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 2636 KB Output is correct
17 Correct 3 ms 4200 KB Output is correct
18 Correct 3 ms 4172 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 3 ms 4204 KB Output is correct
22 Correct 4 ms 4172 KB Output is correct
23 Correct 3 ms 4172 KB Output is correct
24 Correct 3 ms 4208 KB Output is correct
25 Correct 3 ms 2636 KB Output is correct
26 Correct 7 ms 2636 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 3 ms 4172 KB Output is correct
29 Correct 2 ms 2764 KB Output is correct
30 Correct 5 ms 4172 KB Output is correct
31 Correct 3 ms 4172 KB Output is correct
32 Correct 3 ms 4172 KB Output is correct
33 Correct 4 ms 4172 KB Output is correct
34 Correct 3 ms 4172 KB Output is correct

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 4172 KB Output is correct
7 Correct 3 ms 4300 KB Output is correct
8 Correct 3 ms 4200 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 3 ms 4200 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 3 ms 4196 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 2636 KB Output is correct
17 Correct 3 ms 4200 KB Output is correct
18 Correct 3 ms 4172 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 3 ms 4204 KB Output is correct
22 Correct 4 ms 4172 KB Output is correct
23 Correct 3 ms 4172 KB Output is correct
24 Correct 3 ms 4208 KB Output is correct
25 Correct 3 ms 2636 KB Output is correct
26 Correct 7 ms 2636 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 3 ms 4172 KB Output is correct
29 Correct 2 ms 2764 KB Output is correct
30 Correct 5 ms 4172 KB Output is correct
31 Correct 3 ms 4172 KB Output is correct
32 Correct 3 ms 4172 KB Output is correct
33 Correct 4 ms 4172 KB Output is correct
34 Correct 3 ms 4172 KB Output is correct
35 Correct 29 ms 11080 KB Output is correct
36 Correct 38 ms 6716 KB Output is correct
37 Runtime error 145 ms 262148 KB Execution killed with signal 9
38 Halted 0 ms 0 KB -