oj.uz

답안 #209519

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209519 2020-03-14T12:34:40 Z model_code Knapsack (NOI18_knapsack) C++17
12 / 100
 5 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plpl;
ll N, S;
const int MAXN = 100004;
plpl A[MAXN];
bool cmp1 (plpl a, plpl b) {
	return a.second.first*b.second.second > b.second.first*a.second.second;
}
ll scam1(ll s) {
	sort(A, A+N, cmp1);
	ll ans = 0;
	for (int i = 0; i < N; ++i) {
		ll k = min(A[i].first, S/A[i].second.second);
		ans += k*A[i].second.first;
		s -= k*A[i].second.second;
	}
	return ans;
}
bool cmp2 (plpl a, plpl b) {
	return a.second.first > b.second.first;
}
ll scam2 (ll s) {
	sort(A, A+N, cmp1);
	ll ans = 0;
	for (int i = 0; i < N; ++i) {
		if (A[i].second.second > S) continue;
		ll k = min(A[i].first, S/A[i].second.second);
		ans += k*A[i].second.first;
		s -= k*A[i].second.second;
	}
	return ans;
}
bool cmp3 (plpl a, plpl b) {
	return a.second.second < b.second.second;
}
ll scam3 (ll s) {
	sort(A, A+N, cmp1);
	ll ans = 0;
	for (int i = 0; i < N; ++i) {
		if (A[i].second.second > S) continue;
		ll k = min(A[i].first, S/A[i].second.second);
		ans += k*A[i].second.first;
		s -= k*A[i].second.second;
	}
	return ans;
}
int main() {
	scanf("%lld%lld", &S, &N);
	for (int i = 0; i < N; ++i) {
		//V, W, K
		scanf("%lld%lld%lld", &A[i].second.first, &A[i].second.second, &A[i].first);
	}
	
	printf("%lld\n", min({scam1(S), scam2(S), scam3(S)}));
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &S, &N);
  ~~~~~^~~~~~~~~~~~~~~~~~~~
knapsack.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &A[i].second.first, &A[i].second.second, &A[i].first);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -