Submission #36260221

Source Code Expand

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const int mod = 998244353;
void amod(int &x, int y) {
	x = x + y >= mod ? x + y - mod : x + y;
}
int f[105][105], s[3];
int calc(int n, int m) {
	memset(f, 0, sizeof(f));
	for(int i = 0; i <= m; i++) {
		f[1][i] = 1;
	}
	for(int i = 2; i <= n; i++) {
		s[0] = s[1] = s[2] = 0;
		for(int j = 0; j <= m; j++) {
			for(int o = 0; o <= 2; o++) {
				if(o != j % 3) {
					amod(f[i][j], s[o]);
				}
			}
			amod(s[j % 3], f[i - 1][j]);
		}
	}
	int ans = 0;
	for(int i = 0; i <= m; i++) {
		amod(ans, f[n][i]);
	}
	return ans;	
}
int n, m;
int main() {
	// gg
#ifdef DEBUG
	freopen("1.in", "r", stdin);
	freopen("1.out", "w", stdout);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	cout << calc(n, m) << '\n';
	return 0;
}

Submission Info

Submission Time
Task G - Count Sequences
User yanchengzhi
Language C++ (GCC 9.2.1)
Score 0
Code Size 951 Byte
Status RE
Exec Time 109 ms
Memory 3680 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 1
RE × 1
AC × 13
RE × 36
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_smallNM_00.txt, 01_smallNM_01.txt, 01_smallNM_02.txt, 01_smallNM_03.txt, 01_smallNM_04.txt, 01_smallNM_05.txt, 01_smallNM_06.txt, 01_smallNM_07.txt, 01_smallNM_08.txt, 01_smallNM_09.txt, 01_smallNM_10.txt, 01_smallNM_11.txt, 02_smallN_00.txt, 02_smallN_01.txt, 02_smallN_02.txt, 02_smallN_03.txt, 02_smallN_04.txt, 02_smallN_05.txt, 02_smallN_06.txt, 03_rnd_00.txt, 03_rnd_01.txt, 03_rnd_02.txt, 03_rnd_03.txt, 03_rnd_04.txt, 03_rnd_05.txt, 03_rnd_06.txt, 03_rnd_07.txt, 04_max_00.txt, 04_max_01.txt, 04_max_02.txt, 04_max_03.txt, 04_max_04.txt, 04_max_05.txt, 04_max_06.txt, 04_max_07.txt, 04_max_08.txt, 04_max_09.txt, 04_max_10.txt, 04_max_11.txt, 04_max_12.txt, 04_max_13.txt, 04_max_14.txt, 04_max_15.txt, 04_max_16.txt, 04_max_17.txt, 04_max_18.txt, 04_max_19.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 6 ms 3524 KiB
00_sample_01.txt RE 105 ms 3300 KiB
01_smallNM_00.txt AC 3 ms 3564 KiB
01_smallNM_01.txt AC 2 ms 3552 KiB
01_smallNM_02.txt AC 2 ms 3572 KiB
01_smallNM_03.txt AC 2 ms 3524 KiB
01_smallNM_04.txt AC 2 ms 3640 KiB
01_smallNM_05.txt AC 2 ms 3604 KiB
01_smallNM_06.txt AC 2 ms 3512 KiB
01_smallNM_07.txt AC 2 ms 3576 KiB
01_smallNM_08.txt AC 2 ms 3520 KiB
01_smallNM_09.txt AC 2 ms 3624 KiB
01_smallNM_10.txt AC 2 ms 3680 KiB
01_smallNM_11.txt AC 2 ms 3648 KiB
02_smallN_00.txt RE 108 ms 3300 KiB
02_smallN_01.txt RE 104 ms 3204 KiB
02_smallN_02.txt RE 103 ms 3256 KiB
02_smallN_03.txt RE 105 ms 3208 KiB
02_smallN_04.txt RE 105 ms 3324 KiB
02_smallN_05.txt RE 104 ms 3300 KiB
02_smallN_06.txt RE 107 ms 3376 KiB
03_rnd_00.txt RE 105 ms 3284 KiB
03_rnd_01.txt RE 103 ms 3316 KiB
03_rnd_02.txt RE 103 ms 3316 KiB
03_rnd_03.txt RE 104 ms 3388 KiB
03_rnd_04.txt RE 104 ms 3268 KiB
03_rnd_05.txt RE 104 ms 3308 KiB
03_rnd_06.txt RE 103 ms 3284 KiB
03_rnd_07.txt RE 104 ms 3260 KiB
04_max_00.txt RE 104 ms 3284 KiB
04_max_01.txt RE 103 ms 3308 KiB
04_max_02.txt RE 104 ms 3308 KiB
04_max_03.txt RE 107 ms 3388 KiB
04_max_04.txt RE 104 ms 3324 KiB
04_max_05.txt RE 104 ms 3256 KiB
04_max_06.txt RE 103 ms 3324 KiB
04_max_07.txt RE 104 ms 3208 KiB
04_max_08.txt RE 104 ms 3288 KiB
04_max_09.txt RE 104 ms 3320 KiB
04_max_10.txt RE 104 ms 3308 KiB
04_max_11.txt RE 105 ms 3252 KiB
04_max_12.txt RE 104 ms 3304 KiB
04_max_13.txt RE 105 ms 3268 KiB
04_max_14.txt RE 103 ms 3300 KiB
04_max_15.txt RE 109 ms 3304 KiB
04_max_16.txt RE 105 ms 3256 KiB
04_max_17.txt RE 103 ms 3328 KiB
04_max_18.txt RE 103 ms 3304 KiB
04_max_19.txt RE 104 ms 3304 KiB