Y251673671的专栏

<br />// Accepted 1385 46MS 424K 3948 B C++ <br />//点和边均有权值 路径按字典顺序小的输出 <br />#include<iostream><br />#include<cstdio><br />#include<queue><br />#define MAX 0x3fffffff<br />#define asize 10002<br />using namespace std;<br />struct node{<br /> node(int vv=0

<br />//2578521 2010-07-08 17:03:12 Accepted 1142 62MS 4180K 1834 B C++ T&T <br />#include<iostream><br />#include<cstdio><br />#include<queue><br />#define MAX 0x7fffffff<br />#define asize 1002<br />using namespace std;<br />struct node{<br /> node(int v

//2577833 2010-07-08 14:29:13 Accepted 1874 15MS 284K 1445 B C++ T&T #include #include #include #define MAX 0x7fffffff #define asize 210 using namespace std; struct node{ node(int vv=0,int dd=0):vexn(vv),dist(dd){} int vexn; int dist; fri

<br />#include<iostream><br />#include<cstdio><br />#include<queue><br />#include<string><br />#include<vector><br />#define INF 0x7fffffff<br />using namespace std;<br />const int V = 52;<br />const int E = 6005;<br />int n,m,s,t;<br />int dist[V][3],cnt[