| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1021928 | Almonther | Necklace (Subtask 1-3) (BOI19_necklace1) | C++98 | 66 ms | 436 KiB |
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>
#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
bool canconvert(string s,string t){
string check=s,check1=t;
if(s==t) return 1;
sort(check.begin(),check.end());
sort(check1.begin(),check1.end());
if(check!=check1) return 0;
for(int i=0;i<s.size();i++){
s.push_back(s[0]);
s.erase(s.begin());
if(s==t) return 1;
reverse(s.begin(),s.end());
if(s==t) return 1;
reverse(s.begin(),s.end());
}
return 0;
}
string s,t;
void solve(){
cin>>s>>t;
if(s.size()>t.size()) swap(s,t);
for(int k=s.size();k>0;k--){
for(int i=0;i<s.size();i++){
for(int j=0;j<t.size();j++){
if(canconvert(s.substr(i,k),t.substr(j,k))==1){
co k<<'\n'<<i<<' '<<j;
return;
}
}
}
}
}
int main()
{
suiii
int tt=1;
// cin>>tt;
while(tt--){
solve();
}
return 0;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
