Submission #326315

Source Code Expand

#include <iostream>
#include <string>
#include <regex>

unsigned long long int count( unsigned long long int n )
{
    return ( 1 + n ) * n / 2 ;
}

int main()
{

    std::string str ;
    std::cin >> str ;

    std::regex re(R"((?:25)+)") ;

    std::smatch m ;

    unsigned long long int sum = 0 ;

    auto iter = str.cbegin() ;
    auto end = str.cend() ;


    while ( iter != end )
    {
        std::regex_search( iter, end, m, re ) ;
        auto n = m.str().length() / 2 ;
        sum += count( n ) ;

        iter = m[0].second ;
    }

    std::cout << sum << '\n' ;

}

Submission Info

Submission Time
Task B - ニコニコ文字列
User ezoe
Language C++11 (GCC 4.8.1)
Score 0
Code Size 617 Byte
Status TLE
Exec Time 2035 ms
Memory 1120 KiB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
TLE × 5
TLE × 18
TLE × 30
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 TLE 2032 ms 808 KiB
subtask0_sample_02.txt TLE 2032 ms 808 KiB
subtask0_sample_03.txt TLE 2034 ms 808 KiB
subtask0_sample_04.txt TLE 2034 ms 860 KiB
subtask0_sample_05.txt TLE 2034 ms 812 KiB
subtask1_01.txt TLE 2033 ms 888 KiB
subtask1_02.txt TLE 2035 ms 932 KiB
subtask1_03.txt TLE 2033 ms 932 KiB
subtask1_04.txt TLE 2033 ms 924 KiB
subtask1_05.txt TLE 2032 ms 928 KiB
subtask1_06.txt TLE 2034 ms 936 KiB
subtask1_07.txt TLE 2032 ms 924 KiB
subtask1_08.txt TLE 2033 ms 860 KiB
subtask1_09.txt TLE 2033 ms 928 KiB
subtask1_10.txt TLE 2031 ms 804 KiB
subtask1_11.txt TLE 2033 ms 920 KiB
subtask1_12.txt TLE 2032 ms 812 KiB
subtask1_13.txt TLE 2033 ms 928 KiB
subtask2_01.txt TLE 2033 ms 1120 KiB
subtask2_02.txt TLE 2033 ms 1044 KiB
subtask2_03.txt TLE 2033 ms 1064 KiB
subtask2_04.txt TLE 2033 ms 1064 KiB
subtask2_05.txt TLE 2033 ms 1060 KiB
subtask2_06.txt TLE 2033 ms 1056 KiB
subtask2_07.txt TLE 2031 ms 1064 KiB
subtask2_08.txt TLE 2034 ms 1068 KiB
subtask2_09.txt TLE 2033 ms 928 KiB
subtask2_10.txt TLE 2032 ms 936 KiB
subtask2_11.txt TLE 2033 ms 936 KiB
subtask2_12.txt TLE 2032 ms 928 KiB