oj.uz

답안 #49340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49340 2018-05-26T09:12:52 Z 3zp 캥거루 (CEOI16_kangaroo) C++14
36 / 100
 2000 ms 56668 KB 
#include<bits/stdc++.h>
using namespace std;
int dp[209][209][209][3];
int mod = 1e9+ 7;
main(){
    int n,l,r;
    cin >> n >> l >> r;
    dp[1][1][1][1] = 1;
    dp[1][1][1][0] = 1;
    for(int N = 2; N <= n; N++){
        for(int L = 1; L <= n; L++){
            for(int R = 1; R <= n; R++){
                for(int D = 0; D < 2; D++){
                        if(L == R) continue;
                        if(D == 0){
                           for(int nL = L + 1; nL <= N; nL++){
                                int nR = R;
                                if(R > L) nR--;
                                dp[N][L][R][D] += dp[N - 1][nL - 1][nR][1 - D];
                                if(dp[N][L][R][D] > mod) dp[N][L][R][D] -= mod;
                           }
                        }
                        else {
                            for(int nL = L - 1; nL >= 1; nL--){
                                int nR = R;
                                if(R > L) nR--;
                                dp[N][L][R][D] += dp[N - 1][nL][nR][1 - D];
                                if(dp[N][L][R][D] > mod) dp[N][L][R][D] -= mod;
                           }
                        }
                    }
                }
            }
        }
    cout << (dp[n][l][r][0] + dp[n][l][r][1]) % mod << endl;
}

Compilation message

kangaroo.cpp:5:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 5 ms 2096 KB Output is correct
4 Correct 12 ms 4340 KB Output is correct
5 Correct 11 ms 4340 KB Output is correct
6 Correct 12 ms 4372 KB Output is correct
7 Correct 9 ms 4372 KB Output is correct
8 Correct 11 ms 4372 KB Output is correct
9 Correct 12 ms 4436 KB Output is correct
10 Correct 12 ms 4440 KB Output is correct
11 Correct 13 ms 4440 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 5 ms 2096 KB Output is correct
4 Correct 12 ms 4340 KB Output is correct
5 Correct 11 ms 4340 KB Output is correct
6 Correct 12 ms 4372 KB Output is correct
7 Correct 9 ms 4372 KB Output is correct
8 Correct 11 ms 4372 KB Output is correct
9 Correct 12 ms 4436 KB Output is correct
10 Correct 12 ms 4440 KB Output is correct
11 Correct 13 ms 4440 KB Output is correct
12 Execution timed out 2073 ms 56668 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 5 ms 2096 KB Output is correct
4 Correct 12 ms 4340 KB Output is correct
5 Correct 11 ms 4340 KB Output is correct
6 Correct 12 ms 4372 KB Output is correct
7 Correct 9 ms 4372 KB Output is correct
8 Correct 11 ms 4372 KB Output is correct
9 Correct 12 ms 4436 KB Output is correct
10 Correct 12 ms 4440 KB Output is correct
11 Correct 13 ms 4440 KB Output is correct
12 Execution timed out 2073 ms 56668 KB Time limit exceeded
13 Halted 0 ms 0 KB -