Submission #323085
Source Code Expand
#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 <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< VI >; using VS = vector< string >; using SS = stringstream; using PII = pair< int, int >; using VPII = vector< PII >; template < typename T = int > using VT = vector<T>; template < typename T = int > using VVT = VT< VT<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<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 REP( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i ) #define FOR( e, c ) for ( auto &e : c ) #define ALL( c ) ( c ).begin(), ( c ).end() #define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t ) #define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + p, ( c ).end() #define SZ( v ) ( (int)( v ).size() ) #define PB push_back #define EM emplace #define EB emplace_back #define BI back_inserter #define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() ) #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 ); string S; cin >> S; const int L = SZ( S ); VI as; REP( i, 0, L ) { if ( i + 1 < L && S[i] == '2' && S[ i + 1 ] == '5' ) { as.PB( 1 ); ++i; } else { as.PB( 0 ); } } LL res = 0; REP( i, 0, SZ( as ) ) { if ( !as[i] ) { continue; } int j = i; while ( j < SZ( as ) && as[j] ) ++j; const LL n = j - i; res += n * ( n + 1 ) / 2; i = j - 1; } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ニコニコ文字列 |
User | torus711 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 2549 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 1524 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 25 ms | 800 KB |
subtask0_sample_02.txt | AC | 29 ms | 788 KB |
subtask0_sample_03.txt | AC | 24 ms | 924 KB |
subtask0_sample_04.txt | AC | 25 ms | 928 KB |
subtask0_sample_05.txt | AC | 25 ms | 928 KB |
subtask1_01.txt | AC | 24 ms | 932 KB |
subtask1_02.txt | AC | 26 ms | 928 KB |
subtask1_03.txt | AC | 24 ms | 928 KB |
subtask1_04.txt | AC | 24 ms | 932 KB |
subtask1_05.txt | AC | 25 ms | 928 KB |
subtask1_06.txt | AC | 25 ms | 804 KB |
subtask1_07.txt | AC | 26 ms | 800 KB |
subtask1_08.txt | AC | 26 ms | 800 KB |
subtask1_09.txt | AC | 24 ms | 800 KB |
subtask1_10.txt | AC | 27 ms | 792 KB |
subtask1_11.txt | AC | 25 ms | 788 KB |
subtask1_12.txt | AC | 24 ms | 796 KB |
subtask1_13.txt | AC | 26 ms | 796 KB |
subtask2_01.txt | AC | 28 ms | 1516 KB |
subtask2_02.txt | AC | 27 ms | 1508 KB |
subtask2_03.txt | AC | 25 ms | 1520 KB |
subtask2_04.txt | AC | 25 ms | 1512 KB |
subtask2_05.txt | AC | 26 ms | 1524 KB |
subtask2_06.txt | AC | 28 ms | 1516 KB |
subtask2_07.txt | AC | 24 ms | 1268 KB |
subtask2_08.txt | AC | 25 ms | 1392 KB |
subtask2_09.txt | AC | 25 ms | 796 KB |
subtask2_10.txt | AC | 26 ms | 800 KB |
subtask2_11.txt | AC | 25 ms | 796 KB |
subtask2_12.txt | AC | 23 ms | 912 KB |