結果
問題 | No.438 Cwwプログラミング入門 |
ユーザー | torus711 |
提出日時 | 2016-10-28 22:53:06 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,484 bytes |
コンパイル時間 | 987 ms |
コンパイル使用メモリ | 105,820 KB |
実行使用メモリ | 10,136 KB |
最終ジャッジ日時 | 2024-11-24 18:28:51 |
合計ジャッジ時間 | 11,859 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 1,049 ms
10,136 KB |
testcase_05 | AC | 308 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,820 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 2 ms
6,820 KB |
testcase_14 | WA | - |
testcase_15 | AC | 2 ms
6,820 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 2 ms
6,816 KB |
testcase_19 | AC | 2 ms
6,824 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 2 ms
6,816 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 2 ms
6,820 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 2 ms
6,820 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | AC | 2 ms
6,816 KB |
testcase_39 | WA | - |
testcase_40 | AC | 2 ms
6,816 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | AC | 2 ms
6,820 KB |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | AC | 2 ms
6,816 KB |
testcase_49 | WA | - |
testcase_50 | AC | 2 ms
6,816 KB |
testcase_51 | AC | 2 ms
6,816 KB |
testcase_52 | WA | - |
testcase_53 | AC | 2 ms
6,820 KB |
testcase_54 | AC | 2 ms
6,816 KB |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | AC | 2 ms
6,816 KB |
testcase_59 | WA | - |
testcase_60 | AC | 3 ms
6,820 KB |
testcase_61 | WA | - |
testcase_62 | AC | 2 ms
6,820 KB |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | AC | 1 ms
6,820 KB |
testcase_66 | WA | - |
testcase_67 | AC | 2 ms
6,816 KB |
testcase_68 | RE | - |
testcase_69 | AC | 2 ms
6,820 KB |
testcase_70 | AC | 2 ms
6,820 KB |
testcase_71 | WA | - |
testcase_72 | AC | 1 ms
6,820 KB |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | AC | 1 ms
6,824 KB |
testcase_76 | RE | - |
testcase_77 | WA | - |
testcase_78 | AC | 2 ms
6,816 KB |
testcase_79 | AC | 2 ms
6,816 KB |
testcase_80 | AC | 2 ms
6,816 KB |
testcase_81 | AC | 2 ms
6,816 KB |
testcase_82 | AC | 2 ms
6,816 KB |
testcase_83 | AC | 2 ms
6,820 KB |
testcase_84 | AC | 2 ms
6,816 KB |
testcase_85 | AC | 2 ms
6,820 KB |
testcase_86 | AC | 2 ms
6,820 KB |
testcase_87 | AC | 2 ms
6,816 KB |
testcase_88 | RE | - |
testcase_89 | AC | 16 ms
6,820 KB |
testcase_90 | AC | 28 ms
6,816 KB |
testcase_91 | RE | - |
testcase_92 | RE | - |
testcase_93 | RE | - |
testcase_94 | RE | - |
testcase_95 | AC | 2 ms
6,816 KB |
testcase_96 | AC | 3 ms
6,820 KB |
testcase_97 | WA | - |
testcase_98 | AC | 2 ms
6,820 KB |
testcase_99 | AC | 2 ms
6,816 KB |
testcase_100 | AC | 2 ms
6,820 KB |
ソースコード
#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 > 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 ) << endl constexpr int MAX_L = 10000; int main() { cin.tie( 0 ); ios::sync_with_stdio( false ); cout << setprecision( 12 ) << fixed; LL X, Y, Z; cin >> X >> Y >> Z; REP( i, -MAX_L, MAX_L + 1 ) { const LL rest = Z - i * X; if ( rest % Y ) { continue; } const int j = rest / Y; string res; if ( 0 <= i && 0 <= j ) { res += string( i, 'c' ); res += string( j, 'w' ); res += string( i + j - 1, 'C' ); } else { int p, m; tie( m, p ) = minmax( i, j ); res += string( -m, 'w' ); res += string( p, 'c' ); res += string( p - 1, 'C' ); res += string( -m, 'W' ); } if ( !res.empty() && SZ( res ) <= MAX_L ) { cout << res << endl; return 0; } } cout << "mourennaihasimasenn" << endl; return 0; }