Submission #75788738

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <stdio.h>
#include <string.h>
char S[1123456];
int clist[1123456];
int main(void) {
  int len, cnum = 0;
  int i;
  int acnt = 0;
  int ans = 0;
  if (scanf("%1123455s", S) != 1) return 1;
  len = (int)strlen(S);
  for (i = len - 1; i >= 0; i--) {
    if (S[i] == 'C') clist[cnum++] = i;
  }
  for (i = 0; i < len; i++) {
    switch (S[i]) {
      case 'A':
        acnt++;
        break;
      case 'B':
        if (acnt > 0 && cnum > 0) {
          ans++;
          acnt--;
          cnum--;
        }
        break;
      case 'C':
        if (cnum > 0 && clist[cnum - 1] == i) cnum--;
        break;
    }
  }
  printf("%d\n", ans);
  return 0;
}
/*
左から見ていく
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <string.h>

char S[1123456];

int clist[1123456];

int main(void) {
	int len, cnum = 0;
	int i;
	int acnt = 0;
	int ans = 0;
	if (scanf("%1123455s", S) != 1) return 1;
	len = (int)strlen(S);
	for (i = len - 1; i >= 0; i--) {
		if (S[i] == 'C') clist[cnum++] = i;
	}
	for (i = 0; i < len; i++) {
		switch (S[i]) {
			case 'A':
				acnt++;
				break;
			case 'B':
				if (acnt > 0 && cnum > 0) {
					ans++;
					acnt--;
					cnum--;
				}
				break;
			case 'C':
				if (cnum > 0 && clist[cnum - 1] == i) cnum--;
				break;
		}
	}
	printf("%d\n", ans);
	return 0;
}

/*

左から見ていく
それぞれの B について、可能な最も左の A, C を貪欲に割り当てる

*/

Submission Info

Judge Result