G_Jawbreaker_I_Klik_.cpp

#include <iostream>
using namespace std;
typedef long long ll;

int n, m, total=0, cellx, celly, colour;
int graph[30][30], xs[4]={1, -1, 0,  0},
                   ys[4]={0,  0, 1, -1};

void find(int x, int y){
    total++;
    graph[x][y] = 0;
    for(int i=0;i<4;i++){
        int newx = x+xs[i], newy = y+ys[i];
        if( (newx>=0 && newx<n) && (newy>=0 && newy<m) && graph[newx][newy] == colour){
            find(newx, newy);
        }
    }
}

int main(){
    cin >> n >> m;
    for(int l=0;l<n;l++){
        for(int j=0;j<m;j++){
            cin >> graph[l][j];
        }
    }
    cin >> cellx >> celly;
    colour = graph[cellx][celly];
    find(cellx, celly);
    cout << total*(total-1);
}