# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223306 | dantoh000 | Trener (COCI20_trener) | C++14 | 254 ms | 16120 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int n,k;
map<string,int> ct[55];
string a[55][1505];
int main(){
scanf("%d%d",&n,&k);
for (int i = 1; i <= n; i++){
for (int j = 1; j <= k; j++){
cin >> a[i][j];
}
}
ll ans = 0;
ct[0][""]++;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= k; j++){
string X = a[i][j].substr(1,a[i][j].size()-1);
string Y = a[i][j].substr(0,a[i][j].size()-1);
//cout << a[i][j] << " " << X << " " << Y;
int res = 0;
if (ct[i-1].find(X) != ct[i-1].end()) res += ct[i-1][X];
if (X != Y && ct[i-1].find(Y) != ct[i-1].end()) res += ct[i-1][Y];
res %= mod;
//printf("%d %d\n",ct[X],ct[Y]);
ct[i][a[i][j]] += res; ct[i][a[i][j]] %= mod;
}
}
for (auto x : ct[n]){
ans += x.second;
}
printf("%lld",ans%mod);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |