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