SGU 161 Intuitionistic Logic（模拟）

题目链接：http://acm.sgu.ru/problem.php?contest=0&problem=161

题意：

 

思路：

（1）首先求出H集合；

（2）用H集合预处理出Im[i][j],And[i][j],Or[i][j];

（3）对于输出暴力替换每个字母，判断是否可行；判断可行部分就是一个表达式求值，只不过此处的运算法不同。

#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <ctype.h>


#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)<(y)?(x):(y))
#define abs(x) ((x)>=0?(x):-(x))
#define i64 long long
#define u32 unsigned int
#define u64 unsigned long long
#define clr(x,y) memset(x,y,sizeof(x))
#define CLR(x) x.clear()
#define ph(x) push(x)
#define pb(x) push_back(x)
#define Len(x) x.length()
#define SZ(x) x.size()
#define PI acos(-1.0)
#define sqr(x) ((x)*(x))

#define FOR0(i,x) for(i=0;i<x;i++)
#define FOR1(i,x) for(i=1;i<=x;i++)
#define FOR(i,a,b) for(i=a;i<=b;i++)
#define DOW0(i,x) for(i=x;i>=0;i--)
#define DOW1(i,x) for(i=x;i>=1;i--)
#define DOW(i,a,b) for(i=a;i>=b;i--)
using namespace std;


