Submission #15575294


Source Code Expand

Copy
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)

int main() {
  string s;
  cin >> s;
  int n = (int)s.size();

  ll cnt = 0;
  ll ans = 0;
  rep(i, 1, n) {
    if (s[i - 1] == '2' && s[i] == '5') {
      ++cnt;
      ++i;
    } else {
      ans += cnt * -~cnt >> 1;
      cnt = 0;
    }
  }
  ans += cnt * -~cnt >> 1;
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User tonyu0
Language C++ (GCC 9.2.1)
Score 100
Code Size 489 Byte
Status
Exec Time 16 ms
Memory 3740 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
Subtask1 30 / 30 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 70 / 70 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 6 ms 3400 KB
subtask0_sample_02.txt 2 ms 3592 KB
subtask0_sample_03.txt 3 ms 3516 KB
subtask0_sample_04.txt 3 ms 3608 KB
subtask0_sample_05.txt 2 ms 3536 KB
subtask1_01.txt 2 ms 3548 KB
subtask1_02.txt 2 ms 3532 KB
subtask1_03.txt 2 ms 3492 KB
subtask1_04.txt 2 ms 3604 KB
subtask1_05.txt 2 ms 3548 KB
subtask1_06.txt 2 ms 3536 KB
subtask1_07.txt 4 ms 3540 KB
subtask1_08.txt 3 ms 3620 KB
subtask1_09.txt 2 ms 3624 KB
subtask1_10.txt 2 ms 3448 KB
subtask1_11.txt 2 ms 3580 KB
subtask1_12.txt 2 ms 3588 KB
subtask1_13.txt 2 ms 3420 KB
subtask2_01.txt 5 ms 3596 KB
subtask2_02.txt 6 ms 3588 KB
subtask2_03.txt 7 ms 3724 KB
subtask2_04.txt 6 ms 3664 KB
subtask2_05.txt 6 ms 3596 KB
subtask2_06.txt 6 ms 3720 KB
subtask2_07.txt 8 ms 3740 KB
subtask2_08.txt 16 ms 3592 KB
subtask2_09.txt 4 ms 3540 KB
subtask2_10.txt 2 ms 3608 KB
subtask2_11.txt 3 ms 3608 KB
subtask2_12.txt 4 ms 3604 KB