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. // 5 3
  28. // 1 2 8 4 9
  29.  
  30.  
  31.  
  32. vector<int> a;
  33.  
  34. bool isPossible(int n, int k, vector<int>& a, int mid){
  35.     int cows = 1;
  36.     for(int i=0; i<n; ){
  37.         int j = i+1;
  38.         while(j<n && a[j] - a[i] < mid) j++;
  39.         if(j==n) break;
  40.         cows++;
  41.         i = j;
  42.     }
  43.     return cows>=k; 
  44. }
  45.  
  46.  
  47.  
  48. int consistency1(int n, int k){
  49. 	vector<int> b(a);
  50.     sort(begin(b), end(b));
  51.  
  52.     int s = 0, e = INF;
  53.     int ans = 0;
  54.     while(s<=e){
  55.         int mid = s + (e-s)/2;
  56.         if(isPossible(n, k, b, mid)){
  57.             ans = max(ans, mid);
  58.             s = mid+1;
  59.         }
  60.         else{ 
  61.             e = mid-1;
  62.         }
  63.  
  64.     }
  65.  
  66.     return ans;
  67.  
  68. }
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75. int consistency2(int n, int k){
  76.  
  77. 	vector<int> b(a);
  78.  
  79. 	sort(begin(b), end(b));
  80.  
  81. 	int s = 0, e = INF;
  82.  
  83. 	while(s<e){
  84. 		int mid = s + (e-s+1)/2;
  85. 		if(isPossible(n, k, b, mid)){
  86. 			s = mid;
  87. 		}
  88. 		else e = mid-1;
  89. 	}
  90.  
  91. 	return e;
  92.  
  93. }
  94.  
  95.  
  96.  
  97.  
  98.  
  99.  
  100.  
  101.  
  102.  
  103.  
  104.  
  105.  
  106.  
  107.  
  108.  
  109. int practice(int n, int k){
  110.  
  111. 	return 0;
  112.  
  113. }
  114.  
  115.  
  116.  
  117.  
  118.  
  119. void solve() {
  120.  
  121.     int n, k;
  122.     cin>>n >> k;
  123.     a.resize(n);
  124.  
  125.     for(int i=0; i<n; i++) cin >> a[i];
  126.     cout << consistency1(n, k) << " " << consistency2(n,k) << endl;
  127.  
  128.     // cout << consistency1(n, k) << " -> " << practice(n, k) << endl;
  129.  
  130. }
  131.  
  132.  
  133.  
  134.  
  135.  
  136. int32_t main() {
  137.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  138.  
  139.     int t = 1;
  140.     // cin >> t;
  141.     while (t--) {
  142.         solve();
  143.     }
  144.  
  145.     return 0;
  146. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
5 3
1 2 8 4 9
stdout
copy 
3 3
https://ideone.com/w8BS38
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!