Submission #1750526

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int p[100001];

int main () {
	int n;
	cin >> n;     
	string s, t;
	cin >> s >> t;      
	s = t + '#' + s;
	for (int i = 1;i < s.size ();i ++) {
		int j = p[i - 1];                                                                     
		while (j > 0 && s[i] != s[j]) {
			j = p[j - 1];
		}
		if (s[i] == s[j]) {
			j ++;
		}
		p[i] = j;
	}
	cout << 2 * n - p[s.size () - 1];
	return 0;
}

Submission Info

Judge Result