제출 #648121

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648121		Lextyle	Knapsack (NOI18_knapsack)	C++17	100 / 100	167 ms	236708 KiB

knapsack

#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w+", stdout);    
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
using namespace std;

/*
*/
ll dp[15519][2001];
pair<int, pair<int, int>> a[100000];
pair<int, int> b[15518];

bool pred(pair<int, pair<int, int>> a1, pair<int, pair<int, int>> a2) {
	if (a1.first < a2.first) return 1;
	else if (a1.first == a2.first) return a1.second.first > a2.second.first;
	return 0;
}

int main() {
	//USACO;
	fastIO;
	int s, n;
	cin >> s >> n;
	for (int i = 0; i < n; i++) cin >> a[i].second.first >> a[i].first >> a[i].second.second;
	sort(a, a + n, pred);
	int cnt = 0, ind = 0;
	for (int i = 0; i < n; i++) {
		if (i == 0 || a[i].first != a[i - 1].first) cnt = 0;
		for (int j = 0; cnt < s / a[i].first && j < a[i].second.second; j++) {
			b[ind++] = { a[i].first, a[i].second.first };
			cnt++;
		}
	}
	for (int i = 1; i <= ind; i++) {
		for (int j = b[i - 1].first; j <= s; j++) {
			dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - b[i - 1].first] + b[i - 1].second);
		}
	}
	cout << dp[ind][s] << "\n";
}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp:2: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    2 | #pragma warning(disable : 4996)
      | 
knapsack.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    3 | #pragma warning(disable : 6031)
      |

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 27 / 27