oj.uz

답안 #337640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337640 2020-12-21T10:22:23 Z amunduzbaev 힘 센 거북 (IZhO11_turtle) C++14
40 / 100
 2000 ms 262144 KB 
/** 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.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 10 ms 8044 KB Output is correct
6 Correct 45 ms 61548 KB Output is correct
7 Correct 98 ms 98284 KB Output is correct
8 Correct 183 ms 237036 KB Output is correct
9 Runtime error 923 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 1393 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 13 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Execution timed out 2091 ms 83564 KB Time limit exceeded
13 Execution timed out 2090 ms 100304 KB Time limit exceeded
14 Execution timed out 2088 ms 62188 KB Time limit exceeded
15 Runtime error 14 ms 492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 13 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 14 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 14 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Execution timed out 2086 ms 87748 KB Time limit exceeded
20 Execution timed out 2050 ms 78796 KB Time limit exceeded