test/AOJ_ALDS1_10_c.test.cpp

View this file on GitHub
Last update: 2024-05-17 14:55:36+09:00
Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C"

#include "../template.hpp"

#include "../DP/LongestCommonSubsequence.hpp"

void solve(){
    string a,b;cin>>a>>b;
    auto res=LongestCommonSubsequence(a,b);
    // cout<<res<<endl;
    cout<<res.size()<<endl;
}

signed main(){
    int q;cin>>q;
    while(q--) solve();
    return 0;
}

#line 1 "test/AOJ_ALDS1_10_c.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C"

#line 1 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

#line 4 "test/AOJ_ALDS1_10_c.test.cpp"

#line 1 "DP/LongestCommonSubsequence.hpp"
template<typename S>
S LongestCommonSubsequence(S a,S b){
    int n=(int)a.size(),m=(int)b.size();
    vector<vector<int>> dp(n+1,vector<int>(m+1,0)),pre(n+1,vector<int>(m+1,-1));
    for(int i=0;i<=n;i++)for(int j=0;j<=m;j++){
        if(i<n and j<m and a[i]==b[j]){
            if(chmax(dp[i+1][j+1],dp[i][j]+1)) pre[i+1][j+1]=1;
        }
        if(i<n)if(chmax(dp[i+1][j],dp[i][j])) pre[i+1][j]=2;
        if(j<m)if(chmax(dp[i][j+1],dp[i][j])) pre[i][j+1]=3;
    }

    S ret;
    int i=n,j=m;
    while(i and j and pre[i][j]>0){
        if(pre[i][j]==1){
            i--,j--;
            ret.push_back(a[i]);
        }
        else if(pre[i][j]==2) i--;
        else if(pre[i][j]==3) j--;
    }

    reverse(begin(ret),end(ret));
    return ret;
}
#line 6 "test/AOJ_ALDS1_10_c.test.cpp"

void solve(){
    string a,b;cin>>a>>b;
    auto res=LongestCommonSubsequence(a,b);
    // cout<<res<<endl;
    cout<<res.size()<<endl;
}

signed main(){
    int q;cin>>q;
    while(q--) solve();
    return 0;
}