PATA1122题解

最新推荐文章于 2022-03-17 20:06:18 发布

原创最新推荐文章于 2022-03-17 20:06:18 发布 · 255 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT

PAT 专栏收录该内容

131 篇文章

订阅专栏

//
//  main.cpp
//  PATA1122
//
//  Created by Phoenix on 2018/2/24.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
const int maxn = 210;
int G[maxn][maxn] = {0};


int main(int argc, const char * argv[]) {
    int n, m;
    scanf("%d %d", &n, &m);
    for(int i = 0; i < m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        G[a][b] = G[b][a] = 1;
    }
    scanf("%d", &m);
    for(int i = 0; i < m; i++) {
        int k, a, b, st;
        int flag[maxn] = {0};
        bool tag = true;
        scanf("%d %d", &k, &a);
        st = a;
        if(k != n + 1) tag = false;
        for(int j = 1; j < k; j++) {
            scanf("%d", &b);
            flag[b] = 1;
            if(G[a][b] != 1) tag = false;
            a = b;
        }
        if(st != a) tag = false;
        for(int j = 1; j <= n; j++) {
            if(flag[j] == 0) tag = false;
            //printf("%d ", flag[j]);
        }
        if(tag == true) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}