Pet
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 303 Accepted Submission(s): 117
Problem Description
One day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamster. He put the cheese trap in his room and waited for three days. Nothing but cockroaches was caught. He got the map of the school and foundthat there is no cyclic path and every location in the school can be reached from his room. The trap’s manual mention that the pet will always come back if it still in somewhere nearer than distance D. Your task is to help Lin Ji to find out how many possible locations the hamster may found given the map of the school. Assume that the hamster is still hiding in somewhere in the school and distance between each adjacent locations is always one distance unit.
Input
The input contains multiple test cases. Thefirst line is a positive integer T (0<T<=10), the number of test cases. For each test cases, the first line has two positive integer N (0<N<=100000) and D(0<D<N), separated by a single space. N is the number of locations in the school and D is the affective distance of the trap. The following N-1lines descripts the map, each has two integer x and y(0<=x,y<N), separated by a single space, meaning that x and y is adjacent in the map. Lin Ji’s room is always at location 0.
Output
For each test case, outputin a single line the number of possible locations in the school the hamster may be found.
Sample Input
1 10 2 0 1 0 2 0 3 1 4 1 5 2 6 3 7 4 8 6 9
Sample Output
2
Source
2013 ACM/ICPC Asia Regional Online —— Warmup
思路:本题比较好写,建图,每条connection 的边权值为1,求零0为源的最短路,若其他点到0的距离超过D,则计数加一;
我用了spfa求的,当然dijkstra也行,因为没有负边,也没有负环,其实本题的图也很简单--就是一棵树。注意:我spfa用了栈,一般用队列
思路:本题比较好写,建图,每条connection 的边权值为1,求零0为源的最短路,若其他点到0的距离超过D,则计数加一;
我用了spfa求的,当然dijkstra也行,因为没有负边,也没有负环,其实本题的图也很简单--就是一棵树。注意:我spfa用了栈,一般用队列
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
using namespace std;
const int maxn=100000+5;
const int maxe=400010;
const int inf=10000000;
struct NodeEdges
{
int to;
int next;
int w;
};
NodeEdges edges[maxe];
int head[maxn],visit[maxn],dist[maxn];
int nEdges,n,d;
void AddEdges(int u,int v,int w)
{
nEdges++;
edges[nEdges].to=v;
edges[nEdges].w=w;
edges[nEdges].next=head[u];
head[u]=nEdges;
}
bool spfa(int s)
{
int outque[maxn];
stack<int>q;
memset(dist,0,sizeof(dist));
memset(visit,0,sizeof(visit));
memset(outque,0,sizeof(outque));
for(int i=0;i<n;i++) dist[i]=inf;
dist[s]=0;
q.push(s);
visit[s]=1;
while(!q.empty())
{
int top=q.top();
q.pop();
visit[top]=false;
outque[top]++;
if(outque[top]>n) return false;
for(int k=head[top];k!=-1;k=edges[k].next)
{
if(dist[edges[k].to]>edges[k].w+dist[top])
{
dist[edges[k].to]=edges[k].w+dist[top];
if(!visit[edges[k].to])
{
visit[edges[k].to]=1;
q.push(edges[k].to);
}
}
}
}
return true;
}
int main()
{
//freopen("in.txt","r",stdin);
int T;
scanf("%d",&T);
while(T--)
{
memset(edges,0,sizeof(edges));
memset(head,-1,sizeof(head));
nEdges=0;
scanf("%d%d",&n,&d);
for(int i=1;i<n;i++)
{
int u,v;
scanf("%d%d",&u,&v);
AddEdges(u,v,1);
AddEdges(v,u,1);
}
spfa(0);
int ans=0;
for(int i=0;i<n;i++)
{
if(dist[i]>d) ans++;
}
printf("%d\n",ans);
}
return 0;
}