Cod sursa(job #2937134)

Utilizator toma_ariciuAriciu Toma toma_ariciu Data 9 noiembrie 2022 23:09:56
Problema Iv Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.47 kb
/// Preset de infoarena
#include <fstream>

using namespace std;

ifstream fin("iv.in");
ofstream fout("iv.out");

const int mod = 3210121;
int len1, len2, dp[2][505][505], ans;
string s1, s2;

int main()
{
    fin >> s1 >> s2;
    len1 = s1.size();
    len2 = s2.size();
    s1 = '$' + s1;
    s2 = '$' + s2;
    dp[0][0][0] = 1;
    for(int i = 0; i <= len1; i++)
    {
        for(int j = 0; i + j <= len1; j++)
        {
            for(int x = 0; x <= len2; x++)
            {
                int y = i + x - j;
                if(y < 0 || x + y > len2)
                    continue;
                int ci = i % 2, ni = (i + 1) % 2, curr = dp[i % 2][j][x];
                dp[ci][j][x] = 0;
                if(i + j + x + y == len1 + len2 || i + j + x + y == len1 + len2 - 1)
                {
                    ans = (ans + curr) % mod;
                    continue;
                }
                if(s1[i + 1] == s1[len1 - j])
                    dp[ni][j + 1][x] = (dp[ni][j + 1][x] + curr) % mod;
                if(y < len2 && s1[i + 1] == s2[len2 - y])
                    dp[ni][j][x] = (dp[ni][j][x] + curr) % mod;
                if(s2[x + 1] == s1[len1 - j])
                    dp[ci][j + 1][x + 1] = (dp[ci][j + 1][x + 1] + curr) % mod;
                if(y < len2 && s2[x + 1] == s2[len2 - y])
                    dp[ci][j][x + 1] = (dp[ci][j][x + 1] + curr) % mod;
            }
        }
    }
    fout << ans;
    return 0;
}