# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337510 | beksultan04 | Energetic turtle (IZhO11_turtle) | C++14 | 2093 ms | 262148 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>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int dp[2000][2000][30],q[2000][2000];
main(){
int n,m,i,j,k,l,t,mod,ans=0;
scan3(n,m,k)
scan2(t,mod)
while (k--){
int x,y;
scan2(x,y)
q[x][y]=1;
}
dp[0][0][t]=1;
for (i=0;i<=n;++i){
for (j=0;j<=m;++j){
for (l=0;l<=t;++l){
dp[i][j+1][l-q[i][j]] += dp[i][j][l];
dp[i+1][j][l-q[i][j]] += dp[i][j][l];
dp[i][j+1][l-q[i][j]] %= mod;
dp[i+1][j][l-q[i][j]] %= mod;
}
}
}
for (l=0;l<=t;++l){
ans+=dp[n][m][l];
ans%=mod;
}
cout <<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |