Merge pull request ashutosh97#31 from imashwani/master

added question Aggressive cows spoj

Author: ashutosh97

Aggressive Cows Spoj/problem statement.txt

@@ -0,0 +1,34 @@
+AGGRCOW - Aggressive cows
+#binary-search
+
+Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000).
+
+His C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ wants to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?
+Input
+
+t � the number of test cases, then t test cases follows.
+* Line 1: Two space-separated integers: N and C
+* Lines 2..N+1: Line i+1 contains an integer stall ___location, xi
+Output
+
+For each test case output one integer: the largest minimum distance.
+Example
+
+Input:
+
+1
+5 3
+1
+2
+8
+4
+9
+
+Output:
+
+3
+
+Output details:
+
+FJ can put his 3 cows in the stalls at positions 1, 4 and 8,
+resulting in a minimum distance of 3.

Aggressive Cows Spoj/solution1.cpp

@@ -0,0 +1,42 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  long long t,n,c;
+  cin>>t;
+  vector<long long> ans;
+  
+  while(t--){
+    cin>>n>>c;
+    long long x[n];
+    long long mind=LLONG_MAX;
+    for(long long i=0;i<n;i++){
+      cin>>x[i];
+      mind=min(x[i],mind);
+    }
+    sort(x,x+n);
+
+    long long low=mind;
+    long long high=x[n-1]-x[0];
+    long long mid;
+
+    while(low < high){
+      mid = low+(high-low+1)/2;
+      long long cows=1;
+      long long idx=0;
+      for(long long i=1;i<n;i++){
+        if(x[i]-x[idx] >= mid) {cows++; idx=i;}
+      }
+      if(cows >= c) low=mid;
+      else high=mid-1;
+    }
+    ans.push_back(low);
+  }
+
+  for(vector<long long>::iterator it=ans.begin();it!=ans.end();it++){
+    cout<<*it<<endl;
+  }
+  return 0;
+}

Aggressive Cows Spoj/solution2.cpp

@@ -0,0 +1,42 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  long long t,n,c;
+  cin>>t;
+  vector<long long> ans;
+  while(t--){
+    cin>>n>>c;
+    long long x[n];
+    long long mind=LLONG_MAX;
+    for(long long i=0;i<n;i++){
+      cin>>x[i];
+      mind=min(x[i],mind);
+    }
+    sort(x,x+n);
+
+    long long low=mind;
+    long long high=x[n-1]-x[0];
+    long long mid;
+    long long maxd=-1;
+
+    while(low < high){
+      mid = low+(high-low)/2;
+      long long cows=1;
+      long long idx=0;
+      for(long long i=1;i<n;i++){
+        if(x[i]-x[idx] >= mid) {cows++; idx=i;}
+      }
+      if(cows >= c) {low=mid+1; maxd=max(maxd,mid);}
+      else high=mid;
+    }
+    ans.push_back(maxd);
+  }
+
+  for(vector<long long>::iterator it=ans.begin();it!=ans.end();it++){
+    cout<<*it<<endl;
+  }
+  return 0;
+}