Submission #1006111

#TimeUsernameProblemLanguageResultExecution timeMemory
1006111AverageAmogusEnjoyerNecklace (Subtask 1-3) (BOI19_necklace1)C++17
0 / 85
51 ms348 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #include <bits/stdc++.h> using namespace std; using ll = long long; template<class T> bool cmin(T &i, T j) { return i > j ? i=j,true:false; } template<class T> bool cmax(T &i, T j) { return i < j ? i=j,true:false; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int main() { string s,t; cin >> s >> t; int n = (int)t.size(); int ans = 0; auto search = [&]() { for (int i=0;i<n;i++) { for (int j=i;j<n;j++) { for (int k=i;k>=0;k--) { string r = s.substr(i,j-i+1); string f = s.substr(k,i-k); r += f; if (t.find(r) != string::npos) { cmax(ans,(int)r.size()); } } } } }; search(); reverse(t.begin(),t.end()); search(); cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...