事情的起因是平平无奇的一道CF签到题
然后大概题意就是给定一个地图,图中有一些光源,对于一个点(x, y)来说,他的权值为 他到距离他最近点的欧式距离的平方。嗯,是个人都会想到爆搜嘛 then…T4了,然后惊奇的想到了多个点同时开始bfs,上下左右,就很和谐,,//WA6, 然后打表发现先后更新顺序导致有个点被错误覆盖了,然后胡x搞了下把bfs方向从四个变成八个,然后…T24。。。 咳咳, 仔细思考了一晚发觉他的正确bfs顺序其实是个…
hh 然后总算知道了一个正确bfs的顺序。。
const int N = 2010;
ll f[N][N], st[N][N];
int n, m, F, S;
char s[N];
ll cnt, num, idx = 1;
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int Dx[] = {-1, 0, 1, 0}, Dy[] = {0, -1, 0, 1};
struct Node{
int k, x, y;
bool operator < (Node a)const{
return k < a.k;
}
};
vector<Node> v;
void prework(){
rep(i, 0, 2000) rep(j, i, 2000)
v.pb({i*i+j*j, i, j});
sort(ALL(v));
}
In int cal(int x, int y, int fx, int fy){
return (x-fx)*(x-fx)+(y-fy)*(y-fy);
}
In void bfs(int x, int y, int dx, int dy){
cnt ++;
vector<PII> dir;
if(!dx || !dy){//改四个
if(dx) dir.pb({dx, 0}), dir.pb({-dx, 0}), dir.pb({0, dx}), dir.pb({0, -dx});
else dir.pb({0, dy}), dir.pb({0, -dy}), dir.pb({dy, 0}), dir.pb({-dy, 0});
}
else if(dx == dy) dir.pb({dx, dy}), dir.pb({dx, -dy}), dir.pb({-dx, dy}), dir.pb({-dx, -dy});
else dir.pb({dx, dy}), dir.pb({dx, -dy}), dir.pb({-dx, dy}), dir.pb({-dx, -dy}), dir.pb({dy, dx}), dir.pb({dy, -dx}), dir.pb({-dy, dx}), dir.pb({-dy, -dx});
for(auto t :dir){
int nx = x + t.fi, ny = y + t.se;
if(nx >= 0 && nx <= n && ny >= 0 && ny <= m && !st[nx][ny]){
f[nx][ny] = cal(nx, ny, x, y);
num --;
st[nx][ny] = 1;
}
}
}
void run_case(){
prework();
vector<PII> list;
n = read(), m = read();
num = (n+1)*(m+1);
mset(f, 0x3f);
rep(i, 0, n){
scanf("%s", s);
rep(j, 0, m){
if(s[j]=='1') list.pb(mp(i, j)), num --, st[i][j] = 1, f[i][j] = 0;
}
}
// for(auto t:v){
// printf("%d %d %d\n", t.k, t.x, t.y);
// }
int sz = v.size();
while(num > 0 && idx < sz){
int dx = v[idx].x, dy = v[idx].y;
// enter;
// bug(dx), bug(dy), bug(num);
for(auto t:list){
int F = t.fi, S = t.se;
bfs(F, S, dx, dy);
}
idx ++;
}
cout << "bfs次数为: " << cnt << endl;
ll ans = 0;
// enter;
rep(i, 0, n){
rep(j, 0, m){
// cout << f[i][j];
ans += f[i][j];
}
// enter;
}
write(ans);
enter;
}
然后发现这玩意跑的比爆搜还慢…
于是被迫开始了学习新知识(掉头发)的奋斗。。
正解 待补:(end 2022.1.3)
-----------------------2022.10.24-----------------------------
终于爬回来补坑了
(贴了代码说明我补了!~~约等于我会了)
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
#define sq(x) ((x)*(x))
const int N=2010;
const int inf = 1000000000;
ll col[N], val[N], st[N];
vector<int> vec[N];
void solve(){
int n, m;
cin >> n >> m;
for(int i = 0;i <= n;i ++){
string s;
cin >> s;
for(int j = 0;j <= m;j ++){
if(s[j] == '1') vec[j].push_back(i);
}
}
ll ans = 0;
for(int i = 0;i <= n;i ++){
int T = -1, H = 0;
for(int j = 0;j <= m;j ++){
if(!vec[j].size()) continue;
while(col[j]+1<(int)vec[j].size() && abs(vec[j][col[j]+1]-i)<=abs(vec[j][col[j]]-i)) col[j] ++;
val[j] = sq(j) + sq(i-vec[j][col[j]]);
while(H < T && (val[j]-val[st[T]])*(st[T]-st[T-1])<=(val[st[T]]-val[st[T-1]])*(j-st[T])) T --;
st[++T] = j;
}
for(int j = 0;j <= m;j ++){
while(H < T && (val[st[H+1]]-val[st[H]])<=(st[H+1]-st[H])*2*j) H ++;
ans += val[st[H]] + sq(j) - 2*j*st[H];
}
}
printf("%lld\n", ans);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// int _;
// for (scanf("%d",&_);_;_--) {
solve();
// }
}