Light OJ 1261 – K-SAT Problem


/*
Link: http://www.lightoj.com/volume_showproblem.php?problem=1261
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

/* Bits operation */
int Set(int n,int pos)  { return n = n | 1<<pos;}
bool check(int n,int pos) { return n & 1<<pos;}
int Reset(int n, int pos) { return n=n & ~(1<<pos);}

int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    vector<int>v[32];
    bool ara[32];
    int t;
    getint(t);
    TEST_CASE(t)
    {
        ms(ara,0);
        int n,m,k,p,num;
        cin>>n>>m>>k;
        for(int i=1;i<=n;i++)
        {
            v[i].pb(0);
            for(int j=1;j<=k;j++)
            {
                cin>>num;
                v[i].pb(num);
            }
        }

        cin>>p;
        loop(i,p)
        {
            cin>>num;
            ara[num]=1;
        }

        bool test1=0,test2=0;
        for(int i=1;i<=n;i++)
        {
            test1=0;
            for(int j=1;j<=k;j++)
            {
                if(v[i][j]>0 && ara[v[i][j]])
                    test1=1;
                if(v[i][j]<0 && !ara[-v[i][j]])
                    test1=1;
            }
            if(test1==0)
                test2=1;
        }
        PRINT_CASE;
        if(test2)
            cout<<"No"<<endl;
        else
            cout<<"Yes"<<endl;
        loop(i,n+1)
            v[i].clear();
    }
    return 0;
}


Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s