# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
922368 | thunopro | Energetic turtle (IZhO11_turtle) | C++14 | 59 ms | 86608 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 maxn 200009
#define ll long long
#define fi first
#define se second
#define pb push_back
#define left id<<1
#define right id<<1|1
#define re exit(0);
int mod = 1e9+7;
const int INF = 1e9;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<ll> vl;
void add ( int &a , int b )
{
a += b ;
if ( a > mod ) a -= mod ;
if ( a < 0 ) a += mod ;
}
template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
}
int n , m , trap , strength ;
int a [1009][1009] ;
int dp [1009][1009][21] ;
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// rf () ;
cin >> n >> m >> trap >> strength >> mod ;
for ( int i = 1 ; i <= trap ; i ++ )
{
int x , y ; cin >> x >> y ;
a [x][y] = 1 ;
}
dp [0][0][0] = 1 ;
for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= m ; j ++ ) for ( int t = 0 ; t <= strength ; t ++ )
{
add (dp[i+1][j][t+(a[i+1][j]==1)],dp[i][j][t]) ;
add (dp[i][j+1][t+(a[i][j+1]==1)],dp[i][j][t]) ;
}
int res = 0 ;
for ( int t = 0 ; t <= strength ; t ++ ) add (res,dp[n][m][t]) ;
cout << res ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |