시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 1024 MB 13 10 7 100.000%

문제

A new and upcoming artist has a unique way to create checkered patterns. The idea is to use an M-by-N canvas which is initially entirely black. Then the artist repeatedly chooses a row or column and runs their magic brush along the row or column. The brush changes the colour of each cell in the row or column from black to gold or gold to black.

Given the artist’s choices, your job is to determine how much gold appears in the pattern determined by these choices.

입력

The first line of input will be a positive integer M. The second line of input will be a positive integer N. The third line of input will be a positive integer K. The remaining input will be K lines giving the choices made by the artist. Each of these lines will either be R followed by a single space and then an integer which is a row number, or C followed by a single space and then an integer which is a column number. Rows are numbered top down from 1 to M. Columns are numbered left to right from 1 to N.

출력

Output one non-negative integer which is equal to the number of cells that are gold in the pattern determined by the artist’s choices.

제한

  • 1 ≤ M, N ≤ 5 000 000
  • MN ≤ 5 000 000
  • K ≤ 1 000 000
  • Up to 5 000 000 cells, and up to 1 000 000 choices by the artist.

예제 입력 1

3
3
2
R 1
C 1

예제 출력 1

4

After running the brush along the first row, the canvas looks like this:

GGG
BBB
BBB

Then after running the brush along the first column, four cells are gold in the final pattern determined by the artist’s choices:

BGG
GBB
GBB

예제 입력 2

4
5
7
R 3
C 1
C 2
R 2
R 2
C 1
R 4

예제 출력 2

10

Ten cells are gold in the final pattern determined by the artist’s choices:

BGBBB
BGBBB
GBGGG
GBGGG