Codeforces Round #501 (Div. 3), problem: (B) Obtaining the String

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define pli pair<long long int,int>
#define pbi pair<bool,int>
#define pob pop_back
#define all(a) a.begin(),a.end()
#define fio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define i64 long long int
#define mem(x,y) memset(x,y,sizeof(x))
#define fill(arr,b) fill(arr, arr+sizeof(arr)/sizeof(arr[0]), b)
#define maxarr(n,arr,m) m =-1e9;for(int i=0;i<n;i++)if(arr[i]>m) m=arr[i];
#define read freopen("input.txt","r",stdin);

const double pi = acos(-1.0);
const int maxn = (i64)2e9+5;

int scnt[27];
int tcnt[27];
int main()
{
    //read;
    int n;
    cin >> n;
    string s,t;
    cin >> s >> t;
    for(int i = 0 ; i<n ; i++)
    {
        scnt[s[i]-97]++;
        tcnt[t[i]-97]++;
    }
    bool fg = true;
    for(int i = 0 ; i<26 ; i++)
    {
        if(scnt[i]!=tcnt[i]) {fg=false;break;}
    }
    if(!fg) {cout << "-1";return 0;}
    int cnt=0;
    vector<int>v;
    for(int i = 0 ; i<n-1 ;)
    {
        if(s[i]==t[i]) i++;
        else
        {
            for(int j = i ; j<n-1 ; j++)
            {
                if(t[i] == s[j+1])
                {
                    cnt++;
                    v.pb(j+1);
                    swap(s[j],s[j+1]);
                    break;
                }
            }
        }
    }
    cout << cnt << endl;
    for(int i = 0 ; i<v.size() ; i++) cout << v[i] << " ";


return 0;
}