結果
問題 | No.2226 Hello, Forgotten World! |
ユーザー | Ricky_pon |
提出日時 | 2023-06-13 21:44:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 9 ms / 2,000 ms |
コード長 | 4,020 bytes |
コンパイル時間 | 1,642 ms |
コンパイル使用メモリ | 135,380 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 08:06:27 |
合計ジャッジ時間 | 2,178 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 9 ms
6,944 KB |
testcase_02 | AC | 4 ms
6,940 KB |
testcase_03 | AC | 5 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 5 ms
6,940 KB |
testcase_06 | AC | 3 ms
6,944 KB |
testcase_07 | AC | 4 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 4 ms
6,944 KB |
ソースコード
#include <string.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cfloat>#include <chrono>#include <ciso646>#include <climits>#include <cmath>#include <complex>#include <cstdio>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <numeric>#include <optional>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME#define REP3(i, l, r, s) \for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \i += rep3_s)#define REP2(i, l, r) REP3(i, l, r, 1)#define REP1(i, n) REP2(i, 0, n)#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME#define RREP3(i, l, r, s) \for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \i -= rrep3_s)#define RREP2(i, l, r) RREP3(i, l, r, 1)#define RREP1(i, n) RREP2(i, 0, n)#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)#define rrepin(i, l, r) \for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)#include <algorithm>#include <cassert>#include <vector>namespace rklib {// a <- max(a, b)template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}// a <- min(a, b)template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;}return false;}// if a < 0: a <- b// else: a <- min(a, b)template <class T>bool chmin_non_negative(T &a, const T &b) {if (a < 0 || a > b) {a = b;return true;}return false;}// floor(num / den)template <class T>T div_floor(T num, T den) {if (den < 0) num = -num, den = -den;return num >= 0 ? num / den : (num + 1) / den - 1;}// ceil(num / den)template <class T>T div_ceil(T num, T den) {if (den < 0) num = -num, den = -den;return num <= 0 ? num / den : (num - 1) / den + 1;}namespace internal {template <class T>T remainder_count(T r, T b, T m) {return r / m * b + std::min(b, r % m);}} // namespace internal// Number of integer x s.t.// - x in [l, r)// - x mod m in [a, b)template <class T>T remainder_count(T l, T r, T a, T b, T m) {assert(l >= 0);assert(m >= 1);if (l >= r || a >= b) return 0;if (m <= a || b < 0) return 0;chmax(a, T(0));chmin(b, m);auto res = internal::remainder_count(r, b, m);if (l >= 1) res -= internal::remainder_count(l, b, m);if (a >= 1) res -= internal::remainder_count(r, a, m);if (l >= 1 && a >= 1) res += internal::remainder_count(l, a, m);return res;}} // namespace rklibusing namespace std;using namespace rklib;using lint = long long;using pii = pair<int, int>;using pll = pair<lint, lint>;bool check(string s, string t) {rep(i, s.size()) {if (s[i] != t[i] && s[i] != '?' && t[i] != '?') {return false;}}return true;}void solve() {int n;cin >> n;string s;cin >> s;string t = "helloworld";string ans(s.size(), 'z');bool flag = false;rep(i, s.size()) {if (i + t.size() > s.size()) break;if (check(s.substr(i, t.size()), t)) {flag = true;string tmp = s;rep(k, t.size()) { tmp[k + i] = t[k]; }rep(k, tmp.size()) if (tmp[k] == '?') tmp[k] = 'a';chmin(ans, tmp);}}if (flag) {cout << ans << "\n";} else {cout << "-1\n";}}int main() {int t;cin >> t;rep(tt, t) solve();}