# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
845207 | 2023-09-06T12:36:33 Z | vjudge1 | Trener (COCI20_trener) | C++17 | 11 ms | 1372 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" #define all(aa) aa.begin(), aa.end() const int mod=1e9+7; int main(){ int n, k; cin>>n>>k; int ans; map<string, int> dp; for(int j=0; j<k; j++){ string s; cin>>s; dp[s]=1; } for(int i=1; i<n; i++){ ans=0; for(int j=0; j<k; j++){ string s; cin>>s; string a(s.begin(), s.end()-1), b(s.begin()+1, s.end()); if(a==b) dp[s]=dp[a]; else dp[s]=(dp[a]+dp[b])%mod; ans=(ans+dp[s])%mod; } } cout<<ans<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 11 ms | 1372 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |