Submission #53069736

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<ll,ll> P;
typedef pair<int,P> PP; 
const int MAXA=2*100000;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<ll,ll> P;
typedef pair<int,P> PP; 
const int MAXA=2*100000;


int mex(int x,int y,int z){
    vector<int> cnt(4,0);
    cnt[x]++;
    cnt[y]++;
    cnt[z]++;
    for (int i=0;i<4;i++){
        if (cnt[i]==0){
            return i;
        }
    }
    return 3;
    
}

int main(){
    int N;
    cin>>N;
    vector<int> A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
    }
    string S;
    cin>>S;

    vector<vector<ll>> cnt_l(N+2,vector<ll>(3,0));
    vector<vector<ll>> cnt_r(N+2,vector<ll>(3,0));

    for(int i=0;i<N;i++){
        if(S[i]=='M'){
            cnt_l[i][A[i]]++;
        }else if(S[i]=='X'){
            cnt_r[i][A[i]]++;
        }
    }

    for(int i=1;i<=N+1;i++){    
        for(int j=0;j<3;j++){
            cnt_l[i][j]+=cnt_l[i-1][j];
            cnt_r[i][j]+=cnt_r[i-1][j];
        }
    }

    ll ans=0;

    for(int i=0;i<N;i++){
        if(S[i]=='E'){
            for(int cM=0;cM<3;cM++){
                for(int cX=0;cX<3;cX++){
                    ll val=cnt_l[i][cM]*(cnt_r[N][cX]-cnt_r[i][cX]);
                    ans+=val*mex(cM,cX,A[i]);
                }
            }
        }
    }
    cout<<ans<<endl;

}

Submission Info

Judge Result