-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2144c.cpp
More file actions
56 lines (49 loc) · 1.27 KB
/
Copy path2144c.cpp
File metadata and controls
56 lines (49 loc) · 1.27 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
const ll MOD = 998244353;
int main() {
cin.tie(0)->sync_with_stdio(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vi a(n);
vi b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vll dp_no_swap(n);
vll dp_swap(n);
dp_no_swap[0] = 1;
dp_swap[0] = 1;
for (int i = 1; i < n; i++) {
if (a[i - 1] <= a[i] && b[i - 1] <= b[i]) {
dp_no_swap[i] += dp_no_swap[i - 1];
dp_swap[i] += dp_swap[i - 1];
}
if (b[i - 1] <= a[i] && a[i - 1] <= b[i]) {
dp_no_swap[i] += dp_swap[i - 1];
dp_swap[i] += dp_no_swap[i - 1];
}
dp_no_swap[i] %= MOD;
dp_swap[i] %= MOD;
}
ll ans = dp_no_swap[n - 1] + dp_swap[n - 1];
ans %= MOD;
cout << ans << endl;
}
}