結果

問題 No.38 赤青白ブロック
ユーザー fumiphysfumiphys
提出日時 2020-04-10 21:30:52
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 387 ms / 5,000 ms
コード長 3,777 bytes
コンパイル時間 1,731 ms
コンパイル使用メモリ 174,224 KB
実行使用メモリ 4,352 KB
最終ジャッジ日時 2023-10-13 23:24:43
合計ジャッジ時間 14,002 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 372 ms
4,348 KB
testcase_01 AC 331 ms
4,352 KB
testcase_02 AC 327 ms
4,352 KB
testcase_03 AC 343 ms
4,352 KB
testcase_04 AC 335 ms
4,348 KB
testcase_05 AC 379 ms
4,348 KB
testcase_06 AC 331 ms
4,348 KB
testcase_07 AC 327 ms
4,352 KB
testcase_08 AC 387 ms
4,348 KB
testcase_09 AC 355 ms
4,352 KB
testcase_10 AC 372 ms
4,352 KB
testcase_11 AC 372 ms
4,348 KB
testcase_12 AC 339 ms
4,352 KB
testcase_13 AC 372 ms
4,348 KB
testcase_14 AC 347 ms
4,352 KB
testcase_15 AC 368 ms
4,348 KB
testcase_16 AC 320 ms
4,348 KB
testcase_17 AC 334 ms
4,348 KB
testcase_18 AC 361 ms
4,352 KB
testcase_19 AC 338 ms
4,352 KB
testcase_20 AC 342 ms
4,348 KB
testcase_21 AC 324 ms
4,352 KB
testcase_22 AC 355 ms
4,352 KB
testcase_23 AC 359 ms
4,348 KB
testcase_24 AC 332 ms
4,348 KB
testcase_25 AC 354 ms
4,352 KB
testcase_26 AC 341 ms
4,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

bool ok(string &s, int kr, int kb){
  rep(i, sz(s)){
    if(s[i] == 'R'){
      if(i - kr >= 0 && s[i-kr] == s[i])return false;
      if(i + kr < sz(s) && s[i+kr] == s[i])return false;
    }else if(s[i] == 'B'){
      if(i - kb >= 0 && s[i-kb] == s[i])return false;
      if(i + kb < sz(s) && s[i+kb] == s[i])return false;
    }
  }
  return true;
}

int main(int argc, char const* argv[])
{
  int kr, kb; cin >> kr >> kb;
  string s; cin >> s;
  vector<int> v;
  rep(i, sz(s)){
    if(s[i] != 'W'){
      v.pb(i);
    }
  }
  map<int, int> mp; rep(i, sz(v))mp[v[i]] = i;
  int res = 0;
  rep(i, 1 << 20){
    string t = "";
    rep(j, sz(s)){
      if(s[j] == 'W')t += s[j];
      else{
        if((i >> mp[j]) & 1)t += s[j];
      }
    }
    if(ok(t, kr, kb))chmax(res, sz(t));
  }
  cout << res << endl;
  return 0;
}
0