Submission #915360

#TimeUsernameProblemLanguageResultExecution timeMemory
915360vjudge1Bajka (COCI20_bajka)C++17
0 / 70
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define int ll #define ii pair<int,int> #define F first #define S second #define endl '\n' const int N = 105; char a[N][N]; signed main(){ int n, m; cin >> n >> m; string fear, fav; cin >> fear >> fav; int pos = -1; for(int i=0; i<n; ++i){ if(fear[i] == fav[0]){ pos = i; break; } } if(pos == -1){ cout << -1; return 0; } int ans = 0; for(int i=1; i<m; ++i){ char want = fav[i]; if(pos > 0 && fear[pos-1] == want){ pos--; i++; continue; } if(pos+1 < n && fear[pos+1] == want){ pos++; i++; continue; } cout << -1; return 0; } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...