hdu5046
DLX模板(列可以覆盖多次,像数独那样的只能覆盖一次,把remove函数改一下就好了)
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
using namespace std;
typedef long long LL;
const int MaxM = 70;
const int MaxN = 70;
const int maxnode = MaxN * MaxM;
const int INF = 0x3f3f3f3f;
int N,K;
struct P
{
LL x,y;
}p[MaxN];
struct DLX
{
int n,m,size;
int U[maxnode],D[maxnode],R[maxnode],L[maxnode],Row[maxnode],Col[maxnode];
int H[MaxN],S[MaxM];
int ands,ans[MaxN];
void init(int _n,int _m)
{
n = _n;
m = _m;
for(int i = 0;i <= m;i++)
{
S[i] = 0;
U[i] = D[i] = i;
L[i] = i-1;
R[i] = i+1;
}
R[m] = 0; L[0] = m;
size = m;
for(int i = 1;i <= n;i++)
H[i] = -1;
}
void Link(int r,int c)
{
++S[Col[++size]=c];
Row[size] = r;
D[size] = D[c];
U[D[c]] = size;
U[size] = c;
D[c] = size;
if(H[r] < 0)H[r] = L[size] = R[size] = size;
else
{
R[size] = R[H[r]];
L[R[H[r]]] = size;
L[size] = H[r];
R[H[r]] = size;
}
}
void remove(int c)
{
for(int i = D[c];i != c;i = D[i])
L[R[i]] = L[i], R[L[i]] = R[i];
}
void resume(int c)
{
for(int i = U[c];i != c;i = U[i])
L[R[i]]=R[L[i]]=i;
}
bool v[maxnode];
int f()
{
int ret = 0;
for(int c = R[0];c != 0;c = R[c])v[c] = true;
for(int c = R[0];c != 0;c = R[c])
if(v[c])
{
ret++;
v[c] = false;
for(int i = D[c];i != c;i = D[i])
for(int j = R[i];j != i;j = R[j])
v[Col[j]] = false;
}
return ret;
}
bool Dance(int d)
{
if(d + f() > K)return false;
if(R[0] == 0)return d <= K;
int c = R[0];
for(int i = R[0];i != 0;i = R[i])
if(S[i] < S[c])
c = i;
for(int i = D[c];i != c;i = D[i])
{
remove(i);
for(int j = R[i];j != i;j = R[j])remove(j);
if(Dance(d+1))return true;
for(int j = L[i];j != i;j = L[j])resume(j);
resume(i);
}
return false;
}
}dlx;
LL D(int i,int j)
{
return abs(p[i].x-p[j].x)+abs(p[i].y-p[j].y);
}
bool solve(LL mid)
{
dlx.init(N,N);
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
if(D(i,j)<=mid)dlx.Link(i,j);
}
return dlx.Dance(0);
}
vector<LL> dis;
int main()
{
int T,cas=1;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&N,&K);
for(int i=1;i<=N;i++)scanf("%I64d%I64d",&p[i].x,&p[i].y);
dis.clear();
for(int i=1;i<=N;i++)
for(int j=i;j<=N;j++)
dis.push_back(D(i,j));
sort(dis.begin(),dis.end());
dis.erase(unique(dis.begin(),dis.end()),dis.end());
int l=0,r=dis.size()-1;
while(l<r)
{
int mid=l+(r-l)/2;
if(solve(dis[mid]))r=mid;
else l=mid+1;
}
printf("Case #%d: %I64d\n",cas++,dis[r]);
}
return 0;
}
刘汝佳的
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn=70*70;
int N,K;
vector<LL> dis;
struct P
{
LL x,y;
}p[maxn];
LL D(int i,int j)
{
return abs(p[i].x-p[j].x)+abs(p[i].y-p[j].y);
}
struct DLX
{
int n,sz;
int S[maxn];
int L[maxn],R[maxn],U[maxn],D[maxn];
int row[maxn],col[maxn];
int ansd,ans[maxn];
int hash[maxn];
void init(int n)
{
this->n=n;
for(int i=0;i<=n;i++)
{
U[i]=D[i]=i;
R[i]=i+1;
L[i]=i-1;
}
R[n]=0,L[0]=n;
sz=n+1;
memset(S,0,sizeof(S));
}
void addRow(int r,vector<int> colu)
{
int first=sz;
for(int i=0;i<colu.size();i++)
{
int c=colu[i];
L[sz]=sz-1;R[sz]=sz+1;
D[sz]=c,U[sz]=U[c];
D[U[c]]=sz,U[c]=sz;
row[sz]=r,col[sz]=c;
S[c]++,sz++;
}
R[sz-1]=first;L[first]=sz-1;
}
void remove(int c)
{
for(int i=D[c];i!=c;i=D[i])
L[R[i]]=L[i],R[L[i]]=R[i];
}
void restore(int c)
{
for(int i=U[c];i!=c;i=U[i])
L[R[i]]=R[L[i]]=i;
}
int ha()
{
memset(hash,0,sizeof(hash));
int cnt = 0;
for(int i=R[0];i!=0;i=R[i])
if(!hash[i])
{
cnt++;hash[i] = 1;
for(int j=D[i];j!=i;j=D[j])
for(int k=R[j];k!=j;k=R[k])
hash[col[k]] = 1;
}
return cnt;
}
bool dfs(int d)
{
if(d+ha()>K)return false;
if(R[0]==0)
{
ansd=d;
return d<=K;
}
int c=R[0];
for(int i=R[0];i!=0;i=R[i])
if(S[i]<S[c])c=i;
for(int i=D[c];i!=c;i=D[i])
{
remove(i);
ans[d]=row[i];
for(int j=R[i];j!=i;j=R[j])remove(j);
if(dfs(d+1))return true;
for(int j=L[i];j!=i;j=L[j])restore(j);
restore(i);
}
return false;
}
}dlx;
bool solve(LL mid)
{
vector<int> v;
dlx.init(N);
for(int i=1;i<=N;i++)
{
v.clear();
for(int j=1;j<=N;j++)
if(D(i,j)<=mid)v.push_back(j);
dlx.addRow(i,v);
}
return dlx.dfs(0);
}
int main()
{
int T,cas=1;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&N,&K);
for(int i=1;i<=N;i++)scanf("%I64d%I64d",&p[i].x,&p[i].y);
dis.clear();
for(int i=1;i<=N;i++)
for(int j=i;j<=N;j++)
dis.push_back(D(i,j));
sort(dis.begin(),dis.end());
dis.erase(unique(dis.begin(),dis.end()),dis.end());
int l=0,r=dis.size()-1;
while(l<r)
{
int mid=l+(r-l)/2;
if(solve(dis[mid]))r=mid;
else l=mid+1;
}
printf("Case #%d: %I64d\n",cas++,dis[r]);
}
return 0;
}
java二进制
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner read=new Scanner(System.in);
int T,cas=1;
BigInteger a,b,g;
T=read.nextInt();
while(T-->0){
a=read.nextBigInteger(2);
b=read.nextBigInteger(2);
g=a.gcd(b);
System.out.println("Case #"+(cas++)+": "+g.toString(2));
}
}
}
树链剖分学习之后再加上
先写个LCA的
记录每个操作,最后从叶子到根网上遍历一遍,每次把要修改的值传上去就行了
对点u,v加w就是:add1[u]+=w,add1[v]+=w,x=lca(u,v),add[x]-=w(因为传上来两个w),因为到了x之后不能再往上传,设sub[x]+=x,每个点的add值减去sub值就是要往上传的值。
设add2[u]为u和fa[u]的边要增加的值,那么对边操作add2[u]+=w,add2[v]+=w,add2[x]-=2*w。
因为这题要按输入的顺序输出边的权值,那么还要记录u和u的父节点之间的边的编号。
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int maxn=100010;
typedef long long LL;
int N,M,num;
int deg[maxn],top[maxn];
int fa[maxn],dep[maxn];
LL node[maxn],edge[maxn];
LL add[maxn][2],des[maxn];
int anc[maxn][20];
char op[10];
struct Ed
{
int v,id;
Ed(){}
Ed(int x,int i):v(x),id(i){}
};
vector<Ed> g[maxn];
void dfs(int u,int depth,int f)
{
dep[u]=depth;
int len=g[u].size();
for(int i=0;i<len;i++)
{
int v=g[u][i].v;
if(v==f)continue;
deg[u]++;
fa[v]=u;
top[v]=g[u][i].id;
dfs(v,depth+1,u);
}
}
void process()
{
for(int i=1;i<=N;i++)
{
anc[i][0]=fa[i];
for(int j=1;(1<<j)<=N;j++)
anc[i][j]=-1;
}
for(int j=1;(1<<j)<=N;j++)
{
for(int i=1;i<=N;i++)
if(anc[i][j-1]!=-1)
{
int a=anc[i][j-1];
anc[i][j]=anc[a][j-1];
}
}
}
int LCA(int p,int q)
{
int tmp,log,i;
if(dep[p]<dep[q])swap(q,p);
for(log=0;(1<<log)<=dep[p];log++);
log--;
for(int i=log;i>=0;i--)
if(dep[p]-(1<<i)>=dep[q])p=anc[p][i];
if(p==q)return p;
for(int i=log;i>=0;i--)
{
if(anc[p][i]!=-1&&anc[p][i]!=anc[q][i])
p=anc[p][i],q=anc[q][i];
}
return fa[p];
}
void solve()
{
queue<int> q;
for(int i=1;i<=N;i++)
if(!deg[i])q.push(i);
while(!q.empty())
{
int x=q.front();q.pop();
node[x]=add[x][0];
add[x][0]-=des[x];
int f=fa[x];
add[f][0]+=add[x][0];
add[f][1]+=add[x][1];
edge[top[x]]=add[x][1];
if(!(--deg[f]))q.push(f);
}
}
template <class T>
inline bool scan_d(T &ret) {
char c; int sgn;
if(c=getchar(),c==EOF) return 0;
while(c!='-'&&(c<'0'||c>'9')) c=getchar();
sgn=(c=='-')?-1:1;
ret=(c=='-')?0:(c-'0');
while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
ret*=sgn;
return 1;
}
inline void out(long long x) {
if(x>9) out(x/10);
putchar(x%10+'0');
}
int main()
{
int T,cas=1;
scan_d(T);
while(T--)
{
scan_d(N);
scan_d(M);
for(int i=1;i<=N;i++)g[i].clear();
int u,v;
for(int i=1;i<=N-1;i++)
{
scan_d(u);
scan_d(v);
g[u].push_back(Ed(v,i));
g[v].push_back(Ed(u,i));
}
memset(deg,0,sizeof(deg));
memset(des,0,sizeof(des));
memset(add,0,sizeof(add));
memset(fa,0,sizeof(fa));
dfs(1,0,-1);
process();
int val;
while(M--)
{
scanf("%s",op);
scan_d(u);
scan_d(v);
scan_d(val);
int lca=LCA(u,v);
if(op[3]=='1')
{
add[u][0]+=val;
add[v][0]+=val;
add[lca][0]-=val;
des[lca]+=val;
}
else
{
add[u][1]+=val;
add[v][1]+=val;
add[lca][1]-=val*2;
}
}
solve();
printf("Case #%d:\n",cas++);
for(int i=1;i<=N;i++)
{
if(i>1)printf(" ");
out(node[i]);
}
puts("");
if(N==1)puts("");
else
{
for(int i=1;i<=N-1;i++)
{
if(i>1)printf(" ");
out(edge[i]);
}
puts("");
}
}
return 0;
}