結果

問題 No.1192 半部分列
ユーザー heno239heno239
提出日時 2020-08-22 13:59:54
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 42 ms / 2,000 ms
コード長 3,759 bytes
コンパイル時間 1,076 ms
コンパイル使用メモリ 116,144 KB
実行使用メモリ 41,952 KB
最終ジャッジ日時 2024-10-15 08:16:05
合計ジャッジ時間 2,948 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
22,528 KB
testcase_01 AC 17 ms
20,592 KB
testcase_02 AC 17 ms
21,960 KB
testcase_03 AC 18 ms
23,124 KB
testcase_04 AC 16 ms
20,016 KB
testcase_05 AC 18 ms
22,956 KB
testcase_06 AC 33 ms
41,952 KB
testcase_07 AC 41 ms
40,704 KB
testcase_08 AC 42 ms
40,704 KB
testcase_09 AC 42 ms
39,808 KB
testcase_10 AC 25 ms
19,712 KB
testcase_11 AC 25 ms
19,840 KB
testcase_12 AC 42 ms
40,704 KB
testcase_13 AC 32 ms
29,036 KB
testcase_14 AC 35 ms
33,024 KB
testcase_15 AC 35 ms
32,184 KB
testcase_16 AC 32 ms
28,916 KB
testcase_17 AC 36 ms
32,520 KB
testcase_18 AC 26 ms
19,968 KB
testcase_19 AC 23 ms
23,680 KB
testcase_20 AC 19 ms
19,840 KB
testcase_21 AC 17 ms
20,092 KB
testcase_22 AC 17 ms
20,704 KB
testcase_23 AC 29 ms
41,808 KB
testcase_24 AC 25 ms
19,840 KB
testcase_25 AC 25 ms
19,968 KB
testcase_26 AC 25 ms
19,840 KB
testcase_27 AC 26 ms
20,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ul gcd(ul a, ul b) {
	if (a < b)swap(a, b);
	while (b) {
		ul r = a % b; a = b; b = r;
	}
	return a;
}

int nex[1 << 17][26];
int tnex[1 << 17][26];
void solve() {
	string s, t; cin >> s >> t;
	int n = s.size(), m = t.size();
	vector<int> loc(n + 1);
	loc[n] = m;
	per(i, n) {
		int cur = loc[i + 1]-1;
		while (cur >= 0 && s[i]!=t[cur])cur--;
		loc[i] = cur;
	}
	if (loc[0] >= 0) {
		cout << -1 << "\n"; return;
	}

	rep(i, 26)nex[n][i] = n;
	per(i, n) {
		rep(j, 26)nex[i][j] = nex[i + 1][j];
		nex[i][s[i] - 'a'] = i;
	}
	rep(i, 26)tnex[m][i] = m;
	per(i, m) {
		rep(j, 26)tnex[i][j] = tnex[i + 1][j];
		tnex[i][t[i] - 'a'] = i;
	}
	string ans;
	int cur = 0;
	int ccur = 0;
	while (cur < n) {
		rep(j, 26) {
			int to = nex[cur][j];
			if (to == n)continue;
			int cto = tnex[ccur][j];
			if (cto == m) {
				ans.push_back('a' + j);
				cur = n; break;
			}
			if (loc[to + 1] <= cto) {
				ans.push_back('a' + j);
				cur = to + 1;
				ccur = cto + 1; break;
			}
		}
	}
	cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
	solve();
	return 0;
}
0