# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
17737 | 2016-01-12T09:44:08 Z | Adilkhan | 힘 센 거북 (IZhO11_turtle) | C++ | 12 ms | 508 KB |
#include <bits/stdc++.h> #define pb push_back #define endl "\n" #define mp make_pair #define fi first #define se second #define all(x) x.begin(), x.end() #define fname "" #define sz(x) (int)(x.size()) typedef long long ll; using namespace std; const ll N = (ll)(5e5) + 322; const ll INF = (ll)(1e9); const ll mod = (ll)(1e9) + 7; const double eps = 1e-9; ll n, m, a[1000][1000], d[1000][1000][20], z, k, t, x, y, sum; int main () { // freopen(fname".in", "r", stdin); //freopen(fname".out", "w", stdout); scanf("%lld%lld%lld%lld", &n, &m, &k, &t, &z); for (int i = 1; i <= k; ++i) { scanf("%lld%lld", &x, &y); a[x][y] = 1; } d[0][0][0] = 1; for (int i = 0; i <= n; ++i) { for (int j = 0; j <= m; ++j) { if (i == 0 && j == 0) continue; if (a[i][j] == 1) { for (int q = 1; q <= k; ++q) { d[i][j][q] = (d[i - 1][j][q - 1] + d[i][j][q]) % z; d[i][j][q] = (d[i][j - 1][q - 1] + d[i][j][q]) % z; } }else { for (int q = 0; q <= k; ++q) { d[i][j][q] = (d[i - 1][j][q] + d[i][j][q]) % z; d[i][j][q] = (d[i][j - 1][q] + d[i][j][q]) % z; } } } } for (int i = 0; i <= t; ++i) { sum += d[n][m][i]; sum %= z; } printf("%lld", sum); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 10 ms | 472 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Runtime error | 10 ms | 476 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
3 | Runtime error | 10 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Runtime error | 12 ms | 476 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Runtime error | 10 ms | 404 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Runtime error | 9 ms | 508 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
7 | Runtime error | 10 ms | 408 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
8 | Runtime error | 10 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
9 | Runtime error | 11 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
10 | Runtime error | 11 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
11 | Runtime error | 8 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
12 | Runtime error | 10 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
13 | Runtime error | 9 ms | 476 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
14 | Runtime error | 10 ms | 380 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
15 | Runtime error | 10 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
16 | Runtime error | 10 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Runtime error | 10 ms | 476 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
18 | Runtime error | 7 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
19 | Runtime error | 3 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
20 | Runtime error | 10 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |