제출 #535167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
535167		kebine	Miners (IOI07_miners)	C++17	100 / 100	161 ms	592 KiB

miners

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod = 1e9 + 7;
#pragma GCC optimize("Ofast")
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define sc second
#define endl '\n'
#define gl ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int main()
{
  int n;
  string s;
  cin >> n >> s;
  
  int dp[2][4][4][4][4];
  memset(dp, -1, sizeof(dp));
  
  dp[0][0][0][0][0] = 0;
  for(int i = 0; i < n; i++){
    for(int j = 0; j <= 3; j++){
      for(int k = 0; k <= 3; k++){
        for(int l = 0; l <= 3; l++){
          for(int m = 0; m <= 3; m++){
            if(dp[i % 2][j][k][l][m] == -1) continue;
            int nxt, cur = 1;
            if(s[i] == 'M') nxt = 1;
            else if(s[i] == 'B') nxt = 2;
            else nxt = 3;
            if(j > 0 and j != nxt) cur++;
            if(k > 0 and k != nxt and k != j) cur++;
            dp[(i + 1) % 2][nxt][j][l][m] = max(dp[(i+1)%2][nxt][j][l][m], dp[i%2][j][k][l][m] + cur);
            cur = 1;
            if(l > 0 and l != nxt) cur++;
            if(m > 0 and m != l and m != nxt) cur++;
            dp[(i + 1) % 2][j][k][nxt][l] = max(dp[(i+1)%2][j][k][nxt][l], dp[i%2][j][k][l][m] + cur);
          }
        }
      }
    }
  }
  
  int ans = 0;
  for(int i = 0; i < 2; i++){
    for(int j = 0; j <= 3; j++){
      for(int k = 0; k <= 3; k++){
        for(int l = 0; l <= 3; l++){
          for(int m = 0; m <= 3; m++){
            ans = max(ans, dp[i][j][k][l][m]);
          }
        }
      }
    }
  }
  
  cout << ans << endl;
}

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