fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6. inline int power(int a, int b) {
  7. int x = 1;
  8. while (b) {
  9. if (b & 1) x *= a;
  10. a *= a;
  11. b >>= 1;
  12. }
  13. return x;
  14. }
  15.  
  16.  
  17. const int M = 1000000007;
  18. const int N = 3e5+9;
  19. const int INF = 2e9+1;
  20. const int LINF = 2000000000000000001;
  21.  
  22. //_ ***************************** START Below *******************************
  23.  
  24. vector<int> a;
  25. vector<int> b;
  26.  
  27. int consistency(int n, int m){
  28. int ans = 0;
  29.  
  30. int i = 0, j = 0;
  31. while(i<n && j<m){
  32. while(i<n && a[i] < b[j]) i++;
  33. if(i==n) break;
  34.  
  35. while(j<m && b[j] < a[i]) j++;
  36. if(j==m) break;
  37.  
  38. if(a[i] != b[j]) continue;
  39.  
  40. int p = i+1;
  41. while(p<n && a[p] == a[i]) p++;
  42.  
  43. int q = j+1;
  44. while(q<m && b[q] == b[j]) q++;
  45.  
  46. ans += (p-i)*(q-j);
  47.  
  48. i = p;
  49. j = q;
  50. }
  51.  
  52. return ans;
  53. }
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62. int practice(int n, int m){
  63.  
  64. return 0;
  65. }
  66.  
  67.  
  68. void solve() {
  69.  
  70. int n, m;
  71. cin>>n >> m;
  72.  
  73. a.resize(n);
  74. b.resize(m);
  75. for(int i=0; i<n; i++) cin >> a[i];
  76. for(int i=0; i<m; i++) cin >> b[i];
  77.  
  78. cout << consistency(n, m) << endl;
  79.  
  80.  
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. int32_t main() {
  88. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  89.  
  90. int t = 1;
  91. while (t--) {
  92. solve();
  93. }
  94.  
  95. return 0;
  96. }
Success #stdin #stdout 0s 5320KB
stdin
8 6
1 1 3 3 3 5 5 5
2 4 4 4 6 7
stdout
0