제출 #530753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
530753		perchuts	Miners (IOI07_miners)	C++17	17 / 100	1591 ms	844 KiB

miners

#include <bits/stdc++.h>
#define maxn (int)(1e5+51)
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define ll long long
#define pb push_back
#define ull unsigned long long
#define ii pair<int,int>
#define iii tuple<int,int,int>
#define inf 2000000001
#define mod 1000000007 //998244353
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }

map<pair<string,string>,int>dp[2];
map<pair<string,string>,bool>mark,mark2;
int main(){_
    int n;cin>>n;
    string s;cin>>s;
    mark[{"",""}]=1;
    for(int i=1;i<=n;++i){
        for(auto [p,z]:mark){
            auto [x,y] = p;
            int b = dp[(i-1)&1][{x,y}];
            int j = max(0,sz(x)-2),cntm=0,cntf=0,cntb=0;
            string newa,newb;
            while(j<sz(x))newa+=x[j++]; 
            newa+=s[i];
            for(auto u:newa){
                cntm|=u=='M',cntf|=u=='F',cntb|=u=='B';
            }
            if(!mark2[{newa,y}])mark2[{newa,y}] = 1,dp[i&1][{newa,y}] = b+cntm+cntf+cntb;
            else ckmax(dp[i&1][{newa,y}],b+cntm+cntb+cntf);
            j = max(0,sz(y)-2), cntm = cntf = cntb = 0;
            while(j<sz(y))newb+=y[j++];
            newb+=s[i];
            for(auto u:newb){
                cntm|=u=='M',cntf|=u=='F',cntb|=u=='B';
            }
            if(!mark2[{x,newb}])mark2[{x,newb}]=1,dp[i&1][{x,newb}] = b+cntm+cntf+cntb;
            else ckmax(dp[i&1][{x,newb}],b+cntm+cntb+cntf);
        }
        mark = mark2;mark2.clear();
    }
    int ans = 0;
    for(auto [a,b]:dp[n&1])ckmax(ans,b);
    cout<<ans<<endl; 
};

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