kuangbin 的这个专题,基本都是裸题,可以练练模板
A
最小生成树板子题
#include <algorithm>
#include <iostream>
#include <queue>
#include<map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include<cmath>
#include <cstdio>
#define ms(a,b) memset(a, b, sizeof a)
#define _for(i,a,b) for(int i=a;i<b;i++)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define foR(i, b, a) for (int i = b; i >= a; i--)
#define sc1(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a,&b)
#define sc3(a,b,c) scanf("%d%d%d", &a,&b,&c)
#define PII pair<double,int>
using namespace std;
const int N = 1100, INF = 0x3f3f3f3f;
struct rec{int u,v,w;
}e[N];
int fa[N],n,m,ans;
bool operator < (rec a,rec b){return a.w<b.w;
}
int get(int x){
if(x==fa[x])return x;
return fa[x]=get(fa[x]);
}
int main(){
while(1){
cin >> n;//n个点
if(n==0)
break;
ms(e, 0);
int k = 0;
For(i, 1, n-1) {
char t;
int x;
cin >> t;
cin >> x;
For(j,1,x){
char tt;
cin >> tt;
int d;cin>>d;
e[++k] = {t-'A',tt - 'A', d};
}
}
sort(e+1 , e +1+k);
For(i, 0, 30) fa[i] = i;
ans = 0;
For(i, 1, k)
{
int u = get(e[i].u);
int v = get(e[i].v);
if (u == v)continue;
fa[u]=v;
ans+=e[i].w;
}
cout<<ans<<endl;
}
return 0;
}
B
还是板子…
C
输入的时候,处理一下,把点转换成距离就好
#include <algorithm>
#include <iostream>
#include <queue>
#include<map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include<cmath>
#include <cstdio>
#define ms(a,b) memset(a, b, sizeof a)
#define _for(i,a,b) for(int i=a;i<b;i++)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define foR(i, b, a) for (int i = b; i >= a; i--)
#define sc1(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a,&b)
#define sc3(a,b,c) scanf("%d%d%d", &a,&b,&c)
#define PII pair<double,int>
using namespace std;
const int N = 11000, INF = 0x3f3f3f3f;
struct rec{
int u, v;
double w;
}e[N];
int fa[N], n, m;
double ans;
bool operator < (rec a,rec b){return a.w<b.w;
}
int get(int x){
if(x==fa[x])return x;
return fa[x]=get(fa[x]);
}
struct wo
{
double x, y, z, r;
double dis(wo a){
double d = pow(a.x - x, 2) + pow(a.y - y, 2) + pow(a.z - z, 2);
d = sqrt(d) - r - a.r;
if(d<=0)
d = 0;
return d;
}
}cir[N];
int main(){
while(1){
cin>>n;
if(n==0)
return 0;
For(i, 1, n) cin >> cir[i].x >> cir[i].y >> cir[i].z >> cir[i].r;
For(i, 1, n){
For(j, 1, n){
e[i + j * n-n] = {i, j, cir[i].dis(cir[j])};
}
}
m = n * n;
sort(e+1,e+1+m);
For(i,1,n)fa[i]=i;
ans = 0;
For(i,1,m){
int u=get(e[i].u);
int v=get(e[i].v);
if(u==v)continue;
fa[u]=v;
ans+=e[i].w;
}
printf("%.3f\n", ans);
}
return 0;
}
D
#include <algorithm>
#include <iostream>
#include <queue>
#include<map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include<cmath>
#include <cstdio>
#define ms(a,b) memset(a, b, sizeof a)
#define _for(i,a,b) for(int i=a;i<b;i++)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define foR(i, b, a) for (int i = b; i >= a; i--)
#define sc1(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a,&b)
#define sc3(a,b,c) scanf("%d%d%d", &a,&b,&c)
#define PII pair<double,int>
using namespace std;
const int N = 11000, INF = 0x3f3f3f3f;
struct rec{int u,v,w;
}e[N];
int fa[N],n,m,ans;
bool operator < (rec a,rec b){return a.w<b.w;
}
int get(int x){
if(x==fa[x])return x;
return fa[x]=get(fa[x]);
}
void mer(int x,int y){
int rx = get(x);
int ry = get(y);
if( rx != ry)
fa[ry] = rx;
}
int main(){
cin>>n;
m = n * n;
For(i,1,n)For(j,1,n){
int t;
cin >> t;
e[i + j * n - n] = {i, j, t};
}
sort(e+1,e+1+m);
For(i,1,n)fa[i]=i;
int q;
cin >> q;
_for(i,0,q){
int u, v;
cin >> u >> v;
mer(u, v);
}
For(i,1,m){
int u=get(e[i].u);
int v=get(e[i].v);
if(u==v)continue;
fa[u]=v;
ans+=e[i].w;
}
cout<<ans<<endl;
return 0;
}
F
字符串预处理一下
一开始用克鲁斯卡尔跑了1s多,下面是prime
G - Arctic Network
生成树,有条件的记录最长的一段
#include <algorithm>
#include <iostream>
#include <queue>
#include<map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include<cmath>
#include <cstdio>
#define ms(a,b) memset(a, b, sizeof a)
#define _for(i,a,b) for(int i=a;i<b;i++)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define foR(i, b, a) for (int i = b; i >= a; i--)
#define sc1(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a,&b)
#define sc3(a,b,c) scanf("%d%d%d", &a,&b,&c)
#define PII pair<double,int>
using namespace std;
const int N = 1e6 + 10, INF = 0x3f3f3f3f;
struct rec{
int u, v;
double w;
}e[N];
int fa[N], n, m;
double ans;
bool operator < (rec a,rec b){return a.w<b.w;
}
int get(int x){
if(x==fa[x])return x;
return fa[x]=get(fa[x]);
}
struct po
{
int x, y;
}a[510];
double dis(po a,po b){
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
int main(){
int t;cin>>t;
while(t--){
int s;
cin >> s;
cin >> n;
m = 0;
For(i, 1, n) cin >> a[i].x>>a[i].y;
For(i, 1, n) For(j, i, n) { e[++m] = {i, j, dis(a[i], a[j])}; };
sort(e + 1, e + 1 + m);
For(i, 1, n) fa[i] = i;
ans = -1;
int cnt = 0;
For(i, 1, m)
{
int u = get(e[i].u);
int v = get(e[i].v);
if (u == v)continue;
fa[u]=v;
cnt++;
if(cnt>=n-s+1)
break;
ans = max(ans, e[i].w);
}
printf("%.2f\n", ans);
}
}
H
#include <algorithm>
#include <iostream>
#include <queue>
#include<map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include<cmath>
#include <cstdio>
#define ms(a,b) memset(a, b, sizeof a)
#define _for(i,a,b) for(int i=a;i<b;i++)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define foR(i, b, a) for (int i = b; i >= a; i--)
#define sc1(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a,&b)
#define sc3(a,b,c) scanf("%d%d%d", &a,&b,&c)
#define PII pair<double,int>
using namespace std;
const int N = 1e6 + 10, INF = 0x3f3f3f3f;
struct rec{
int u, v;
double w;
}e[N];
int fa[N], n, m;
double ans;
bool operator < (rec a,rec b){return a.w<b.w;
}
int get(int x){
if(x==fa[x])return x;
return fa[x]=get(fa[x]);
}
struct po
{
int x, y;
}a[1000];
double dis(po a,po b){
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
void uni(int x,int y){
int rx = get(x);
int ry = get(y);
if( rx != ry)
fa[ry] = rx;
}
int main(){
cin >> n;
m = 0;
For(i, 1, n) cin >> a[i].x >> a[i].y;
For(i,1,n)For(j,i,n){
e[++m] = {i, j, dis(a[i], a[j])};
}
sort(e+1,e+1+m);
For(i,1,n)fa[i]=i;
int q;
cin >> q;
_for(i,0,q){
int u, v;
cin >> u >> v;
uni(u, v);
}
For(i,1,m){
int u=get(e[i].u);
int v=get(e[i].v);
if(u==v)continue;
fa[u]=v;
cout << e[i].u << " " << e[i].v << endl;
}
}
I
典型模板题 (注意用long long)
#include <algorithm>
#include <iostream>
#include <queue>
#include<map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include<cmath>
#include <cstdio>
#define ms(a,b) memset(a, b, sizeof a)
#define ll long long
#define _for(i,a,b) for(int i=a;i<b;i++)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define foR(i, b, a) for (int i = b; i >= a; i--)
#define sc1(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a,&b)
#define sc3(a,b,c) scanf("%d%d%d", &a,&b,&c)
#define PII pair<double,int>
using namespace std;
const int N = 1e6 + 10, INF = 0x3f3f3f3f;
struct rec{
int u, v, w;
}e[N];
int fa[N], n, m;
ll ans;
bool operator < (rec a,rec b){return a.w<b.w;
}
int get(int x){
if(x==fa[x])return x;
return fa[x]=get(fa[x]);
}
int main(){
while(cin >> n){
m = n*n;
For(i,1,n)For(j,1,n){
int t;
cin >> t;
e[i + j * n - n] = {i, j, t};
}
sort(e + 1, e + 1 + m);
For(i, 1, n) fa[i] = i;
ans = 0;
For(i, 1, m)
{
int u = get(e[i].u);
int v = get(e[i].v);
if (u == v)continue;
fa[u]=v;
ans += e[i].w;
}
cout << ans << endl;
}
return 0;
}