Submission #30883174

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void fast_io() {
  cin.tie(0)->sync_with_stdio(0);
}
const int MAX = 2e5, MOD = 998244353;
int p[MAX], q[MAX];
vector<int> graph[MAX + 1];
ll lucas[MAX + 1];
bool vis[MAX + 1];
int cyc;
void dfs(int v) {
  vis[v] = 1;
  for (int u : graph[v]) {
    if (!vis[u]) dfs(u);
  }
  cyc++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void fast_io() {
  cin.tie(0)->sync_with_stdio(0);
}

const int MAX = 2e5, MOD = 998244353;
int p[MAX], q[MAX];
vector<int> graph[MAX + 1];
ll lucas[MAX + 1];
bool vis[MAX + 1];

int cyc;
void dfs(int v) {
  vis[v] = 1;
  for (int u : graph[v]) {
    if (!vis[u]) dfs(u);
  }
  cyc++;
}

void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> p[i];
  for (int i = 0; i < n; i++) cin >> q[i];
  for (int i = 0; i < n; i++) {
    graph[p[i]].push_back(q[i]);
    graph[q[i]].push_back(p[i]);
  }

  ll ans = 1;
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      cyc = 0;
      dfs(i);
      ans = (ans * lucas[cyc]) % MOD;
    }
  }

  cout << ans << '\n';

}

int main() {
  fast_io();

  lucas[0] = 2, lucas[1] = 1;
  for (int i = 2; i <= MAX; i++) lucas[i] = (lucas[i - 1] + lucas[i - 2]) % MOD;

  int t = 1;
  // cin >> t;
  while (t--) solve();
}

Submission Info

Judge Result