提出 #10807660


ソースコード 拡げる

#include <cstdio>
#include <cstring>

const int Mod = 1000000007;
const int MN = 100005;

int N, Sum; char s[MN];
int nx[MN][2], f[MN];

int main() {
	scanf("%s", s + 1), N = strlen(s + 1);
	int flag = 1;
	for (int i = 1; i < N; ++i) if (s[i] == s[i + 1]) flag = 0;
	if (flag) return puts("1"), 0;
	f[N + 1] = 1, nx[N + 1][0] = nx[N + 1][1] = nx[N + 2][0] = nx[N + 2][1] = N + 2;
	for (int i = N; i >= 1; --i) {
		(Sum += s[i] == 'a' ? 1 : 2) %= 3;
		nx[i][0] = s[i] == 'a' ? i + 1 : s[i + 1] == 'b' ? i + 2 : nx[i + 2][0];
		nx[i][1] = s[i] == 'b' ? i + 1 : s[i + 1] == 'a' ? i + 2 : nx[i + 2][1];
		f[i] = (f[nx[i][0]] + f[nx[i][1]] + (Sum == 0)) % Mod;
	}
	printf("%d\n", (f[1] - (Sum == 0) + Mod) % Mod);
	return 0;
}

提出情報

提出日時
問題 E - ABBreviate
ユーザ PinkRabbit
言語 C++14 (GCC 5.4.1)
得点 1300
コード長 744 Byte
結果 AC
実行時間 2 ms
メモリ 1408 KiB

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", s + 1), N = strlen(s + 1);
                                       ^

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 1300 / 1300
結果
AC × 4
AC × 60
セット名 テストケース
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt
ケース名 結果 実行時間 メモリ
0_00.txt AC 1 ms 128 KiB
0_01.txt AC 1 ms 128 KiB
0_02.txt AC 1 ms 128 KiB
0_03.txt AC 1 ms 128 KiB
1_00.txt AC 1 ms 128 KiB
1_01.txt AC 1 ms 128 KiB
1_02.txt AC 1 ms 128 KiB
1_03.txt AC 1 ms 128 KiB
1_04.txt AC 1 ms 128 KiB
1_05.txt AC 2 ms 256 KiB
1_06.txt AC 1 ms 128 KiB
1_07.txt AC 1 ms 128 KiB
1_08.txt AC 1 ms 128 KiB
1_09.txt AC 1 ms 128 KiB
1_10.txt AC 1 ms 128 KiB
1_11.txt AC 1 ms 128 KiB
1_12.txt AC 2 ms 1408 KiB
1_13.txt AC 2 ms 1408 KiB
1_14.txt AC 1 ms 256 KiB
1_15.txt AC 1 ms 256 KiB
1_16.txt AC 2 ms 1408 KiB
1_17.txt AC 2 ms 1408 KiB
1_18.txt AC 1 ms 256 KiB
1_19.txt AC 1 ms 256 KiB
1_20.txt AC 2 ms 1408 KiB
1_21.txt AC 2 ms 1408 KiB
1_22.txt AC 1 ms 256 KiB
1_23.txt AC 1 ms 256 KiB
1_24.txt AC 2 ms 1408 KiB
1_25.txt AC 2 ms 1408 KiB
1_26.txt AC 2 ms 1408 KiB
1_27.txt AC 2 ms 1408 KiB
1_28.txt AC 2 ms 1408 KiB
1_29.txt AC 2 ms 1408 KiB
1_30.txt AC 2 ms 1408 KiB
1_31.txt AC 2 ms 1408 KiB
1_32.txt AC 2 ms 1408 KiB
1_33.txt AC 2 ms 1408 KiB
1_34.txt AC 2 ms 1408 KiB
1_35.txt AC 2 ms 1408 KiB
1_36.txt AC 2 ms 1408 KiB
1_37.txt AC 2 ms 1408 KiB
1_38.txt AC 2 ms 1408 KiB
1_39.txt AC 2 ms 1408 KiB
1_40.txt AC 2 ms 1408 KiB
1_41.txt AC 2 ms 1408 KiB
1_42.txt AC 2 ms 1408 KiB
1_43.txt AC 2 ms 1408 KiB
1_44.txt AC 2 ms 1408 KiB
1_45.txt AC 2 ms 1408 KiB
1_46.txt AC 2 ms 1408 KiB
1_47.txt AC 2 ms 1408 KiB
1_48.txt AC 2 ms 1408 KiB
1_49.txt AC 2 ms 1408 KiB
1_50.txt AC 2 ms 1408 KiB
1_51.txt AC 2 ms 1408 KiB
1_52.txt AC 2 ms 1408 KiB
1_53.txt AC 2 ms 1408 KiB
1_54.txt AC 2 ms 1408 KiB
1_55.txt AC 1 ms 256 KiB