Submission #16776761


Source Code Expand

Copy
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
  string s;
  cin >> s;
  int ans = 0;
  int si = 0;
  int l = 0;
  rep(i, s.size()) {
    if (i % 2 == si % 2 && s[i] == '2') continue;
    if (i % 2 != si % 2 && s[i] == '5') {
      l++;
      continue;
    }
    ans += (l + 1) * l / 2;
    si = i + 1;
    l = 0;
    if (s[i] == '2') si = i;
  }
  ans += (l + 1) * l / 2;
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User giyau02
Language C++ (GCC 9.2.1)
Score 30
Code Size 542 Byte
Status
Exec Time 9 ms
Memory 3744 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:2:36: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    2 | #define rep(i,n) for (int i = 0; i < (n); ++i)
      |                                    ^
./Main.cpp:13:3: note: in expansion of macro ‘rep’
   13 |   rep(i, s.size()) {
      |   ^~~

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
× 5
× 18
× 29
× 1
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 6 ms 3532 KB
subtask0_sample_02.txt 4 ms 3396 KB
subtask0_sample_03.txt 2 ms 3508 KB
subtask0_sample_04.txt 2 ms 3536 KB
subtask0_sample_05.txt 2 ms 3592 KB
subtask1_01.txt 2 ms 3596 KB
subtask1_02.txt 2 ms 3552 KB
subtask1_03.txt 2 ms 3496 KB
subtask1_04.txt 4 ms 3436 KB
subtask1_05.txt 2 ms 3600 KB
subtask1_06.txt 1 ms 3476 KB
subtask1_07.txt 2 ms 3552 KB
subtask1_08.txt 2 ms 3596 KB
subtask1_09.txt 2 ms 3620 KB
subtask1_10.txt 3 ms 3424 KB
subtask1_11.txt 2 ms 3536 KB
subtask1_12.txt 3 ms 3496 KB
subtask1_13.txt 3 ms 3532 KB
subtask2_01.txt 6 ms 3716 KB
subtask2_02.txt 8 ms 3716 KB
subtask2_03.txt 9 ms 3704 KB
subtask2_04.txt 6 ms 3740 KB
subtask2_05.txt 5 ms 3656 KB
subtask2_06.txt 7 ms 3600 KB
subtask2_07.txt 8 ms 3744 KB
subtask2_08.txt 7 ms 3720 KB
subtask2_09.txt 3 ms 3612 KB
subtask2_10.txt 2 ms 3456 KB
subtask2_11.txt 2 ms 3612 KB
subtask2_12.txt 2 ms 3492 KB