文章目录
知识点
STL入门
vector
- 声明
#include<vector>
using namespace std;
vector<int> V[max_n] // 假设需要的为int类型
- 清空
for(int i=0; i<max_n; i++)
V[i].clear() // 清空是针对一个链表
- 尾部添加和删除元素
V[0].push_back(x);
V[0].pop_back();
- 测试是否为空
V[0].empty();
- 改变大小
V[0].resize(h+1); //只保留下标0~h的元素
- 排序
#include <algorithm>
using namespcae std;
sort(V[0].begin(), V[0].end());
- 得到长度
V[0].size();
Set
- 声明
#include<set>
using namespace std;
set<string> dict;
- 插入
dict.insert(word); // word是string类型的变量
- 删除
dict.erase(word);
- 遍历(set中元素已经从小到大排好了序)
for(set<string>::iterator it=dict.begin(); it != dict.end(); ++it)
cout << *it << endl;
map
- 声明
#include<map>
using namespace std;
map<string, int> word2cnt;
- 插入或更改值
word2cnt['test'] = 1;
- 查找
word2cnt.fund('test') == word2cnt.end() //True:找到了,否则没有.
- 求大小
word2cnt.size()
并查集查找父亲并压缩
int find_father(int x){
if(father[x] == -1) return x;
int tmp = find_father(father[x]);
father[x] = tmp;
return tmp;
}
例题
畅通工程
题目链接
题目大意:要将所有村庄连接起来,需要最少修多少路
- 并查集求出集合个数。如果father[i] == -1,则集合个数加一。
- 答案为集合个数-1
代码:
#include <stdio.h>
#include <cstring>
using namespace std;
const int max_n = 1005;
int father[max_n];
void init(){
memset(father, -1, sizeof(father));
}
int find_father(int x){
if(father[x] == -1) return x;
int tmp = find_father(father[x]);
father[x] = tmp;
return tmp;
}
int main(){
int n, m, from, to, ans;
while(scanf("%d", &n)){
if(n == 0) break;
scanf("%d", &m);
init();
for(int i=0; i<m; i++){
scanf("%d%d", &from, &to);
int father_a = find_father(from);
int father_b = find_father(to);
if(father_a == father_b) continue;
father[father_b] = father_a;
}
ans = 0;
for(int i=1; i<=n; i++){
if(father[i] == -1)
ans++;
}
printf("%d\n",ans-1);
}
return 0;
}
More is better
题目链接
题目大意:给定节点,给定边。相连的节点为一个集合。求最大集合的元素个数.
- 典型的并查集问题。加入数量
代码:
#include <stdio.h>
#include <cstring>
#include <iostream>
using namespace std;
const int max_n = 10000000 + 5;
const int inf = 0x7fffffff;
int father[max_n];
int set_num[max_n];
void init(){
memset(father, -1, sizeof(father));
for(int i=0; i<max_n; i++)
set_num[i] = 1;
}
int find_father(int x){
if(father[x] == -1) return x;
int tmp = find_father(father[x]);
father[x] = tmp;
return tmp;
}
int main(){
int n, a, b, fa, fb, ans;
while(scanf("%d", &n)!=EOF){
// ---------------------------------
init();
for(int i=1; i<=n; i++){
scanf("%d%d", &a, &b);
fa = find_father(a);
fb = find_father(b);
if(fa == fb) continue;
father[fb] = fa;
set_num[fa] += set_num[fb];
}
// -----------------------------------
ans = -inf;
for(int i=1; i<max_n; i++){
ans = max(ans, set_num[i]);
}
printf("%d\n", ans);
}
return 0;
}
Head of a Gang
题目链接
题目大意:给定n个节点(含名字),n条边,边有权重。求出节点大于2, 并且集合总权重大于阈值的集合度数最大的节点名字以及其所在集合的节点数。
- 首先输入的是字符串。因此需要一个name2id的字典来转换
- 集合问题依然抽象为并查集
- 在合并过程中,求出每个节点的权重和记录在id2num中。
- 利用set_num记录每个集合的节点数
- total_num记录每个集合的总权重
- 利用head_f, 和max_f来求每一个集合中的最大权重的节点。
- 将满足的节点放入ans(vector)中
- 注意最后合并并查集后并没有完全压缩。因此后面不能直接用father[i]求其父亲
代码:
#include <iostream>
#include <map>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int max_n = 1000+5;
int father[max_n], set_num[max_n];
int id2num[max_n], total_num[max_n];
int head_f[max_n], max_f[max_n];
string id2name[max_n];
map<string, int> name2id;
vector<string> ans;
void init(){
for(int i=0; i<max_n; i++){
father[i] = -1;
set_num[i] = 1;
id2num[i] = 0;
total_num[i] = 0;
max_f[i] = 0;
head_f[i] = -1;
}
name2id.clear();
ans.clear();
}
int find_father(int x){
if(father[x] == -1) return x;
int tmp = find_father(father[x]);
father[x] = tmp;
return tmp;
}
int main(){
int n, thread;
string namea, nameb;
int a, b, fa, fb, time, cnt;
while(cin >> n >> thread){
init();
cnt = 0;
for(int i=0; i<n; i++){
cin >> namea >> nameb >> time;
if(name2id.find(namea) == name2id.end()){
name2id[namea] = cnt++;
id2name[cnt-1] = namea;
}
if(name2id.find(nameb) == name2id.end()){
name2id[nameb] = cnt++;
id2name[cnt-1] = nameb;
}
a = name2id[namea];
b = name2id[nameb];
id2num[a] += time;
id2num[b] += time;
fa = find_father(a);
fb = find_father(b);
if(fa == fb) continue;
father[fb] = fa;
set_num[fa] += set_num[fb];
}
// 得到所有所有团体的总时间并得到其head
for(int i=0; i<cnt; i++){
int f = find_father(i);
total_num[f] += id2num[i];
if(id2num[i] > max_f[f]){
head_f[f] = i;
max_f[f] = id2num[i];
}
}
for(int i=0; i<cnt; i++){
// cout << total_num[i] << endl;
int f = find_father(i);
if(i == head_f[f] && total_num[f] > 2*thread && set_num[f] > 2){
ans.push_back(id2name[i]);
}
}
sort(ans.begin(), ans.end());
cout << ans.size() << endl;
for(int i=0; i<ans.size();i++){
int f = find_father(name2id[ans[i]]);
cout << ans[i] << " " << set_num[f] << endl;
}
}
return 0;
}
连通图
题目链接
题目大意:给定n个顶点和m条边,确定图是否联通
- 并查集看最后集合是否大于2
代码:
#include <stdio.h>
const int max_n = 1000+5;
int tree[max_n];
int num[max_n];
void init(){
for(int i=0; i<max_n; i++){
tree[i] = -1;
num[i] = 1;
}
}
int find_tree(int a){
if(tree[a] == -1) return a;
int tmp = find_tree(tree[a]);
tree[a] = tmp;
return tmp;
}
int main(){
int m, n;
int a, b, ta, tb;
int ans;
while(scanf("%d%d",&n, &m)!=EOF){
init();
if(n == 0){
printf("YES\n");
continue;
}
while(m--){
scanf("%d%d", &a, &b);
ta = find_tree(a);
tb = find_tree(b);
if(ta != tb){
tree[tb] = ta;
num[ta] += num[tb];
}
}
ans = -1;
for(int i=1; i<=n; i++){
if(ans < num[i])
ans = num[i];
}
if(ans == n)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
还是畅通工程
-
题目大意:典型的求最短生成树问题.
-
使用kruskal算法
-
其间用到并查集
-
注意重载符号
代码:
#include <iostream>
#include <algorithm>
using namespace std;
const int max_n = 100+5;
const int max_e = max_n * (max_n - 1) / 2;
struct Edge{
int s, e, w;
bool operator < (const Edge &a) const{
return w < a.w;
}
}edge[max_e];
int father[max_n];
int find_father(int a){
if(father[a] == -1) return a;
int tmp = find_father(father[a]);
father[a] = tmp;
return tmp;
}
void init(){
for(int i=0; i<max_n; i++){
father[i] = -1;
}
}
int main(){
int N, num_e, ans, ans_num, fs, fe;
while(cin >> N && N){
init();
num_e = (N-1)*N / 2;
for(int i=0; i<num_e;i++)
cin >> edge[i].s >> edge[i].e >> edge[i].w;
sort(edge, edge+num_e);
ans = ans_num = 0;
for(int i=0; i<num_e; i++){
fs = find_father(edge[i].s);
fe = find_father(edge[i].e);
if(fs != fe){
ans += edge[i].w;
ans_num++;
if(ans_num == N-1)
break;
father[fe] = fs;
}
}
cout << ans << endl;
}
return 0;
}
Freckles
题目链接
题目大意:也是典型的求最小生成树
- 值得注意的是结构体的使用
- 在结构体里定义函数
- 重载小于号
- 把点表示为一个下标。
代码:
#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
const int max_n = 105;
struct Point{
double x, y;
double get_distance(Point B){
return sqrt((x - B.x) * (x - B.x) + (y - B.y) * (y - B.y));
}
}points[max_n];
struct Edge{
int from, to;
double weight;
bool operator < (const Edge &A) const{
return weight < A.weight;
}
}edges[max_n * max_n / 2];
int father[max_n];
void init(){
for(int i=0; i<max_n;i++)
father[i] = -1;
}
int find_father(int x){
if(father[x] == -1) return x;
int tmp = find_father(father[x]);
father[x] = tmp;
return tmp;
}
int main(){
int n;
while(scanf("%d", &n)!=EOF){
init();
for(int i=0; i<n; i++){
scanf("%lf%lf", &points[i].x, &points[i].y);
}
int cnt = 0;
for(int i=0; i<n-1; i++){
for(int j=i+1; j<n; j++){
edges[cnt].from = i;
edges[cnt].to = j;
edges[cnt++].weight = points[i].get_distance(points[j]);
}
}
sort(edges, edges+cnt);
int ans_num = 0;
double ans = 0;
for(int i=0; i<cnt; i++){
int a = edges[i].from;
int b = edges[i].to;
int fa = find_father(a);
int fb = find_father(b);
if(fa == fb) continue;
ans += edges[i].weight;
ans_num++;
if(ans_num == n-1)
break;
}
printf("%.2f\n", ans);
}
return 0;
}
最短路(迪杰斯特拉算法)
- 外面是N-1次循环,指找到N-1个点
- 第一部分是利用当前最短路径更新其余为找到路径
- 第二部分是寻找下一次的最短路径
#include<iostream>
using namespace std;
const int max_n = 100+5;
const int inf = 1 << 20;
int G[max_n][max_n];
int mark[max_n];
int D[max_n];
void init(){
for(int i=0; i<max_n; i++){
for(int j=0; j<max_n; j++)
G[i][j] = inf;
}
for(int i=0; i<max_n; i++){
mark[i] = 0;
D[i] = inf;
}
}
int djstla(int s, int e, int n){
D[s] = 0;
mark[s] = 1;
int min_j = s;
for(int i=1; i<=n-1; i++){
for(int j=1; j<=n; j++){
if(!mark[j] && D[j] > D[min_j] + G[min_j][j])
D[j] = D[min_j] + G[min_j][j];
}
int min_d = inf;
for(int j=1; j<=n; j++){
if(!mark[j] && D[j] < min_d){
min_d = D[j];
min_j = j;
}
}
mark[min_j] = 1;
}
return D[e];
}
int main(){
int N, M, s, e, cost, ans;
while(cin >> N >> M){
if(N == 0 && M == 0)
break;
init();
while(M--){
cin >> s >> e >> cost;
G[s][e] = G[e][s] = cost;
}
ans = djstla(1, N, N);
cout << ans << endl;
}
return 0;
}
I wanna go home(临接矩阵djstla)
- 题目中没有提到两个城市间只有一条道路,因此使用邻接矩阵时一定要双向。
- 判断能否到达就看是否大于等于inf
- 核心思想就是将两个阵营间的路设置为单向!,即只能从1到2阵营。
- 再次弄明白djstla算法的过程
#include <iostream>
using namespace std;
const int max_n = 600+5;
const int inf = 1 << 20;
struct Edge{
int next;
int w;
};
int G[max_n][max_n];
int D[max_n], mark[max_n], flag[max_n];
void init(){
for(int i=0; i<max_n; i++){
D[i] = inf;
mark[i] = 0;
}
for(int i=0; i<max_n; i++){
for(int j=0; j<max_n; j++){
G[i][j] = inf;
}
G[i][i] = 0;
}
}
int N, M;
void djstla(int s){
D[s] = 0;
int min_j = s;
mark[s] = 1;
for(int i=0;i<N; i++){
for(int j=1; j<=N; j++){
if(!mark[j] && D[j] > D[min_j] + G[min_j][j]){
D[j] = D[min_j] + G[min_j][j];
}
}
int min_d = inf;
for(int j=1; j<=N;j++){
if(!mark[j] && D[j] < min_d){
min_d = D[j];
min_j = j;
}
}
mark[min_j] = 1;
}
}
int main(){
int s, e, w;
while(cin >> N && N){
init();
cin >> M;
while(M--){
cin >> s >> e >> w;
if(G[s][e] > w)
G[s][e] = G[e][s] = w;
}
for(int i=1; i<=N;i++)
cin >> flag[i];
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++){
if(flag[i] != flag[j]){
if(flag[i] == 2){
G[i][j] = inf;
}
else{
G[j][i] = inf;
}
}
}
}
djstla(1);
if(D[2] >= inf){
cout << -1 << endl;
}
else
cout << D[2] << endl;
}
return 0;
}
最短路径(并查集或者高精度djstla)
- 并查集代码.
- 考虑到 2 k > 2 k − 1 + . . . + 1 2^k > 2^{k-1} + ... + 1 2k>2k−1+...+1 ,因此对不在同一集合的两个定点,其最短路径为当前边,当这两个点相连后,各自集合的每一对点都通过这两个点建立连接,且最短距离一定通过这两个点
#include <iostream>
using namespace std;
const int max_n = 100 + 5;
const int mod = 100000;
const int inf = 1 << 20;
int G[max_n][max_n];
int pow_2(int k){
int res = 1;
for(int i=1; i<=k; i++){
res = (res * 2) % mod;
}
return res;
}
int father[max_n];
void init(){
for(int i=0; i<max_n; i++)
father[i] = -1;
for(int i=0; i<max_n; i++){
for(int j=0; j<max_n; j++)
G[i][j] = inf;
G[i][i] = 0;
}
}
int find_father(int a){
if(father[a] == -1) return a;
int tmp = find_father(father[a]);
father[a] = tmp;
return tmp;
}
int main(){
int N, M;
int s, e, fs, fe;
while(cin >> N >> M){
init();
for(int i=0; i<M;i++){
cin >> s >> e;
int w = pow_2(i);
fs = find_father(s);
fe = find_father(e);
if(fs != fe){
G[s][e] = G[e][s] = w;
for(int j=0; j<N; j++){
if(fs == find_father(j)){
for(int k=0; k<N; k++){
if(fe == find_father(k)){
G[j][k] = G[k][j]= (G[j][s] + G[e][k] + w) % mod;
}
}
}
}
father[fe] = fs;
}
}
for(int i=1; i<N; i++){
if(G[0][i] >= inf)
cout << -1 << endl;
else
cout << G[0][i] << endl;
}
}
return 0;
}
legal or not(HDU)拓扑排序
- 用到vector来建图
- 用到队列来保存当前入度为0的点
- 用到indegree数组来记录入度
#include <stdio.h>
#include <queue>
#include <vector>
using namespace std;
const int max_n = 100+5;
vector<int>G[max_n];
queue<int> Q;
int indegree[max_n];
void init(){
for(int i=0; i<max_n; i++){
G[i].clear();
indegree[i] = 0;
}
while(!Q.empty())
Q.pop();
}
int main(){
int N, M, s, e;
while(scanf("%d%d", &N, &M)){
init();
if(N==0 && M == 0)
break;
while(M--){
scanf("%d%d", &s, &e);
G[s].push_back(e);
indegree[e]++;
}
int cnt = 0;
for(int i=0; i<N;i++){
if(!indegree[i]){
Q.push(i);
cnt++;
}
}
while(!Q.empty()){
int now = Q.front();
Q.pop();
for(int j=0; j<G[now].size(); j++){
int n = G[now][j];
indegree[n]--;
if(indegree[n] == 0){
Q.push(n);
cnt++;
}
}
}
if(cnt == N) printf("YES\n");
else printf("NO\n");
}
return 0;
}
确定比赛名次(有限队列+拓扑排序)
#include <stdio.h>
#include <queue>
#include <cstring>
using namespace std;
const int max_n = 505;
int indegree[max_n];
int G[max_n][max_n];
priority_queue<int, vector<int>, greater<int> > Q;
void init(){
for(int i=0; i<max_n; i++)
for(int j=0; j<max_n;j++)
G[i][j] = 0;
memset(indegree, 0, sizeof(indegree));
while(!Q.empty())
Q.pop();
}
int main(){
int N, M, s, e;
while(scanf("%d%d", &N, &M)!=EOF){
init();
while(M--){
scanf("%d%d", &s, &e);
G[s][e] = 1;
}
int flag = 1;
for(int j=1; j<=N; j++){
for(int i=1; i<=N; i++){
if(G[i][j])
indegree[j]++;
}
if(!indegree[j]){
Q.push(j);
}
}
while(!Q.empty()){
int now = Q.top();
Q.pop();
if(flag){
printf("%d", now);
flag = 0;
}
else
printf(" %d", now);
for(int j=1; j<=N; j++){
if(G[now][j]){
indegree[j]--;
if(indegree[j] == 0){
Q.push(j);
}
}
}
}
printf("\n");
}
return 0;
}