oj.uz

답안 #337592

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337592 2020-12-21T07:36:27 Z tengiz05 힘 센 거북 (IZhO11_turtle) C++17
40 / 100
 117 ms 169324 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int N = 2005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int n, m, k;
int dp[N][N][21];
int a[N][N];
int mod;
void solve(int test_case){
	int i, j, t;
	cin >> n >> m;
	cin >> k >> t >> mod;
	n++,m++;
	for(i=0;i<k;i++){
		int x, y;
		cin >> x >> y;
		x++,y++;
		if(x <= 2000 && y <= 2000)a[x][y] = 1;
	}
	if(n >= 2000){cout << 0 << '\n';return;}
	dp[1][0][0] = 1;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			if(a[i][j] == 0)
				for(int l=0;l<=t;l++){
					dp[i][j][l] = (dp[i-1][j][l] + dp[i][j-1][l])%mod;
				}
			else 
				for(int l=1;l<=t;l++){
					dp[i][j][l] = (dp[i-1][j][l-1]+dp[i][j-1][l-1])%mod;
				}
		}
	}
/*	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			cout << dp[i][j][0] << ' ' ;
		}cout << '\n';
	}*/
	int ans = 0;
	for(i=0;i<=t;i++)(ans += dp[n][m][i])%=mod;
	cout << ans << '\n';
	
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	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 876 KB Output is correct
4 Correct 2 ms 1516 KB Output is correct
5 Correct 7 ms 6016 KB Output is correct
6 Correct 29 ms 43884 KB Output is correct
7 Correct 59 ms 69996 KB Output is correct
8 Correct 117 ms 169324 KB Output is correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Incorrect 0 ms 364 KB Output isn't correct
12 Incorrect 1 ms 364 KB Output isn't correct
13 Incorrect 0 ms 364 KB Output isn't correct
14 Incorrect 0 ms 364 KB Output isn't correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Incorrect 0 ms 364 KB Output isn't correct
17 Incorrect 0 ms 364 KB Output isn't correct
18 Incorrect 0 ms 364 KB Output isn't correct
19 Incorrect 0 ms 364 KB Output isn't correct
20 Incorrect 0 ms 364 KB Output isn't correct