HDOJ-三部曲一(搜索、数学)-1012-Shredding Company

Shredding Company

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)

Total Submission(s) : 8   Accepted Submission(s) : 7

Problem Description

You have just been put in charge of developing a new shredder for the Shredding Company Although a "normal" shredder would just shred sheets of paper into little pieces so that the contents would become unreadable, this new shredder needs to have the following unusual basic characteristics.
1.The shredder takes as input a target number and a sheet of paper with a number written on it.
2.It shreds (or cuts) the sheet into pieces each of which has one or more digits on it.
3.The sum of the numbers written on each piece is the closest possible number to the target number, without going over it.
For example, suppose that the target number is 50, and the sheet of paper has the number 12346. The shredder would cut the sheet into four pieces, where one piece has 1, another has 2, the third has 34, and the fourth has 6. This is because their sum 43 (= 1 + 2 + 34 + 6) is closest to the target number 50 of all possible combinations without going over 50. For example, a combination where the pieces are 1, 23, 4, and 6 is not valid, because the sum of this combination 34 (= 1 + 23 + 4 + 6) is less than the above combination's 43. The combination of 12, 34, and 6 is not valid either, because the sum 52 (= 12 + 34 + 6) is greater than the target number of 50. Figure 1. Shredding a sheet of paper having the number 12346 when the target number is 50There are also three special rules :
1.If the target number is the same as the number on the sheet of paper, then the paper is not cut.
For example, if the target number is 100 and the number on the sheet of paper is also 100, then
the paper is not cut.
2.If it is not possible to make any combination whose sum is less than or equal to the target number, then error is printed on a display. For example, if the target number is 1 and the number on the sheet of paper is 123, it is not possible to make any valid combination, as the combination with the smallest possible sum is 1, 2, 3. The sum for this combination is 6, which is greater than the target number, and thus error is printed.
3.If there is more than one possible combination where the sum is closest to the target number without going over it, then rejected is printed on a display. For example, if the target number is 15, and the number on the sheet of paper is 111, then there are two possible combinations with the highest possible sum of 12: (a) 1 and 11 and (b) 11 and 1; thus rejected is printed. In order to develop such a shredder, you have decided to first make a simple program that would simulate the above characteristics and rules. Given two numbers, where the first is the target number and the second is the number on the sheet of paper to be shredded, you need to figure out how the shredder should "cut up" the second number.

 

Input

The input consists of several test cases, each on one line, as follows :
tl num1 t2 num2 ... tn numn 0 0
Each test case consists of the following two positive integers, which are separated by one space : (1) the first integer (ti above) is the target number, (2) the second integer (numi above) is the number that is on the paper to be shredded.
Neither integers may have a 0 as the first digit, e.g., 123 is allowed but 0123 is not. You may assume that both integers are at most 6 digits in length. A line consisting of two zeros signals the end of the input.

 

Output

For each test case in the input, the corresponding output takes one of the following three types :
sum part1 part2 ... rejected error
In the first type, partj and sum have the following meaning :
1.Each partj is a number on one piece of shredded paper. The order of partj corresponds to the order of the original digits on the sheet of paper.
2.sum is the sum of the numbers after being shredded, i.e., sum = part1 + part2 +...
Each number should be separated by one space. The message error is printed if it is not possible to make any combination, and rejected if there is more than one possible combination. No extra characters including spaces are allowed at the beginning of each line, nor at the end of each line.

 

Sample Input

50 12346

376 144139

927438 927438

18 3312

9 3142

25 1299

111 33333

103 862150

6 1104

0 0

 

Sample Output

43 1 2 34 6

283 144 139

927438 927438

18 3 3 12

error

21 1 2 9 9

rejected

103 86 2 15 0

rejected

 

Source

PKU

 

 

 

做这道题我头都想炸了。。。。。。。。。。

又是一道DFS题，关键是回溯的那个地方让我很难理清头绪，加上又有点感冒头痛，真快崩溃了。。。

开始以为每个加数的最大位数和输入的限制数位数一样，但后来发现还有出现0的情况，比如最后一个测试样例1104，结果是rejected，因为1+1+0+4和1+1+04一样，出现了两位数04，所以我干脆让每个加数最大的位数为限制数的位数加1，就过了。

 

 

#include<iostream>
#include<string.h>
using namespace std;
//fig数组记录纸片上的数字，dig记录限制数t的位数，add数组记录中间过程加数，a数组记录结果加数，len记录纸片数字长度
int t,fig[6],ans,dig,add[6],sum,k,f[1000000],len,a[6],it;

void DFS(int beg)
{
	int i,j;
	for(i=1;i<=dig+1&&beg+i<=len;i++)
	{
		int tem=0;
		for(j=0;j<i;j++)                     
		{ 
			tem=10*tem+fig[beg+j];         //计算加数
		}
		add[k]=tem;
		sum+=add[k];
		if(sum>t)                          //如果出现大于t的情况，就剪枝，回退
		{
			sum-=add[k];
			add[k]=0;
			return;
		}
		if(beg+i==len)                     //如果搜到了纸片数字的尽头
		{
			f[sum]++;                      //标记结果出现的次数
			if(sum>ans)
			{
				ans=sum;
				for(it=0;it<=k;it++)        //将最优结果的加数保存
					a[it]=add[it];
			}
			sum-=add[k];
			return;
		}
		k++;                               //k指向下一个加数
		DFS(beg+i);
		k--;
		sum-=add[k];                        //回溯
		add[k]=0;
	}
	return;
}

int main()
{
	
	char num[7];
	while(cin>>t>>num&&(t+(num[0]-'0')))
	{
		len=strlen(num);
		
		int i;
		int tem=t;
		dig=0;
		sum=0;
		ans=0;
		while(tem!=0)
		{
			tem/=10;
			dig++;
		}
		memset(fig,0,sizeof(fig));
		memset(f,false,sizeof(f));
		memset(add,0,sizeof(add));
		memset(f,0,sizeof(f));
		for(i=0;i<len;i++)
		{
			fig[i]=num[i]-'0';
		}
		DFS(0);
		if(ans==0)                         //如果没有一个符合要求的答案
			cout<<"error"<<endl;
		else if(f[ans]!=1)                  //如果有超过一个的答案
			cout<<"rejected"<<endl;
		else 
		{
			cout<<ans;
			for(i=0;i<it;i++)
				cout<<' '<<a[i];
			cout<<endl;
		}
	}
}