SDUT 3467 图的基本存储的基本方式四

点击打开题目链接

duang duang duang,题意看错,一直交,一直wa, 悲哀!

#include <iostream>
#include <cstdio>
using namespace std;

struct node
{
    int data;
    node *next;
};

node *head[5020];

void creat(int n)
{
    for(int i = 0; i < n; i++)
    {
        head[i] = new node;
        head[i] -> next = NULL;
    }
}

int main()
{
    int n, m;
    while(~scanf("%d", &n))
    {
        creat(n);
        for(int u = 0; u < n; u++)
        {
            for(int v = 0; v < n; v++)
            {
                int tmp;
                scanf("%d", &tmp);
                if(tmp)
                {
                    node *p = new node;
                    p -> data = v;
                    p -> next = head[u] -> next;
                    head[u] -> next = p;
                }
            }
        }
        scanf("%d", &m);
        while(m --)
        {
            int flag = 0, u, v;
            scanf("%d %d", &u, &v);
            node *p = head[u] -> next;
            while(p)
            {
                if(p -> data == v)
                {
                    flag = 1;
                    break;
                }
                p = p -> next;
            }
            (flag) ? printf("Yes\n") : printf("No\n");
        }
        for(int i = 0; i < n; i++)
        {
         delete(head[i]);
        }

    }
    return 0;
}