oj.uz

Submission #824135

# Submission time Handle Problem Language Result Execution time Memory
824135 2023-08-13T15:12:12 Z rainboy Flip it and Stick it (CCO23_day2problem1) C
18 / 25
 3 ms 596 KB 
#include <stdio.h>
#include <string.h>

#define N	200000

int count(char *aa, int n, char *bb, int m) {
	int i, k;

	k = 0;
	for (i = 0; i + m <= n; i++)
		if (strncmp(aa + i, bb, m * sizeof *bb) == 0)
			k++;
	return k;
}

int main() {
	static char aa[N + 1], bb[4];
	static int kk[N + 1];
	int n, m, i, j, a, d, k1, k2, k3, k;

	scanf("%s%s", aa, bb), n = strlen(aa), m = strlen(bb);
	k = count(aa, n, bb, m);
	if (m == 1)
		printf(k != 0 ? "-1\n" : "0\n");
	else if (m == 2) {
		if (bb[0] != bb[1])
			printf("%d\n", k);
		else {
			d = 0;
			for (i = 0; i < n; i++)
				d += aa[i] == bb[0] ? 1 : -1;
			printf("%d\n", d > 1 ? -1 : k);
		}
	} else {
		if (bb[0] != bb[2])
			printf("%d\n", k);
		else if (bb[0] != bb[1])
			printf("%d\n", (k + 1) / 2);
		else {
			k1 = k2 = k3 = 0;
			for (i = -1, j = 0; j <= n; j++)
				if (j == n || aa[j] != bb[0]) {
					a = j - i - 1;
					if (a == 0)
						k3++;
					else if (a == 1)
						k2++;
					else if (a == 2)
						k1++;
					else if (a > 3)
						kk[a - 3]++;
				}
			k = 0;
			while (k3 > 0) {
				a = n;
				while (a > 0 && kk[a] == 0)
					a--;
				if (a >= 3)
					k++, k3--, kk[a]--, kk[a - 3]++;
				else {
					k2 += k3, k1 += k3;
					break;
				}
			}
			while (k2 > 0) {
				a = n;
				while (a > 0 && kk[a] == 0)
					a--;
				if (a >= 2)
					k++, k2--, kk[a]--, kk[a - 2]++;
				else {
					k1 += k2 * 2;
					break;
				}
			}
			while (k1 > 0) {
				a = n;
				while (a > 0 && kk[a] == 0)
					a--;
				if (a > 0)
					k++, k1--, kk[a]--, kk[a - 1]++;
				else
					break;
			}
			a = n;
			while (a > 0 && kk[a] == 0)
				a--;
			printf("%d\n", a > 0 ? -1 : k);
		}
	}
	return 0;
}

Compilation message

Main.c: In function 'main':
Main.c:21:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%s%s", aa, bb), n = strlen(aa), m = strlen(bb);
      |  ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.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 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 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 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 1 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct

Subtask #4
5.0 / 5.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 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 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct

Subtask #5
5.0 / 5.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 1 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 1 ms 212 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 532 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 560 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 2 ms 572 KB Output is correct
20 Correct 2 ms 520 KB Output is correct
21 Correct 2 ms 540 KB Output is correct
22 Correct 2 ms 568 KB Output is correct

Subtask #6
0 / 7.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 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 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 1 ms 212 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 564 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 532 KB Output is correct
27 Correct 2 ms 560 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 560 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 2 ms 572 KB Output is correct
33 Correct 2 ms 520 KB Output is correct
34 Correct 2 ms 540 KB Output is correct
35 Correct 2 ms 568 KB Output is correct
36 Incorrect 0 ms 212 KB Output isn't correct
37 Halted 0 ms 0 KB -