传送门
题目描述
现在有 n n n棵树和 m m m个人,给你每一个树的位置,需要你安排每一个人的位置,使每个人到离他最近的那棵树的距离和最小
分析
有点类似于广搜,我们把每个树作为一个起点,然后向两边进行拓展,丢进队列进行模拟就可以了
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,ll> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod= 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
int gcd(int a,int b){return (b>0)?gcd(b,a%b):a;}
int n,m;
map<int,int> M;
int a[N];
int main(){
read(n),read(m);
queue<PII> q;
for(int i = 1;i <= n;i++){
int x;
read(x);
M[x] = 1;
q.push({x + 1,1});
q.push({x - 1,1});
}
ll res = 0;
for(int i = 1;i <= m;i++){
PII t;
while(1){
t = q.front();
q.pop();
if(!M[t.fi]) break;
}
M[t.fi] = 1;
res += t.se;
a[i] = t.fi;
if(!M[t.fi + 1]) q.push({t.fi + 1,t.se + 1});
if(!M[t.fi - 1]) q.push({t.fi - 1,t.se + 1});
}
dl(res);
for(int i = 1;i <= m;i++) printf("%d ",a[i]);
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/