結果

問題 No.286 Modulo Discount Store
ユーザー torus711
提出日時 2015-10-09 22:33:02
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 8 ms
コード長 2,701 Byte
コンパイル時間 540 ms
使用メモリ 1,652 KB
最終ジャッジ日時 2019-10-25 16:24:40

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
case1.txt AC 3 ms
1,648 KB
case2.txt AC 3 ms
1,648 KB
case3.txt AC 5 ms
1,652 KB
case4.txt AC 3 ms
1,648 KB
case5.txt AC 3 ms
1,648 KB
case6.txt AC 4 ms
1,648 KB
case7.txt AC 6 ms
1,652 KB
case8.txt AC 3 ms
1,648 KB
case9.txt AC 4 ms
1,652 KB
case10.txt AC 3 ms
1,652 KB
case11.txt AC 3 ms
1,648 KB
case12.txt AC 3 ms
1,652 KB
case13.txt AC 3 ms
1,652 KB
case14.txt AC 5 ms
1,648 KB
case15.txt AC 3 ms
1,648 KB
case16.txt AC 3 ms
1,652 KB
case17.txt AC 3 ms
1,652 KB
case18.txt AC 8 ms
1,648 KB
case19.txt AC 4 ms
1,652 KB
case20.txt AC 3 ms
1,652 KB
case21.txt AC 3 ms
1,652 KB
case22.txt AC 3 ms
1,652 KB
case23.txt AC 4 ms
1,644 KB
case24.txt AC 4 ms
1,648 KB
case25.txt AC 3 ms
1,652 KB
case26.txt AC 4 ms
1,648 KB
case27.txt AC 3 ms
1,648 KB
case28.txt AC 4 ms
1,652 KB
case29.txt AC 5 ms
1,652 KB
case30.txt AC 3 ms
1,648 KB
case31.txt AC 3 ms
1,648 KB
case32.txt AC 3 ms
1,648 KB
case33.txt AC 3 ms
1,648 KB
case34.txt AC 3 ms
1,648 KB
case35.txt AC 3 ms
1,648 KB
case36.txt AC 3 ms
1,652 KB
case37.txt AC 3 ms
1,652 KB
case38.txt AC 3 ms
1,652 KB
case39.txt AC 3 ms
1,648 KB
case40.txt AC 6 ms
1,648 KB
sample1.txt AC 4 ms
1,648 KB
sample2.txt AC 3 ms
1,652 KB
sample3.txt AC 4 ms
1,652 KB
テストケース一括ダウンロード

ソースコード

diff #
#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 PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

constexpr int INF = LIM<>::max() / 2;

int dp[ 1 << 15 ];

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int N;
	cin >> N;

	VI M( N );
	cin >> M;

	fill( AALL( dp, int ), INF );
	dp[0] = 0;

	REP( s, 1 << N )
	{
		int mod = 0;
		REP( i, N )
		{
			if ( s & 1 << i )
			{
				mod += M[i];
			}
		}
		mod %= 1000;

		REP( i, N )
		{
			if ( s & 1 << i )
			{
				continue;
			}

			const int c = max( 0, M[i] - mod );
			dp[ s | 1 << i ] = min( dp[ s | 1 << i ], dp[s] + c );
		}
	}

	cout << dp[ ( 1 << N ) - 1 ] << endl;

	return 0;

}
0