Submission #337640

#	Time	Username	Problem	Language	Result	Execution time	Memory
337640		amunduzbaev	Energetic turtle (IZhO11_turtle)	C++14	40 / 100	2091 ms	262144 KiB

turtle

/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 1e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, t, ans;
ll z;
ll dp[N][N][30], a[N][N];
void solve(){
	fastios
	cin>>n>>m>>k>>t>>z;
	vector<pll> vv(k);
	for(int i=0;i<k;i++) { cin>>vv[i].ff>>vv[i].ss; a[vv[i].ff][vv[i].ss] = 1; }
	dp[0][0][t] = 1;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=m;j++){
			for(int l=0;l<=t;l++){
				dp[i][j+1][l - a[i][j]] += dp[i][j][l];
				dp[i+1][j][l - a[i][j]] += dp[i][j][l];
				dp[i][j+1][l - a[i][j]] %= z;
				dp[i+1][j][l - a[i][j]] %= z;
			}
		}
	}
	for(int i=0;i<=t;i++){
		ans += dp[n][m][i];
		ans %= z;
	}
	cout<<ans<<" "<<"\n";
	return;
}

/*

4 4 5 3 1000000
0 1
0 3
2 1
2 3
4 3

*/

int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

• Subtask 1: 40 / 100