Given two sets of countries, one donating clothes and the other accepting, and the amount of clothes donated, maximize the total amount of clothes donated such that there is a one-to-one relationship between countries in the two sets. The input format is {r1, r2, tc, {c1, c2, a}, ...}, where r1 is the number of countries in the donating set, r2 is the number of countries in the accepting set, tc is the number of test cases, and {c1, c2, a} represents country c1 donating 'a' amount of clothes to country c2. Each country can only be in one set, and a country can donate to or accept from only one other country.

Question

Accepted Answer

Maximize clothes donation between two sets of countries with one-to-one relationships.

Model the problem as a bipartite graph where one set represents donors and the other set represents recipients.
Use algorithms like the Hungarian algorithm or maximum flow to find the optimal matching.
Example: If country A donates 5 clothes to country B, and country C donates 6 to country D, ensure no overlaps.
Consider edge cases where some countries may not have any valid donation pairs.