oj.uz

답안 #490931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
490931 2021-11-29T22:01:08 Z rainboy Ljetopica (COI19_ljetopica) C
25 / 100
 500 ms 276 KB 
#include <stdio.h>
#include <string.h>

#define N	1000
#define MD	1000000007

int pp2[N + 1], vv[N + 1], ff[N + 1], gg[N + 1];

void init() {
	int i;

	pp2[0] = 1;
	for (i = 1; i <= N; i++)
		pp2[i] = pp2[i - 1] * 2 % MD;
	ff[0] = gg[0] = 1;
	for (i = 1; i <= N; i++) {
		vv[i] = i == 1 ? 1 : (long long) vv[i - MD % i] * (MD / i + 1) % MD;
		ff[i] = (long long) ff[i - 1] * i % MD;
		gg[i] = (long long) gg[i - 1] * vv[i] % MD;
	}
}

int choose(int n, int k) {
	return (long long) ff[n] * gg[k] % MD * gg[n - k] % MD;
}

int main() {
	static char cc[N + 1], aa[N + 1], bb[N + 1];
	int n, k, i, b, l, r, x, ans;

	init();
	scanf("%d%d%s%s%s", &n, &k, cc, aa, bb);
	if (n <= 25) {
		l = 0;
		for (i = 0; i < n; i++)
			l = l * 2 + aa[i] - '0';
		r = 0;
		for (i = 0; i < n; i++)
			r = r * 2 + bb[i] - '0';
		x = 1;
		for (i = 0; i < n - 1; i++)
			x = x * 2 + (cc[i] == 'L' ? 0 : 1);
		ans = 0;
		for (b = 0; b < 1 << n - 1; b++) {
			int y = x, cnt = 0;

			for (i = 0; i < n - 1; i++)
				if ((b & 1 << i) != 0) {
					y ^= (1 << n - 1 - i) - 1;
					cnt++;
				}
			if (cnt != k)
				continue;
			if (l <= y && y <= r)
				ans = (ans + y) % MD;
			y ^= (1 << n - 1) - 1;
			if (l <= y && y <= r)
				ans = (ans + y) % MD;
		}
		printf("%d\n", ans);
		return 0;
	}
	if (k == 0 && strcmp(aa, bb) == 0) {
		ans = 0;
		for (i = 0; i < n; i++)
			ans = (ans * 2 + aa[i] - '0') % MD;
		printf("%d\n", ans);
		return 0;
	}
	printf("%lld\n", (long long) (pp2[n - 1] + pp2[n] - 1) % MD * choose(n - 1, k) % MD);
	return 0;
}

Compilation message

ljetopica.c: In function 'main':
ljetopica.c:44:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   44 |   for (b = 0; b < 1 << n - 1; b++) {
      |                        ~~^~~
ljetopica.c:49:23: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   49 |      y ^= (1 << n - 1 - i) - 1;
      |                 ~~~~~~^~~
ljetopica.c:56:17: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   56 |    y ^= (1 << n - 1) - 1;
      |               ~~^~~
ljetopica.c:32:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  scanf("%d%d%s%s%s", &n, &k, cc, aa, bb);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 980 ms 276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

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

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Execution timed out 980 ms 276 KB Time limit exceeded
10 Halted 0 ms 0 KB -