3047049_re.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <algorithm>

using namespace std;

struct node
{
	int w, d;
}cake[211], t;

int n, w, d;

bool cmp(node a,node b)
{
	return a.w*a.d<b.w*b.d;
}

int main()
{
	int i, id;
	int p, s;

	while(scanf("%d%d%d",&n,&w,&d)==3)
	{
		if(n==0&&w==0&&d==0)
		{
			break;
		}
		cake[1].w = w;
		cake[1].d = d;
		id = 2;
		for(i = 0; i < n; i++)
		{
			scanf("%d%d",&p,&s);
			s %= 2*(cake[p].d+cake[p].w);
			if(s < cake[p].w || (s > cake[p].w+cake[p].d && s < 2*cake[p].w+cake[p].d))
			{
				if(s > cake[p].w)
				{
					s = 2*cake[p].w+cake[p].d-s;
				}
				t.w = cake[p].w-s;
				cake[p].w = s;
				t.d = cake[p].d;
				if(t.w < cake[p].w)
				{
					swap(t,cake[p]);
				}
			}
			else
			{
				if(s < cake[p].w+cake[p].d)
				{
					s -= cake[p].w;
				}
				else
				{
					s = 2*(cake[p].w+cake[p].d)-s;
				}
				t.w = cake[p].w;
				t.d = cake[p].d - s;
				cake[p].d = s;
				if(t.d < cake[p].d)
				{
					swap(t,cake[p]);
				}
			}
			cake[id++] = t;
		}
		sort(&cake[1],&cake[1]+id-1,cmp);
		printf("%d",cake[1].w*cake[1].d);
		for(i = 2; i < id; i++)
		{
			printf(" %d",cake[i].w*cake[i].d);
		}
		printf("\n");
	}
	return 0;
}