1154 Vertex Coloring (25 分)

#include
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair
#define piii pair
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=1e4+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m,x,y;
vector g[maxn];
map mp;
int c[maxn],k;
int main(){
    cin>>n>>m;
    rep(i,0,m){
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    cin>>k;
    rep(i,0,k){
        mp.clear();
        int flag=0;
        rep(j,0,n) {
            cin>>c[j];
            mp[c[j]]++;
        }
        rep(j,0,n) rep(p,0,g[j].size()){
            if(c[j]==c[g[j][p]]) flag=1;
        }
        if(flag) cout<<"No";
        else cout<