UTPC 03.09.21. Problem K Template (Flow on matrix)

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = (int)500 + 11;

bool gr[N][N];
struct edge{
    int a,b,cap,flow;
    cap = 1;
    flow = 1;
    edge(){};
    edge(int a,int b):a(a),b(b){}
};

vector<edge> e;
vector<int> g[N];

void add_edge(int a,int b){
    edge t;
    t.a = a, t.b = b;
    t.cap = 1, t.flow = 0;
    g[a].push_back(e.size());
    e.push_back(t);
    swap(t.a,t.b);

    t.cap = 0, t.flow = 0;
    g[b].push_back(e.size());
    e.push_back(t);

    return;
}

bool bfs(){
    queue<int> q; /// id = x * m + y
    q.push(start);
    while(!q.empty()){

    }
}

signed main(){
    #ifndef _WIN32
    freopen("three.in","r",stdin);
    freopen("three.out","w",stdout);
    #endif // _WIN32

    int n,m;
    cin >> n >> m;

    char ch;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> ch;
            if(ch == '#')
                gr[i][j] = 1;
        }
    }



    return 0;
}