# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88668 | Badral | Energetic turtle (IZhO11_turtle) | C++17 | 2089 ms | 1340 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.
#include<bits/stdc++.h>
#define maxn 10005
#define mp make_pair
using namespace std;
typedef long long ll;
int ans;
bool a[maxn][maxn];
int n, m, k1, t, z;
inline void lol(int x, int y, int k) {
if(x == n && y == m) ans++;
if(x < n) {
if(a[x+1][y] == 1 && k > 0) {
lol(x+1, y, k-1);
}
if(a[x+1][y] == 0) {
lol(x+1, y, k);
}
}
if(y < m) {
if(a[x][y+1] == 1 && k > 0) {
lol(x, y+1, k-1);
}
if(a[x][y+1] == 0) {
lol(x, y+1, k);
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >>n >>m >>k1 >>t >>z;
while(k1--) {
int x, y;
cin >>x >>y;
a[x][y] = 1;
}
lol(0, 0, t);
cout<<ans%z;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |