結果
問題 | No.1192 半部分列 |
ユーザー | 👑 hitonanode |
提出日時 | 2020-08-22 15:17:47 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 5,053 bytes |
コンパイル時間 | 2,253 ms |
コンパイル使用メモリ | 204,332 KB |
実行使用メモリ | 24,908 KB |
最終ジャッジ日時 | 2024-04-23 09:39:36 |
合計ジャッジ時間 | 3,520 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 34 ms
24,780 KB |
testcase_07 | AC | 30 ms
24,780 KB |
testcase_08 | AC | 31 ms
24,780 KB |
testcase_09 | AC | 30 ms
23,892 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 33 ms
24,908 KB |
testcase_13 | AC | 16 ms
12,800 KB |
testcase_14 | AC | 27 ms
17,104 KB |
testcase_15 | AC | 21 ms
16,104 KB |
testcase_16 | AC | 15 ms
12,672 KB |
testcase_17 | AC | 22 ms
16,296 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 5 ms
7,040 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 20 ms
14,080 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 29 ms
24,716 KB |
testcase_24 | AC | 8 ms
7,168 KB |
testcase_25 | AC | 17 ms
12,288 KB |
testcase_26 | AC | 17 ms
12,416 KB |
testcase_27 | AC | 15 ms
13,676 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); } template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; } template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); } template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } 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) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; } #endif template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl #else #define dbg(x) #endif vector<int> Solve(const string &S, const string &T) { vector<int> reqlen; int tmp = 0; for (auto c : S) { while (tmp < T.length() and c != T[tmp]) tmp++; tmp++; reqlen.emplace_back(tmp); } return reqlen; } vector<vector<int>> buildNext(const string &T) { vector<vector<int>> nxt(26, vector<int>(T.length() + 1, T.length() + 2)); IREP(i, T.length()) { REP(d, 26) nxt[d][i] = nxt[d][i + 1]; nxt[T[i] - 'a'][i] = i; } return nxt; } int main() { string S, T; cin >> S >> T; auto Srev = S, Trev = T; reverse(ALL(Srev)); reverse(ALL(Trev)); auto vb = Solve(Srev, Trev); reverse(vb.begin(), vb.end()); auto Snxt = buildNext(S), Tnxt = buildNext(T); int Scur = 0, Tcur = 0; string ret; while (Scur < S.length()) { int nxtc = -1; REP(d, 26) if (Snxt[d][Scur] < S.length()) { if (vb[Snxt[d][Scur]] + Tcur > T.length()) { nxtc = d; break; } } if (nxtc < 0) { puts("-1"); return 0; } ret += 'a' + nxtc; Scur = Snxt[nxtc][Scur] + 1; Tcur = Tnxt[nxtc][Tcur] + 1; if (Tcur > T.length()) break; } cout << ret << '\n'; }