Rover

#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

ifstream fin("rover.in");
ofstream fout("rover.out");

vector < pair < int, int> > deq;

int di[] = {-1, +1, -0, +0};
int dj[] = {+0, +0, +1, -1};

int cerinta;
int n, G;
int mat[502][502];

bitset < 502 > marcat[502];

void Lee(int i, int j)
{
    deq.push_back(make_pair(i, j));

    while(!deq.empty())
    {
        int i = deq[0].first;
        int j = deq[0].second;

        deq.erase(deq.begin());

        for(int k = 0; k < 4; k++)
        {
            int nexti = i + di[k];
            int nextj = j + dj[k];

            if(!marcat[nexti][nextj])
            {
                marcat[nexti][nextj] = 1;

                if(mat[nexti][nextj] >= G)
                    deq.insert(deq.begin(), mat[nexti][nextj]);
                else
                    mar

            }
        }
    }
}

void gard()
{
    for(int i = 0; i <= n + 1; i++)
    {
        marcat[i][0] = 1;
        marcat[0][i] = 1;
        marcat[n + 1][i] = 1;
        marcat[i][n + 1] = 1;
    }

}

int main()
{
    fin >> cerinta >> n;

    if(cerinta == 1)
        fin >> G;

    gard();

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> mat[i][j];




    fin.close();
    fout.close();
    return 0;
}