oj.uz

답안 #118047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118047 2019-06-17T23:38:35 Z onjo0127 Ljetopica (COI19_ljetopica) C++11
0 / 100
 56 ms 26752 KB 
#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1e9 + 7;

int N;
long long C[1009][1009][2], D[1009][1009][2], bi[1009];
char S[1009], A[1009], B[1009], H = ('L' ^ 'R');

void go(int idx, int left, bool ok) {
	long long &CC = C[idx][left][ok], &DD = D[idx][left][ok];

	if(idx == N) {
		if(left == 0) CC = DD = 1;
		else CC = DD = 0;
		return;
	}
	if(DD != -1) return;

	char X = S[idx];
	if(!ok) X ^= H;

	go(idx+1, left, ok);
	if(left) go(idx+1, left-1, !ok);

	CC = C[idx+1][left][ok];
	if(left) CC += C[idx+1][left-1][!ok];
	CC %= MOD;

	if(X == 'L') {
		DD = D[idx+1][left][ok] + C[idx+1][left][ok] * bi[N - idx - 1] % MOD;
		DD %= MOD;
		if(left) DD += D[idx+1][left-1][!ok] + C[idx+1][left-1][!ok] * bi[N - idx] % MOD, DD %= MOD;
	}
	else {
		DD = D[idx+1][left][ok] + C[idx+1][left][ok] * bi[N - idx] % MOD;
		DD %= MOD;
		if(left) DD += D[idx+1][left-1][!ok] + C[idx+1][left-1][!ok] * bi[N - idx - 1] % MOD, DD %= MOD;
	}
}

int main() {
    int K; scanf("%d%d",&N,&K);
    bi[0] = 1; for(int i=1; i<=N; i++) bi[i] = bi[i-1] * 2 % MOD;
    scanf(" %s %s %s", S+1, A, B);
   	memset(D, -1, sizeof(D));
    go(1, K, 1); go(1, K, 0);

    long long ans = (D[1][K][0] + D[1][K][1]) % MOD; int c1 = 0, c2 = 0;
    printf("before: %lld\n",ans);

    for(int i=1; i<N; i++) {
    	if(A[i] == '1') {
    		if(S[i] == 'R') ++c1;
    		if(S[i] == 'L') ++c2;

    		if(c1 <= K)	ans += MOD - D[i+1][K - c1][(c1 + 1) % 2];
    		ans %= MOD;
    		if(c2 <= K)	ans += MOD - D[i+1][K - c2][c2 % 2];
    		ans %= MOD;

    		if(S[i] == 'R') --c1;
    		if(S[i] == 'L') --c2;
    	}
    	if(A[i] == '1') {
    		if(S[i] == 'L') ++c1;
    		if(S[i] == 'R') ++c2;
    	}
    	else {
    		if(S[i] == 'L') ++c2;
    		if(S[i] == 'R') ++c1;
    	}
    }
    printf("middle: %lld\n", ans);
    c1 = c2 = 0;
    for(int i=1; i<N; i++) {
    	if(B[i] == '0') {
    		if(S[i] == 'L') ++c1;
    		if(S[i] == 'R') ++c2;

    		if(c1 <= K)	ans += MOD - D[i+1][K - c1][(c1 + 1) % 2];
    		ans %= MOD;
    		if(c2 <= K)	ans += MOD - D[i+1][K - c2][c2 % 2];
    		ans %= MOD;

    		if(S[i] == 'L') --c1;
    		if(S[i] == 'R') --c2;
    	}
    	if(B[i] == '0') {
    		if(S[i] == 'R') ++c1;
    		if(S[i] == 'L') ++c2;
    	}
    	else {
    		if(S[i] == 'R') ++c2;
    		if(S[i] == 'L') ++c1;
    	}
    }
    printf("%lld", ans);
    return 0; 
}

Compilation message

ljetopica.cpp: In function 'int main()':
ljetopica.cpp:43:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int K; scanf("%d%d",&N,&K);
            ~~~~~^~~~~~~~~~~~~~
ljetopica.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %s %s %s", S+1, A, B);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 20352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 16384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 56 ms 26752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 20352 KB Output isn't correct
2 Halted 0 ms 0 KB -