提出 8b506eae-d3ab-4299-a1f4-b81fcf7af6fd

コード

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
#include<atcoder/all>

using namespace std;
using namespace atcoder;

//https://qiita.com/ageprocpp/items/7bda728d109c953ece3c
//# pragma GCC target("avx2")
//# pragma GCC optimize("O3")
//# pragma GCC optimize("unroll-loops")

#define rep(i,n) for(long long i = 0; i < (n); i++)
#define REP(i,a,n) for(long long i = (a); i< (n); i++)
#define rrep(i,n) for(long long i = (n-1);i>=0; i--)//n-1から0のループ
#define RREP(i,a,n) for(long long i = (a-1);i>=(n); i--)
#define repp(i,n) for(long long i= n;i>=0;i--)
#define REPP(i,a,n) for(long long i = a;i>=n;i--)
#define fore(x,a) for(auto (x):(a))
#define FORE(x,a) for(auto& (x):(a))
#define dwhile(a) while(!(a))//わかりやすいだけ
#define all(x) x.begin(), x.end()
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yn(b) if(b){Yes;}else{No;}
#define YN(b) if(b){YES;}else{NO;}
#define rsort(i) sort(i);reverse(i)
#define UNIQUE(n) n.erase(unique(all(n)),n.end())

//https://qiita.com/hibit/items/8ca9a58ccd23014f3a54#%E5%85%A8%E9%83%A8%E3%81%BE%E3%81%A8%E3%82%81%E3%81%A6
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p)
{
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << "i = " << i << endl;
        os << v[i];
    }
    return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <class T, class Container, class Compare>
ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}
//入力
template<typename... T>
void vin(T&... args){
  ((cin>>args),...);
  return;
}template<typename T,typename... U>
void vvin(vector<T>& hd,vector<U>&... args){
  rep(i,(long long int)hd.size()){
    cin >> hd[i];
    ((cin>>args[i]),...);
  }return;
}

//vector
template<typename T>
T vmax(vector<T>& n){
  T mx=n[0];
  rep(i,n.size()){
    if(mx<n[i]){
      mx=n[i];
    }
  }return mx;
}template<typename T>
T vmin(vector<T>& n){
  T mn=n[0];
  rep(i,n.size()){
    if(mn>n[i]){
      mn=n[i];
    }
  }return mn;
}
using ll = long long;
using pll = pair<ll,ll>;
using vpl = vector<pair<ll,ll>>;
template<typename T> using v = vector<T>;
template<typename T> using vv = v<v<T>>;
template<typename T> using vvv = v<vv<T>>;
using vl = v<ll>;
using vvl = vv<ll>;
using vvvl = vvv<ll>;
using vs = v<string>;
using vvs = vv<string>;
using vvvs = vvv<string>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using pq_g = priority_queue<T,vector<T>,greater<ll>>;
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const v<ll> dx={1,0,-1,0};
const v<ll> dy={0,1,0,-1};
const ll INF = 2e18;
const double pi = 3.1415926535897932384626;

template<typename T,typename U,typename V>ll tousa_sum(T a,U b,V c){//初項,交差,項数
  return (b*(c-1)+a*2)*c/2;
}template<typename T>vector<T> get_rank(vector<T> A){
  ll r=0;
  map<ll,ll> taiou;
  sort(all(A));
  rep(i,A.size()){
    r++;
    if(i>0&&A[i]==A[i-1]){
      r--;
    }taiou[A[i]]=r;
  }rep(i,A.size()){
    A[i]=taiou[A[i]];
  }
  return A;
}
template<typename T,typename U>
string to_baseN(T a,U N){
  if(N==0){
    return "0";
  }
  string ret="";
  while(N>0){
    ret+='0'+N%a;
    N/=a;
  }reverse(all(ret));
  return ret;
}template<typename T>
ll to_baseten(T a,string S){
  ll k=1,ret=0;
  reverse(all(S));
  rep(i,S.size()){
    ret+=k*(S[i]-'0');
    k*=a;
  }return ret;
}
template<typename T,typename U>
bool in(U a,T b, T c){//おそらく半開区間
  return a<=b&&b<c;
}template<typename T>
bool in_grid(T H,T W,T a,T b){
  return(in(0,a,H)&&in(0,b,W));
}void DFS(vvl& g,ll p,ll oya){
  /*行く(ついた)ときの処理*/
  for(ll x:g[p]){
    if(x==oya){
      continue;
    }
    DFS(g,x,p);
  }/*帰りの処理*/
}
void solve(){
  ll N;
  string S,T,str;
  cin >> N >> S >> T;
  set<string> St;
  set<string> Tt;
  set<string> ans;
  //Sのどこかを反転させたものとTのどこかを反転させたもので一致するものがあればOK
  rep(i,N){
    REP(j,i+1,N){
      str=S.substr(i,j-i);
      reverse(all(str));
      St.insert(S.substr(0,i)+str+S.substr(j));
    }
  }rep(i,N){
    REP(j,i+1,N){
      str=T.substr(i,j-i);
      reverse(all(str));
      Tt.insert(T.substr(0,i)+str+T.substr(j));
    }
  }set_intersection(all(St),all(Tt),inserter(ans,ans.end()));
  yn(ans.size()>0);
  return;
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  ll T=1;
  //cin >> T;
  rep(i,T) solve();
}

