結果

問題 No.252 "良問"(良問とは言っていない (2)
コンテスト
ユーザー fumiphys
提出日時 2019-10-13 21:23:20
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,952 bytes
コンパイル時間 1,553 ms
コンパイル使用メモリ 173,304 KB
実行使用メモリ 16,080 KB
最終ジャッジ日時 2024-12-17 16:04:21
合計ジャッジ時間 2,517 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 5 WA * 2
権限があれば一括ダウンロードができます

ソースコード

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 all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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(0); cout << fixed << setprecision(20);}
} fast_io_;

string good = "good", problem = "problem";

int main(int argc, char const* argv[])
{
  int t; cin >> t;
  rep(i_, t){
    string s; cin >> s;
    int gf = sz(s), pf = sz(s);
    for(int i = 0; i <= sz(s) - 4; i++){
      if(s.substr(i, 4) == good){
        gf = i;
        break;
      }
    }
    for(int i = 0; i <= sz(s) - 7; i++){
      if(s.substr(i, 7) == problem){
        pf = i;
        break;
      }
    }
    vector<int> g(sz(s), 0), p(sz(s), 0);
    for(int i = 0; i <= sz(s) - 4; i++){
      rep(j, 4)if(s[i+j] != good[j])g[i]++;
    }
    for(int i = 0; i <= sz(s) - 7; i++){
      rep(j, 7)if(s[i+j] != problem[j])p[i]++;
    }
    vector<int> g2(sz(s), 0);
    for(int i = sz(s) - 7; i >= 0; i--){
      g2[i] = (i < sz(s) - 7 ? g2[i+1]: 11);
      g2[i] = min(g2[i], p[i] + (i > pf ? 1: 0));
    }
    int res = 11;
    for(int i = 0; i <= sz(s) - 11; i++){
      int tmp = (i <= gf ? 0: 1) + g[i];
      tmp += g2[i+4];
      if(pf != sz(s) && max(i, pf) <= min(i + 3, pf + 6))tmp--;
      res = min(res, tmp);
    }
    cout << res << endl;
  }
  return 0;
}
0