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