結果
問題 | No.482 あなたの名は |
ユーザー | torus711 |
提出日時 | 2017-02-10 22:41:47 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 3,590 bytes |
コンパイル時間 | 946 ms |
コンパイル使用メモリ | 106,212 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-09 11:22:41 |
合計ジャッジ時間 | 2,554 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 27 ms
5,376 KB |
testcase_16 | AC | 27 ms
5,376 KB |
testcase_17 | AC | 27 ms
5,376 KB |
testcase_18 | AC | 26 ms
5,376 KB |
testcase_19 | AC | 27 ms
5,376 KB |
testcase_20 | AC | 27 ms
5,376 KB |
testcase_21 | AC | 27 ms
5,376 KB |
testcase_22 | AC | 27 ms
5,376 KB |
testcase_23 | AC | 26 ms
5,376 KB |
testcase_24 | AC | 26 ms
5,376 KB |
testcase_25 | AC | 26 ms
5,376 KB |
testcase_26 | AC | 26 ms
5,376 KB |
testcase_27 | AC | 24 ms
5,376 KB |
testcase_28 | AC | 25 ms
5,376 KB |
testcase_29 | AC | 25 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
コンパイルメッセージ
main.cpp:44:66: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] 44 | template <> struct getv_fmt< int >{ static constexpr char *fmt = "%d"; }; | ^~~~ main.cpp:45:72: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] 45 | template <> struct getv_fmt< long long >{ static constexpr char *fmt = "%lld"; }; | ^~~~~~
ソースコード
#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 char *fmt = "%d"; }; template <> struct getv_fmt< long long >{ static constexpr 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 ) << endl int main() { cin.tie( 0 ); ios::sync_with_stdio( false ); cout << setprecision( 12 ) << fixed; int N; LL K; scanf( "%d%lld", &N, &K ); VI A( N ); getv( A ); transform( ALL( A ), begin( A ), bind( minus< LL >(), _1, 1 ) ); VI indices( N ); REP( i, N ) { indices[ A[i] ] = i; } REP( i, N ) { if ( A[i] == i ) { continue; } swap( A[ indices[i] ], A[i] ); swap( indices[ A[ indices[i] ] ], indices[ A[i] ] ); --K; } puts( K < 0 || K % 2 ? "NO" : "YES" ); fflush( stdout ); return 0; }