#include #include #include using namespace std; // Flood fill is the algorythm used for exemple by the paint bucket in paint (ref line 55) struct Ff { Ff(vector> const&); int floodFill(int, int, int); bool alreadyPassed(int, int) const; int counter; pair pass; vector> path; vector> layer; }; ostream& operator<<(ostream&, vector> const&); int main() { const int w(5); const int h(10); vector> layer(w, vector (h, 0)); // not realy hard for user ;) Ff vect(layer); vect.layer[0][2] = 1; vect.layer[1][1] = 1; vect.layer[1][2] = 1; // floodFill -> x, y, target cout << vect.floodFill(1, 1, 1) << endl; cout << vect.layer << endl; return 0; } Ff::Ff(vector> const& v): counter(0), layer(v) {} int Ff::floodFill(int x, int y, int t) { if (layer[x][y] != t) { return 0; } for (int xp = -1; xp <= 1; xp++) { for (int yp = -1; yp <= 1; yp++) { if (x + xp < 0 || y + yp < 0 || x + xp >= layer.size() || y + yp >= layer[0].size()) { continue; } if (xp == 0 && yp == 0) {} else if ((xp == -1 || xp == 1) && (yp == 1 || yp == -1)) { // comment this statment for 8 axes flood fill } else if (layer[x + xp][y + yp] == t) { if (!alreadyPassed(x + xp, y + yp)) { // here I just count but I could change the stocked int counter++; pass = make_pair(x + xp, y + yp); path.push_back(pass); floodFill(x + xp, y + yp, t); } } } } return counter; } bool Ff::alreadyPassed(int x, int y) const { for (int i(0); i < path.size(); i++) { if (path[i].first == x && path[i].second == y) { return true; } } return false; } ostream& operator<<(ostream& fl, vector> const& v) { for (int y(0); y < v[0].size(); y++) { for (int x(0); x < v.size(); x++) { fl << v[x][y]; } fl << endl; } return fl; }