求助，本地正常运行的代码提交后编译失败

#include <iostream>
#include <string>
#include <vector>

using namespace std;

// 定义一个函数，将正方形顺时针旋转90度
vector<string> rotate90(vector<string>& square) 
{
    int n = square.size();
    vector<string> rotated(n, string(n, ' '));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            rotated[j][n - i - 1] = square[i][j];
        }
    }
    return rotated;
}

// 定义一个函数，将正方形进行水平翻转
vector<string> reflect(vector<string>& square) 
{
    int n = square.size();
    for (int i = 0; i < n; ++i) {
        reverse(square[i].begin(), square[i].end());
    }
    return square;
}

// 定义一个函数，检查所有可能的转换，返回最小的有效转换序号
int check_transformations(vector<string>& original, vector<string>& transformed) 
{
    if (original == transformed) return 6;

    vector<string> rotated90 = rotate90(original);
    if (rotated90 == transformed) return 1;

    vector<string> rotated180 = rotate90(rotated90);
    if (rotated180 == transformed) return 2;

    vector<string> rotated270 = rotate90(rotated180);
    if (rotated270 == transformed) return 3;

    vector<string> reflected = reflect(original);
    if (reflected == transformed) return 4;

    vector<string> reflected_rotated90 = rotate90(reflected);
    vector<string> reflected_rotated180 = rotate90(reflected_rotated90);
    vector<string> reflected_rotated270 = rotate90(reflected_rotated180);
    if (reflected_rotated90 == transformed || reflected_rotated180 == transformed || reflected_rotated270 == transformed) return 5;
    return 7;
}

int main() 
{
    int n;
    cin >> n;
    vector<string> original(n), transformed(n);
    for (int i = 0; i < n; ++i)
    {
        cin >> original[i];
    }
    for (int i = 0; i < n; ++i)
    {
        cin >> transformed[i];
    }
    int res = check_transformations(original, transformed);
    cout << res << endl;
    return 0;
}