This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
int pos = 0;
for (int i = 0; i < n; i++) {
if (s[i] == t[0]) {
pos = i;
break;
}
}
bool es = true;
for (int i = 1; i < m; i++) {
if (pos < n-1 && s[pos+1] == t[i]) pos++;
else if (pos > 0 && s[pos-1] == t[i]) pos--;
else {
es = false;
break;
}
}
if (es) cout << m << endl;
else cout << -1 << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |