welcome_z的专栏

#include #include const int N = 10010; using namespace std; struct node { int u, v, w, c; bool operator < (const node &cmp) const { if (c==cmp.c) return (w<cmp.w); else if (c==1) return

#include #include #include #include #define clr(x, k) memset((x), (k), sizeof(x)) #define MAXe 10002 //e; #define MAXn 210 #define INF 1<<30 using namespace std; struct Edge { int to, w, next; }e

#include #include #include #define dis(x, y, u, v) sqrt((x-u)*(x-u) +(v-y)*(v-y)) const int N = 10010; using namespace std; struct node { int u, v; double w; bool operator < (const node &cmp)

#include #include #include #include #define clr(x, k) memset((x), (k), sizeof(x)) #define MAXe 1000002 //e; #define MAXn 1210 #define INF 1<<30 using namespace std; struct Edge { int to, w, p, ne

dfs: #include using namespace std; short d[4][2] = {1,0,0,1,-1,0,0,-1}; char g[110][110]; int n, m, ans; void dfs(int i, int j) { g[i][j] = '.'; for (int k=0;k<4;++k) { int x = i +