Codeforces Round 500 (Div. 1) [based on EJOI]
B
Chemical table
Codeforces
1900
原题
← AC →
翻译中…

Innopolis University scientists continue to investigate the periodic table. There are $*n*·*m*$ known elements and they form a periodic table: a rectangle with $*n*$ rows and $*m*$ columns. Each element can be described by its coordinates $(*r*, *c*)$ ($1 ≤ *r* ≤ *n*$, $1 ≤ *c* ≤ *m*$) in the table.

翻译中…

Recently scientists discovered that for every four different elements in this table that form a rectangle with sides parallel to the sides of the table, if they have samples of three of the four elements, they can produce a sample of the fourth element using nuclear fusion. So if we have elements in positions $(*r*_{1}, *c*_{1})$, $(*r*_{1}, *c*_{2})$, $(*r*_{2}, *c*_{1})$, where $*r*_{1} ≠ *r*_{2}$ and $*c*_{1} ≠ *c*_{2}$, then we can produce element $(*r*_{2}, *c*_{2})$.

翻译中…

image

翻译中…

Samples used in fusion are not wasted and can be used again in future fusions. Newly crafted elements also can be used in future fusions.

翻译中…

Innopolis University scientists already have samples of $*q*$ elements. They want to obtain samples of all $*n*·*m*$ elements. To achieve that, they will purchase some samples from other laboratories and then produce all remaining elements using an arbitrary number of nuclear fusions in some order. Help them to find the minimal number of elements they need to purchase.

翻译中…

Input

翻译中…

The first line contains three integers $*n*$, $*m*$, $*q*$ ($1 ≤ *n*, *m* ≤ 200 000$; $0 ≤ *q* ≤ *min*(*n*·*m*, 200 000)$), the chemical table dimensions and the number of elements scientists already have.

翻译中…

The following $*q*$ lines contain two integers $*r*_{*i*}$, $*c*_{*i*}$ ($1 ≤ *r*_{*i*} ≤ *n*$, $1 ≤ *c*_{*i*} ≤ *m*$), each describes an element that scientists already have. All elements in the input are different.

翻译中…

Output

翻译中…

Print the minimal number of elements to be purchased.

翻译中…

Note

翻译中…

For each example you have a picture which illustrates it.

翻译中…

The first picture for each example describes the initial set of element samples available. Black crosses represent elements available in the lab initially.

翻译中…

The second picture describes how remaining samples can be obtained. Red dashed circles denote elements that should be purchased from other labs (the optimal solution should minimize the number of red circles). Blue dashed circles are elements that can be produced with nuclear fusion. They are numbered in order in which they can be produced.

翻译中…

Test 1

翻译中…

We can use nuclear fusion and get the element from three other samples, so we don't need to purchase anything.

翻译中…

image

翻译中…

Test 2

翻译中…

We cannot use any nuclear fusion at all as there is only one row, so we have to purchase all missing elements.

翻译中…

image

翻译中…

Test 3

翻译中…

There are several possible solutions. One of them is illustrated below.

翻译中…

Note that after purchasing one element marked as red it's still not possible to immidiately produce the middle element in the bottom row (marked as 4). So we produce the element in the left-top corner first (marked as 1), and then use it in future fusions.

翻译中…

image

翻译中…

样例

Input #1
2 2 3
1 2
2 2
2 1
Output #1
0
InputCopy OutputCopy
Input #2
1 5 3
1 3
1 1
1 5
Output #2
2
InputCopy OutputCopy
Input #3
4 3 6
1 2
1 3
2 2
2 3
3 1
3 3
Output #3
1
InputCopy OutputCopy
题目信息
题号
1012B
时间限制
1 s
内存限制
512 MB
标签
构造
DFS 及类似
并查集
图论
矩阵

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。