oj.uz

답안 #489788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489788 2021-11-24T16:10:18 Z CSQ31 캥거루 (CEOI16_kangaroo) C++17
6 / 100
 1 ms 332 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
ll dp[2001][2001];
int main()
{
	int n,a,b;
	cin>>n>>a>>b;
	dp[1][1] = 1;
	for(int i=2;i<=n;i++){
		for(int j=1;j<=i;j++){
			if(i==a || i==b){
				dp[i][j] = dp[i-1][j-1] + dp[i-1][j];
				dp[i][j]%=MOD;
			}else{
				dp[i][j] += dp[i-1][j-1] * 1LL * max(0,(j-(i>a)-(i>b)));
				dp[i][j] += dp[i-1][j+1] * 1LL * j;
				dp[i][j]%=MOD;
			}
		}
	}
	cout<<dp[n][1]<<'\n';
	
	
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -