#include <bits/stdc++.h>
#define allr v.rbegin(), v.rend()
#define sllr s.rbegin(), s.rend()
#define all v.begin(), s.end()
#define sll s.begin(), s.end()
#define pii pair <int, int>
#define int long long
#define pb push_back
#define pp pop_back
#define sc second
#define fr first
using namespace std;
const int N=1e3+7, INT=1e6+7, INF=1e9+7, INFF=INT64_MAX;
int dp[N][N], siu[N][N];
signed main() {
ios_base::sync_with_stdio(false);
// ofstream cout ("turtle.out");
// ifstream cin ("turtle.in");
cout.tie(NULL);
cin.tie(NULL);
int n, m, k, t, z, a, b, i, j;
cin >> n >> m >> k >> t >> z;
map <pii, int> mp;
for (i=0; i<k; i++) {
cin >> a >> b;
mp[{a+1, b+1}]=1;
}
dp[1][1]=1;
for (i=1; i<=n+1; i++) {
for (j=1; j<=m+1; j++) {
if (mp[{i, j}]!=1) siu[i][j]+=siu[i-1][j]+mp[{i, j}], dp[i][j]+=dp[i-1][j];
if (mp[{i, j}]!=1) siu[i][j]+=siu[i][j-1]+mp[{i, j}], dp[i][j]+=dp[i][j-1];
dp[i][j]%=z;
}
}
for (i=1; i<=n+1; i++) {
for (j=1; j<=m+1; j++) {
cout << dp[i][j] << ' ';
}
cout << '\n';
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
4700 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
7004 KB |
Output isn't correct |
| 5 |
Incorrect |
12 ms |
8492 KB |
Output isn't correct |
| 6 |
Incorrect |
141 ms |
28124 KB |
Output isn't correct |
| 7 |
Incorrect |
228 ms |
42640 KB |
Output isn't correct |
| 8 |
Incorrect |
611 ms |
85436 KB |
Output isn't correct |
| 9 |
Execution timed out |
2072 ms |
214808 KB |
Time limit exceeded |
| 10 |
Execution timed out |
2017 ms |
207184 KB |
Time limit exceeded |
| 11 |
Execution timed out |
2056 ms |
200356 KB |
Time limit exceeded |
| 12 |
Execution timed out |
2045 ms |
195952 KB |
Time limit exceeded |
| 13 |
Execution timed out |
2049 ms |
203264 KB |
Time limit exceeded |
| 14 |
Execution timed out |
2061 ms |
197288 KB |
Time limit exceeded |
| 15 |
Execution timed out |
2057 ms |
202612 KB |
Time limit exceeded |
| 16 |
Execution timed out |
2032 ms |
198452 KB |
Time limit exceeded |
| 17 |
Execution timed out |
2017 ms |
192008 KB |
Time limit exceeded |
| 18 |
Execution timed out |
2045 ms |
191644 KB |
Time limit exceeded |
| 19 |
Execution timed out |
2063 ms |
201232 KB |
Time limit exceeded |
| 20 |
Execution timed out |
2039 ms |
191640 KB |
Time limit exceeded |
