# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875027 | dilanyan | Energetic turtle (IZhO11_turtle) | C++17 | 181 ms | 197348 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.
//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------KarginDefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
#define Kargin ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Usaco freopen(".in", "r", stdin); freopen(".out", "w", stdout);
//-------------------KarginConstants------------------\\
const int mod = 1000000007;
const ll inf = 1e9;
//-------------------KarginCode------------------------\\
const int N = 1005;
bool a[N][N];
ll dp[N][N][25];
void KarginSolve() {
ll n, m, k, t, z;
cin >> n >> m >> k >> t >> z;
for (int i = 0;i < k;i++) {
int x, y;
cin >> x >> y;
a[x][y] = true;
}
dp[0][0][0] = 1;
for (int b = 0;b <= k;b++) {
for (int i = 0;i <= n;i++) {
for (int j = 0;j <= n;j++) {
if (!i && !j) continue;
if (a[i][j]) {
if(!b) continue;
if (i > 0) dp[i][j][b] += dp[i - 1][j][b - 1];
if (j > 0) dp[i][j][b] += dp[i][j - 1][b - 1];
}
else {
if (i > 0) dp[i][j][b] += dp[i - 1][j][b];
if (j > 0) dp[i][j][b] += dp[i][j - 1][b];
}
dp[i][j][b] %= z;
}
}
}
ll ans = 0;
for (int i = 0;i <= t;i++) {
ans += dp[n][m][i];
ans %= z;
}
cout << ans << '\n';
}
int main() {
//Usaco
Kargin;
int test = 1;
//cin >> test;
while (test--) {
KarginSolve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |