competitive-programming/solved-lightOj/1110-2.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long llu;

#define ft           first
#define sd           second
#define mp           make_pair
#define pb(x)        push_back(x)
#define all(x)       x.begin(), x.end()
#define allr(x)      x.rbegin(), x.rend()
#define mem(a, b)    memset(a, b, sizeof(a))
#define repv(i, a)   for (i = 0; i < (ll)a.size(); i++)
#define revv(i, a)   for (i = (ll)a.size() - 1; i >= 0; i--)
#define rep(i, a, b) for (i = a; i <= b; i++)
#define rev(i, a, b) for (i = a; i >= b; i--)
#define sf(a)        scanf("%lld", &a)
#define sf2(a, b)    scanf("%lld %lld", &a, &b)
#define sf3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define inf          1e9
#define eps          1e-9
#define mod          1000000007
#define NN           101

// clang-format off
#ifdef  redback
#define bug printf("line=%d\n",__LINE__);
#define debug(args...) {cout<<":: "; dbg,args; cerr<<endl;}
struct  debugger{template<typename T>debugger& operator ,(const T& v){cerr<<v<<" ";return *this;}}dbg;
#else
#define bug
#define debug(args...)
#endif  //debugging macros
// clang-format on

ll dp[NN][NN];
string s[NN][NN];

char a[NN], b[NN];

int main() {
// ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef redback
    freopen("C:\\Users\\Maruf\\Desktop\\in.txt", "r", stdin);
#endif

    ll t = 1, tc;
    sf(tc);
    ll l, m, n;
    while (tc--) {
        ll i, j, k;

        scanf("%s", a + 1);
        scanf("%s", b + 1);

        n = strlen(a + 1);
        m = strlen(b + 1);

        for (i = 0; i <= n; i++) dp[i][0] = 0, s[i][0] = "";
        for (i = 0; i <= m; i++) dp[0][i] = 0, s[0][i] = "";

        for (i = 1; i <= n; i++) {
            for (j = 1; j <= m; j++) {
                if (a[i] == b[j])
                    dp[i][j] = dp[i - 1][j - 1] + 1, s[i][j] = s[i - 1][j - 1] + a[i];
                else if (dp[i - 1][j] < dp[i][j - 1])
                    dp[i][j] = dp[i][j - 1], s[i][j] = s[i][j - 1];
                else if (dp[i - 1][j] > dp[i][j - 1])
                    dp[i][j] = dp[i - 1][j], s[i][j] = s[i - 1][j];
                else if (dp[i - 1][j] == dp[i][j - 1])
                    dp[i][j] = dp[i - 1][j], s[i][j] = min(s[i][j - 1], s[i - 1][j]);
            }
        }

        if (dp[n][m] == 0)
            printf("Case %lld: :(\n", t++);
        else
            printf("Case %lld: %s\n", t++, s[n][m].c_str());
    }
    return 0;
}

/*

        for(int i = 1 ; i <= n ; i++)
            for(int j = 1 ; j <= m ; j++)
            {
                if(a[i] == b[j])                        s[i][j] = s[i-1][j-1] + a[i];
                else if(sz(s[i-1][j]) > sz(s[i][j-1]))  s[i][j] = s[i-1][j];
                else if(sz(s[i-1][j]) < sz(s[i][j-1]))  s[i][j] = s[i][j-1];
                else                                    s[i][j] = min(s[i-1][j],s[i][j-1]);
            }

*/