oj.uz

답안 #609406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609406 2022-07-27T15:00:28 Z SlavicG 캥거루 (CEOI16_kangaroo) C++17
100 / 100
 23 ms 24052 KB 
#include <iostream>
int64_t n,s,t,m=1e9+7,d[5000][5000],i,j;
main() {std::cin>>n>>s>>t;d[0][0]=1;for(i=1;i<=n;++i){for(int j=1;j<=i;++j){if(i==s||i==t)d[i][j]=d[i-1][j-1]+d[i-1][j]%m;else d[i][j]=(d[i-1][j+1]*j+d[i-1][j-1]*(j-(i>s)-(i>t)))%m;}}std::cout<<d[n][1];}

Compilation message

kangaroo.cpp:3:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    3 | main() {std::cin>>n>>s>>t;d[0][0]=1;for(i=1;i<=n;++i){for(int j=1;j<=i;++j){if(i==s||i==t)d[i][j]=d[i-1][j-1]+d[i-1][j]%m;else d[i][j]=(d[i-1][j+1]*j+d[i-1][j-1]*(j-(i>s)-(i>t)))%m;}}std::cout<<d[n][1];}
      | ^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1236 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1236 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 3 ms 4564 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 4 ms 5588 KB Output is correct
24 Correct 22 ms 24020 KB Output is correct
25 Correct 21 ms 24020 KB Output is correct
26 Correct 23 ms 24052 KB Output is correct
27 Correct 21 ms 23888 KB Output is correct
28 Correct 13 ms 15192 KB Output is correct