Submission #1135545


Source Code Expand

#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const int INF = 2000000000;
using namespace std;

int main(){
    string s;
    cin >> s;

    long long cnt = 0;
    long long ans = 0;
    for(int i = 0; i < s.size() - 1; i+=2){
        if(s.substr(i,2) == "25") cnt++;
        else {
            ans += (cnt * cnt + cnt) / 2;
            cnt = 0;
        }
    }
    if(cnt != 0) ans += (cnt * cnt + cnt) / 2;
    cnt = 0;
    for(int i = 1; i < s.size() - 1; i+=2){
        if(s.substr(i,2) == "25") cnt++;
        else {
            ans += (cnt * cnt + cnt) / 2;
            cnt = 0;
        }
    }
    if(cnt != 0) ans += (cnt * cnt + cnt) / 2;
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User noy72
Language C++14 (GCC 5.4.1)
Score 100
Code Size 976 Byte
Status AC
Exec Time 16 ms
Memory 512 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 5
AC × 18
AC × 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 AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask0_sample_04.txt AC 1 ms 256 KB
subtask0_sample_05.txt AC 1 ms 256 KB
subtask1_01.txt AC 2 ms 256 KB
subtask1_02.txt AC 2 ms 256 KB
subtask1_03.txt AC 2 ms 256 KB
subtask1_04.txt AC 2 ms 256 KB
subtask1_05.txt AC 2 ms 256 KB
subtask1_06.txt AC 2 ms 256 KB
subtask1_07.txt AC 2 ms 256 KB
subtask1_08.txt AC 2 ms 256 KB
subtask1_09.txt AC 2 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 2 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask2_01.txt AC 11 ms 512 KB
subtask2_02.txt AC 16 ms 512 KB
subtask2_03.txt AC 10 ms 512 KB
subtask2_04.txt AC 12 ms 512 KB
subtask2_05.txt AC 11 ms 512 KB
subtask2_06.txt AC 11 ms 512 KB
subtask2_07.txt AC 10 ms 512 KB
subtask2_08.txt AC 10 ms 512 KB
subtask2_09.txt AC 2 ms 256 KB
subtask2_10.txt AC 2 ms 256 KB
subtask2_11.txt AC 2 ms 256 KB
subtask2_12.txt AC 2 ms 256 KB