oj.uz

Submission #845466

# Submission time Handle Problem Language Result Execution time Memory
845466 2023-09-06T13:44:31 Z vjudge1 Trener (COCI20_trener) C++17
22 / 110
 22 ms 24408 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define int long long
const int mod = 1e9 + 7;
const int N = 1e6 + 7;
inline long long get1(string const& s) {
    const int p = 31;
    const int m = 166739;
    long long hash_value = 0;
    long long p_pow = 1;
    for (char c : s) {
        hash_value = (hash_value + (c - 'a' + 1) * p_pow) % m;
        p_pow = (p_pow * p) % m;
    }
    return hash_value;
}
inline long long get2(string const& s) {
    const int p = 37;
    const int m = 923501;
    long long hash_value = 0;
    long long p_pow = 1;
    for (char c : s) {
        hash_value = (hash_value + (c - 'a' + 1) * p_pow) % m;
        p_pow = (p_pow * p) % m;
    }
    return hash_value;
}
inline int get(string const& s){
	return {get1(s)};
}
void solve(){
	int n,k;cin >> n >> k;
	string v[n+1][k];
	vector < int > mpa[N];
	for(int i = 1;i<=n;i++){
		for(int j = 0;j<k;j++){
			cin >> v[i][j];
			mpa[get(v[i][j])].push_back(j);
		}
	}
	int dp[n+1][k];
	memset(dp , 0 , sizeof(dp));
	for(int i = 0;i<k;i++)dp[1][i] = 1;
	for(int i = 2;i<=n;i++){
		for(int j = 0;j<k;j++){
			string s1 = string(v[i][j].begin() , v[i][j].end()-1) , s2 = string(v[i][j].begin()+1 , v[i][j].end());
			vector < int > ind1 = mpa[get(s1)];
			vector < int > ind2 = mpa[get(s2)];
			for(auto itr : ind2)ind1.push_back(itr);
			sort(ind1.begin(),ind1.end());
			ind1.resize(unique(ind1.begin() , ind1.end()) - ind1.begin());
			for(auto itr : ind1){
				dp[i][j] = (dp[i][j] + dp[i-1][itr]) % mod;
			}
		}
	}
	int ans = 0;
	for(int i = 0;i<k;i++)ans = (ans + dp[n][i]) % mod;
	cout << ans << endl;
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int testcase = 1;//cin >> testcase;
	while(testcase--)solve();
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23896 KB Output is correct
2 Correct 15 ms 23896 KB Output is correct
3 Correct 15 ms 23900 KB Output is correct
4 Correct 15 ms 23896 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 24408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23896 KB Output is correct
2 Correct 15 ms 23896 KB Output is correct
3 Correct 15 ms 23900 KB Output is correct
4 Correct 15 ms 23896 KB Output is correct
5 Incorrect 22 ms 24408 KB Output isn't correct
6 Halted 0 ms 0 KB -