Joeferyの博客

B. Bakerytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMasha wants to open her own bakery and bake muffi

题目链接前向星写法#include#include#include#include#include#include#includeusing namespace std;#define V 1000struct node { int v; int next;};node edge[V*4];int head[V],deg[V];int cnt;

题目链接前向星拓普排序。#include#include#include#include#include#include#includeusing namespace std;#define V 1000//前向星结构体struct node { int v; //记录队伍编号 int next;};node edge[V*4];int h

DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, i

1982. Electrification PlanTime limit: 0.5 secondMemory limit: 64 MBSome country has n cities. The government has decided to electrify all these cities. At first, power stations in k diff

Is It A Tree?Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19844    Accepted Submission(s): 4460Problem DescriptionA tree is a

Descriptionstandard input/outputStatementsLimak is a little bear who loves to play with graphs. Recently, he defined a new structure in a graph and called it a stickman.A stickman is a set