提出 #5350787

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#define MIN(a, b) (a > b ? b : a)

int main(void) {
  int N; cin >> N;
  int c = 0, A = 0, B = 0, AB = 0;
  for (int i = 0; i < N; i++) {
    string si; cin >> si;
    for (int i = 0; i < si.length(); i++) if (i < si.length()-1 && si[i] == 'A' && si[i+1] == 'B') c++;
    if (si.front() == 'B' && si.back() == 'A') AB++;
    else if (si.front() == 'B') B++;
    else if (si.back() == 'A') A++;
  }

  if (AB == 0) cout << c + MIN(A, B) << endl;
  else {
    if (A > 0) {
      c++;
      A--;
    }
    if (B > 0) {
      c++;
      B--;
    }

    if (A == B) cout << c + AB-1 + A << endl;
    else cout << c + AB-1 + MIN(A, B) << endl;
  }

  return 0;
}

提出情報

提出日時
問題 C - AB Substrings
ユーザ kahuu
言語 C++14 (GCC 5.4.1)
得点 400
コード長 737 Byte
結果 AC
実行時間 7 ms
メモリ 256 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 48
セット名 テストケース
Sample sample_01.txt, sample_02.txt, sample_03.txt
All rand_01.txt, rand_02.txt, rand_03.txt, rand_04.txt, rand_05.txt, rand_06.txt, rand_07.txt, rand_08.txt, rand_09.txt, rand_10.txt, rand_11.txt, rand_12.txt, rand_13.txt, rand_14.txt, rand_15.txt, rand_16.txt, rand_17.txt, rand_18.txt, rand_19.txt, rand_20.txt, rand_21.txt, rand_22.txt, rand_23.txt, rand_24.txt, rand_25.txt, rand_26.txt, rand_27.txt, rand_28.txt, rand_29.txt, rand_30.txt, rand_31.txt, rand_32.txt, rand_33.txt, rand_34.txt, rand_35.txt, rand_36.txt, rand_37.txt, rand_38.txt, rand_39.txt, rand_40.txt, rand_41.txt, rand_42.txt, rand_43.txt, rand_44.txt, rand_45.txt, sample_01.txt, sample_02.txt, sample_03.txt
ケース名 結果 実行時間 メモリ
rand_01.txt AC 7 ms 256 KiB
rand_02.txt AC 7 ms 256 KiB
rand_03.txt AC 7 ms 256 KiB
rand_04.txt AC 7 ms 256 KiB
rand_05.txt AC 7 ms 256 KiB
rand_06.txt AC 7 ms 256 KiB
rand_07.txt AC 7 ms 256 KiB
rand_08.txt AC 7 ms 256 KiB
rand_09.txt AC 5 ms 256 KiB
rand_10.txt AC 5 ms 256 KiB
rand_11.txt AC 2 ms 256 KiB
rand_12.txt AC 4 ms 256 KiB
rand_13.txt AC 6 ms 256 KiB
rand_14.txt AC 5 ms 256 KiB
rand_15.txt AC 5 ms 256 KiB
rand_16.txt AC 4 ms 256 KiB
rand_17.txt AC 2 ms 256 KiB
rand_18.txt AC 3 ms 256 KiB
rand_19.txt AC 2 ms 256 KiB
rand_20.txt AC 3 ms 256 KiB
rand_21.txt AC 7 ms 256 KiB
rand_22.txt AC 7 ms 256 KiB
rand_23.txt AC 7 ms 256 KiB
rand_24.txt AC 7 ms 256 KiB
rand_25.txt AC 7 ms 256 KiB
rand_26.txt AC 7 ms 256 KiB
rand_27.txt AC 4 ms 256 KiB
rand_28.txt AC 5 ms 256 KiB
rand_29.txt AC 4 ms 256 KiB
rand_30.txt AC 4 ms 256 KiB
rand_31.txt AC 3 ms 256 KiB
rand_32.txt AC 5 ms 256 KiB
rand_33.txt AC 5 ms 256 KiB
rand_34.txt AC 4 ms 256 KiB
rand_35.txt AC 4 ms 256 KiB
rand_36.txt AC 4 ms 256 KiB
rand_37.txt AC 3 ms 256 KiB
rand_38.txt AC 5 ms 256 KiB
rand_39.txt AC 4 ms 256 KiB
rand_40.txt AC 5 ms 256 KiB
rand_41.txt AC 5 ms 256 KiB
rand_42.txt AC 3 ms 256 KiB
rand_43.txt AC 5 ms 256 KiB
rand_44.txt AC 4 ms 256 KiB
rand_45.txt AC 4 ms 256 KiB
sample_01.txt AC 1 ms 256 KiB
sample_02.txt AC 1 ms 256 KiB
sample_03.txt AC 1 ms 256 KiB