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. // 6
  28. // 8 4 9 11 7 13
  29. // 10 5 8 8 4 14
  30.  
  31.  
  32. vector<int> a;
  33. vector<int> b;
  34.  
  35. int consistency(int n){
  36.  
  37. 	unordered_map<int, int> mp = {{0, -1}};
  38.  
  39. 	int xora = 0;
  40. 	int xorb = 0;
  41.  
  42. 	int maxLen = 0;
  43.  
  44. 	for(int i=0; i<n; i++){
  45. 		xora ^= a[i];
  46. 		xorb ^= b[i];
  47.  
  48. 		if(mp.count(xora ^ xorb)){
  49. 			int j = mp[xora ^ xorb];
  50. 			int len = i - j;
  51. 			if(len > maxLen){
  52. 				maxLen = len;
  53. 			}
  54. 		}
  55. 		else mp[xora ^ xorb] = i;
  56. 	}
  57.  
  58.  
  59. 	return maxLen;
  60.  
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77. int practice(int n){
  78.  
  79. 	return 0;
  80. }
  81.  
  82.  
  83.  
  84.  
  85.  
  86. void solve() {
  87.  
  88.     int n;
  89.     cin>> n;
  90.  
  91.     a.resize(n);
  92.     b.resize(n);
  93.     for(int i=0; i<n; i++) cin >> a[i];
  94.     for(int i=0; i<n; i++) cin >> b[i];
  95.  
  96.     cout << consistency(n) << endl;
  97.  
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. int32_t main() {
  105.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  106.  
  107.     int t = 1;
  108.     // cin >> t;
  109.     while (t--) {
  110.         solve();
  111.     }
  112.  
  113.     return 0;
  114. }
Success #stdin #stdout 0s 5300KB
comments (?)
stdin
copy 
6
8 4 9 11 7 13
10 5 8 8 4 14
stdout
copy 
4
https://ideone.com/7uj145
language:
C++14 (gcc 8.3)
created:
4 days 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!