結果
問題 | No.496 ワープクリスタル (給料日前編) |
ユーザー |
![]() |
提出日時 | 2017-03-24 22:53:25 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 3,921 bytes |
コンパイル時間 | 1,039 ms |
コンパイル使用メモリ | 103,276 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-05 22:17:44 |
合計ジャッジ時間 | 1,670 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 23 |
ソースコード
#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 <type_traits>#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 ISS = istringstream;using OSS = ostringstream;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 > struct getv_fmt;template <> struct getv_fmt< int >{ static constexpr const char *fmt = "%d"; };template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };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 NUMBERED( name, number ) NUMBERED2( name, number )#define NUMBERED2( name, number ) name ## _ ## number#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )#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, REP1 )( __VA_ARGS__ )#define FOR( e, c ) for ( auto &&e : c )#define ALL( c ) begin( c ), end( c )#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof(remove_all_extents< decltype( a ) >::type )#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )#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 ) << endlconst int INF = LIM<>::max() / 2;int main(){cin.tie( 0 );ios::sync_with_stdio( false );cout << setprecision( 12 ) << fixed;int W, H, N, F;cin >> W >> H >> N >> F;VI X( N ), Y( N ), C( N );REP( i, N ){cin >> X[i] >> Y[i] >> C[i];}static int dp[ 128 ][ 128 ];fill( AALL( dp ), INF );dp[0][0] = 0;const auto inside = [&]( const int y, const int x ){ return y <= H && x <= W; };REP( i, SZ( X ) ){for ( int y = H; 0 <= y; --y ){for ( int x = W; 0 <= x; --x ){const int ny = y + Y[i];const int nx = x + X[i];if ( !inside( ny, nx ) ){continue;}chmin( dp[ ny ][ nx ], dp[y][x] + C[i] );}}}int res = INF;REP( y, H + 1 ){REP( x, W + 1 ){chmin( res, dp[y][x] + ( H - y + W - x ) * F );}}cout << res << endl;return 0;}