oj.uz

Submission #218302

# Submission time Handle Problem Language Result Execution time Memory
218302 2020-04-01T22:49:05 Z alishahali1382 Trener (COCI20_trener) C++14
110 / 110
 115 ms 16376 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int N = 53, K = 1510, SGM=26;

int n, m, k, u, v, x, y, t, a, b;
int TR[N*K][26], ts;
ll sum[N*K];
ll dp[N][K];
string S[N][K];

int AddTrie(string &s){
	int v=0;
	for (char ch:s){
		if (!TR[v][ch-'a']) TR[v][ch-'a']=++ts;
		v=TR[v][ch-'a'];
	}
	return v;
}

ll Get(string &s){
	int v=0;
	for (char ch:s){
		if (!TR[v][ch-'a']) return 0;
		v=TR[v][ch-'a'];
	}
	return sum[v];
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>k;
	for (int i=1; i<=n; i++) for (int j=1; j<=k; j++) cin>>S[i][j];
	for (int j=1; j<=k; j++) dp[1][j]=1;
	for (int i=2; i<=n; i++){
		memset(TR, 0, sizeof(TR));
		memset(sum, 0, sizeof(sum));
		ts=0;
		for (int j=1; j<=k; j++){
			int v=AddTrie(S[i-1][j]);
			sum[v]+=dp[i-1][j];
		}
		for (int j=1; j<=k; j++){
			string s=S[i][j].substr(0, i-1), t=S[i][j].substr(1, i-1);
			dp[i][j]=Get(s);
			if (s!=t) dp[i][j]+=Get(t);
			dp[i][j]%=mod;
		}
	}
	ll ans=0;
	for (int j=1; j<=k; j++) ans=(ans+dp[n][j])%mod;
	cout<<ans<<'\n';
	
	return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 11648 KB Output is correct
2 Correct 14 ms 11696 KB Output is correct
3 Correct 13 ms 11648 KB Output is correct
4 Correct 13 ms 11648 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 12152 KB Output is correct
2 Correct 50 ms 12152 KB Output is correct
3 Correct 50 ms 12152 KB Output is correct
4 Correct 50 ms 12160 KB Output is correct
5 Correct 54 ms 12152 KB Output is correct
6 Correct 50 ms 12152 KB Output is correct
7 Correct 52 ms 12152 KB Output is correct

Subtask #3
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 11648 KB Output is correct
2 Correct 14 ms 11696 KB Output is correct
3 Correct 13 ms 11648 KB Output is correct
4 Correct 13 ms 11648 KB Output is correct
5 Correct 54 ms 12152 KB Output is correct
6 Correct 50 ms 12152 KB Output is correct
7 Correct 50 ms 12152 KB Output is correct
8 Correct 50 ms 12160 KB Output is correct
9 Correct 54 ms 12152 KB Output is correct
10 Correct 50 ms 12152 KB Output is correct
11 Correct 52 ms 12152 KB Output is correct
12 Correct 93 ms 16376 KB Output is correct
13 Correct 98 ms 16376 KB Output is correct
14 Correct 96 ms 16376 KB Output is correct
15 Correct 91 ms 16376 KB Output is correct
16 Correct 83 ms 16376 KB Output is correct
17 Correct 99 ms 16368 KB Output is correct
18 Correct 97 ms 16376 KB Output is correct
19 Correct 115 ms 16352 KB Output is correct
20 Correct 96 ms 16340 KB Output is correct
21 Correct 99 ms 16376 KB Output is correct
22 Correct 84 ms 16376 KB Output is correct