void RD(int &x){scanf("%d",&x);}
void RD(i64 &x){scanf("%I64d",&x);}
void RD(u32 &x){scanf("%u",&x);}
void RD(double &x){scanf("%lf",&x);}
void RD(int &x,int &y){scanf("%d%d",&x,&y);}
void RD(i64 &x,i64 &y){scanf("%I64d%I64d",&x,&y);}
void RD(u32 &x,u32 &y){scanf("%u%u",&x,&y);}
void RD(double &x,double &y){scanf("%lf%lf",&x,&y);}
void RD(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void RD(i64 &x,i64 &y,i64 &z){scanf("%I64d%I64d%I64d",&x,&y,&z);}
void RD(u32 &x,u32 &y,u32 &z){scanf("%u%u%u",&x,&y,&z);}
void RD(double &x,double &y,double &z){scanf("%lf%lf%lf",&x,&y,&z);}
void RD(char &x){x=getchar();}
void RD(char *s){scanf("%s",s);}
void RD(string &s){cin>>s;}

void PR(int x) {printf("%d\n",x);}
void PR(i64 x) {printf("%I64d\n",x);}
void PR(u32 x) {printf("%u\n",x);}
void PR(double x) {printf("%.4lf\n",x);}
void PR(char x) {printf("%c\n",x);}
void PR(char *x) {printf("%s\n",x);}
void PR(string x) {cout<<x<<endl;}

const int N=105;
int n,g[N][N];

class H
{
public:
    bool v[N];

    H(){}
    H(int x)
    {
        clr(v,x);
    }

    bool operator==(H a)
    {
        int i;
        FOR0(i,n) if(v[i]!=a.v[i]) return 0;
        return 1;
    }
};

H Max(H a)
{
    int i,j;
    FOR0(i,n) if(a.v[i]) FOR0(j,n)
    {
        if(a.v[j]&&i!=j&&g[i][j])
        {
            a.v[i]=0;
            break;
        }
    }
    return a;
}

H impli(H a,H b)
{
    int i,j;
    FOR0(i,n) if(b.v[i]) FOR0(j,n)
    {
        if(a.v[j]&&g[i][j])
        {
            b.v[i]=0;
            break;
        }
    }
    return b;
}

H con(H a,H b)
{
    int i;
    FOR0(i,n) if(b.v[i]) a.v[i]=1;
    return Max(a);
}

H dis(H a,H b)
{
    int i,j;
    H c(0);
    FOR0(i,n)
    {
        FOR0(j,n) if(a.v[j]&&g[i][j]) break;
        if(j==n) continue;
        FOR0(j,n) if(b.v[j]&&g[i][j]) break;
        if(j==n) continue;

        c.v[i]=1;
    }
    return Max(c);
}

H h[N];
int hNum,And[N][N],Or[N][N],Im[N][N];
int m;

void floyd()
{
    int i,j,k;
    FOR0(i,n) FOR0(j,n) FOR0(k,n)
    {
        if(g[j][i]&&g[i][k]) g[j][k]=1;
    }
    FOR0(i,n) g[i][i]=1;
}

H temp;

void DFS(int x)
{
    if(x==n)
    {
        h[hNum++]=temp;
        return;
    }
    DFS(x+1);
    int i;
    FOR0(i,x) if(temp.v[i]&&(g[x][i]||g[i][x])) return;
    temp.v[i]=1;
    DFS(x+1);
    temp.v[i]=0;
}

void init()
{
    hNum=0;
    clr(temp.v,0);
    DFS(0);
    swap(h[1],*find(h+1,h+hNum,Max(H(1))));
    int i,j;
    FOR0(i,hNum) FOR0(j,hNum)
    {
        Im[i][j]=find(h,h+hNum,impli(h[i],h[j]))-h;
        And[i][j]=find(h,h+hNum,con(h[i],h[j]))-h;
        Or[i][j]=find(h,h+hNum,dis(h[i],h[j]))-h;
    }
}

//0:~ 1:& 2:| 3:> 4:= 5:(
bool Q[6][6]={
    {0,0,0,0,0,0},
    {1,1,0,0,0,0},
    {1,1,1,0,0,0},
    {1,1,1,0,0,0},
    {1,1,1,1,0,0},
    {0,0,0,0,0,0}};
int stOp[N<<2],opTop;
int stNum[N<<2],numTop;
int a[26];
char str[N<<2];

int get(char x)
{
    if(x=='~') return 0;
    if(x=='&') return 1;
    if(x=='|') return 2;
    if(x=='>') return 3;
    if(x=='=') return 4;
    return 5;
}

void pop()
{
    int i,j,k,x,y,t=stOp[opTop];
    if(t==0)
    {
        opTop--;
        stNum[numTop]=Im[stNum[numTop]][1];
    }
    else if(t==1)
    {
        opTop--;
        numTop--;
        stNum[numTop]=And[stNum[numTop]][stNum[numTop+1]];
    }
    else if(t==2)
    {
        opTop--;
        numTop--;
        stNum[numTop]=Or[stNum[numTop]][stNum[numTop+1]];
    }
    else if(t==3)
    {
        opTop--;
        numTop--;
        stNum[numTop]=Im[stNum[numTop]][stNum[numTop+1]];
    }
    else if(t==4)
    {
        for(i=1;stOp[opTop-i]==4;i++);
        opTop-=i;
        j=numTop-i;
        x=Im[stNum[j]][stNum[j+1]];
        y=Im[stNum[j+1]][stNum[j]];
        k=And[x][y];
        j++;
        while(j<numTop)
        {
            x=Im[stNum[j]][stNum[j+1]];
            y=Im[stNum[j+1]][stNum[j]];
            k=And[k][And[x][y]];
            j++;
        }
        numTop-=i;
        stNum[numTop]=k;
    }
}

int ok()
{
    opTop=numTop=0;
    int i,j;
    for(i=0;str[i];i++)
    {
        if(str[i]==' ') continue;
        if(isupper(str[i])) stNum[++numTop]=a[str[i]-'A'];
        else if(isdigit(str[i])) stNum[++numTop]=!(str[i]-'0');
        else if(str[i]==')')
        {
            while(stOp[opTop]!=5) pop();
            opTop--;
        }
        else
        {
            j=get(str[i]);
            while(opTop&&Q[j][stOp[opTop]]) pop();
            stOp[++opTop]=j;
        }
    }
    while(opTop) pop();
    return !stNum[1];
}

int DFS1(int x)
{
    while(x<26&&a[x]==-1) x++;
    if(x==26) return ok();
    while(a[x]<hNum)
    {
        if(!DFS1(x+1)) return 0;
        a[x]++;
    }
    a[x]=0;
    return 1;
}

int main()
{
    RD(n,m);
    int i,u,v;
    FOR0(i,m)
    {
        RD(u,v);
        u--;
        v--;
        g[u][v]=1;
    }
    floyd();
    init();
    scanf("%d\n",&m);
    while(m--)
    {
        gets(str);
        clr(a,-1);
        for(i=0;str[i];i++)
        {
            if(isupper(str[i])) a[str[i]-'A']=0;
            else if(str[i]=='>') str[i-1]=' ';
        }
        if(DFS1(0)) puts("valid");
        else puts("invalid");
    }
    return 0;
}