Submission

PPPPPPPPPP

Score: 100

User: Nagornz

Problemset: Dvaravati-LCS

Language: cpp

Time: 0.004 second

Submitted On: 2025-03-14 12:19:57

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    string s, t; cin >> s >> t;
    int n = s.length(), m = t.length();
    vector <vector <int>> dp(n + 1, vector <int> (m + 1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (s[i - 1] == t[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
            else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
        }
    }
    string ans = "";
    int ii = n, jj = m;
    while (ii && jj) {
        if (s[ii - 1] == t[jj - 1]) {
            ans += s[ii - 1];
            ii--, jj--;
        }
        else {
            if (dp[ii - 1][jj] > dp[ii][jj - 1]) ii--;
            else jj--;
        }
    }
    reverse(all(ans));
    cout << ans << "\n" << ans.length() << "\n" << (ans.length() > s.length() / 2 ? 'y' : 'n');
}