Submission #39254176

Source Code Expand

#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
using namespace std;

const int P = 998244353;

inline void add(int &a, const int &b) { a += b; a = (a >= P ? a - P : a); }
inline int aad(const int &a, const int &b) { return (a + b >= P ? a + b - P : a + b); }
inline void mul(int &a, const int &b) { a = 1ll * a * b % P; }
inline int mut(const int &a, const int &b) { return 1ll * a * b % P; }

const int NR = 2 * 1e5 + 10;

int n;
int a[NR][2];
int f[NR][2];

int main()
{
#ifdef WYZ
	freopen("1.in", "r", stdin);
	freopen("1.out", "w", stdout);
#endif
	ios::sync_with_stdio(0);

	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i][0] >> a[i][1];

	f[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		if (a[i][0] != a[i - 1][0]) add(f[i][0], f[i - 1][0]);
		if (a[i][0] != a[i - 1][1]) add(f[i][0], f[i - 1][1]);
		if (a[i][1] != a[i - 1][0]) add(f[i][1], f[i - 1][0]);
		if (a[i][1] != a[i - 1][1]) add(f[i][1], f[i - 1][1]);
	}

	cout << aad(f[n][0], f[n][1]) << '\n';
	
	return 0;
}

Submission Info

Submission Time
Task D - Flip Cards
User TimWYZ
Language C++ (GCC 9.2.1)
Score 400
Code Size 1070 Byte
Status AC
Exec Time 49 ms
Memory 6740 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 50
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_small_00.txt, 01_small_01.txt, 01_small_02.txt, 01_small_03.txt, 01_small_04.txt, 02_large_00.txt, 02_large_01.txt, 02_large_02.txt, 02_large_03.txt, 02_large_04.txt, 02_large_05.txt, 02_large_06.txt, 02_large_07.txt, 02_large_08.txt, 02_large_09.txt, 02_large_10.txt, 02_large_11.txt, 02_large_12.txt, 02_large_13.txt, 02_large_14.txt, 02_large_15.txt, 02_large_16.txt, 02_large_17.txt, 02_large_18.txt, 02_large_19.txt, 02_large_20.txt, 02_large_21.txt, 02_large_22.txt, 02_large_23.txt, 02_large_24.txt, 02_large_25.txt, 02_large_26.txt, 02_large_27.txt, 02_large_28.txt, 02_large_29.txt, 03_same_00.txt, 03_same_01.txt, 03_same_02.txt, 03_same_03.txt, 03_same_04.txt, 03_same_05.txt, 03_same_06.txt, 03_same_07.txt, 03_same_08.txt, 03_same_09.txt, 04_min_00.txt, 04_min_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 9 ms 3512 KiB
00_sample_01.txt AC 2 ms 3608 KiB
00_sample_02.txt AC 2 ms 3616 KiB
01_small_00.txt AC 3 ms 3616 KiB
01_small_01.txt AC 3 ms 3576 KiB
01_small_02.txt AC 2 ms 3540 KiB
01_small_03.txt AC 2 ms 3532 KiB
01_small_04.txt AC 3 ms 3560 KiB
02_large_00.txt AC 49 ms 6700 KiB
02_large_01.txt AC 47 ms 6576 KiB
02_large_02.txt AC 46 ms 6624 KiB
02_large_03.txt AC 44 ms 6732 KiB
02_large_04.txt AC 47 ms 6572 KiB
02_large_05.txt AC 45 ms 6644 KiB
02_large_06.txt AC 46 ms 6628 KiB
02_large_07.txt AC 46 ms 6628 KiB
02_large_08.txt AC 47 ms 6620 KiB
02_large_09.txt AC 46 ms 6732 KiB
02_large_10.txt AC 45 ms 6732 KiB
02_large_11.txt AC 48 ms 6624 KiB
02_large_12.txt AC 43 ms 6616 KiB
02_large_13.txt AC 46 ms 6732 KiB
02_large_14.txt AC 45 ms 6696 KiB
02_large_15.txt AC 45 ms 6632 KiB
02_large_16.txt AC 45 ms 6680 KiB
02_large_17.txt AC 47 ms 6572 KiB
02_large_18.txt AC 45 ms 6628 KiB
02_large_19.txt AC 45 ms 6728 KiB
02_large_20.txt AC 45 ms 6680 KiB
02_large_21.txt AC 45 ms 6740 KiB
02_large_22.txt AC 48 ms 6620 KiB
02_large_23.txt AC 47 ms 6572 KiB
02_large_24.txt AC 44 ms 6680 KiB
02_large_25.txt AC 45 ms 6704 KiB
02_large_26.txt AC 47 ms 6704 KiB
02_large_27.txt AC 45 ms 6688 KiB
02_large_28.txt AC 45 ms 6628 KiB
02_large_29.txt AC 44 ms 6616 KiB
03_same_00.txt AC 46 ms 6644 KiB
03_same_01.txt AC 45 ms 6728 KiB
03_same_02.txt AC 46 ms 6700 KiB
03_same_03.txt AC 47 ms 6628 KiB
03_same_04.txt AC 45 ms 6628 KiB
03_same_05.txt AC 45 ms 6692 KiB
03_same_06.txt AC 44 ms 6688 KiB
03_same_07.txt AC 47 ms 6628 KiB
03_same_08.txt AC 47 ms 6692 KiB
03_same_09.txt AC 42 ms 5012 KiB
04_min_00.txt AC 3 ms 3568 KiB
04_min_01.txt AC 3 ms 3500 KiB