编程思路:
以bitset的01表示来代替此维有多少符合偏序,最后取k维偏序的交集即是答案
使用分块加速原理,可以根据此维数字大小排名来分块预处理每一小块,查询时使用二分得到快速定位属于的块号,最后再暴力计算剩余的<=sqrt(n)个数字
模板代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 50010;
int n,k,block,num,belong[maxn],l[maxn],r[maxn],f[10][maxn];
pair<int,int>val[10][maxn];
bitset<maxn>bset[10][210];
LL ans;
int bin( int p , int x )
{
int l=1,r=n;
while ( l<=r )
{
int mid = (l+r)>>1;
if ( val[p][mid].first<=x ) l = mid+1;
else r = mid-1;
}
return r;
}
bitset<maxn> getbset( int p , int x )
{
bitset<maxn>res; res.reset();
int pp = bin( p , x );
if ( pp<=0 ) return res;
int pre = pp/block;
int st = pre*block+1;
res = bset[p][pre];
for ( int i=st ; i<=pp ; i++ )
res.set( val[p][i].second );
return res;
}
void solve()
{
bitset<maxn>res;
for ( int i=1 ; i<=n ; i++ )
{
res.set();
for ( int j=0 ; j<=k ; j++ )
res&=getbset( j , f[j][i]-1 );
ans += res.count();
}
}
int main()
{
//freopen( "partial_order_plus.in" , "r" , stdin );
//freopen( "partial_order_plus.out" , "w" , stdout );
scanf ( "%d%d" , &n , &k ); block = sqrt(n+0.1);
for ( int i=1 ; i<=n ; i++ ) val[0][i] = make_pair( f[0][i]=i , i );
for ( int i=1 ; i<=k ; i++ )
for ( int j=1 ; j<=n ; j++ )
scanf ( "%d" , &f[i][j] ),val[i][j] = make_pair( f[i][j] , j );
for ( int i=1 ; i<=n ; i++ ) belong[i] = (i-1)/block+1; num = belong[n];
for ( int i=1 ; i<=num ; i++ ) l[i] = (i-1)*block+1,r[i] = i*block; r[num] = n;
for ( int i=0 ; i<=k ; i++ ) sort( val[i]+1 , val[i]+n+1 );
for ( int i=0 ; i<=k ; i++ ) bset[i][0].reset();
for ( int i=0 ; i<=k ; i++ )
for ( int j=1 ; j<=num ; j++ )
{
bset[i][j] = bset[i][j-1];
for ( int _=l[j] ; _<=r[j] ; _++ )
bset[i][j][val[i][_].second] = 1;
}
ans = 0; solve(); printf ( "%lld\n" , ans );
return 0;
}