제출 #445115

#제출 시각아이디문제언어결과실행 시간메모리
445115Abrar_Al_SamitTrener (COCI20_trener)C++17
22 / 110
39 ms700 KiB
#include<bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define debug(x) cerr << '[' << (#x) << "] = " << x << '\n'; template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update> ; const int Mod = 1e9 + 7; void PlayGround() { int n, k; cin >> n >> k; vector<vector<string>>buck(n, vector<string>(k)); for(int i=0; i<n; ++i) { for(auto& it : buck[i]) cin >> it; } auto substring = [=] (string& s, string& t) { if(s.substr(0, t.size())==t || s.substr(1, t.size())==t) return true; return false; }; vector<int>dp(n*k); int ans = 0; for(int i=0; i<k; ++i) dp[i] = 1; for(int i=0; i<n-1; ++i) { for(int j=0; j<k; ++j) { for(int l=0; l<k; ++l) { if(substring(buck[i+1][l], buck[i][j])) { if(i+1==n-1) ans = (ans + dp[i*k + j]); else dp[(i+1)*k + l] = (dp[(i+1)*k+l] + dp[i*k+j]) % Mod; } } } } cout << ans << '\n'; #ifndef ONLINE_JUDGE cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); //#ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); //#endif PlayGround(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...