-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path308-5.cpp
More file actions
72 lines (72 loc) · 1.3 KB
/
308-5.cpp
File metadata and controls
72 lines (72 loc) · 1.3 KB
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef struct nodeE
{
int pos;
int num;
int targetnum[3];
} nodeE;
vector<nodeE> M;
vector<nodeE> X;
int a[200001];
int n;
int m[3], x[3];
string s;
int mex(int a,int b,int c)
{
for(int i=0;i<=3;i++)
{
if(a!=i&&b!=i&&c!=i)return i;
}
return 3;
}
signed main()
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
{
char c;
cin >> c;
s += c;
switch (c)
{
case 'M':
m[a[i]]++;
break;
case 'E':
M.push_back(nodeE({i, a[i], {m[0], m[1], m[2]}}));
break;
case 'X':
x[a[i]]++;
}
}
for (int i = 0; i < n; i++)
{
switch (s[i])
{
case 'M':
m[a[i]]--;
break;
case 'E':
X.push_back(nodeE({i, a[i], {x[0], x[1], x[2]}}));
break;
case 'X':
x[a[i]]--;
}
}
int ansf=0;
for(int i=0;i<M.size();i++)
{
for(int j=0;j<=2;j++)
for(int k=0;k<=2;k++)
{
ansf+=mex(M[i].num,j,k)*(M[i].targetnum[j])*(X[i].targetnum[k]);
}
}
cout<<ansf<<endl;
system("pause");
return 0;
}