Advertisement
Guest User

Untitled

a guest
Mar 18th, 2018
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.74 KB | None | 0 0
  1. #pragma GCC optimize("O3")
  2. #include <bits/stdc++.h>
  3. #define MOD 1000000007
  4. using namespace std;
  5. typedef unsigned long long ll;
  6. typedef pair< int , int > PII;
  7.  
  8. ll n, m, a, b, p, fact[101000], rs;
  9. map < int , ll > M;
  10.  
  11. int main(){
  12. ios_base::sync_with_stdio(0);
  13. cin.tie(0); cout.tie(0);
  14. cin >> p;
  15.  
  16. cin >> n;
  17. for (int i = 1; i <= n; i++) cin >> a, M[a]++;
  18.  
  19. cin >> m;
  20. for (int j = 1; j <= m; j++) cin >> b, rs += (M[b] > 0);
  21.  
  22. fact[0] = 1;
  23. for (int i = 1; i <= p; i++) fact[i] = i * fact[i - 1] % MOD;
  24.  
  25. ll ans = 0;
  26. ll check = M.size();
  27.  
  28. for (int i = 1; i <= p - check + 1; i++){
  29. ans += fact[p - i];
  30. ans %= MOD;
  31. }
  32.  
  33. cout << ans * rs % MOD;
  34.  
  35. return 0;
  36. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement