CF1043D

link

给定m个1到n的排列$S_i$，求这些排列有多少个非空公共子串。

算法1

显然可以在第i个排列和第i+1个排列之间插入n+i并连成一个串，然后用SAM求解出现了m次的子串个数。

然而这样会TLE。

算法2

发现几个结论（只需要考虑s1的每个子串）：

假设s1的一个子串是公共子串，那么它的每个子串都是。

假设s1两个有交集的子串是公共子串，那么它们的并集也是。

把s1划分成一些极长子串使得每个子串都是公共子串，那么所有满足条件的串都一定是其中一个子串的子串。

划分通过暴力判断就可以了

/*
Author: CNYALI_LK
LANG: C++
PROG: d.cpp
Mail: cnyalilk@vip.qq.com
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %lld\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %lld\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const ll inf=0x3f3f3f3f;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T>ll chkmin(T &a,T b){return a>b?a=b,1:0;}
template<class T>ll chkmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;}
template<class T>T mmax(T a,T b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>ll dcmp(T a,T b){return a>b;}
template<ll *a>ll cmp_a(ll x,ll y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
namespace io {
    const ll SIZE = (1 << 21) + 1;
    char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; ll f, qr;
    // getchar
    #define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
    // prll the remaining part
    inline void flush () {
        fwrite (obuf, 1, oS - obuf, stdout);
        oS = obuf;
    }
    // putchar
    inline void putc (char x) {
        *oS ++ = x;
        if (oS == oT) flush ();
    }
    // input a signed lleger
    inline void read (ll &x) {
        for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
        for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
    }
    inline void read (char &x) {
        x=gc();
    }
    inline void read(char *x){
        while((*x=gc())=='\n' || *x==' '||*x=='\r');
        while(!(*x=='\n'||*x==' '||*x=='\r'))*(++x)=gc();
    }
    template<typename A,typename ...B>
    inline void read(A &x,B &...y){
        read(x);read(y...);
    }
    // prll a signed lleger
    inline void write (ll x) {
        if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
        while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
        while (qr) putc (qu[qr --]);
    }
    inline void write (char x) {
        putc(x);
    }
    inline void write(const char *x){
        while(*x){putc(*x);++x;}
    }
    inline void write(char *x){
        while(*x){putc(*x);++x;}
    }
    template<typename A,typename ...B>
    inline void write(A x,B ...y){
        write(x);write(y...);
    }
    //no need to call flush at the end manually!
    struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
ll a[17][100005],qaq[17][100005],it[17];
int main(){
#ifdef cnyali_lk
    freopen("d.in","r",stdin);
    freopen("d.out","w",stdout);
#endif
    ll n,m,s=0;
    read(n,m);
    for(ll i=1;i<=m;++i)for(ll j=1;j<=n;++j){read(a[i][j]);qaq[i][a[i][j]]=j;}
    for(ll i=1,j;i<=n;i=j+1){
        j=i;
        for(ll k=2;k<=m;++k)it[k]=qaq[k][a[1][i]];
        int ok=1;
        while(1){
            if(j==n)break;
            for(ll k=2;k<=m;++k)if(a[k][it[k]+1]!=a[1][j+1])ok=0;
            if(!ok)break;
            for(ll k=2;k<=m;++k)++it[k];
            ++j;
        }
        s+=(j-i+1)*(j-i+2)>>1;
    }
    printf("%lld\n",s);
    return 0;
}