結果

問題 No.3013 ハチマキ買い星人
ユーザー torus711torus711
提出日時 2025-01-25 13:12:53
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 225 ms / 2,000 ms
コード長 5,076 bytes
コンパイル時間 2,001 ms
コンパイル使用メモリ 176,224 KB
実行使用メモリ 18,668 KB
最終ジャッジ日時 2025-01-25 22:37:21
合計ジャッジ時間 8,631 ms
ジャッジサーバーID
(参考情報)
judge11 / judge7
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

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 <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 )
template < typename C, typename F > void EACH( C &c, const F &&f ) { std::for_each( std::begin( c ), std::end( c ), f ); }
#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; }
inline std::string YES( const bool l ){ return l ? "YES" : "Yes"; }
inline std::string NO( const bool l ){ return l ? "NO" : "No"; }
inline std::string YESNO( const bool f, const bool l = false ){ return f ? YES( l ) : NO( l ); }
#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< LL >::max() / 2;
int main()
{
cin.tie( nullptr );
ios::sync_with_stdio( false );
cout << setprecision( 12 ) << fixed;
IN( int, N, M, P );
IN( LL, Y );
VT< VPII > G( N );
REP( M )
{
IN( int, u, v, c );
--u, --v;
G[u].EB( v, c );
G[v].EB( u, c );
}
VI D( P ), E( P );
REP( i, P )
{
cin >> D[i] >> E[i];
}
MAP_PRED( D );
static LL max_money[ 1 << 18 ];
fill( AALL( max_money ), -INF );
max_money[0] = Y;
priority_queue< pair< LL, int > > que;
que.EM( Y, 0 );
while ( !que.empty() )
{
const auto [ c, u ] = que.top();
que.pop();
if ( c < max_money[u] )
{
continue;
}
for ( const auto [ v, c ] : G[u] )
{
if ( chmax( max_money[v], max< LL >( 0, max_money[u] - c ) ) )
{
que.EM( max_money[v], v );
}
}
}
LL res = 0;
REP( i, P )
{
chmax( res, max_money[ D[i] ] / E[i] );
}
cout << res << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0