結果
問題 | No.2955 Pizza Delivery Plan |
ユーザー |
![]() |
提出日時 | 2024-11-08 22:27:57 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 273 ms / 2,000 ms |
コード長 | 4,991 bytes |
コンパイル時間 | 1,817 ms |
コンパイル使用メモリ | 164,592 KB |
実行使用メモリ | 36,608 KB |
最終ジャッジ日時 | 2024-11-08 22:28:08 |
合計ジャッジ時間 | 6,916 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
ソースコード
#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 <ranges>#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 VLL = vector< long long >;using VVLL = vector< vector< long long > >;template < typename T = int > using VT = vector< T >;template < typename T = int > using VVT = vector< VT< T > >;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 LIM = numeric_limits< T >;template < typename T = int > using OSI = ostream_iterator< 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; }void in_impl(){};template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );template < typename T, typename V >auto make_vector( const int n, const V &v ){return vector< T >( n, v );}template < typename T, typename... TS >auto make_vector( const int n, TS... ts ){return vector< decltype( make_vector< T >( forward< TS >( ts )...) ) >( n, make_vector< T >( forward< TS >( ts )... ) );}template < typename T, typename V >auto make_vector0(){return vector< T >();}template < typename T, typename... TS >auto make_vector0( const int n, TS... ts ){return vector< decltype( make_vector0< T >( forward< TS >( ts )...) ) >( n, make_vector0< T >( forward< TS >( ts )... ) );}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 MAP_PRED( c ) transform( begin( c ), end( c ), begin( c ), bind( minus< int >(), _1, 1 ) );#define SZ( v ) ( (int)( v ).size() )#define EXISTS( 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// Λ Λ__// /(*゚ー゚)/\// /|  ̄U U ̄|\/// | |/constexpr auto INF = LIM< double >::max() / 2;double dist( const LL x1, const LL y1, const LL x2, const LL y2 ){const LL dx = x1 - x2;const LL dy = y1 - y2;return sqrt( dx * dx + dy * dy );}int main(){cin.tie( nullptr );ios::sync_with_stdio( false );cout << setprecision( 12 ) << fixed;IN( int, N, K );VLL X( N ), Y( N );REP( i, N ){cin >> X[i] >> Y[i];}static double dp[ 1 << 14 ][ 16 ][ 16 ];// dp[ set of delivered house ][ current position ][ number of having pizza ] := min costfill( AALL( dp ), INF );REP( i, N ){dp[ 1 << i ][i][ K - 1 ] = dist( 0, 0, X[i], Y[i] );}REP( s, 1 << N ){REP( i, N ){REP( j, K ){REP( k, N ){if ( s & 1 << k ){continue;}if ( j ){chmin( dp[ s | 1 << k ][k][ j - 1 ], dp[s][i][j] + dist( X[i], Y[i], X[k], Y[k] ) );}chmin( dp[ s | 1 << k ][k][ K - 1 ], dp[s][i][j] + dist( X[i], Y[i], 0, 0 ) + dist( 0, 0, X[k], Y[k] ) );}}}}double res = INF;REP( i, N ){REP( j, K ){chmin( res, dp[ ( 1 << N ) - 1 ][i][j] + dist( X[i], Y[i], 0, 0 ) );}}cout << res << endl;return 0;}