結果
問題 | No.2226 Hello, Forgotten World! |
ユーザー |
|
提出日時 | 2023-02-24 21:58:18 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 11 ms / 2,000 ms |
コード長 | 2,846 bytes |
コンパイル時間 | 2,049 ms |
コンパイル使用メモリ | 181,680 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-13 05:27:36 |
合計ジャッジ時間 | 2,533 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 |
ソースコード
#include <bits/stdc++.h>#define all(v) v.begin(), v.end()#define rall(v) v.rbegin(), v.rend()#define rep(i,n) for(int i=0;i<(int)(n);i++)#define codefor int test;cin>>test;while(test--)#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))using namespace std;using ll = long long;template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;template<class T> istream& operator>>(istream& is, vector<T>& vec) {for(T& x : vec)is >> x;return is;}template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;}void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){cin >> head;in(tail...);}void out(){cout << '\n';}template<class T>void out(const T& a){cout << a << '\n';}template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);}const int INF = 1 << 30;const long long INF2 = 1ll << 60;template<class T> void chmax(T &a,const T b){if(b>a)a=b;}template<class T> void chmin(T &a,const T b){if(b<a)a=b;}int main(){ios::sync_with_stdio(false);cin.tie(0);string s;string t = "helloworld";int T;cin >> T;auto f = [&](int i){for(int j = 0; j < t.size(); j++){if(i + j >= s.size()) return false;if(s[i + j] == '?') continue;if(s[i + j] != t[j]) return false;}return true;};auto g = [&](int i){for(int j = 0; j < t.size(); j++){if(i + j >= s.size()) return false;if(s[i + j] != t[j]) return false;}return true;};auto f2 = [&](string s){for(int i = 0; i < s.size(); i++){if(s[i] == '?') s[i] = 'a';}return s;};while(T--){INT(n);cin >> s;int pos = -1;vector<int> b;for(int i = 0; i + 10 <= n; i++){if(f(i)) b.push_back(i);if(g(i)){s = f2(s);pos = n;break;}}if(b.empty() && pos == -1){out(-1);continue;}if(pos == n){out(s);continue;}vector<string> c;for(auto &v: b){string s2 = s;for(int j = 0; j < 10; j++){s2[v + j] = t[j];}c.push_back(f2(s2));}sort(all(c));out(c[0]);}}