Submission #1260419

#TimeUsernameProblemLanguageResultExecution timeMemory
1260419kawhietTrener (COCI20_trener)C++20
22 / 110
3 ms584 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector<vector<string>> a(n, vector<string>(k)); for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { cin >> a[i][j]; } } vector<vector<int64_t>> dp(n, vector<int64_t>(k)); fill(dp[0].begin(), dp[0].end(), 1); for (int i = 1; i < n; i++) { for (int j = 0; j < k; j++) { string s1 = a[i][j].substr(0, i); string s2 = a[i][j].substr(1, i); for (int r = 0; r < k; r++) { if (a[i - 1][r] == s1 || a[i - 1][r] == s2) { dp[i][j] += dp[i - 1][r]; } } } } cout << accumulate(dp[n - 1].begin(), dp[n - 1].end(), int64_t(0)) << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...