oj.uz

Submission #693314

# Submission time Handle Problem Language Result Execution time Memory
693314 2023-02-02T17:11:33 Z rainboy None (JOI16_solitaire) C
100 / 100
 64 ms 460 KB 
#include <stdio.h>

#define N	2000
#define M	(N * 3)
#define MD	1000000007

int main() {
	static char cc[3][N + 1];
	static int dp[M + 1][2], dq[M + 1][2];
	int n, m, k, h, i, j, x, ans;

	scanf("%d", &n);
	for (h = 0; h < 3; h++)
		scanf("%s", cc[h]);
	for (i = 1; i < n; i++)
		if (cc[0][i] == 'x' && cc[0][i - 1] == 'x' || cc[2][i] == 'x' && cc[2][i - 1] == 'x') {
			printf("0\n");
			return 0;
		}
	m = 0;
	dp[0][0] = 1;
	for (i = 0; i < n; i++) {
		k = 0;
		if (cc[0][i] == 'x')
			k++;
		if (cc[2][i] == 'x')
			k++;
		if (cc[1][i] == 'o') {
			for (j = 0; j <= m; j++)
				dq[j][0] = dq[j][1] = 0;
			if (k == 0)
				x = 1;
			else if (k == 1)
				x = m + 1;
			else
				x = (m + 1) * (m + 2);
			for (j = 0; j <= m; j++) {
				dq[0][0] = (dq[0][0] + (long long) dp[j][0] * x) % MD;
				dq[0][0] = (dq[0][0] + (long long) dp[j][1] * x) % MD;
			}
			for (j = 0; j <= m + k; j++)
				dp[j][0] = dq[j][0], dp[j][1] = dq[j][1];
			m += k;
		} else {
			for (j = 0; j <= m + 1; j++)
				dq[j][0] = dq[j][1] = 0;
			x = 0;
			for (j = 0; j <= m; j++) {
				x = (x + dp[j][0]) % MD;
				dq[j + 1][1] = (dq[j + 1][1] + x) % MD;
			}
			for (j = 1; j <= m + 1; j++)
				dq[j][0] = (dq[j][0] + x) % MD;
			x = 0;
			for (j = m; j >= 0; j--) {
				x = (x + dp[j][1]) % MD;
				if (j > 0)
					dq[j][0] = (dq[j][0] + x) % MD;
			}
			for (j = 0; j <= m + 1; j++)
				dp[j][0] = dq[j][0], dp[j][1] = dq[j][1];
			m++;
			for (j = 0; j <= m + k; j++)
				dq[j][0] = dq[j][1] = 0;
			if (k == 0) {
				for (j = 1; j <= m; j++) {
					x = dp[j][0];
					dq[j][0] = (dq[j][0] + x) % MD;
				}
			} else if (k == 1) {
				for (j = 1; j <= m; j++) {
					x = dp[j][0];
					dq[j + 1][0] = (dq[j + 1][0] + (long long) x * j) % MD;
					x = dp[j][1];
					dq[j][1] = (dq[j][1] + (long long) x * (m - j + 1)) % MD;
				}
			} else {
				for (j = 1; j <= m; j++) {
					x = dp[j][0];
					dq[j + 2][0] = (dq[j + 2][0] + (long long) x * j * (j + 1)) % MD;
					x = dp[j][1];
					dq[j][1] = (dq[j][1] + (long long) x * (m - j + 1) * (m - j + 2)) % MD;
					dq[j + 1][1] = (dq[j + 1][1] + (long long) x * j * (m - j + 1) * 2) % MD;
				}
			}
			for (j = 0; j <= m + k; j++)
				dp[j][0] = dq[j][0], dp[j][1] = dq[j][1];
			m += k;
		}
	}
	ans = 0;
	for (j = 0; j <= m; j++) {
		ans = (ans + dp[j][0]) % MD;
		ans = (ans + dp[j][1]) % MD;
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

solitaire.c: In function 'main':
solitaire.c:16:23: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   16 |   if (cc[0][i] == 'x' && cc[0][i - 1] == 'x' || cc[2][i] == 'x' && cc[2][i - 1] == 'x') {
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
solitaire.c:12:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
solitaire.c:14:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |   scanf("%s", cc[h]);
      |   ^~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 0 ms 292 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 212 KB Output is correct
2 Correct 20 ms 316 KB Output is correct
3 Correct 4 ms 212 KB Output is correct
4 Correct 30 ms 320 KB Output is correct
5 Correct 26 ms 300 KB Output is correct
6 Correct 24 ms 212 KB Output is correct
7 Correct 18 ms 324 KB Output is correct
8 Correct 27 ms 212 KB Output is correct
9 Correct 28 ms 324 KB Output is correct
10 Correct 18 ms 328 KB Output is correct
11 Correct 22 ms 212 KB Output is correct
12 Correct 28 ms 328 KB Output is correct
13 Correct 29 ms 340 KB Output is correct
14 Correct 29 ms 328 KB Output is correct
15 Correct 31 ms 212 KB Output is correct
16 Correct 28 ms 312 KB Output is correct
17 Correct 28 ms 296 KB Output is correct
18 Correct 28 ms 316 KB Output is correct
19 Correct 29 ms 324 KB Output is correct
20 Correct 27 ms 324 KB Output is correct
21 Correct 28 ms 324 KB Output is correct
22 Correct 28 ms 320 KB Output is correct
23 Correct 31 ms 452 KB Output is correct
24 Correct 28 ms 336 KB Output is correct
25 Correct 29 ms 316 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 292 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 288 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 292 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 0 ms 292 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 292 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 292 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 288 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 292 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 292 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 2 ms 212 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 0 ms 292 KB Output is correct
13 Correct 6 ms 212 KB Output is correct
14 Correct 20 ms 316 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 30 ms 320 KB Output is correct
17 Correct 26 ms 300 KB Output is correct
18 Correct 24 ms 212 KB Output is correct
19 Correct 18 ms 324 KB Output is correct
20 Correct 27 ms 212 KB Output is correct
21 Correct 28 ms 324 KB Output is correct
22 Correct 18 ms 328 KB Output is correct
23 Correct 22 ms 212 KB Output is correct
24 Correct 28 ms 328 KB Output is correct
25 Correct 29 ms 340 KB Output is correct
26 Correct 29 ms 328 KB Output is correct
27 Correct 31 ms 212 KB Output is correct
28 Correct 28 ms 312 KB Output is correct
29 Correct 28 ms 296 KB Output is correct
30 Correct 28 ms 316 KB Output is correct
31 Correct 29 ms 324 KB Output is correct
32 Correct 27 ms 324 KB Output is correct
33 Correct 28 ms 324 KB Output is correct
34 Correct 28 ms 320 KB Output is correct
35 Correct 31 ms 452 KB Output is correct
36 Correct 28 ms 336 KB Output is correct
37 Correct 29 ms 316 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 292 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 292 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 288 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 292 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 292 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 2 ms 212 KB Output is correct
74 Correct 22 ms 212 KB Output is correct
75 Correct 5 ms 212 KB Output is correct
76 Correct 11 ms 212 KB Output is correct
77 Correct 46 ms 344 KB Output is correct
78 Correct 39 ms 336 KB Output is correct
79 Correct 24 ms 324 KB Output is correct
80 Correct 38 ms 336 KB Output is correct
81 Correct 32 ms 332 KB Output is correct
82 Correct 37 ms 332 KB Output is correct
83 Correct 24 ms 332 KB Output is correct
84 Correct 21 ms 324 KB Output is correct
85 Correct 35 ms 340 KB Output is correct
86 Correct 64 ms 332 KB Output is correct
87 Correct 53 ms 452 KB Output is correct
88 Correct 51 ms 340 KB Output is correct
89 Correct 52 ms 332 KB Output is correct
90 Correct 50 ms 328 KB Output is correct
91 Correct 52 ms 324 KB Output is correct
92 Correct 53 ms 460 KB Output is correct
93 Correct 54 ms 336 KB Output is correct
94 Correct 52 ms 316 KB Output is correct
95 Correct 51 ms 336 KB Output is correct
96 Correct 51 ms 332 KB Output is correct
97 Correct 51 ms 344 KB Output is correct