// You can test this using InteractivePercolationVisualizer and PercolationVisualizer

// All methods should make at most a constant number of calls to the UF data structure,

// except percolates(), which may make up to N calls to the UF data structure.

public class Percolation {

int N;

boolean[] open;

// TODO: more fields to add here

public Percolation(int N) {

this.N = N;

this.open = new boolean[N*N];

// TODO: more to do here

}

// open site (row i, column j) if it is not already

public void open(int i, int j) {

open[i*N+j] = true;

}

// TODO: more to do here.

// is site (row i, column j) open?

public boolean isOpen(int i, int j) {

return open[i*N+j];

}

// is site (row i, column j) full?

public boolean isFull(int i, int j) {

// TO DO

if(!isOpen(i, j)) return false;

return false;

}

// does the system percolate?

public boolean percolates() {

int row = N;

return false;

}

}