1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
| #include<cassert> #include<vector> #include<cstdio> #include<cstring> #include<algorithm> using namespace std;
const int N=1e5+10,M=1e9,SIZ=N*20; typedef long long ll; const ll INF=1ll<<60; typedef pair<int,int> pii; #define ci const int & #define cl const ll & #define fir first #define sec second
struct FastIO { static const int S = 1e7; int wpos; char wbuf[S]; FastIO() : wpos(0) {} inline int xchar() { static char buf[S]; static int len = 0, pos = 0; if (pos == len) pos = 0, len = fread(buf, 1, S, stdin); if (pos == len) exit(0); return buf[pos++]; } inline int xuint() { int c = xchar(), x = 0; while (c <= 32) c = xchar(); for (; '0' <= c && c <= '9'; c = xchar()) x = x * 10 + c - '0'; return x; } inline int xint() { int s = 1, c = xchar(), x = 0; while (c <= 32) c = xchar(); if (c == '-') s = -1, c = xchar(); for (; '0' <= c && c <= '9'; c = xchar()) x = x * 10 + c - '0'; return x * s; } inline void xstring(char *s) { int c = xchar(); while (c <= 32) c = xchar(); for (; c > 32; c = xchar()) * s++ = c; *s = 0; } inline void wchar(int x) { if (wpos == S) fwrite(wbuf, 1, S, stdout), wpos = 0; wbuf[wpos++] = x; } inline void wint(ll x) { if (x < 0) wchar('-'), x = -x; char s[24]; int n = 0; while (x || !n) s[n++] = '0' + x % 10, x /= 10; while (n--) wchar(s[n]); wchar('\n'); } inline void wstring(const char *s) { while (*s) wchar(*s++); } ~FastIO() { if (wpos) fwrite(wbuf, 1, wpos, stdout), wpos = 0; } } io;
vector<int> unx; int cas,n,nnod; int pnt[N][2];
struct NODE{ int nxt[2],fix,key,x,y; ll val[4],mn[4],add; inline int& operator [](ci i){return nxt[i];} void Update(ll cur){ add+=cur; for(int i=0;i<4;i++) val[i]+=cur,mn[i]+=cur; } }nod[N*20]; namespace TREAP{ inline void PushUp(ci u){ for(int i=0;i<4;i++){ nod[u].mn[i]=nod[u].val[i]; if(nod[u][0]) nod[u].mn[i]=min(nod[u].mn[i],nod[nod[u][0]].mn[i]); if(nod[u][1]) nod[u].mn[i]=min(nod[u].mn[i],nod[nod[u][1]].mn[i]); } } inline void PushDown(ci u){ if(!nod[u].add) return; if(nod[u][0]) nod[nod[u][0]].Update(nod[u].add); if(nod[u][1]) nod[nod[u][1]].Update(nod[u].add); nod[u].add=0; } inline int NewNode(int x,int y,cl f){ int p=++nnod; x=unx[x-1]; nod[p].x=x,nod[p].y=y; nod[p].fix=rand(),nod[p].key=y; nod[p].add=0; nod[p][0]=nod[p][1]=0; nod[p].val[0]=nod[p].mn[0]=f+x+y; nod[p].val[1]=nod[p].mn[1]=f-x+y; nod[p].val[2]=nod[p].mn[2]=f+x-y; nod[p].val[3]=nod[p].mn[3]=f-x-y; return p; } inline pii SplitKey(ci u,ci key){ if(!u) return make_pair(0,0); PushDown(u); if(nod[u].key<=key){ pii res=SplitKey(nod[u][1],key); nod[u][1]=res.first,PushUp(u); res.first=u; return res; } else{ pii res=SplitKey(nod[u][0],key); nod[u][0]=res.second,PushUp(u); res.second=u; return res; } } inline int Merge(ci u,ci v){ if(!u || !v) return u|v; PushDown(u),PushDown(v); if(nod[u].fix>nod[v].fix){ nod[u][1]=Merge(nod[u][1],v); PushUp(u); return u; } else{ nod[v][0]=Merge(u,nod[v][0]); PushUp(v); return v; } } void Insert(int &rt,ci x,ci y,cl f){ pii dv=SplitKey(rt,y); rt=Merge(dv.fir,Merge(NewNode(x,y,f),dv.sec)); } ll Query(int &rt,ci i,ci le,ci ri){ pii dv1=SplitKey(rt,ri), dv2=SplitKey(dv1.fir,le-1); ll res=dv2.sec? nod[dv2.sec].mn[i]:INF; rt=Merge(Merge(dv2.fir,dv2.sec),dv1.sec); return res; } ll Value(ci rt){ if(!rt) return INF; PushDown(rt); ll res=(nod[rt].val[0]+nod[rt].val[3])/2; if(nod[rt][0]) res=min(res,Value(nod[rt][0])); if(nod[rt][1]) res=min(res,Value(nod[rt][1])); return res; } } struct SEGTREE{ #define idx(l,r) (((l)+(r))|((l)!=(r))) int tr[N<<1]; ll add[N<<1]; void Update(ci le,ci ri,ll key){ if(tr[idx(le,ri)]) nod[tr[idx(le,ri)]].Update(key); add[idx(le,ri)]+=key; } void PushDown(ci le,ci ri){ int u=idx(le,ri),mi=(le+ri)>>1; if(!add[u]) return; Update(le,mi,add[u]),Update(mi+1,ri,add[u]); add[u]=0; } void Insert(ci le,ci ri,ci x,ci y,cl f){ TREAP::Insert(tr[idx(le,ri)],x,y,f); if(le==ri) return; PushDown(le,ri); int mi=(le+ri)>>1; if(x<=mi) Insert(le,mi,x,y,f); else Insert(mi+1,ri,x,y,f); } ll Query(ci le,ci ri,ci xL,ci xR,ci kL,ci kR,ci i){ if(xL>xR || kL>kR) return INF; if(xL<=le && ri<=xR) return TREAP::Query(tr[idx(le,ri)],i,kL,kR); PushDown(le,ri); int mi=(le+ri)>>1; if(xR<=mi) return Query(le,mi,xL,xR,kL,kR,i); if(mi<xL) return Query(mi+1,ri,xL,xR,kL,kR,i); return min(Query(le,mi,xL,xR,kL,kR,i),Query(mi+1,ri,xL,xR,kL,kR,i)); } void Build(ci le,ci ri){ tr[idx(le,ri)]=0;add[idx(le,ri)]=0; if(le==ri) return; int mi=(le+ri)>>1; Build(le,mi),Build(mi+1,ri); } ll Value(ci le,ci ri){return TREAP::Value(tr[idx(le,ri)]);} #undef idx }Se;
int eABS(ci x){return x<0? -x:x;} int Dist(ci a,ci b){return eABS(unx[pnt[a][0]-1]-unx[pnt[b][0]-1])+eABS(pnt[a][1]-pnt[b][1]);} void Init(){ unx.clear(); nnod=n=0; } void Input(){ n=io.xint(); for(int i=1;i<=n;i++){ pnt[i][0]=io.xint(),pnt[i][1]=io.xint(); unx.push_back(pnt[i][0]); } sort(unx.begin(),unx.end()); unx.erase(unique(unx.begin(),unx.end()),unx.end()); for(int i=1;i<=n;i++) pnt[i][0]=lower_bound(unx.begin(),unx.end(),pnt[i][0])-unx.begin()+1; }
int main(){ cas=io.xint(); while(cas--){ Init(); Input(); int m=unx.size(); Se.Build(1,m); ll fi0=0; for(int i=0;i<n;i++){ ll res=min( min( Se.Query(1,m,pnt[i+1][0],m,pnt[i+1][1],M,0)-unx[pnt[i+1][0]-1]-pnt[i+1][1], Se.Query(1,m,1,pnt[i+1][0],pnt[i+1][1],M,1)+unx[pnt[i+1][0]-1]-pnt[i+1][1] ),min( Se.Query(1,m,pnt[i+1][0],m,0,pnt[i+1][1],2)-unx[pnt[i+1][0]-1]+pnt[i+1][1], Se.Query(1,m,1,pnt[i+1][0],0,pnt[i+1][1],3)+unx[pnt[i+1][0]-1]+pnt[i+1][1] ) ); if(i){ Se.Update(1,m,Dist(i,i+1)); Se.Insert(1,m,pnt[i][0],pnt[i][1],min(fi0,res)); fi0+=Dist(i,i+1); } } io.wint(min(Se.Value(1,m),fi0)); } return 0; }
|