Submission #1027040


Source Code Expand

// Template {{{
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;

#ifdef LOCAL
#include "contest.h"
#else
#define dump(x) 
#endif

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
inline bool valid(int x, int w) { return 0 <= x && x < w; }

void iostream_init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.setf(ios::fixed);
    cout.precision(12);
}
//}}}

int main(){
    iostream_init();
    string s;
    cin >> s;
    LL ans = 0;
    REP(i, s.size()) {
        if(s[i] == '2') {
            int idx = i;
            while(idx+1 < s.size() && s[idx] == '2' && s[idx+1] == '5') {
                idx += 2;
            }
            if(idx != i) {
                LL len = (idx - i) / 2;
                ans += len * (len + 1) / 2;
                i = idx-1;
            }
        } 
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User ichyo
Language C++ (G++ 4.6.4)
Score 100
Code Size 978 Byte
Status AC
Exec Time 20 ms
Memory 1180 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 18 ms 792 KB
subtask0_sample_02.txt AC 18 ms 800 KB
subtask0_sample_03.txt AC 18 ms 800 KB
subtask0_sample_04.txt AC 19 ms 840 KB
subtask0_sample_05.txt AC 19 ms 924 KB
subtask1_01.txt AC 17 ms 800 KB
subtask1_02.txt AC 17 ms 796 KB
subtask1_03.txt AC 19 ms 796 KB
subtask1_04.txt AC 18 ms 924 KB
subtask1_05.txt AC 19 ms 796 KB
subtask1_06.txt AC 19 ms 924 KB
subtask1_07.txt AC 19 ms 800 KB
subtask1_08.txt AC 19 ms 792 KB
subtask1_09.txt AC 19 ms 796 KB
subtask1_10.txt AC 18 ms 920 KB
subtask1_11.txt AC 17 ms 880 KB
subtask1_12.txt AC 19 ms 800 KB
subtask1_13.txt AC 18 ms 800 KB
subtask2_01.txt AC 20 ms 1052 KB
subtask2_02.txt AC 18 ms 1052 KB
subtask2_03.txt AC 19 ms 1180 KB
subtask2_04.txt AC 19 ms 1176 KB
subtask2_05.txt AC 19 ms 1056 KB
subtask2_06.txt AC 19 ms 1052 KB
subtask2_07.txt AC 19 ms 1056 KB
subtask2_08.txt AC 19 ms 1052 KB
subtask2_09.txt AC 18 ms 920 KB
subtask2_10.txt AC 17 ms 796 KB
subtask2_11.txt AC 19 ms 796 KB
subtask2_12.txt AC 19 ms 800 KB