#103120 (C++14) No.393 2本の竹

• 問題: No.393 2本の竹
• ユーザー: torus711
• 提出日時: 2016-07-12 17:43:11
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: TLE
• 実行時間: -
• コード長: 3,423 bytes
• コンパイル時間: 958 ms
• コンパイル使用メモリ: 107,184 KB
• 実行使用メモリ: 144,768 KB
• 最終ジャッジ日時: 2024-10-15 01:07:44
• 合計ジャッジ時間: 5,322 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
other	TLE * 1 -- * 27

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>
using namespace std;
using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i 
    ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()
#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )
template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define MP make_pair
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
constexpr int INF = LIM<>::max() / 2;
constexpr int LMAX = ( 1 << 18 );
int dp[ 2 ][ 64 ][ LMAX ];
int solve()
{
    VI L( 2 );
    cin >> L;
    int N;
    cin >> N;
    VI A( N );
    cin >> A;
    sort( ALL( A ) );
    fill( AALL( dp, int ), -INF );
    dp[0][0][ L[0] ] = L[1];
    // dp[ processed ][ assigned ][ remaining length of A ] := maximum remaining length of B 
    REP( i, N )
    {
        const int cur = i & 1;
        const int nex = 1 - cur;
        fill( AALL( dp[ nex ], int ), -INF );
        REP( j, N + 1 )
        {
            REP( k, LMAX )
            {
                chmax( dp[ nex ][j][k], dp[ cur ][j][k] );
                if ( A[i] <= k )
                {
                    chmax( dp[ nex ][ j + 1 ][ k - A[i] ], dp[ cur ][j][k] );
                }
                chmax( dp[ nex ][ j + 1 ][k], dp[ cur ][j][k] - A[i] );
            }
        }
    }
    int res = 0;
    REP( j, N + 1 )
    {
        REP( k, LMAX )
        {
            if ( 0 <= dp[ N % 2 ][j][k] )
            {
                chmax( res, j );
            }
        }
    }
    return res;
}
int main()
{
    cin.tie( 0 );
    ios::sync_with_stdio( false );
    cout << setprecision( 12 ) << fixed;
    int T;
    cin >> T;
    REP( _, T )
    {
        cout << solve() << endl;
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX