Submission #3602740


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e9;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)


 
 

 
int main() {
    string s;
    cin >> s;
    
    ll n = s.size(), ans = 0;
    for(ll l = 0; l < n; ){
        while(l < n && s[l] != '2'){
            l++;
        }
        
        bool five = true;
        ll cnt = 0, r;
        for(r = l + 1; r < n; r++){
            if(five){
                if(s[r] == '5'){
                    cnt++;
                    five = false;
                }
                else{
                    break;
                }
            }
            else{
                if(s[r] == '2'){
                    five = true;
                }
                else{
                    break;
                }
            }
        }
        
        ans += cnt * (cnt + 1) / 2;
        
        l = r;
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User chocobo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1024 Byte
Status AC
Exec Time 5 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 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask2_01.txt AC 5 ms 512 KB
subtask2_02.txt AC 4 ms 512 KB
subtask2_03.txt AC 5 ms 512 KB
subtask2_04.txt AC 5 ms 512 KB
subtask2_05.txt AC 5 ms 512 KB
subtask2_06.txt AC 5 ms 512 KB
subtask2_07.txt AC 4 ms 512 KB
subtask2_08.txt AC 4 ms 512 KB
subtask2_09.txt AC 2 ms 256 KB
subtask2_10.txt AC 1 ms 256 KB
subtask2_11.txt AC 1 ms 256 KB
subtask2_12.txt AC 2 ms 256 KB