結果

問題 No.393 2本の竹
ユーザー shimomireshimomire
提出日時 2016-07-12 00:31:49
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 263 ms / 1,000 ms
コード長 5,070 bytes
コンパイル時間 1,434 ms
コンパイル使用メモリ 119,892 KB
実行使用メモリ 4,384 KB
最終ジャッジ日時 2023-08-07 23:58:20
合計ジャッジ時間 4,837 ms
ジャッジサーバーID
(参考情報)
judge13 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 93 ms
4,380 KB
testcase_01 AC 32 ms
4,376 KB
testcase_02 AC 90 ms
4,380 KB
testcase_03 AC 88 ms
4,380 KB
testcase_04 AC 44 ms
4,376 KB
testcase_05 AC 59 ms
4,380 KB
testcase_06 AC 41 ms
4,380 KB
testcase_07 AC 112 ms
4,376 KB
testcase_08 AC 184 ms
4,380 KB
testcase_09 AC 263 ms
4,380 KB
testcase_10 AC 88 ms
4,380 KB
testcase_11 AC 143 ms
4,376 KB
testcase_12 AC 141 ms
4,380 KB
testcase_13 AC 139 ms
4,380 KB
testcase_14 AC 116 ms
4,376 KB
testcase_15 AC 71 ms
4,380 KB
testcase_16 AC 98 ms
4,380 KB
testcase_17 AC 82 ms
4,380 KB
testcase_18 AC 46 ms
4,376 KB
testcase_19 AC 21 ms
4,376 KB
testcase_20 AC 40 ms
4,380 KB
testcase_21 AC 67 ms
4,376 KB
testcase_22 AC 132 ms
4,376 KB
testcase_23 AC 149 ms
4,376 KB
testcase_24 AC 71 ms
4,376 KB
testcase_25 AC 55 ms
4,376 KB
testcase_26 AC 29 ms
4,384 KB
testcase_27 AC 233 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<58;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};

// min{2^r | n < 2^r}
template<typename T> T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

class Main{
	public:

	void run(){
		int d;cin >> d;
		for(int _d:range(d)){
			int n1,n2;cin >> n1 >> n2;
			int m;cin >> m;
			vector<int> as(m);cin >> as;
			sort(ALL(as));

			int Mv = 0;
			vector<vector<bool>> dp(m+1,vector<bool>(100050));
			dp[0][0] = true;
			for(int i:range(1,m+1)){
				for(int v:range(100050)){
					if(dp[i-1][v]) dp[i][v] = true;
					if(v >= as[i-1] && dp[i-1][v-as[i-1]]){
						dp[i][v] = true;
					}
				}
			}

			int sum = 0;
			for(int i:range(0,m+1)){
				sum += as[i-1];
				for(int v:range(100050))if(dp[i][v]){
					if(v <= n1 && sum-v <= n2){
						Mv = i;
					}
				}
			}
			cout << Mv << endl;
		}
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}
0