oj.uz

답안 #789786

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789786 2023-07-22T03:40:19 Z chengcheng567 캥거루 (CEOI16_kangaroo) C++14
100 / 100
 20 ms 33160 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MOD=1e9+7;
int dp[2100][2100],n,a,b;
int32_t main() {
	ios::sync_with_stdio(0);
	cin.tie(0);cin>>n>>a>>b;
	if(a>b)swap(a,b);dp[1][1]=1;
	for(int i=2;i<=n;i++)
    	for(int j=1;j<=n;j++)
    		if(i==a||i==b)dp[i][j]=(dp[i-1][j-1]+dp[i-1][j])%MOD;
    		else if(i<a)dp[i][j]=(j*dp[i-1][j-1]+j*dp[i-1][j+1])%MOD;
    		else if(a<i&&i<b)dp[i][j]=((j-1)*dp[i-1][j-1]+j*dp[i-1][j+1])%MOD;
    		else dp[i][j]=(max(0ll,j-2)*dp[i-1][j-1]+j*dp[i-1][j+1])%MOD;
	return cout<<dp[n][1],0;
}

Compilation message

kangaroo.cpp: In function 'int32_t main()':
kangaroo.cpp:9:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    9 |  if(a>b)swap(a,b);dp[1][1]=1;
      |  ^~
kangaroo.cpp:9:19: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    9 |  if(a>b)swap(a,b);dp[1][1]=1;
      |                   ^~

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 452 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 452 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1352 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1376 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 452 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1352 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1376 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 3 ms 6228 KB Output is correct
22 Correct 4 ms 6868 KB Output is correct
23 Correct 4 ms 7764 KB Output is correct
24 Correct 18 ms 33144 KB Output is correct
25 Correct 18 ms 33160 KB Output is correct
26 Correct 19 ms 33148 KB Output is correct
27 Correct 20 ms 32980 KB Output is correct
28 Correct 14 ms 23756 KB Output is correct