結果
問題 | No.252 "良問"(良問とは言っていない (2) |
ユーザー | fumiphys |
提出日時 | 2019-10-13 21:50:45 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 67 ms / 2,000 ms |
コード長 | 3,945 bytes |
コンパイル時間 | 1,676 ms |
コンパイル使用メモリ | 172,728 KB |
実行使用メモリ | 23,844 KB |
最終ジャッジ日時 | 2024-05-09 22:31:41 |
合計ジャッジ時間 | 2,283 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
5,248 KB |
testcase_01 | AC | 67 ms
5,376 KB |
testcase_02 | AC | 38 ms
7,856 KB |
testcase_03 | AC | 42 ms
23,764 KB |
testcase_04 | AC | 44 ms
23,756 KB |
testcase_05 | AC | 45 ms
23,844 KB |
testcase_06 | AC | 2 ms
5,376 KB |
ソースコード
// 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; vector<int> g(sz(s), 0), p(sz(s), 0); vector<int> ge(sz(s), 0), pe(sz(s), 0); for(int i = 0; i + 4 <= sz(s); i++){ rep(j, 4){ if(s[i+j] != good[j])g[i]++; } if(g[i] == 0)ge[i]++; } for(int i = 1; i + 4 <= sz(s); i++){ ge[i] = ge[i] + ge[i-1]; } for(int i = 0; i + 7 <= sz(s); i++){ rep(j, 7){ if(s[i+j] != problem[j])p[i]++; } if(p[i] == 0)pe[i]++; } for(int i = 1; i + 7 <= sz(s); i++){ pe[i] = pe[i] + pe[i-1]; } vector<int> pm(sz(s), 7); for(int i = sz(s) - 7; i >= 0; i--){ pm[i] = p[i]; pm[i] = min(p[i], pm[i+1]); } int res = 11; for(int i = 0; i + 11 <= sz(s); i++){ int tmp = g[i]; tmp += pm[i + 4]; if(i > 3){ tmp += ge[i-4]; } if(i > 6){ tmp += pe[i-7]; } res = min(res, tmp); } cout << res << endl; } return 0; }