Pie

the error I get is "sort was not declared in this scope"

Different installations of g++ are set up in different ways. sort() is declared in the header - the header probably includes it on SPOJ's installation and not on yours. On my installation, I can only use memset() if I have #include ; that file doesn't seem to be included elsewhere.

I don't think it's a precision error. You've used doubles and M_PI, that's as precise as it's going to get.

Your reasoning is flawed. Consider:

      if(v.size()>=ff){
         ans = pi*v[ff-1];
         printf("%0.4f\n" ,ans);
      }

So in other words, if there are at least enough pies to go around, you can give everybody a piece with size equal to that of the smallest pie, right?
Well this isn't going to work. What about a case like this:

1
2 1
1 100

There is one friend, so two people in total. There are two pies, one really big (r = 100) and one really small (r = 1).
Your output:

3.1416

That is, each person gets a piece equal in area to the smaller pie.
Correct output:

15707.963

The optimal solution is for you and your friend to split the large pie, leaving the small one untouched.

Here's a hint on how to solve this problem: Let's say each person is to get a piece of size X, can you determine whether or not this is possible?

I am getting WA for this problem spoj.pl/problems/PIE/
Here's my code

[color=#804080][bbone=text,39]Code removed[/bbone][/color]

It's giving the correct output for the given test cases. So, can somebody please give me some test cases where this goes wrong?
Also, I think there must be a better way to approach these type of problems rather than this crude method where I just took all the possibilities in consideration and coded according to that. So, if somebody can give some hint of a better algo, he's most welcome. Thanks in advance.

You can use binary search to solve this problem. Lets say you think everyone can get a piece of volume V. Try to find out if it is achievable. If not then all volumes above V is unachievable. You can use the absolute error of 10^(-3) to your advantage while performing the binary search.

Ok. Got it. Thanks man. Will try doing this again using binary search.

[quote="Brian"]

15707.963

[/quote]

Please correct this, this should be 15707.9633

continuously getting WA.Please tell me what's wrong with the code or atleast tell me a test casefor which it fails.

#include <iostream>
#include <cstdio>
#include <math.h>
#define LLI long long int
#define gc getchar_unlocked
#define pc putchar_unlocked
using namespace std;
LLI scanint()
{
register int c = gc();
LLI x = 0;
int neg = 0;
for(;((c<48 || c>57) && c != '-');c = gc());
if(c=='-') {neg=1;c=gc();}
for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
if(neg) x=-x;
return x;
}
LLI N,K,A[10010];
bool F(LLI x){
	LLI piece=0;
	for(LLI i=0;i<N;i++){
		piece += (A[i]/x);
		if(piece>=K)return true;
	}
	return false;
}
double BinarySearch(double lo,double hi){
	LLI mid;
	while (lo<hi){
		mid  = (LLI)(lo + (hi-lo)/2);
		if(F(mid)==true) lo = mid+1;
		else hi = mid;
	}
	return lo-1;
}
int main(){
int T;LLI x;double V;
cin>>T;
while(T--){
    N = scanint();	K = scanint();
    K++;
    for(LLI i=0;i<N;i++){
    	x = scanint();A[i] = x*x;
    }
    V = BinarySearch(1,1000000100) * M_PI ;
    printf("%.4lf\n",V);
}
return 0;
}

can any tell me what’s wrong with this code.

#include <bits/stdc++.h>
using namespace std;

const double pi = M_PI;
const double eps = 1e-5;

bool canpiece(vector<int>& rad, double r, double f){
for(int i = 0; i < rad.size(); i++){
	double area = rad[i]*rad[i];
	double temp = r*r;
	while(area >= temp){
		area -= temp;
		f--;
	}
	if(f <= 0) return true;
  }
 return false;
}

int main(){
int t;
cin >> t;
while(t--){
	int n, f;
	cin >> n >> f;
	f++;
	vector<int> rad(n);
	for(int i = 0; i < n; i++){
		cin >> rad[i];
	}
	sort(rad.begin(), rad.end());
	
	double l = 0, h = rad[n-1];

	while(h - l > eps){
		double m = (l+h)/2;
		if(canpiece(rad, m, f)) l = m;
		else h = m - eps;
	}
	cout << fixed << setprecision(3)<< pi*h*h<< endl;
}

}