Ферзь, ладья и конь

#include <iostream>
#include <fstream>
#include <vector>;
using namespace std;

int vertical(int& j, vector<vector<bool>>& m) {

    int answ = 0;

    for (int i = 0; i < 8; i++) {
        if (!m[i][j]) {
            m[i][j] = true;
            answ++;
        }
    }

    return answ;

}
int gorizontal(int& j, vector<vector<bool>>& m) {

    int answ = 0;

    for (int i = 0; i < 8; i++) {
        if (!m[j][i]) {
            m[j][i] = true;
            answ++;
        }
    }

    return answ;

}

int diagonal(int qi, int qj, vector<vector<bool>>& m) {

    int j, i, answ = 0, temp = 1;;
    vector <int> napr = {1, 1, -1, -1};

    for (int k = 0; k < 4; k++) {
        i = qi, j = qj;
        while (i < 8 && i > -1 && j < 8 && j > -1) {
            if (!m[i][j]) {
                m[i][j] = true;
                answ++;
            }
            j += napr[k];
            i += temp;
        }
        temp *= -1;
    }

    return answ;

}

int main() {

    std::ifstream fin("input.txt");
    std::ofstream fout("output.txt");

    string queen, castle, knight;
    fin >> queen >> castle >> knight;

    int answ = 0;

    vector<vector<bool>> m(8, vector<bool>(8, false));

    m[queen[1] - '1'][queen[0] - 'A'] = true;
    m[castle[1] - '1'][castle[0] - 'A'] = true;
    m[knight[1] - '1'][knight[0] - 'A'] = true;

    int j = queen[1] - '1';
    answ += gorizontal(j, m);
    j = castle[1] - '1';
    answ += gorizontal(j, m);
    j = queen[0] - 'A';
    answ += vertical(j, m);
    j = castle[0] - 'A';
    answ += vertical(j, m);

    j = queen[0] - 'A';
    int i = queen[1] - '1';
    answ += diagonal(i, j, m);

    vector <int> ki = {1, 1, -1, -1, 2, 2, -2, -2};
    vector <int> kj = {2, -2, 2, -2, 1, -1, 1, -1};

    i = knight[1] - '1', j = knight[0] - 'A';

    for (int k = 0; k < ki.size(); k++) {
        int curi = i + ki[k], curj = j + kj[k];
        if (curi < 8 && curi > -1 && curj > -1 && curj < 8) {
            if (!m[curi][curj]) {
                m[curi][curj] = true;
                answ++;
            }
        }
    }

    fout << answ << endl;

    /*for (int i = 0; i < 8; i++) {
        for (int j = 0; j < 8; j++) {
            fout << m[i][j] << " ";
        }
        fout << endl;
    }*/
    return 0;

}