J3. Creative Candy Consumption
레이팅 미적용의견: 0
Ngoc and Minh devised a creative way to eat candy that comes in three
different colours: red, green, and blue.
They begin by arranging some coloured candies into a line. Then, the
candy at the front of Ngoc's line is compared to the candy at the front
of Minh's line. If both candies are the same colour, then Ngoc and Minh
each eat the candy at the front of their own line. If the candies are
different colours, then the person with the winning candy eats the
losing candy, and the winning candy stays at the front of its line.
- Red candy
wins against green candy
.
- Green candy
wins against blue candy
.
- Blue candy
wins against red candy
.
This process of comparing and eating candy repeats until there is at
least one empty line of candy. When that happens, if one person still
has candy left in their line, then that person eats all of their
leftover candy.
Your job is to determine how much candy each person eats.
The first line of input contains a sequence of \(N\) letters, representing Ngoc's line of
candy. The second line of input contains a sequence of \(M\) letters, representing Minh's line of
candy. Each letter will be an uppercase R, G,
or B representing the colours red, green, and blue,
respectively. The first letter in each sequence represents the colour of
the candy at the front of that person's line. (There will always be at
least one letter in each sequence.)
There will be two lines of output.
On the first line, output the number of candies Ngoc eats. On the
second line, output the number of candies Minh eats.
| 서브태스크 | 점수 | 설명 |
|---|---|---|
1 | 13점 | Ngoc and Minh each have one candy. — \(N = 1\) and \(M = 1\) |
2 | 27점 | Either Ngoc's line will empty first, or both lines will empty at the same time. Ngoc and Minh could have many candies. — \(N \leq 50\) and \(M \leq 50\) |
3 | 47점 | Ngoc and Minh could have many candies. — \(N \leq 50\) and \(M \leq 50\) |
4 | 13점 | Ngoc and Minh could have an absurd amount of candy. — \(N \leq 1\,000\,000\) and \(M \leq 1\,000\,000\) |
RRR
RGBB2
5| Candy Lines | Description | Summary |
|---|---|---|
| Ngoc: Minh: | Both people have red candy at the front of their lines. Ngoc eats her red candy and Minh eats his red candy. | So far, Ngoc has eaten (1) candy and Minh has eaten (1) candy. |
| Ngoc: Minh: | Ngoc's red candy wins against Minh's green candy. Ngoc eats Minh's green candy. | So far, Ngoc has eaten (2) candies and Minh has eaten (1) candy. |
| Ngoc: Minh: | Minh's blue candy wins against Ngoc's red candy. Minh eats Ngoc's red candy. | So far, Ngoc has eaten (2) candies and Minh has eaten (2) candies. |
| Ngoc: Minh: | Minh's blue candy wins against Ngoc's red candy. Minh eats Ngoc's red candy. | So far, Ngoc has eaten (2) candies and Minh has eaten (3) candies. |
| Ngoc: Minh: | Ngoc's line of candy is empty, so the process ends. Minh eats his remaining blue candies. | In total, Ngoc eats (2) candies and Minh eats (5) candies. |
평가 및 의견
J3. Creative Candy Consumption
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
J3. Creative Candy Consumption