B. Circus

 http://codeforces.com/contest/1138/problem/B

题意：将两个1  0串均分两组，一组的c等于另一组的a(1的数量)，1  1可以作为c也可以作为a；问怎么分组；

思路：枚举一组的0  1，1  0数目；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
//const int maxn=1e5+9;
const int mod=9973;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}


const int maxn=5005;
struct node{
    int num1,num2;
}man[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        string a,b;
        cin>>a>>b;
        int len1=a.size();
        int len2=b.size();
        for(int i=0;i<len1;i++)
        {
            if(a[i]=='0')
                man[i+1].num1=0;
            else man[i+1].num1=1;
        }
        for(int i=0;i<len2;i++)
        {
            if(b[i]=='0')
                man[i+1].num2=0;
            else man[i+1].num2=1;
        }
        int sum1=0,sum2=0,sum3=0,sum4=0;
        for(int i=1;i<=n;i++)
        {
            if(man[i].num1&&man[i].num2)
                sum3++;
            else if(man[i].num1&&!man[i].num2)
                sum1++;
            else if(!man[i].num1&&man[i].num2)
                sum2++;
            else sum4++;
        }
        bool f=false;
        int n00=0,n10=0,n01=0,n11=0;
        for(int i=0;i<=sum1;i++)
        {
            for(int j=0;j<=sum2;j++)
            {
                if(i+j>n/2) continue;
                n10=i;
                n01=j;
                n11=0,n00=0;

                n11=(sum2-j+sum3-i)/2;//看图片
                n00=n/2-n11-n10-n01;

                if(n11<0||n11>sum3||n00<0||n00>sum4) continue;
                if(n11+n00+n10+n01!=n/2) continue;
                if((n11+n10)==(sum2-j+sum3-n11))//判断c与a，没写wa死我
                {
                    f=1;
                    break;
                }



            }
            if(f) break;
        }
        //cout<<n00<<" "<<n10<<" "<<n01<<" "<<n11<<endl;
        if(!f)
            printf("-1\n");
        else {
            for(int i=1;i<=n;i++)
            {
                if(man[i].num1&&man[i].num2&&n11)
                    printf("%d ",i),n11--;
                else if(man[i].num1&&!man[i].num2&&n10)
                   printf("%d ",i),n10--;
                else if(!man[i].num1&&man[i].num2&&n01)
                    printf("%d ",i),n01--;
                else if(!man[i].num1&&!man[i].num2&&n00)
                    printf("%d ",i),n00--;
            }
            puts("");
        }
    }
}