結果

問題 No.527 ナップサック容量問題
ユーザー komori3komori3
提出日時 2018-02-18 08:28:31
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 4,580 bytes
コンパイル時間 1,605 ms
コンパイル使用メモリ 148,296 KB
実行使用メモリ 4,456 KB
最終ジャッジ日時 2023-09-06 18:13:29
合計ジャッジ時間 4,504 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,376 KB
testcase_01 AC 3 ms
4,380 KB
testcase_02 AC 10 ms
4,380 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 3 ms
4,380 KB
testcase_05 AC 88 ms
4,384 KB
testcase_06 AC 212 ms
4,384 KB
testcase_07 WA -
testcase_08 AC 75 ms
4,404 KB
testcase_09 AC 8 ms
4,384 KB
testcase_10 AC 89 ms
4,380 KB
testcase_11 WA -
testcase_12 AC 94 ms
4,456 KB
testcase_13 AC 221 ms
4,376 KB
testcase_14 WA -
testcase_15 AC 18 ms
4,384 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 35 ms
4,380 KB
testcase_19 AC 3 ms
4,376 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 14 ms
4,380 KB
testcase_27 AC 14 ms
4,384 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 22 ms
4,380 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 13 ms
4,380 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 13 ms
4,376 KB
testcase_38 AC 22 ms
4,380 KB
testcase_39 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
//#include "util.k"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



//重さに対する最大の価値
ll ZeroOneKnapsackSmart(ll n, vector<ll>& w, vector<ll>& v, ll W)
{
	vector<ll> dp(W + 1, 0);
	for (int i = 1; i <= n; i++)
		for (int j = W; j >= w[i]; j--)
			dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
	return dp[W];
}


int main() {
	//clock_t start, end;
	//start = clock();

	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

	vector<ll> v(N + 1, 0), w(N + 1, 0);
	for (int i = 1; i <= N; i++) {
		cin >> v[i] >> w[i];
	}

	int V;
	cin >> V;
	{
		int minW = 1, midW, maxW = 100010;
		while (maxW >= minW) {
			midW = minW + (maxW - minW) / 2;
			int midV = ZeroOneKnapsackSmart(N, w, v, midW);
			if (midV >= V) maxW = midW - 1;
			else if (midV < V) minW = midW + 1;
			else {
				break;
			}
		}
		cout << midW << endl;
	}
	{
		V++;
		int minW = 1, midW, maxW = 100010;
		while (maxW >= minW) {
			midW = minW + (maxW - minW) / 2;
			int midV = ZeroOneKnapsackSmart(N, w, v, midW);
			if (midV >= V) maxW = midW - 1;
			else if (midV < V) minW = midW + 1;
			else {
				break;
			}
		}
		cout << (midW == 100010 ? "inf" : to_string(midW - 1)) << endl;
	}



	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}
0