史上最诡异代码（求优化）

#include <bits/stdc++.h>
using namespace std;

int n;
vector<char> a, b;

int main(void)  {
    cin >> n;

    for(int i = 1; i <= n; i++)   a.push_back('o');
    for(int i = 1; i <= n; i++)   a.push_back('*');
//    for(auto& v : a)   cout << v;   cout << '-' << '-';
    int u = n-1, v = 2*n-1;
//    for(int i = 0; i <= u; i++) cout << a[i]; cout << '-' << '-';
    int temp = 0;
    while(true) {

        if(temp != 0)  { 
            for(int i = 0; i <= u; i++) cout << a[i];   
            cout << '-' << '-';
            for(int i = u+1; i <= v; i++)   cout << a[i];   
            for(auto& k : b)    cout << k;  cout << endl;
        }

        for(auto& k : a) cout << k;   cout << '-' << '-';
        for(auto& k : b)    cout << k;  cout << endl;        
        
        swap(a[u], a[v-1]);
        b.push_back(a[v-1]);    b.push_back(a[v]);
        a.pop_back();    a.pop_back();
        u -= 1; v -= 2;
        temp = 1;
        if(u == 2) break;
    }
    cout<<"ooo--***";
    for(int i=1;i<=n-3;i++)
    cout<<"o*";
    cout<<endl;
    cout<<"ooo*o**--*";
	for(int i=1;i<=n-4;i++)
	cout<<"o*";
	cout<<endl;
	cout<<"o--*o**o";
	for(int i=1;i<=n-3;i++)
	cout<<"o*";
	cout<<endl;
	cout<<"o*o*o*--";
	for(int i=1;i<=n-3;i++)
	cout<<"o*";
	cout<<endl;
	cout<<"--";
	for(int i=1;i<=n;i++)
	cout<<"o*";
    return 0;
}