Edit distance

#include <iostream>
#include <deque>
#include <algorithm>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef std::string str;

using namespace std;

int table[5001][5001];

ll calcDistance(str a, str b, int n, int m) {
  int incN = n+1, incM = m+1;
  if (table[incN][incM] != -1) {
    return table[incN][incM];
  }
  if (n==-1) {
    table[incN][incM] = incM;
    return incM;
  }
  if (m==-1) {
    table[incN][incM] = incN;
    return incN;
  }
  table[incN][incM] = min(calcDistance(a, b, n-1, m) + 1,
      min(calcDistance(a, b, n, m-1) + 1,
      calcDistance(a, b, n-1, m-1) + (int)(a[n] != b[m])));
  return table[incN][incM];
}

int main() {
    for(int i=0; i<5001; i++) {
      for(int j=0; j<5001; j++) {
        table[i][j] = -1;
      }
    }
    str a, b;
    cin >> a >> b;
    ll res = calcDistance(a, b, a.size()-1, b.size()-1);
    cout << res << endl;
}

Test 1

Verdict: UNKNOWN

Test 2

Verdict: UNKNOWN

Test 3

Verdict: UNKNOWN

Test 4

Verdict: UNKNOWN

Test 5

Verdict: UNKNOWN

Test 6

Verdict: UNKNOWN

Test 7

Verdict: UNKNOWN

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN

Test 10

Verdict: UNKNOWN

Test 11

Verdict: UNKNOWN

Test 12

Verdict: UNKNOWN

Test 13

Verdict: UNKNOWN

Test 14

Verdict: UNKNOWN

Test 15

Verdict: UNKNOWN

Test 16

Verdict: UNKNOWN

Test 17

Verdict: UNKNOWN

Test 18

Verdict: UNKNOWN

Test 19

Verdict: UNKNOWN