fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a, b;
  31.  
  32. int consistency(int m, int n){
  33.  
  34. int ans = INF;
  35. unordered_set<string> st;
  36.  
  37. for(int i=0; i<m; i++){
  38. for(int j=i; j<m; j++){
  39. string s = a.substr(i, j-i+1);
  40. st.insert(s);
  41. }
  42. }
  43.  
  44. for(int i=0; i<n; i++){
  45. for(int j=i; j<n; j++){
  46. string s = b.substr(i, j-i+1);
  47.  
  48. if(st.count(s)){
  49. int sz = s.size();
  50. int len = m+n-2*sz;
  51. ans = min(ans, len);
  52. }
  53. }
  54. }
  55.  
  56. if(ans == INF) return m+n;
  57. return ans;
  58.  
  59. }
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78. void solve() {
  79.  
  80. int m, n;
  81.  
  82. cin >> a >> b
  83. ;
  84. m = a.size();
  85. n = b.size();
  86.  
  87. cout << consistency(m, n) << endl;
  88.  
  89.  
  90. }
  91.  
  92.  
  93.  
  94.  
  95.  
  96. int32_t main() {
  97. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  98.  
  99. int t = 1;
  100. cin >> t;
  101. while (t--) {
  102. solve();
  103. }
  104.  
  105. return 0;
  106. }
Success #stdin #stdout 0s 5316KB
stdin
6
a
a
abcd
bc
hello
codeforces
hello
helo
dhjakjsnasjhfksafasd
adjsnasjhfksvdafdser
c
a
stdout
0
2
13
3
20
2