oj.uz

답안 #611682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
611682 2022-07-29T06:36:07 Z 반딧불(#8497) Ljetopica (COI19_ljetopica) C++17
100 / 100
 19 ms 18576 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll MOD = 1000000007;

int n, k;
bool dir[1002];
ll comb[1002][1002]; /// comb[i][j] : iCj
ll pow2[1002];
ll DP[1002][1002][2]; /// DP[i][j][b]: ���� ���� i�� ��忡 �ְ�, �¿츦 j�� �ٲ� �� �ְ�, (k=1�̸� ���� �¿츦 �ݴ�� ���� ��) ���� ��
bool A[1002], B[1002];
ll ans;

inline void addAns(ll x){
    ans = (ans + x) % MOD;
}

void dfs(int depth, int chance, bool following, ll offset, bool isBiggerThanA, bool isSmallerThanB){
    if(chance < 0) return;
    if(depth==n){
        if(!chance) addAns(offset+1);
        return;
    }
    if(isBiggerThanA && isSmallerThanB){ /// �ܼ� ����� ������ ���̽�
        addAns(DP[depth][chance][following] + comb[n-depth][chance] * offset);
        return;
    }

    if(!(!isBiggerThanA && A[depth] == 1)){ /// �������� ���� ���� ���̴�
        bool toFollow = !dir[depth];
        dfs(depth+1, chance - (following ^ toFollow), toFollow, (offset+pow2[n-depth-1])%MOD, isBiggerThanA, (B[depth] == 1) || isSmallerThanB);
    }
    if(!(!isSmallerThanB && B[depth] == 0)){ /// ���������� ���� ���� ���̴�
        bool toFollow = dir[depth];
        dfs(depth+1, chance - (following ^ toFollow), toFollow, (offset+pow2[n-depth])%MOD, (A[depth] == 0 || isBiggerThanA), isSmallerThanB);
    }
}

int main(){
    for(int i=0; i<=1000; i++){
        comb[i][0] = comb[i][i] = 1;
        for(int j=1; j<i; j++) comb[i][j] = (comb[i-1][j] + comb[i-1][j-1]) % MOD;
    }
    pow2[0] = 1;
    for(int i=1; i<=1000; i++) pow2[i] = pow2[i-1] * 2 % MOD;

    scanf("%d %d", &n, &k);
    for(int i=1; i<n; i++){
        char c;
        scanf(" %c", &c);
        dir[i] = (c == 'R');
    }

    DP[n][0][0] = DP[n][0][1] = 1;
    for(int d=n-1; d>=1; d--){ /// ���� ����
        for(int j=0; j<=n-d; j++){
            ll cntNo = comb[n-d-1][j], cntYes = j ? comb[n-d-1][j-1] : 0;
            DP[d][j][0] += (DP[d+1][j][0] + (dir[d] ? pow2[n-d-1] : pow2[n-d]) * cntNo);
            if(j) DP[d][j][0] += (DP[d+1][j-1][1] + (!dir[d] ? pow2[n-d-1] : pow2[n-d]) * cntYes);
            DP[d][j][0] %= MOD;

            if(j) DP[d][j][1] += (DP[d+1][j-1][0] + (dir[d] ? pow2[n-d-1] : pow2[n-d]) * cntYes);
            DP[d][j][1] += (DP[d+1][j][1] + (!dir[d] ? pow2[n-d-1] : pow2[n-d]) * cntNo);
            DP[d][j][1] %= MOD;

//            printf("(%d %d): (%lld %lld)\n", d, j, DP[d][j][0], DP[d][j][1]);
        }
    }

    for(int i=0; i<n; i++) scanf("%1d", &A[i]);
    for(int i=0; i<n; i++) scanf("%1d", &B[i]);
    for(int i=0; i<n; i++){
        if(A[i] < B[i]) break;
        if(A[i] > B[i]){
            puts("0");
            return 0;
        }
    }

    dfs(1, k, 0, 0, 0, 0);
    dfs(1, k, 1, 0, 0, 0);
    printf("%lld", ans);
}

Compilation message

ljetopica.cpp: In function 'int main()':
ljetopica.cpp:72:37: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'bool*' [-Wformat=]
   72 |     for(int i=0; i<n; i++) scanf("%1d", &A[i]);
      |                                   ~~^   ~~~~~
      |                                     |   |
      |                                     |   bool*
      |                                     int*
ljetopica.cpp:73:37: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'bool*' [-Wformat=]
   73 |     for(int i=0; i<n; i++) scanf("%1d", &B[i]);
      |                                   ~~^   ~~~~~
      |                                     |   |
      |                                     |   bool*
      |                                     int*
ljetopica.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
ljetopica.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         scanf(" %c", &c);
      |         ~~~~~^~~~~~~~~~~
ljetopica.cpp:72:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     for(int i=0; i<n; i++) scanf("%1d", &A[i]);
      |                            ~~~~~^~~~~~~~~~~~~~
ljetopica.cpp:73:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     for(int i=0; i<n; i++) scanf("%1d", &B[i]);
      |                            ~~~~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 18576 KB Output is correct
2 Correct 12 ms 17748 KB Output is correct
3 Correct 11 ms 16960 KB Output is correct
4 Correct 11 ms 16212 KB Output is correct
5 Correct 10 ms 15444 KB Output is correct
6 Correct 11 ms 14656 KB Output is correct
7 Correct 9 ms 13780 KB Output is correct
8 Correct 11 ms 13072 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 4 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7252 KB Output is correct
10 Correct 4 ms 7236 KB Output is correct
11 Correct 5 ms 7212 KB Output is correct
12 Correct 5 ms 7296 KB Output is correct
13 Correct 6 ms 7252 KB Output is correct
14 Correct 4 ms 7252 KB Output is correct
15 Correct 4 ms 7252 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 18520 KB Output is correct
2 Correct 13 ms 18516 KB Output is correct
3 Correct 15 ms 18516 KB Output is correct
4 Correct 13 ms 18516 KB Output is correct
5 Correct 12 ms 18536 KB Output is correct
6 Correct 13 ms 18532 KB Output is correct
7 Correct 17 ms 18516 KB Output is correct
8 Correct 15 ms 18516 KB Output is correct
9 Correct 13 ms 18496 KB Output is correct
10 Correct 14 ms 18516 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 18576 KB Output is correct
2 Correct 12 ms 17748 KB Output is correct
3 Correct 11 ms 16960 KB Output is correct
4 Correct 11 ms 16212 KB Output is correct
5 Correct 10 ms 15444 KB Output is correct
6 Correct 11 ms 14656 KB Output is correct
7 Correct 9 ms 13780 KB Output is correct
8 Correct 11 ms 13072 KB Output is correct
9 Correct 5 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 4 ms 7252 KB Output is correct
12 Correct 4 ms 7252 KB Output is correct
13 Correct 4 ms 7252 KB Output is correct
14 Correct 4 ms 7252 KB Output is correct
15 Correct 4 ms 7252 KB Output is correct
16 Correct 4 ms 7252 KB Output is correct
17 Correct 4 ms 7252 KB Output is correct
18 Correct 4 ms 7236 KB Output is correct
19 Correct 5 ms 7212 KB Output is correct
20 Correct 5 ms 7296 KB Output is correct
21 Correct 6 ms 7252 KB Output is correct
22 Correct 4 ms 7252 KB Output is correct
23 Correct 4 ms 7252 KB Output is correct
24 Correct 14 ms 18520 KB Output is correct
25 Correct 13 ms 18516 KB Output is correct
26 Correct 15 ms 18516 KB Output is correct
27 Correct 13 ms 18516 KB Output is correct
28 Correct 12 ms 18536 KB Output is correct
29 Correct 13 ms 18532 KB Output is correct
30 Correct 17 ms 18516 KB Output is correct
31 Correct 15 ms 18516 KB Output is correct
32 Correct 13 ms 18496 KB Output is correct
33 Correct 14 ms 18516 KB Output is correct
34 Correct 19 ms 18380 KB Output is correct
35 Correct 14 ms 17084 KB Output is correct
36 Correct 14 ms 17620 KB Output is correct
37 Correct 14 ms 17748 KB Output is correct
38 Correct 16 ms 17236 KB Output is correct
39 Correct 14 ms 17084 KB Output is correct
40 Correct 13 ms 17344 KB Output is correct
41 Correct 13 ms 18132 KB Output is correct
42 Correct 16 ms 18420 KB Output is correct
43 Correct 12 ms 17768 KB Output is correct
44 Correct 12 ms 17108 KB Output is correct
45 Correct 12 ms 17492 KB Output is correct
46 Correct 12 ms 17184 KB Output is correct
47 Correct 16 ms 17504 KB Output is correct
48 Correct 13 ms 17344 KB Output is correct
49 Correct 12 ms 17356 KB Output is correct
50 Correct 18 ms 18088 KB Output is correct
51 Correct 13 ms 17620 KB Output is correct
52 Correct 13 ms 18108 KB Output is correct
53 Correct 15 ms 18508 KB Output is correct
54 Correct 15 ms 18564 KB Output is correct
55 Correct 14 ms 18516 KB Output is correct
56 Correct 13 ms 18520 KB Output is correct
57 Correct 13 ms 18500 KB Output is correct
58 Correct 13 ms 18516 KB Output is correct