Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <bitset>
- #include <queue>
- #define MAX 505
- using namespace std;
- ifstream fin("pereti.in");
- ofstream fout("pereti.out");
- bitset<32> v[5]= {7, 11, 13, 14};
- string x[4]= {"N","E","S","V"};
- int n, m;
- int di[5]={-1, 0, +1, 0};
- int dj[5]={0, +1 ,0, -1};
- queue<pair<int, int> > q;
- int a[MAX][MAX];
- void FILL(int i, int j);
- void gard();
- void posibil(int i, int j);
- void algoritm();
- int main()
- {
- algoritm();
- return 0;
- }
- void algoritm()
- {
- int n, int m;
- fin>>n>>m;
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=m; j++)
- {
- fin>>a[i][j];
- }
- }
- fin.close();
- gard();
- fout.close();
- }
- void gard()
- {
- }
- void posibil(int i, int j)
- {
- if((i>0 && i<n) && (j>0 && j<m))
- {
- return true;
- }
- return false;
- }
- void FILL(int starti, int startj)
- {
- int nexti,nextj;
- q.push({starti,startj});
- while(!q.empty())
- {
- int i=q.front().first;
- int j=q.front().second;
- q.pop();
- for(int k=0; k<4; k++)
- {
- nexti=i+di[k];
- nextj=j+dj[k];
- if(posibil(nexti,nextj)==true && )
- {
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment