OJ Board

Posted: **Fri Jan 14, 2011 10:02 am**

why wa i have cant understand

//C++
#include<iostream>
#include<algorithm>
using namespace std;
#define max_(a,b)(a>b?a:b)

int a[110];
int mark[10000][10000];
int store[10000][10000];
int n,t;

int dp(int i, int w)
{
	if(i==0 || w==0)
		return 0;
	else if(mark[i][w]==t)
		return store[i][w];
	int res;
	if(a[i]<=w)
	{
		res=max_(dp(i-1,w),dp(i-1,w-a[i])+a[i]);
	}
	else
		res=dp(i-1,w);
	mark[i][w]=t;
	store[i][w]=res;
	return res;
}
int main()
{
	int i,w,cs,tt,sum,x;
	//freopen("1.txt","r",stdin);
	cin>>tt;
	for(cs=1;cs<=tt;cs++)
	{
		t++;
		cin>>n;
		sum=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			sum+=a[i];
		}
		w=sum/2;
		x=dp(n,w);
		printf("%d\n",(sum-2*x));
	}
}

plz help me. im getting frustrated..
plz...

Posted: **Fri Jan 14, 2011 11:02 am**

you should get memory limit exceed.How much memory you used-

Code: Select all

int mark[10000][10000];
int store[10000][10000];

Its a simple 1-dimentional DP problem.look at the sample input
4
1 2 4 6

Declare an array A[50000] because highest value may be 100*500=50000 and and fill it by 0.

now add all element .Sum=1+2+4+6=13.
as sum is odd you can't divide it evenly,so look for number closet to half-6.
so try to make sum=6 by adding some element.

For 1st element we have sum- 1. set A[1]=1;
For 2nd element we have sum-2,(2+1=3).set A[2]=1,A[3]=1.
For 3rd element we have sum-4,(1+4=5),(2+4=6) stop as you find 6 from element 2,4=6 and other set certainly contain=13-6=7.

SO diff is 1.

Hope you understand .

Posted: **Fri Jan 14, 2011 11:49 am**

thx via. i cant understand why im getting wa. I should get re or ce.. bt making the the arry mark[101][25001] and mark[101][25001] get accepted its too weird to me.

Posted: **Wed Feb 02, 2011 8:30 pm**

I got a wa for a simple but tricky case.

Code: Select all

1
0

output is 0

another case that may help you:

Code: Select all

1
13
1 4 6 8 5 3 4 7 5 3 5 2 100

ans: 47

Posted: **Thu Jun 09, 2011 4:41 pm**

got two times wrong answer.
Can anyone help me?

#include<iostream>

using namespace std;

int main()
{
int n;
cin>>n;
int value=0;
int diff;

for(int i=1;i<=n;i++)
{
int coin_no;
cin>>coin_no;

for(int x=1;x<=coin_no;x++)
{
int val;
cin>>val;
value=value+val;
}
diff=value%2;
cout<<"\n"<<diff;

}

return 0;
}

Posted: **Wed Jun 15, 2011 8:26 pm**

Hello
My code passing all the input found here in this board and also my hand-generated one's(compared with toolkit output).I used simple DP here.
I worked like..
1)Sum up all the coin first
2)Then set S=sum/2
3)Now I used 0-1 knapsack here.That is Fill knapsack with size S as maximum as possible
4)then output sum-2*p[n][S]
But I'm getting WA..Here is my code

Code: Select all

//Got Accepted.

Edit:
A silly Bug.Algorithm was okay.allocated memory less than program need..wondered to see no one here in this board to help....its dead one..

Posted: **Sat Jun 25, 2011 4:12 pm**

mr. mdpallob
What you did???You really understood what problem wants??I don't think so
Your algorithm is totally wrong.Your code always produce minimal difference as 0 or 1.But answer may be greater than 0 or 1 too. Read carefully problem statement again and try learning Dynamic programming technique.

Posted: **Tue May 22, 2012 7:51 pm**

I used 0-1 knapsack to solve this problem.
can anyone find any bug in my code:

Code: Select all

removed after AC

Posted: **Tue May 22, 2012 11:48 pm**

see I/O #7 at http://ideone.com/XgQ97, AC output is 1.

Posted: **Mon May 28, 2012 5:40 pm**

thanks brianfry!
got AC.

Posted: **Fri Jun 15, 2012 12:38 am**

Runtime error. Why????

Code: Select all

AC

Posted: **Fri Jun 15, 2012 9:40 pm**

For one thing, this declares more memory than you need to solve this problem.
long int coins[102],opt[102][25010];

Your RE is here:
for(i=0;i<103;i++)
for(j=0;j<25011;j++) opt[j]=-100;

Posted: **Sat Jun 16, 2012 2:53 pm**

Thanks

Posted: **Tue Jan 22, 2013 3:30 am**

This looks like an easy knapsack problem, but I don't know the knapsack algorithm. So, could anyone give me a pseudo-code for this problem? Or a pseudo-code for the knapsack algorithm?

Thank you very much.

Posted: **Tue Jan 22, 2013 10:41 pm**

http://en.wikipedia.org/wiki/Knapsack_problem
http://www.comp.nus.edu.sg/~stevenha/pr ... ng%20Coins
http://www.questtosolve.com/browse.php?vol=5

OJ Board

562 - Dividing coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

Re: 562 - Dividing Coins

562 - Dividing coins and Knapsack Algorithm

Re: 562 - Dividing coins and Knapsack Algorithm