結果

問題	点数	言語	結果	実行時間	メモリ
S. Association	0	C++ (gcc)	RE	64 ms	8448 KiB

テストセット

テストセット	結果	実行時間	メモリ
testcase1	WA × 2 RE × 18	15 ms	8448 KiB
testcase2	WA × 1 RE × 11	16 ms	8320 KiB
testcase3	WA × 2 RE × 33	64 ms	8448 KiB

詳細結果

テストケース	結果	実行時間	メモリ
sub1sub2sub3_hand_01.txt	WA	14 ms	8064 KiB
sub1sub2sub3_hand_02.txt	RE	14 ms	8192 KiB
sub1sub2sub3_hand_03.txt	RE	15 ms	8064 KiB
sub1sub2sub3_random_01.txt	RE	14 ms	8064 KiB
sub1sub2sub3_random_02.txt	RE	15 ms	8320 KiB
sub1sub2sub3_random_03.txt	RE	14 ms	8320 KiB
sub1sub3_corner_01.txt	WA	15 ms	7936 KiB
sub1sub3_corner_02.txt	RE	13 ms	8192 KiB
sub1sub3_corner_03.txt	RE	13 ms	8064 KiB
sub1sub3_corner_04.txt	RE	13 ms	8320 KiB
sub1sub3_corner_05.txt	RE	15 ms	8192 KiB
sub1sub3_corner_06.txt	RE	14 ms	8192 KiB
sub1sub3_corner_07.txt	RE	15 ms	8064 KiB
sub1sub3_example_01.txt	RE	14 ms	8192 KiB
sub1sub3_example_02.txt	RE	15 ms	8192 KiB
sub1sub3_hand_04.txt	RE	13 ms	8448 KiB
sub1sub3_hand_05.txt	RE	13 ms	8064 KiB
sub1sub3_random_04.txt	RE	14 ms	8064 KiB
sub1sub3_random_05.txt	RE	14 ms	8064 KiB
sub1sub3_random_06.txt	RE	15 ms	8192 KiB
sub2sub3_max_01.txt	RE	14 ms	8192 KiB
sub2sub3_max_02.txt	RE	16 ms	8064 KiB
sub2sub3_max_03.txt	RE	14 ms	8192 KiB
sub2sub3_random_07.txt	RE	15 ms	8192 KiB
sub2sub3_random_08.txt	RE	14 ms	8064 KiB
sub2sub3_random_09.txt	RE	15 ms	8064 KiB
sub3_corner_08.txt	RE	14 ms	8448 KiB
sub3_corner_09.txt	RE	15 ms	7808 KiB
sub3_corner_10.txt	RE	14 ms	8064 KiB
sub3_max_04.txt	RE	60 ms	8064 KiB
sub3_max_05.txt	RE	64 ms	8192 KiB
sub3_max_06.txt	RE	14 ms	8192 KiB
sub3_random_10.txt	RE	14 ms	7936 KiB
sub3_random_11.txt	RE	15 ms	7936 KiB
sub3_random_12.txt	RE	15 ms	8192 KiB