Score : 500 points
There are N cards placed face down in a row. On each card, an integer 1 or 2 is written.
Let A_i be the integer written on the i-th card.
Your objective is to guess A_1, A_2, ..., A_N correctly.
You know the following facts:
You are a magician and can use the following magic any number of times:
Magic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.
What is the minimum cost required to determine all of A_1, A_2, ..., A_N?
It is guaranteed that there is no contradiction in given input.
Input is given from Standard Input in the following format:
N M X_1 Y_1 Z_1 X_2 Y_2 Z_2 \vdots X_M Y_M Z_M
Print the minimum total cost required to determine all of A_1, A_2, ..., A_N.
3 1 1 2 1
2
You can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.
6 5 1 2 1 2 3 2 1 3 3 4 5 4 5 6 5
2
100000 1 1 100000 100
99999