写在前面
好久没更新公众号和博客了,因为最近在研究新的方向,所以很少发文。
笔者接触编程只有一年,这一年间主要研究启发式算法在运筹学中的应用。但是由于编程基础薄弱,在进一步研究复杂运筹学问题时发现基础算法不过关导致写出的代码运行速度很慢,因此很苦恼。所以决定这个暑假补习一下基础算法,主要是刷一些简单的ACM入门题。偶尔会发一些刷题笔记(偶尔!)。和作者有类似目标的同学可以一起交流共勉!
目前在看的教程:
北京理工大学ACM冬季培训课程
算法竞赛入门经典/刘汝佳编著.-2版可以在这里下载->github
课程刷题点
Virtual Judge
刷题代码都会放在github上,欢迎一起学习进步!
这两天事比较多,没好好刷题,明后天甚至大后天有玩耍安排,今天简单写两道题弥补一下…都是基础题,简单做一下。
A - 拓扑排序·一
拓扑排序。按照BFS的思路进行拓扑排序,入度为0的点进入队列,vis设为true,再在队列中循环,每次循环相当于删除取出的点,把下一个点的入度-1,对入度为0的点入列。
#include <iostream>
#include <sstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
#define INT_MAX 0x7fffffff
#define INT_MIN 0x80000000
// #define LOCAL
void swap(int &x, int &y)
{
int temp = x;
x = y;
y = temp;
}
const int maxn = 100000 + 5;
int deg[maxn];
int vis[maxn];
vector<int> g[maxn];
queue<int> q;
int n, m;
bool topological()
{
for (int i = 1; i <= n; i++)
{
if(!deg[i])
{
vis[i] = 1;
q.push(i);
}
}
int num = 0;
while(!q.empty())
{
int now = q.front();
q.pop();
num++;
for(auto to:g[now])
{
if(vis[to])
continue;
else
{
deg[to]--;
if(!deg[to])
{
vis[to] = 0;
q.push(to);
}
}
}
}
if(num == n)
return true;
else
return false;
}
int main()
{
#ifdef LOCAL
freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
#endif
int kase;
scanf("%d", &kase);
while (kase--)
{
memset(vis, 0, sizeof(vis));
memset(deg, 0, sizeof(deg));
for (int i = 0; i < n; i++)
g[i].clear();
while (!q.empty())
q.pop();
cin >> n >> m;
for (int i = 0; i < m; i++)
{
int u, v;
cin >> u >> v;
g[u].push_back(v);
deg[v]++;
}
if(topological())
cout << "Correct" << endl;
else
cout << "Wrong" << endl;
}
return 0;
}
B - 最短路径·二:Floyd算法
Floyd。三次循环点数,
O
(
n
3
)
O(n^3)
O(n3),三次循环的顺序可以随意。这题的输入有一个坑,两点之间可能有多条路,输入时要判断选择最短的一条存储。
#include <iostream>
#include <sstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
#define INT_MAX 0x7fffffff
#define INT_MIN 0x80000000
#define LOCAL
void swap(int &x, int &y)
{
int temp = x;
x = y;
y = temp;
}
const int maxn = 100 + 5;
int n, m;
int min_dis[maxn][maxn];
int main()
{
#ifdef LOCAL
freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
#endif
cin >> n >> m;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
min_dis[i][j] = 10000;
min_dis[i][i] = 0;
}
for (int i = 0; i < m; i++)
{
int u, v, w;
cin >> u >> v >> w;
min_dis[v - 1][u - 1] = min_dis[u - 1][v - 1] = min(min_dis[u - 1][v - 1], w);
}
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
min_dis[i][j] = min(min_dis[i][j], min_dis[i][k] + min_dis[k][j]);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
cout << min_dis[i][j] << " ";
cout << endl;
}
return 0;
}
C - 最短路径·三:SPFA算法
邻接表存储的SPFA,复杂度
O
(
n
m
)
O(nm)
O(nm)。dist数组标记到起点的距离,vis数组标记点是否在队列中,起点入列,当前点pre,所有pre的边的下一个点next,用dist[pre]和pre到起点的距离松弛dist[next],若松弛成功且vis[next]=false,入列。
#include <iostream>
#include <sstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
#define INT_MAX 0x7fffffff
#define INT_MIN 0x80000000
// #define LOCAL
void swap(int &x, int &y)
{
int temp = x;
x = y;
y = temp;
}
const int maxn = 100000 + 5;
int vis[maxn];
int dist[maxn];
vector<pii> g[maxn];
queue<int> q;
int n, m;
void SPFA(int start)
{
for (int i = 0; i < n; i++)
dist[i] = 10000;
queue<int> q;
dist[start] = 0;
vis[start] = true;
q.push(start);
while (!q.empty())
{
int v = q.front();
q.pop();
vis[v] = false;
for (int i = 0; i < g[v].size(); i++)
{
int nex = g[v][i].first;
if (g[v][i].second > 0 && dist[nex] > dist[v] + g[v][i].second)
{
dist[nex] = dist[v] + g[v][i].second;
if (vis[nex] == false)
{
q.push(nex);
vis[nex] = true;
}
}
}
}
}
int main()
{
#ifdef LOCAL
freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
#endif
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++)
g[i].clear();
while (!q.empty())
q.pop();
int s, e;
cin >> n >> m >> s >> e;
for (int i = 0; i < m; i++)
{
int u, v, w;
cin >> u >> v >> w;
u--;
v--;
g[u].push_back({v, w});
g[v].push_back({u, w});
}
SPFA(s - 1);
cout << dist[e - 1];
return 0;
}
D - K-th Path
求图中第k短的路径长度。
图的点比较多,有1e5,要是直接floyd肯定超时了,这辈子都求不完。
搜了一下,看到网上大神们这样说的:k是400,只需要在m条边中取前k短的边组成新的子图,那么子图中的点最多800个,1e3,再floyd即可。看来做算法题也和数学题一样,可以从题目中找到蛛丝马迹。
#include <iostream>
#include <sstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
#define INT_MAX 0x7fffffff
#define INT_MIN 0x80000000
#define INF 1e11
#define LOCAL
void swap(int &x, int &y)
{
int temp = x;
x = y;
y = temp;
}
const int maxn = 100000 + 5;
int n, m, k, b[1000];
long long mp[805][805], d[maxn];
struct node
{
int u, v, w;
} a[maxn];
bool cmp(node x, node y) { return x.w < y.w; }
int main()
{
#ifdef LOCAL
freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
#endif
cin >> n >> m >> k;
for (int i = 1; i <= m; i++)
cin >> a[i].u >> a[i].v >> a[i].w;
sort(a + 1, a + m + 1, cmp);
int cnt = 0;
for (int i = 1; i <= min(m, k); i++)
b[++cnt] = a[i].u, b[++cnt] = a[i].v;
sort(b + 1, b + cnt + 1);
cnt = unique(b + 1, b + cnt + 1) - b - 1;
for (int i = 1; i <= cnt; i++)
for (int j = 1; j <= cnt; j++)
mp[i][j] = INF;
for (int i = 1; i <= min(m, k); i++)
{
int u = lower_bound(b, b + cnt + 1, a[i].u) - b;
int v = lower_bound(b, b + cnt + 1, a[i].v) - b;
mp[u][v] = mp[v][u] = a[i].w;
}
for (int q = 1; q <= cnt; q++)
for (int i = 1; i <= cnt; i++)
for (int j = 1; j <= cnt; j++)
if (mp[i][j] > mp[i][q] + mp[q][j])
mp[i][j] = mp[i][q] + mp[q][j];
int cnt1 = 0;
for (int i = 1; i <= cnt; i++)
for (int j = i + 1; j <= cnt; j++)
if (mp[i][j] != INF)
d[++cnt1] = mp[i][j];
sort(d, d + cnt1 + 1);
printf("%lld\n", d[k]);
return 0;
}