fork download
copy 
  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.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> b;
  32.  
  33. int consistency(int n, int m){
  34.  
  35. 	if(m==1) return 1;
  36.  
  37. 	vector<int> prefix(m, n);
  38. 	int i = 0, j = 0;
  39. 	while(i<n && j < m){
  40. 		while(i<n && a[i] != b[j]) i++;
  41. 		if(i==n) break;
  42.  
  43. 		prefix[j] = i;
  44. 		i++;
  45. 		j++;
  46. 	}
  47.  
  48. 	vector<int> sufix(m, -1);
  49. 	i = n-1, j = m-1;
  50. 	while(i>=0 && j>=0){
  51. 		while(i>=0 && a[i] != b[j]) i--;
  52. 		if(i==-1) break;
  53.  
  54. 		sufix[j] = i;
  55. 		i--;
  56. 		j--;
  57. 	}
  58.  
  59. 	int ans = 0;
  60.  
  61. 	for(int i=0; i<m; i++){
  62. 		if(i==0){
  63. 			if(sufix[i+1] != -1)	ans++;
  64. 		}
  65. 		else if(i==m-1){
  66. 			if(prefix[i-1] != n)	ans++;
  67. 		}
  68. 		else{
  69. 			int left = prefix[i-1];
  70. 			int right = sufix[i+1];
  71.  
  72. 			if(left < right){
  73. 				ans++;
  74. 			}
  75. 		}
  76. 	}
  77.  
  78. 	return ans;
  79. }
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88. // vector<int> a;
  89. // vector<int> b;
  90.  
  91. int practice(int n, int m){
  92.  
  93.  
  94. }
  95.  
  96.  
  97.  
  98.  
  99.  
  100. void solve() {
  101.  
  102.     int n, m;
  103.     cin >> n >> m;
  104.  
  105.     a.resize(n);
  106.     b.resize(m);
  107.  
  108.     for(int i=0; i<n; i++) cin >> a[i];
  109.     for(int i=0; i<m; i++) cin >> b[i];
  110.  
  111.     cout << consistency(n, m) << endl;
  112.  
  113.  
  114. }
  115.  
  116.  
  117.  
  118.  
  119.  
  120. int32_t main() {
  121.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  122.  
  123.     int t = 1;
  124.     cin >> t;
  125.     while (t--) {
  126.         solve();
  127.     }
  128.  
  129.     return 0;
  130. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
4
4 5
1 2 2 3
1 2 2 2 3
9 6
2 7 8 1 4 6 3 9 8
2 8 4 15 9 8
8 6
2 7 8 1 4 6 3 8
2 8 4 15 9 8
9 5
2 7 8 1 4 6 3 8 9
2 8 3 8 9
stdout
copy 
3
1
0
5
https://ideone.com/zCHBrK
language:
C++14 (gcc 8.3)
created:
3 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!