RandomColoringDiv2 | Topcoder Archive

Problem Statement

Little Arthur has a new frisbee and he would like to color it. A frisbee has the shape of a disc. Arthur will color the disc using two colors: one for the top side, one for the bottom side.

Each color is defined by three integer components: R, G, and B (meaning red, green, and blue, respectively), where 0 <= R < maxR, 0 <= G < maxG, and 0 <= B < maxB. It is known that Arthur can use any of the maxR*maxG*maxB possible colors.

Arthur is going to perform the coloring in the following way:

In the first step, he will color the top side of the frisbee using the color (startR, startG, startB).
In the second step, he will color the bottom side of the frisbee using a color that makes a good transition from the first color. (This is explained below.)

A transition from color (R, G, B) to color (R', G', B') is called good if all components differ by at most d2 units (formally, |R - R'| <= d2, |G - G'| <= d2, |B - B'| <= d2) and at least one component differs by at least d1 units (formally, at least one of the conditions |R - R'| >= d1, |G - G'| >= d1, |B - B'| >= d1 holds). Intuitively, a transition between two colors is called good if they are neither too similar, nor too different.

After coloring the top side Arthur is wondering how many different options there are now for the color of the bottom side of the frisbee.

Given ints maxR, maxG, maxB, startR, startG, startB, d1, and d2, return the number of valid colors that make a good transition from the color (startR, startG, startB).

Definition

Class:: RandomColoringDiv2
Method:: getCount
Parameters:: int, int, int, int, int, int, int, int
Returns:: int
Method signature:: int getCount(int maxR, int maxG, int maxB, int startR, int startG, int startB, int d1, int d2)
(be sure your method is public)

Constraints

maxR, maxG and maxB will each be between 1 and 100, inclusive.
startR will be between 0 and maxR-1, inclusive.
startG will be between 0 and maxG-1, inclusive.
startB will be between 0 and maxB-1, inclusive.
d1 and d2 will each be between 0 and 100, inclusive.
d1 will be less than or equal to d2.

Examples

```
5
```
```
1
```
```
1
```
```
2
```
```
0
```
```
0
```
```
0
```
```
1
```
```
Returns: 3
```
Only the R component can change here. It has to change by at least 0 and at most 1. Thus the colors that make a good transition from color (2, 0, 0) here are (1, 0, 0), (2, 0, 0), and (3, 0, 0).
```
4
```
```
2
```
```
2
```
```
0
```
```
0
```
```
0
```
```
3
```
```
3
```
```
Returns: 4
```
Colors that make a good transition from color (0, 0, 0) here are (3, 0, 0), (3, 0, 1), (3, 1, 0), and (3, 1, 1).
```
4
```
```
2
```
```
2
```
```
0
```
```
0
```
```
0
```
```
5
```
```
5
```
```
Returns: 0
```
At least one component has to change by 5. There exists no color that makes a good transition from color (0, 0, 0) within the respective maxR, maxG, maxB constraints.
```
6
```
```
9
```
```
10
```
```
1
```
```
2
```
```
3
```
```
0
```
```
10
```
```
Returns: 540
```
All valid colors make a good transition from color (1, 2, 3).
```
6
```
```
9
```
```
10
```
```
1
```
```
2
```
```
3
```
```
4
```
```
10
```
```
Returns: 330
```
```
49
```
```
59
```
```
53
```
```
12
```
```
23
```
```
13
```
```
11
```
```
22
```
```
Returns: 47439
```

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.