think:
1邻接表(链表)
图的基本存储的基本方式二
Time Limit: 1000MS Memory Limit: 65536KB
Problem Description
解决图论问题,首先就要思考用什么样的方式存储图。但是小鑫却怎么也弄不明白如何存图才能有利于解决问题。你能帮他解决这个问题么?
Input
多组输入,到文件结尾。
每一组第一行有两个数n、m表示n个点,m条有向边。接下来有m行,每行两个数u、v代表u到v有一条有向边。第m+2行有一个数q代表询问次数,接下来q行每行有一个询问,输入两个数为a,b。
注意:点的编号为0~n-1,2<=n<=500000 ,0<=m<=500000,0<=q<=500000,a!=b,输入保证没有自环和重边
Output
对于每一条询问,输出一行。若a到b可以直接连通输出Yes,否则输出No。
Example Input
2 1
0 1
2
0 1
1 0
Example Output
Yes
No
Hint
Author
lin
以下为accepted代码
#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
int Data;
struct node *next;
} Adjv;
Adjv *a[500004];
int main()
{
int n, m, i, Q, u, v, flag;
Adjv *p;
while(scanf("%d %d", &n, &m) != EOF)
{
for(i = 0; i < n; i++)
a[i] = NULL;
for(i = 0; i < m; i++)
{
scanf("%d %d", &u, &v);
if(a[u] == NULL)
{
p = (Adjv *)malloc(sizeof(Adjv));
p->Data = v;
p->next = NULL;
a[u] = p;
}
else
{
p = (Adjv *)malloc(sizeof(Adjv));
p->Data = v;
p->next = a[u]->next;
a[u]->next = p;
}
}
scanf("%d", &Q);
while(Q--)
{
flag = 0;
scanf("%d %d", &u, &v);
p = a[u];
while(p != NULL)
{
if(p->Data == v)
{
flag = 1;
break;
}
p = p->next;
}
if(flag)
printf("Yes\n");
else
printf("No\n");
}
}
return 0;
}
/***************************************************
User name: jk160630
Result: Accepted
Take time: 56ms
Take Memory: 3904KB
Submit time: 2017-02-14 10:38:22
****************************************************/
以下为accepted建议参考代码
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct node
{
int Data;
struct node *next;
}*a[500000], *p;
int main()
{
int n, m, i, u, v, Q;
while(scanf("%d %d", &n, &m) != EOF)
{
for(i = 0; i < 500000; i++)
a[i] = NULL;
while(m--)
{
scanf("%d %d", &u, &v);
if(a[u] == NULL)
{
p = (struct node *)malloc(sizeof(struct node));
p->Data = v;
p->next = NULL;
a[u] = p;
}
else
{
p = (struct node *)malloc(sizeof(struct node));
p->Data = v;
p->next = a[u]->next;
a[u]->next = p;
}
}
scanf("%d", &Q);
while(Q--)
{
int flag = 0;
scanf("%d %d", &u, &v);
p = a[u];
while(p != NULL)
{
if(p->Data == v)
{
flag = 1;
break;
}
p = p->next;
}
if(flag)
printf("Yes\n");
else
printf("No\n");
}
}
return 0;
}
/***************************************************
User name: jk160630
Result: Accepted
Take time: 64ms
Take Memory: 3908KB
Submit time: 2017-02-14 20:05:10
****************************************************/