oj.uz

Submission #491136

# Submission time Handle Problem Language Result Execution time Memory
491136 2021-11-30T16:00:52 Z rainboy Semafor (COI20_semafor) C
100 / 100
 100 ms 412 KB 
#include <stdio.h>
#include <string.h>

#define N	100
#define MD	1000000007
#define B	32

int count[B];
int mask[] = { 10, 2, 9, 7, 18, 21, 12, 3, 29, 23 };
int vch5[] = { 1, 5, 10, 10, 5, 1 };
int vch10[] = { 1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1 };

int inv(int a) {
	return a == 1 ? 1 : (long long) inv(a - MD % a) * (MD / a + 1) % MD;
}

void init() {
	int b, i;

	for (b = 1; b < B; b++)
		count[b] = count[b & b - 1] + 1;
	for (i = 0; i <= 5; i++)
		vch5[i] = inv(vch5[i]);
	for (i = 0; i <= 10; i++)
		vch10[i] = inv(vch10[i]);
}

void mult(int aa[][N], int bb[][N], int cc[][N], int n) {
	int i, j, k;

	for (i = 0; i < n; i++)
		memset(cc[i], 0, n * sizeof *cc[i]);
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++) {
			int a = aa[i][j];

			if (a == 0)
				continue;
			for (k = 0; k < n; k++) {
				int b = bb[j][k];

				if (b != 0)
					cc[i][k] = (cc[i][k] + (long long) a * b) % MD;
			}
		}
}

void power(int aa[][N], int pp[][N], int tt[][N], int n, long long k) {
	if (k == 0) {
		int i;

		for (i = 0; i < n; i++)
			memset(pp[i], 0, n * sizeof *pp[i]), pp[i][i] = 1;
		return;
	}
	if (k % 2 == 0) {
		power(aa, tt, pp, n, k / 2);
		mult(tt, tt, pp, n);
	} else {
		power(aa, pp, tt, n, k / 2);
		mult(pp, pp, tt, n);
		mult(tt, aa, pp, n);
	}
}

int main() {
	static int aa[N][N], bb[N][N], cc[N][N], pp[N][N], tt[N][N];
	int n, m, s, i, j, c;
	long long k, l;

	init();
	scanf("%d%lld%lld%d", &m, &k, &l, &s), n = m == 1 ? 10 : 100;
	for (c = 0; c <= m * 5; c++) {
		if (c < m * 5)
			aa[c][c + 1] = m * 5 - c;
		if (c > 0)
			aa[c][c - 1] = c;
	}
	power(aa, pp, tt, m * 5 + 1, l);
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			if (m == 1) {
				c = count[mask[i] ^ mask[j]];
				bb[i][j] = (long long) pp[0][c] * vch5[c] % MD;
			} else {
				c = count[mask[i / 10] ^ mask[j / 10]] + count[mask[i % 10] ^ mask[j % 10]];
				bb[i][j] = (long long) pp[0][c] * vch10[c] % MD;
			}
	power(bb, cc, tt, n, k / l);
	power(aa, pp, tt, m * 5 + 1, k % l);
	for (j = 0; j < n; j++) {
		int ans;

		ans = 0;
		for (i = 0; i < n; i++) {
			int x;

			if (m == 1) {
				c = count[mask[i] ^ mask[j]];
				x = (long long) pp[0][c] * vch5[c] % MD;
			} else {
				c = count[mask[i / 10] ^ mask[j / 10]] + count[mask[i % 10] ^ mask[j % 10]];
				x = (long long) pp[0][c] * vch10[c] % MD;
			}
			ans = (ans + (long long) cc[s][i] * x) % MD;
		}
		printf("%d\n", ans);
	}
	return 0;
}

Compilation message

semafor.c: In function 'init':
semafor.c:21:26: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   21 |   count[b] = count[b & b - 1] + 1;
      |                        ~~^~~
semafor.c: In function 'main':
semafor.c:72:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf("%d%lld%lld%d", &m, &k, &l, &s), n = m == 1 ? 10 : 100;
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 280 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 404 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 404 KB Output is correct
2 Correct 34 ms 280 KB Output is correct
3 Correct 64 ms 332 KB Output is correct
4 Correct 85 ms 392 KB Output is correct
5 Correct 72 ms 396 KB Output is correct
6 Correct 63 ms 396 KB Output is correct
7 Correct 69 ms 400 KB Output is correct
8 Correct 27 ms 340 KB Output is correct
9 Correct 55 ms 392 KB Output is correct
10 Correct 55 ms 340 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 95 ms 388 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 404 KB Output is correct
2 Correct 34 ms 280 KB Output is correct
3 Correct 64 ms 332 KB Output is correct
4 Correct 85 ms 392 KB Output is correct
5 Correct 72 ms 396 KB Output is correct
6 Correct 63 ms 396 KB Output is correct
7 Correct 69 ms 400 KB Output is correct
8 Correct 27 ms 340 KB Output is correct
9 Correct 55 ms 392 KB Output is correct
10 Correct 55 ms 340 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 95 ms 388 KB Output is correct
14 Correct 7 ms 412 KB Output is correct
15 Correct 38 ms 332 KB Output is correct
16 Correct 52 ms 388 KB Output is correct
17 Correct 62 ms 388 KB Output is correct
18 Correct 63 ms 276 KB Output is correct
19 Correct 67 ms 388 KB Output is correct
20 Correct 83 ms 384 KB Output is correct
21 Correct 35 ms 384 KB Output is correct
22 Correct 84 ms 388 KB Output is correct
23 Correct 54 ms 388 KB Output is correct
24 Correct 73 ms 392 KB Output is correct
25 Correct 73 ms 392 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 6 ms 280 KB Output is correct
28 Correct 45 ms 276 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 404 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 12 ms 404 KB Output is correct
11 Correct 34 ms 280 KB Output is correct
12 Correct 64 ms 332 KB Output is correct
13 Correct 85 ms 392 KB Output is correct
14 Correct 72 ms 396 KB Output is correct
15 Correct 63 ms 396 KB Output is correct
16 Correct 69 ms 400 KB Output is correct
17 Correct 27 ms 340 KB Output is correct
18 Correct 55 ms 392 KB Output is correct
19 Correct 55 ms 340 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 95 ms 388 KB Output is correct
23 Correct 7 ms 412 KB Output is correct
24 Correct 38 ms 332 KB Output is correct
25 Correct 52 ms 388 KB Output is correct
26 Correct 62 ms 388 KB Output is correct
27 Correct 63 ms 276 KB Output is correct
28 Correct 67 ms 388 KB Output is correct
29 Correct 83 ms 384 KB Output is correct
30 Correct 35 ms 384 KB Output is correct
31 Correct 84 ms 388 KB Output is correct
32 Correct 54 ms 388 KB Output is correct
33 Correct 73 ms 392 KB Output is correct
34 Correct 73 ms 392 KB Output is correct
35 Correct 3 ms 332 KB Output is correct
36 Correct 6 ms 280 KB Output is correct
37 Correct 45 ms 276 KB Output is correct
38 Correct 2 ms 388 KB Output is correct
39 Correct 1 ms 388 KB Output is correct
40 Correct 1 ms 408 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 272 KB Output is correct
45 Correct 25 ms 388 KB Output is correct
46 Correct 100 ms 384 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 388 KB Output is correct
51 Correct 1 ms 328 KB Output is correct
52 Correct 18 ms 400 KB Output is correct