# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223304 | 2020-04-15T07:00:42 Z | dantoh000 | Trener (COCI20_trener) | C++14 | 19 ms | 3840 KB |
#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]; //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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 2944 KB | Output is correct |
2 | Correct | 6 ms | 2944 KB | Output is correct |
3 | Correct | 6 ms | 2944 KB | Output is correct |
4 | Correct | 7 ms | 2944 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 3712 KB | Output is correct |
2 | Correct | 19 ms | 3712 KB | Output is correct |
3 | Correct | 19 ms | 3840 KB | Output is correct |
4 | Correct | 15 ms | 3200 KB | Output is correct |
5 | Incorrect | 19 ms | 3584 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 2944 KB | Output is correct |
2 | Correct | 6 ms | 2944 KB | Output is correct |
3 | Correct | 6 ms | 2944 KB | Output is correct |
4 | Correct | 7 ms | 2944 KB | Output is correct |
5 | Correct | 18 ms | 3712 KB | Output is correct |
6 | Correct | 19 ms | 3712 KB | Output is correct |
7 | Correct | 19 ms | 3840 KB | Output is correct |
8 | Correct | 15 ms | 3200 KB | Output is correct |
9 | Incorrect | 19 ms | 3584 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |