oj.uz

Submission #464064

# Submission time Handle Problem Language Result Execution time Memory
464064 2021-08-12T10:30:40 Z Jasiekstrz Trener (COCI20_trener) C++17
0 / 110
 10 ms 1484 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int MOD=1e9+7;
map<string,int> dp;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n,k;
	cin>>n>>k;
	long long ans=0;
	dp[""]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=k;j++)
		{
			string s;
			cin>>s;
			string s1=s,s2=s;
			s1.pop_back();
			s2.erase(s2.begin());
			dp[s]=((long long)dp[s]+dp[s1]+(s1!=s2)*dp[s2])%MOD;
			if(i==n)
				ans=(ans+dp[s])%MOD;
		}
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Incorrect 0 ms 204 KB Output isn't correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1484 KB Output is correct
2 Correct 10 ms 1464 KB Output is correct
3 Correct 10 ms 1452 KB Output is correct
4 Incorrect 3 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Incorrect 0 ms 204 KB Output isn't correct