Submission #845481

#	Time	Username	Problem	Language	Result	Execution time	Memory
845481		vjudge1	Trener (COCI20_trener)	C++17	0 / 110	389 ms	792 KiB

trener

#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
#define pb push_back
#define endl '\n'
#define fi first
#define se second
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define CDIV(a,b) (((a)+(b)-(1))/(b))
const ll inf = 1e17 + 5;
const ll mod = 1e9 + 7;
const ll N = 1e3 + 30;

 
int mod_(int a, int b)
{
    if(a >= 0)return a % b;
    a += (-a/b + 1) * b;
    return a % b;
}

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<vector<string> >v(n, vector<string>(k));
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < k; ++j)
            cin >> v[i][j];
    }
    vector<vector<int> >dp(n, vector<int>(k));
    for(int i = k - 1; i >= 0; --i)dp[n - 1][i] = 1;
    for(int i = n - 1; i >= 1; --i)
    {
        for(int j = 0; j < k; ++j)
        {
            for(int z = 0; z < k; ++z)
            {
                string cmp1 = v[i][j], cmp2 = v[i - 1][z];
                for(int er = 0; er <= i; ++er)
                {
                    string tmp = cmp1;
                    tmp.erase(tmp.begin() + er);
                    if(tmp == cmp2)
                    {
                        //cout << cmp1 << ' ' << tmp << ' ' << cmp2 << endl;
                        dp[i - 1][z] += dp[i][j];
                        if(dp[i - 1][z] >= mod)dp[i - 1][z] -= mod;
                        break;
                    }
                }
            }
        }
    }
    cout << accumulate(dp[0].begin(), dp[0].end(), 0) << endl;

}
    

int main()
{
    fio;
    //int t; cin >> t; while(t--)
    {
        solve();
    }
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 33
• Subtask 3: 0 / 55