提出 #46269993

ソースコード 拡げる

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <inttypes.h>
int mex(int a, int b, int c) {
  int mask = 0;
  int i;
  mask |= 1 << a;
  mask |= 1 << b;
  mask |= 1 << c;
  for (i = 0; (mask >> i) & 1; i++);
  return i;
}
int N;
int A[212345];
char S[212345];
int countLeft[3][212345];
int countRight[3][12345];
int main(void) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <inttypes.h>

int mex(int a, int b, int c) {
	int mask = 0;
	int i;
	mask |= 1 << a;
	mask |= 1 << b;
	mask |= 1 << c;
	for (i = 0; (mask >> i) & 1; i++);
	return i;
}

int N;
int A[212345];
char S[212345];

int countLeft[3][212345];
int countRight[3][12345];

int main(void) {
	int i, j, k;
	uint64_t ans = 0;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	if (scanf("%212343s", S + 1) != 1) return 1;
	for (i = 1; i <= N; i++) {
		for (j = 0; j <= 2; j++) countLeft[j][i] = countLeft[j][i - 1];
		if (S[i] == 'M') countLeft[A[i]][i]++;
	}
	for (i = N; i >= 1; i--) {
		for (j = 0; j <= 2; j++) countRight[j][i] = countRight[j][i + 1];
		if (S[i] == 'X') countRight[A[i]][i]++;
	}
	for (i = 1; i <= N; i++) {
		if (S[i] == 'E') {
			for (j = 0; j <= 2; j++) {
				for (k = 0; k <= 2; k++) {
					ans += (uint64_t)countLeft[j][i] * countRight[k][i] * mex(j, A[i], k);
				}
			}
		}
	}
	printf("%" PRIu64 "\n", ans);
	return 0;
}

提出情報

ジャッジ結果