SRM 441 div 1 1000
Recently I solve the problem that was already compteted.
and I found out that I'm not skillfull at understanding english.
I want to understand problem written in english but it is very difficult to get the point of problem,
this is somehow eaiser than others because it show pictures and sample.
I try to solve this problem
next time I hope write answer aticle of this question ~!!!
TopCoder problem "PaperAndPaint" used in SRM 441 (Division I Level Three)
|Onise likes to play with paper and paint. He has a piece of paper with dimensions width x height. He performs K operations, one for each i between 0 and K-1, inclusive. Each operation consists of the following steps:|
You are given ints width and height, and ints xfold, cnt, x1, y1, x2 and y2, each containing exactly K elements. Return the total area of of the paper that is not covered in paint after Onise is done.
|-||width and height will be between 1 and 10^9, inclusive.|
|-||xfold, cnt, x1, y1, x2 and y2 will all contain the same number of elements, between 1 and 50, inclusive.|
|-||Every element of xfold will be between 0 and width, inclusive.|
|-||Every element of cnt will be between 0 and 1000, inclusive.|
|-||For every i, cnt[i]+1 will be a divisor of height.|
|-||For every i, 0 <= x1[i] < x2[i] <= max(xfold[i], width-xfold[i]) and 0 <= y1[i] < y2[i] <= height/(cnt[i]+1).|