4945: [Noi2017]游戏

观察d的数据范围为8
然后考虑暴力枚举x的取值…
一开始我暴力令x = ‘a’ ,’b’,’c’则为3^n
但是发现其实因为最后每个位置只用一个取值，那么只要保证x能取’A’ ‘B’ ‘C’即可。
也就是x = ‘a’ ,’b’， 复杂度2^n
接下来容易发现是个2-sat问题…
建边以后跑tarjan，
然后根据belong 的大小来确定是选的第一个数还是第二个..

c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y ; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y ; -- i)
typedef long long ll;
using namespace std;
template<typename T>inline void read(T&x)
{
    x= 0;char c;int sign = 1;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x *10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 2e5+500,M = 1e6+50;
int n,m,d,p[10],ans[N];
int head[N],to[M],nxt[M],tot;
char s[N],u[2],v[2];
struct Edge { int u,v,a,b; }edge[N];

inline void add(int x,int y)
{
    nxt[tot] = head[x];
    to[tot] = y;
    head[x] = tot++;
}

int belong[N],dfn[N],low[N],sz,cnt;
int st[N],top;
bool inq[N];

void tarjan(int x)
{
    dfn[x] = low[x] = ++sz;
    inq[x] = 1;st[++top] = x;
    for(register int i = head[x];~i;i=nxt[i])
        if(!dfn[to[i]])
        {
            tarjan(to[i]);
            low[x] = min(low[to[i]],low[x]);
        }else if(inq[to[i]]) low[x] = min(low[x],dfn[to[i]]);
    if(low[x] == dfn[x])
    {
        belong[x] = ++cnt; inq[x] = 0;
        while(st[top] != x)
        {
            belong[st[top]] = cnt;
            inq[st[top--]] = 0;
        }
        top--;
    }
}

inline int color(int i,int x)
{
    if(s[i] == 0) return x == 1 ?0 : 1;
    if(s[i] == 1) return x == 0 ?0 : 1;
    if(s[i] == 2) return x == 0 ?0 : 1;
} 

char get(int pos)
{
    if(s[pos] == 0) return ans[pos] == 0 ? 'B' : 'C';
    if(s[pos] == 1) return ans[pos] == 0 ? 'A' : 'C';
    if(s[pos] == 2) return ans[pos] == 0 ? 'A' : 'B';
}

inline bool check()
{
    rep(i,1,n<<1) head[i] = -1;
    rep(i,1,n<<1) low[i] = dfn[i] = 0;
    sz = cnt = tot = 0;
    rep(i,1,m)
    {
        int p1 = edge[i].u,p2 = edge[i].v;
        if(edge[i].a == s[p1] || (p1 == p2 &&edge[i].a == edge[i].b)) continue;
        if(edge[i].b == s[p2]) add(p1 + color(p1,edge[i].a)*n,p1 + (color(p1,edge[i].a)^1)*n);
        else
        {
            add(p1 + color(p1,edge[i].a)*n,p2 + color(p2,edge[i].b) * n);
            add(p2 + (color(p2,edge[i].b)^1)*n,p1 + (color(p1,edge[i].a)^1)*n);
        }
    }

    rep(i,1,2*n) if(!dfn[i]) tarjan(i);
    rep(i,1,n) if(belong[i] == belong[i + n]) return false;
    rep(i,1,n) ans[i] = -1;
    rep(i,1,n)
        if(belong[i] < belong[i + n])
            ans[i] = 0;
        else ans[i] = 1;

    return true;
}

bool solve(int now)
{
    if(now == d + 1)
    {
        if(check()) return true;
        return false;
    }

    s[p[now]] = 0;
    if(solve(now + 1)) return true;
    s[p[now]] = 1;
    if(solve(now + 1)) return true;

    return false;
}

int main()
{
    read(n); read(d);d = 0;
    scanf("%s",s + 1);
    read(m);
    rep(i,1,m)
    {
        int a,b,p1,p2;
        read(p1); scanf("%s",u);
        read(p2); scanf("%s",v);
        a = u[0] - 'A';b = v[0] - 'A';
        edge[i].u = p1;edge[i].v = p2;
        edge[i].a = a; edge[i].b = b;
    }

    rep(i,1,n) if(s[i] == 'x') p[++d] = i;
    rep(i,1,n) s[i] -= 'a';
    if(!solve(1)) puts("-1");
    else rep(i,1,n) printf("%c",get(i));
    return 0;
}

注意上面这份代码并不能过uoj 100的数据…
uoj ac代码：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y ; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y ; -- i)
typedef long long ll;
using namespace std;
template<typename T>inline void read(T&x)
{
    x= 0;char c;int sign = 1;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x *10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 2e5+500,M = 1e6+50;
int n,m,d,p[10],ans[N];
int head[N],to[M],nxt[M],tot;
char s[N],u[2],v[2];
struct Edge { int u,v,a,b; }edge[N];

inline void add(int x,int y)
{
    nxt[tot] = head[x];
    to[tot] = y;
    head[x] = tot++;
}

int belong[N],dfn[N],low[N],sz,cnt;
int st[N],top;
bool inq[N];

void tarjan(int x)
{
    dfn[x] = low[x] = ++sz;
    inq[x] = 1;st[++top] = x;
    for(register int i = head[x];~i;i=nxt[i])
        if(!dfn[to[i]])
        {
            tarjan(to[i]);
            low[x] = min(low[to[i]],low[x]);
        }else if(inq[to[i]]) low[x] = min(low[x],dfn[to[i]]);
    if(low[x] == dfn[x])
    {
        belong[x] = ++cnt; inq[x] = 0;
        while(st[top] != x)
        {
            belong[st[top]] = cnt;
            inq[st[top--]] = 0;
        }
        top--;
    }
}

inline int color(int i,int x)
{
    if(s[i] == 0) return x == 1 ?0 : 1;
    if(s[i] == 1) return x == 0 ?0 : 1;
    if(s[i] == 2) return x == 0 ?0 : 1;
} 

char get(int pos)
{
    if(s[pos] == 0) return ans[pos] == 0 ? 'B' : 'C';
    if(s[pos] == 1) return ans[pos] == 0 ? 'A' : 'C';
    if(s[pos] == 2) return ans[pos] == 0 ? 'A' : 'B';
}

inline bool check()
{
    rep(i,1,n<<1) head[i] = -1;
    rep(i,1,n<<1) low[i] = dfn[i] = 0;
    sz = cnt = tot = 0;
    rep(i,1,m)
    {
        int p1 = edge[i].u,p2 = edge[i].v;
        if(edge[i].a == s[p1] || (p1 == p2 &&edge[i].a == edge[i].b)) continue;
        if(edge[i].b == s[p2]) add(p1 + color(p1,edge[i].a)*n,p1 + (color(p1,edge[i].a)^1)*n);
        else
        {
            add(p1 + color(p1,edge[i].a)*n,p2 + color(p2,edge[i].b) * n);
            add(p2 + (color(p2,edge[i].b)^1)*n,p1 + (color(p1,edge[i].a)^1)*n);
        }
    }

    rep(i,1,2*n) if(!dfn[i]) tarjan(i);
    rep(i,1,n) if(belong[i] == belong[i + n]) return false;
    rep(i,1,n) ans[i] = -1;
    rep(i,1,n)
        if(belong[i] < belong[i + n])
            ans[i] = 0;
        else ans[i] = 1;

    return true;
}

bool solve(int now)
{
    if(now == d + 1)
    {
        if(check()) return true;
        return false;
    }

    s[p[now]] = 0;
    if(solve(now + 1)) return true;
    if ( 1.0 * clock ( ) / CLOCKS_PER_SEC > 0.9 )  {
        puts ( "-1" ) ;
        exit ( 0 ) ;
    }
    s[p[now]] = 1;
    if(solve(now + 1)) return true;

    return false;
}

int main()
{
    read(n); read(d);d = 0;
    scanf("%s",s + 1);
    read(m);
    rep(i,1,m)
    {
        int a,b,p1,p2;
        read(p1); scanf("%s",u);
        read(p2); scanf("%s",v);
        a = u[0] - 'A';b = v[0] - 'A';
        edge[i].u = p1;edge[i].v = p2;
        edge[i].a = a; edge[i].b = b;
    }

    rep(i,1,n) if(s[i] == 'x') p[++d] = i;
    rep(i,1,n) s[i] -= 'a';
    if(!solve(1)) puts("-1");
    else rep(i,1,n) printf("%c",get(i));
    return 0;
}