結果

問題 No.291 黒い文字列
ユーザー hamray
提出日時 2021-03-21 23:39:05
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 51 ms / 2,000 ms
コード長 5,757 bytes
コンパイル時間 1,612 ms
コンパイル使用メモリ 173,516 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-22 18:52:51
合計ジャッジ時間 3,420 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
#pragma GCC target ("avx")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;


#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()

#define MOD 1000000007

template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
const double EPS = 1e-6, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
//ここから編集    
typedef string::const_iterator State;
ll GCD(ll a, ll b){
  return (b==0)?a:GCD(b, a%b);
}
ll LCM(ll a, ll b){
  return a/GCD(a, b) * b;
}
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< 998244353 >;
template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(int k) const { return _fact[k]; }

  inline T rfact(int k) const { return _rfact[k]; }

  inline T inv(int k) const { return _inv[k]; }

  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }

  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};

int modpow(ll x, ll n, int mod) {
  if(x == 0) return 0;
  
  ll res = 1;
  while(n) {
    if(n&1) res = res*x % mod;
    x = x*x%mod;
    n >>= 1;
  }
  return res;
}

int dp[21][21][21][21];
int rdp[21][21][21][21];
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(11);
  
  string s; cin >> s;
  int n = s.size();
  REP(i,21) REP(j,21) REP(k,21) REP(l,21) dp[i][j][k][l] = -1;
  dp[0][0][0][0] = 0; 
  for(int i=0; i<n; i++) {
    REP(j,21)REP(k,21)REP(kk,21)REP(l,21) rdp[j][k][kk][l] = dp[j][k][kk][l];
    REP(j,21) {
      REP(k,21) {
        REP(kk,21) {
          REP(l,21) {
            if(dp[j][k][kk][l] == -1) continue;
            if(s[i] == 'K') {
              rdp[j+1][k][kk][l] = max(rdp[j+1][k][kk][l],dp[j][k][kk][l]);
            }else if(s[i] == 'U') {
              if(j>0) rdp[j-1][k+1][kk][l] = max(rdp[j-1][k+1][kk][l],dp[j][k][kk][l]);
            }else if(s[i] == 'R') {
              if(k>0) rdp[j][k-1][kk+1][l] = max(rdp[j][k-1][kk+1][l],dp[j][k][kk][l]);
            }else if(s[i] == 'O') {
              if(kk>0) rdp[j][k][kk-1][l+1] = max(rdp[j][k][kk-1][l+1],dp[j][k][kk][l]);
            }else if(s[i] == 'I') {
              if(l>0) rdp[j][k][kk][l-1] = max(rdp[j][k][kk][l-1],dp[j][k][kk][l] + 1);
            }else if(s[i] == '?') {
              rdp[j+1][k][kk][l] = max(rdp[j+1][k][kk][l],dp[j][k][kk][l]);
              if(j>0) rdp[j-1][k+1][kk][l] = max(rdp[j-1][k+1][kk][l],dp[j][k][kk][l]);
              if(k>0) rdp[j][k-1][kk+1][l] = max(rdp[j][k-1][kk+1][l],dp[j][k][kk][l]);
              if(kk>0) rdp[j][k][kk-1][l+1] = max(rdp[j][k][kk-1][l+1],dp[j][k][kk][l]);
              if(l>0) rdp[j][k][kk][l-1] = max(rdp[j][k][kk][l-1],dp[j][k][kk][l] + 1);
            }
          }
        }
      }
    }
    REP(j,21)REP(k,21)REP(kk,21)REP(l,21) dp[j][k][kk][l] = rdp[j][k][kk][l];
  }
  int ans = 0;
  REP(i,21) REP(j,21) REP(k,21) REP(l,21) ans = max(ans, dp[i][j][k][l]);
  cout << ans << endl;
  return 0;
}
0