oj.uz

답안 #160590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160590 2019-10-28T16:11:14 Z Akashi 캥거루 (CEOI16_kangaroo) C++14
100 / 100
 28 ms 14200 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;

int n, l, r;
int d[2005][2005];

int main()
{
//    freopen("kangaroo.in", "r", stdin);
//    freopen("kangaroo.out", "w", stdout);

    scanf("%d%d%d", &n, &l, &r);

    d[0][0] = 1;
    int nr = 0;
    for(int i = 1; i <= n ; ++i){
        if(i != l && i != r){
            ///create a new component
            for(int k = 1; k <= i ; ++k)
                d[i][k] = (d[i][k] + 1LL * d[i - 1][k - 1] * (k - nr)) % MOD;

            ///merge two components
            for(int k = 1; k <= i ; ++k)
                d[i][k] = (d[i][k] + 1LL * d[i - 1][k + 1] * k) % MOD;
        }
        else{
            ++nr;
            for(int k = 1; k <= i ; ++k){
                d[i][k] = d[i - 1][k - 1] + d[i - 1][k];
                if(d[i][k] >= MOD) d[i][k] -= MOD;
            }
        }
    }

    printf("%d", d[n][1]);

    return 0;
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &l, &r);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 9 ms 1272 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1272 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1272 KB Output is correct
17 Correct 3 ms 1148 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 3 ms 1124 KB Output is correct
20 Correct 3 ms 1272 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 9 ms 1272 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1272 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1272 KB Output is correct
17 Correct 3 ms 1148 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 3 ms 1124 KB Output is correct
20 Correct 3 ms 1272 KB Output is correct
21 Correct 7 ms 3832 KB Output is correct
22 Correct 8 ms 4088 KB Output is correct
23 Correct 8 ms 4412 KB Output is correct
24 Correct 28 ms 14200 KB Output is correct
25 Correct 28 ms 14200 KB Output is correct
26 Correct 28 ms 14152 KB Output is correct
27 Correct 27 ms 14072 KB Output is correct
28 Correct 19 ms 10232 KB Output is correct