Submission #2403326


Source Code Expand

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
using namespace std;
typedef long long ll;
ll mod = 998244353;
ll dp[303030][3][3][2];
set<string>se;
void dfs(string s)
{
	if (se.find(s) != se.end())return;
	se.insert(s);
	for (int i = 0; i < s.size() - 1; i++)
	{
		if (s[i] != s[i + 1])
		{
			string z = s;
			z[i] = z[i + 1] = int('a') + int('b') + int('c') - s[i] - s[i + 1];
			dfs(z);
		}
	}
}
int main()
{
	string s;
	cin >> s;
	se.clear();
	for (int i = 0; i <= s.size(); i++)for (int j = 0; j < 3; j++)for (int k = 0; k < 3; k++)for (int l = 0; l < 2; l++)dp[i][j][k][l] = 0;
	if (s.size() <= 3)
	{
		dfs(s);
		printf("%d\n", se.size());
	}
	else
	{
		bool f1 = false, f2 = false;
		int cnt = 0;
		for (int i = 0; i < s.size(); i++)cnt += s[i] - 'a';
		for (int i = 0; i < s.size() - 1; i++)
		{
			if (s[i] != s[i + 1])f1 = true;
			else f2 = true;
		}
		cnt %= 3;
		if (!f1)printf("1\n");
		else
		{
			dp[1][0][0][0] = dp[1][1][1][0] = dp[1][2][2][0] = 1;
			for (int i = 1; i < s.size(); i++)
			{
				for (int j = 0; j < 3; j++)
				{
					for (int k = 0; k < 3; k++)
					{
						for (int l = 0; l < 3; l++)
						{
							if (k == l)
							{
								dp[i + 1][(j + l) % 3][l][1] += dp[i][j][k][0] + dp[i][j][k][1];
							}
							else
							{
								dp[i + 1][(j + l) % 3][l][0] += dp[i][j][k][0];
								dp[i + 1][(j + l) % 3][l][1] += dp[i][j][k][1];
							}
						}
					}
				}
				for (int j = 0; j < 3; j++)for (int k = 0; k < 3; k++)for (int l = 0; l < 2; l++)dp[i + 1][j][k][l] %= mod;
			}
			ll ans = 0;
			for (int i = 0; i < 3; i++)ans += dp[s.size()][cnt][i][1];
			if (!f2)ans++;
			printf("%lld\n", ans%mod);
		}
	}
}

Submission Info

Submission Time
Task F - Normalization
User DEGwer
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1793 Byte
Status AC
Exec Time 68 ms
Memory 29188 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:35:27: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘std::set<std::basic_string<char> >::size_type {aka long unsigned int}’ [-Wformat=]
   printf("%d\n", se.size());
                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 4
AC × 78
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 70.txt, 71.txt, 72.txt, 73.txt, 74.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
29.txt AC 1 ms 256 KB
30.txt AC 1 ms 256 KB
31.txt AC 1 ms 256 KB
32.txt AC 1 ms 256 KB
33.txt AC 1 ms 256 KB
34.txt AC 1 ms 256 KB
35.txt AC 1 ms 256 KB
36.txt AC 1 ms 256 KB
37.txt AC 56 ms 25092 KB
38.txt AC 8 ms 4352 KB
39.txt AC 5 ms 1664 KB
40.txt AC 28 ms 12672 KB
41.txt AC 67 ms 29188 KB
42.txt AC 61 ms 27140 KB
43.txt AC 43 ms 18944 KB
44.txt AC 66 ms 29188 KB
45.txt AC 36 ms 16896 KB
46.txt AC 60 ms 27140 KB
47.txt AC 53 ms 23044 KB
48.txt AC 34 ms 14848 KB
49.txt AC 33 ms 14848 KB
50.txt AC 23 ms 10624 KB
51.txt AC 37 ms 16896 KB
52.txt AC 9 ms 4352 KB
53.txt AC 49 ms 20996 KB
54.txt AC 16 ms 6528 KB
55.txt AC 42 ms 18944 KB
56.txt AC 44 ms 18944 KB
57.txt AC 7 ms 4352 KB
58.txt AC 59 ms 25092 KB
59.txt AC 3 ms 896 KB
60.txt AC 47 ms 20996 KB
61.txt AC 6 ms 10624 KB
62.txt AC 5 ms 8576 KB
63.txt AC 15 ms 27140 KB
64.txt AC 15 ms 27140 KB
65.txt AC 12 ms 23044 KB
66.txt AC 12 ms 20996 KB
67.txt AC 68 ms 29188 KB
68.txt AC 68 ms 29188 KB
69.txt AC 68 ms 29188 KB
70.txt AC 68 ms 29188 KB
71.txt AC 68 ms 29188 KB
72.txt AC 68 ms 29188 KB
73.txt AC 68 ms 29188 KB
74.txt AC 68 ms 29188 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB
s4.txt AC 1 ms 256 KB