제출 #956742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
956742		DeltaStruct	Miners (IOI07_miners)	C++17	0 / 100	96 ms	628 KiB

miners

#include <bits/stdc++.h>
using namespace std;
 
int main(){
  int n,id=numeric_limits<int>::lowest(); cin >> n; string s; cin >> s; vector dp(4,vector(4,vector(4,vector<int>(4,id))));
  string u = "MFB"; dp[3][3][3][3] = 0; auto res = dp;
  for (char a:s){
    int t = find(u.begin(),u.end(),a)-u.begin();
    for (int i(0);i < 4;++i) for (int k(0);k < 4;++k) for (int j(0);j < 4;++j) for (int l(0);l < 4;++l){
      if (dp[i][k][j][l]!=id){
        res[k][t][j][l] = max(res[k][t][j][l],dp[i][k][j][l]+1+(i!=k)+(i!=t)+(i!=k&&k!=t)-(i==3||k==3));
        res[i][k][l][t] = max(res[i][k][l][t],dp[i][k][j][l]+1+(j!=l)+(j!=t)+(j!=l&&l!=t)-(j==3||l==3));
      }
    }
    swap(dp,res);
  }
  int r = 0;
  for (int i(0);i < 4;++i) for (int k(0);k < 4;++k) for (int j(0);j < 4;++j) for (int l(0);l < 4;++l){
    r = max(r,dp[i][k][j][l]);
  }
  cout << r << endl;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 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