Submission #88666

#TimeUsernameProblemLanguageResultExecution timeMemory
88666BadralEnergetic turtle (IZhO11_turtle)C++17
10 / 100
2081 ms1400 KiB
#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; 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() { 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 timeMemoryGrader output
Fetching results...