Submission #88612

#TimeUsernameProblemLanguageResultExecution timeMemory
88612turbatEnergetic turtle (IZhO11_turtle)C++14
40 / 100
2088 ms167600 KiB
#include <bits/stdc++.h> using namespace std; int n, m, k, t, z, a, b, d[1002][1002][21], ans; bool u[1002][1002]; int main (){ cin >> n>> m>> k>> t>> z; for (int i = 0;i < k;i++){ cin >> a>> b; u[a + 1][b + 1] = 1; } d[1][1][0] = 1; for (int i = 1; i <= n + 1;i++) for (int j = 1;j <= m + 1;j++){ for (int o = 0;o <= t;o++){ if (u[i][j] && o) d[i][j][o] = (d[i][j][o] + d[i - 1][j][o - 1] + d[i][j - 1][o - 1]) % z; if (!u[i][j]) d[i][j][o] = (d[i][j][o] + d[i - 1][j][o] + d[i][j - 1][o]) % z; } } for (int i = 0;i <= t;i++) ans = (ans + d[n + 1][m + 1][i]) % z; cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...