BOJ-14502

// Samsung SW 기출문제
#include <iostream>
#include <vector>
#include <utility>
#include <stack>

using namespace std;

int N, M;
int lab[9][9] = {-1};
int visited[9][9] = {-1};

int dfs(int i, int j) {
    
}

int main() {
    cin >> N >> M;
    stack<pair<int,int>> list;
    for (int i=0; i<N; i++) {
        for (int j=0; j<M; j++) {
            cin >> lab[i][j];
            visited[i][j] = 0;
            if (lab[i][j] == 2) {
                pair<int,int> virus = make_pair(i,j);
                list.push_back(virus);
            }
        }
    }
    int size = list.size();
    for (int i=0; i<size; i++) {
        dfs(list.top().first, list.top().second());
        list.pop();
    }
    
}