ccshijtgc的专栏

Roadblocks#include <cstdio>#include <cstring>#include <queue>#include <algorithm>#define MAXN (5000 + 10)#define INF (5000*5000*2)using namespace std;struct edge {...

一个人的旅行#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int inf = 1<<30; int T,S,D,n;int map[1111][1111];int vis[1111],cast[1111];i...

最短路径问题#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int inf = 1<<30;int n, m;int map_len[1005][1005], map_time[1005][1005];int vi...

HDU Today#include <stdio.h>#include <iostream>#include <cstring>#include <algorithm>#include <map>using namespace std;#define inf 0x3f3f3f3fint cast[205], vis[...

A strange lift#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int inf = 1<<30;int n;int map[205][205];int a[205], cnt;int vis[20...

Arbitrage#include <stdio.h>#include <iostream>#include <cstring>#include <map>#include <queue>#include <algorithm>using namespace std;const int L = 35;c...

The Shortest Path#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define inf 99999999int n,m;int map[85][85];int a[85][85][85], tem[85][85];...

Choose the best route#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int inf = 100000000;int n,m,s;int map[1005][1005];int vis[1005],cast...

Saving James Bond#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const double inf = 100000000;double map[105][105];int s[1...

find the mincost route#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int inf = 100000000;int n, m, ans;int map[105][105];int dis[105][10...

最短路#include <bits/stdc++.h>#include <set>using namespace std;const int MAX_N = 10000;const int MAX_M = 100000;const int inf = 0x3f3f3f3f;struct edge { int v, w, next;} e[MA...

畅通工程续#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <climits>using namespace std;const int MAXN = 200+5;const int MAXM = 1000+5...

骑车比赛#include <bits/stdc++.h>#include <set>using namespace std;const int MAX_N = 10000;const int MAX_M = 100000;const int inf = 0x3f3f3f3f;struct edge { int v, w, next;} e[M...

圣诞树#include <bits/stdc++.h>#include <set>using namespace std;const int MAX_N = 50005;const int MAX_M = 500005;const int inf = 0x3f3f3f3f;struct edge { int v, w, next;} e[MA...

迷阵突围#include<iostream>#include<cstdio>#include<vector>#include<cmath>#include<string.h>#include<map>using namespace std;const int MAXN=205;double inf=999...

闯关游戏#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <climits>using namespace std;const int MAXN = 110;const int MAXM = 11000;int...

成仙之路#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <climits>int L[200010];using namespace std;int MAXN=70000;int p[70000];boo...

蒜头君的银行卡#include<iostream>#include<cstdio>#include<cctype>#include<cstring>#include<algorithm>#include<cmath>//#include<set>//#include<vector&

蒜厂年会#include <bits/stdc++.h>using namespace std;const int MAXN = 305;const int INF = 0x3f3f3f3f;int group1[MAXN];int group2[MAXN];int G[MAXN][MAXN];int n, m;void floyd(){ for(...

蒜头君的训练室#include <bits/stdc++.h>using namespace std;const int MAXN = 305;const int INF = 0x3f3f3f3f;int group1[MAXN];int group2[MAXN];int G[MAXN][MAXN];int n, m, t;void floyd(){ ...

美好的邂逅#include <bits/stdc++.h>using namespace std;const int MAXN = 305;const int INF = 0x3f3f3f3f;int group1[MAXN];int group2[MAXN];int G[MAXN][MAXN];int n, m, t;void floyd(){ ...

find the safest road#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>using namespace std;const double inf = 1000000;int n, m;double map[1005...