https://acm.ecnu.edu.cn/contest/273/problem/C/
这题没注意到数据随机,于是第一反应三维偏序的一般都能cdq分治
然而下午一直wa4
晚上对拍找到了问题,发现cdq并不可行,问ecnu群里好像也没人想出cdq的方法
这题正解是因为数据随机,所以直接按照x+y+z排序,然后判断从前往后判断当前白细胞应该在哪层,
对于可以从(x1,y1,z1)可以挡住(x,y,z),x1+y1+z1<x+y+z,所以按找个排序,又因为数据随机,所以可以很快找到
试了一下大概2.5s左右,本题时限5s
然而其实还可以树套树,因为转移是去(1,y)(1,z)中找最大值,可以直接树状数组+线段树,外层树状数组,内层线段树,比cdq还好写一些。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxl=3e5+10;
int n,m,cas,k,xn,ynn,zn,tot,nn;
int b[maxl],tb[maxl],ans[maxl],rt[maxl];
ull ax[maxl],ay[maxl],az[maxl];
char s[maxl];
bool in[maxl];
struct que
{
ull x,y,z;
int id;
bool operator < (const que &b)const
{
if(x==b.x)
{
if(y==b.y)
return z<b.z;
return y<b.y;
}
return x<b.x;
}
bool operator == (const que &b)const
{
return x==b.x && y==b.y && z==b.z;
}
}q[maxl],aa[maxl];
struct node
{
int ls,rs,mx;
}tree[maxl*200];
ull k1,k2;
unsigned long long CoronavirusBeats() {
unsigned long long k3 = k1, k4 = k2;
k1 = k4;
k3 ^= k3 << 23;
k2 = k3 ^ k4 ^ (k3 >> 17) ^ (k4 >> 26);
return k2 + k4;
}
inline void prework()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
cin>>k1>>k2;
for(int i=1;i<=n;++i)
{
aa[i].x=CoronavirusBeats();
aa[i].y=CoronavirusBeats();
aa[i].z=CoronavirusBeats();
aa[i].id=i;
ax[i]=aa[i].x;
ay[i]=aa[i].y;
az[i]=aa[i].z;
}
sort(ax+1,ax+1+n);
sort(ay+1,ay+1+n);
sort(az+1,az+1+n);
xn=unique(ax+1,ax+1+n)-ax-1;
ynn=unique(ay+1,ay+1+n)-ay-1;
zn=unique(az+1,az+1+n)-az-1;
for(int i=1;i<=n;i++)
{
aa[i].x=lower_bound(ax+1,ax+1+xn,aa[i].x)-ax;
aa[i].y=lower_bound(ay+1,ay+1+ynn,aa[i].y)-ay;
aa[i].z=lower_bound(az+1,az+1+zn,aa[i].z)-az;
ans[i]=0;
}
sort(aa+1,aa+1+n);
nn=0;
q[++nn]=aa[1];
for(int i=2;i<=n;i++)
if(!(aa[i]==aa[i-1]))
q[++nn]=aa[i];
}
inline void upd(int &o,int id,int val,int L,int R)
{
if(!o)
{
o=++tot;
tree[o].mx=-1;
}
if(L==R)
{
tree[o].mx=max(tree[o].mx,val);
return;
}
int mid=(L+R)>>1;
if(id<=mid)
upd(tree[o].ls,id,val,L,mid);
else
upd(tree[o].rs,id,val,mid+1,R);
tree[o].mx=max(tree[tree[o].ls].mx,tree[tree[o].rs].mx);
}
inline void update(int y,int z,int val)
{
while(y<=ynn)
{
upd(rt[y],z,val,1,zn);
y+=y&-y;
}
}
inline int qry(int &o,int l,int r,int L,int R)
{
int ret=-1;
if(o==0)
return -1;
if(l==L && r==R)
return tree[o].mx;
int mid=(L+R)>>1;
if(r<=mid)
ret=qry(tree[o].ls,l,r,L,mid);
else if(l>mid)
ret=qry(tree[o].rs,l,r,mid+1,R);
else
{
ret=qry(tree[o].ls,l,mid,L,mid);
ret=max(ret,qry(tree[o].rs,mid+1,r,mid+1,R));
}
return ret;
}
inline int query(int y,int z)
{
int ret=-1;
while(y)
{
ret=max(ret,qry(rt[y],1,z,1,zn));
y-=y&-y;
}
return ret;
}
inline void mainwork()
{
tree[0].mx=-1;
for(int i=1;i<=nn;i++)
{
ans[q[i].id]=query(q[i].y,q[i].z)+1;
update(q[i].y,q[i].z,ans[q[i].id]);
}
}
inline void print()
{
for(int i=2;i<=n;i++)
if(aa[i]==aa[i-1])
ans[aa[i].id]=ans[aa[i-1].id];
int mx=0;
for(int i=1;i<=n;i++)
mx=max(mx,ans[i]+1);
printf("%d\n",mx);
for(int i=1;i<=n;i++)
printf("%d%c",ans[i],(i==n)?'\n':' ');
}
int main()
{
int t=1;
//scanf("%d",&t);
for(cas=1;cas<=t;cas++)
{
prework();
mainwork();
print();
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxl=3e5+10;
int n,m,cas,k,xn,ynn,zn,tot,nn;
int b[maxl],tb[maxl],ans[maxl];
ull ax[maxl],ay[maxl],az[maxl];
char s[maxl];
bool in[maxl];
struct que
{
ull x,y,z;
int id;
}q[maxl],t[maxl],aa[maxl];
vector <que> vv[maxl];
ull k1,k2;
unsigned long long CoronavirusBeats() {
unsigned long long k3 = k1, k4 = k2;
k1 = k4;
k3 ^= k3 << 23;
k2 = k3 ^ k4 ^ (k3 >> 17) ^ (k4 >> 26);
return k2 + k4;
}
inline bool cmp(const que &a,const que &b)
{
return a.x+a.y+a.z<b.x+b.y+b.z;
}
inline void prework()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
cin>>k1>>k2;
for(int i=1;i<=n;++i)
{
aa[i].x=CoronavirusBeats();
aa[i].y=CoronavirusBeats();
aa[i].z=CoronavirusBeats();
aa[i].id=i;
ax[i]=aa[i].x;
ay[i]=aa[i].y;
az[i]=aa[i].z;
}
sort(ax+1,ax+1+n);
sort(ay+1,ay+1+n);
sort(az+1,az+1+n);
xn=unique(ax+1,ax+1+n)-ax-1;
ynn=unique(ay+1,ay+1+n)-ay-1;
zn=unique(az+1,az+1+n)-az-1;
for(int i=1;i<=n;i++)
{
aa[i].x=lower_bound(ax+1,ax+1+xn,aa[i].x)-ax;
aa[i].y=lower_bound(ay+1,ay+1+ynn,aa[i].y)-ay;
aa[i].z=lower_bound(az+1,az+1+zn,aa[i].z)-az;
ans[i]=0;
}
sort(aa+1,aa+1+n,cmp);
}
inline void mainwork()
{
int now=0,id;
for(int i=1;i<=n;i++)
{
id=0;
for(int j=now;j>=0;j--)
{
for(que d:vv[j])
if(d.x<=aa[i].x && d.y<=aa[i].y && d.z<=aa[i].z)
{
id=j+1;
break;
}
if(id>0)
break;
}
now=max(id,now);
ans[aa[i].id]=id;
vv[id].push_back(aa[i]);
}
}
inline void print()
{
int mx=0;
for(int i=1;i<=n;i++)
mx=max(mx,ans[i]+1);
printf("%d\n",mx);
for(int i=1;i<=n;i++)
printf("%d%c",ans[i],(i==n)?'\n':' ');
}
int main()
{
int t=1;
//scanf("%d",&t);
for(cas=1;cas<=t;cas++)
{
prework();
mainwork();
print();
}
return 0;
}