Solution: Swapity Swap Swap

Time Complexity: $\mathcal{O}(NM)$

Java

Java Implementation

import java.io.*;
import java.util.*;

public class swapswap {
	static int N, M, K;
	static int[] f;
	static int[] P, A;
	static boolean[] vis;
	static List<Integer> c = new ArrayList<>();
	static Queue<Integer> q = new LinkedList<>();

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

Join Forum