제출 #607628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
607628		Blobo2_Blobo2	Miners (IOI07_miners)	C++17	25 / 100	587 ms	315288 KiB

miners

/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
I love my mama
*/\
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2 ios_base::sync_with_stdio(false);cin.tie(0);

const int mod = 1e9+7;
int nxt(){int x;cin>>x;return x;}

int dp[100000][28][28],n;
string s;
int mask3[4][4][4];
int mask1[3], mask2[3];
int solve(int idx=0){
    if(idx == n)
        return 0;
    int m1 = mask3[mask1[0]][mask1[1]][mask1[2]];
    int m2 = mask3[mask2[0]][mask2[1]][mask2[2]];
    int &ret = dp[idx][m1][m2];
    if(~ret)return ret;

    int meal = 0;
    if(s[idx] == 'M')meal = 1;
    if(s[idx] == 'B')meal = 2;
    if(s[idx] == 'F')meal = 4;

    int x = mask1[0];
    swap(mask1[0],mask1[1]);
    swap(mask1[2],mask1[1]);
    mask1[2] = (meal/2)+1;

    int c=0;
    if((mask1[0] == mask1[1] && mask1[1] == mask1[2] && mask1[0] && mask1[1] && mask1[2]) || (mask1[2] && !mask1[1]))c=1;
    else if(((mask1[0] == mask1[1]) 
        ||  (mask1[0] == mask1[2])
        ||  (mask1[1] == mask1[2]))
        &&   mask1[0] && mask1[1] && mask1[2])c = 2;
    else if(mask1[0] == 0 && mask1[1] == mask1[2])c = 1;
    else if(mask1[0] == 0 && mask1[1] != mask1[2])c = 2;
    else if(mask1[0] && mask1[1] && mask1[2])c=3;
    ret = solve(idx+1) + c;

    swap(mask1[2],mask1[1]);
    swap(mask1[0],mask1[1]);
    mask1[0] = x;

    x = mask2[0];
    swap(mask2[0],mask2[1]);
    swap(mask2[2],mask2[1]);
    mask2[2] = (meal/2)+1;

    c=0;
    if((mask2[0] == mask2[1] && mask2[1] == mask2[2] && mask2[0] && mask2[1] && mask2[2]) || (mask2[2] && !mask2[1]))c=1;
    else if(((mask2[0] == mask2[1]) 
        ||  (mask2[0] == mask2[2])
        ||  (mask2[1] == mask2[2]))
        &&   mask2[0] && mask2[1] && mask2[2])c = 2;
    else if(mask2[0] == 0 && mask2[1] == mask2[2])c = 1;
    else if(mask2[0] == 0 && mask2[1] != mask2[2])c = 2;
    else if(mask2[0] && mask2[1] && mask2[2])c=3;
    ret = max(ret,solve(idx+1) + c);

    swap(mask2[2],mask2[1]);
    swap(mask2[0],mask2[1]);
    mask2[0] = x;

    return ret;
}

signed main() {
    Blobo2
    n=nxt();
    cin>>s;
    memset(dp,-1,sizeof dp);
    int idx=1;
    for(int A=0;A<4;A++){
        for(int B=0;B<4;B++){   
            for(int C=0;C<4;C++){
                mask3[A][B][C] = idx++;
            }
        }
    }
    cout<<solve();
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 7 / 7
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8