Submission #3943636

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

#define L 3003

string s, t;
int n, m;
int pp[L][L], qq[L][L], rr[L][L];
int memo[L][L];

int dfs(int i, int j) {
  if(i >= n || j >= m) return 0;
  if(memo[i][j] != -1) {
    return memo[i][j];
  }
  int r0 = dfs(i+1, j), r1 = dfs(i, j+1), r;
  int p0, q0, rr0 = 0;
  if(r0 < r1) {
    p0 = i; q0 = j+1; r = r1;
  } else {
    p0 = i+1; q0 = j; r = r0;
  }
  if(s[i] == t[j]) {
    int r2 = dfs(i+1, j+1) + 1;
    if(r < r2) {
      r = r2; rr0 = 1; p0 = i+1; q0 = j+1;
    }
  }
  pp[i][j] = p0; qq[i][j] = q0; rr[i][j] = rr0;
  return memo[i][j] = r;
}

int main() {
  cin >> s >> t;
  n = s.length(); m = t.length();
  rep(i, n+1) rep(j, m+1) memo[i][j] = -1;
  dfs(0, 0);
  int i = 0, j = 0;
  while(i < n && j < m) {
    int i0 = pp[i][j], j0 = qq[i][j];
    if(rr[i][j]) {
      printf("%c", s[i]);
    }
    i = i0; j = j0;
  }
  printf("\n");
  return 0;
}

Submission Info

Judge Result