2018 hdu 多校 第四场

1002 BPM136 莫队

/* ***********************************************
Author        :BPM136
Created Time  :2018/8/1 12:08:40
File Name     :1002.cpp
************************************************ */

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<queue>
#include<ctime>
#include<set>
#include<map>
#include<vector>
#include<cassert>
#include<functional>
#define pb push_back
#define popb pop_back
#define MID ((l+r)>>1)
#define LSON (k<<1)
#define RSON (k<<1|1)
#define get(a,i) ((a)&(1<<(i-1)))
#define PAU putchar(32)
#define ENT putchar(10)
#define clr(a,b) memset(a,b,sizeof(a))
#define rep(_i,_a,_b) for(int _i=(_a);_i<=(_b);_i++)
#define down(_i,_a,_b) for(int _i=(_a);_i>=(_b);_i--)
#define FOR(_i,_b) for(int _i=1;_i<=(_b);_i++)
#define efo(_i,_a) for(int _i=last[(_a)];_i!=0;_i=e[_i].next)
#define Remax(a,b) if(b>a) a=b;
#define Remin(a,b) if(b<a) a=b;
#define filein(x) freopen(#x".in","r",stdin)
#define fileout(x) freopen(#x".out","w",stdout)
#define file(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout);
#define mkd(x) freopen(#x".in","w",stdout);
#define setlargestack(x) int _SIZE=x<<20;char *_PPP=(char*)malloc(size)+_SIZE;__asm__("movl %0, %%esp
" :: "r"(_PPP));
#define END system("pause")
#define read2(a,b) read(a),read(b)
#define read3(a,b,c) read(a),read(b),read(c)
#define readg(_x1,_y1,_x2,_y2) read(_x1),read(_y1),read(_x2),read(_y2)
using namespace std;

typedef long long ll;
typedef double DB;
typedef long double LD;
typedef unsigned int  UI;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef set<int> SI;
typedef set<int , greater<int> > SIG;
typedef map<int, int > MII;
typedef map<int, int, greater<int> > MIIG;

namespace fastIO{  
    #define BUF_SIZE 100000  
    #define OUT_SIZE 100000  
    //fread->read  
    bool IOerror=0;  
    inline char nc(){  
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;  
        if (p1==pend){  
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);  
            if (pend==p1){IOerror=1;return -1;}  
            //{printf("IO error!
");system("pause");for (;;);exit(0);}  
        }  
        return *p1++;  
    }  
    inline bool blank(char ch){return ch==32||ch==10||ch==13||ch==9;}  
    inline bool enter(char ch){return ch==10||ch==13;}
    inline void read(int &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(ll &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(double &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (ch==46){  
            double tmp=1; ch=nc();  
            for (;ch>=48&&ch<=57;ch=nc())tmp/=10.0,x+=tmp*(ch-48);  
        }  
        if (sign)x=-x;  
    }  
    inline void read(char *s){  
        char ch=nc();  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch;  
        *s=0;  
    }  
    inline void read(char *s,bool f) {
        char ch=nc();
        for (;blank(ch);ch=nc());
        if(IOerror)return;
        for(;!enter(ch)&&!IOerror;ch=nc())*s++=ch;
        *s=0;
    }
    inline void read(char &c){  
        for (c=nc();blank(c);c=nc());  
        if (IOerror){c=-1;return;}  
    } 
#undef OUT_SIZE  
#undef BUF_SIZE  
}; using namespace fastIO;

const int N = 200005;
const ll MOD = 1e9 + 7;

ll inv[N];
ll fac[N];
ll fac_inv[N];
int T;

ll C(int n,int m) {
    return fac[n]*fac_inv[m]%MOD*fac_inv[n-m]%MOD;
}

struct ques {
    int n,m;
    ll ans;
    int id;
    int posl;
}q[N];
int bsz;

bool cmpq(ques a,ques b) {
    if(a.posl==b.posl) return a.n<b.n;
    return a.posl<b.posl;
}

bool cmpid(ques a,ques b) {
    return a.id<b.id;
}

void solve() {
    ll ans=1;
    for(int n=1,m=0,i=1;i<=T;i++) {
        for(;n<q[i].n;n++) {
            ans=ans*2-C(n,m);
            if(ans<0) ans+=MOD;
            if(ans>=MOD) ans-=MOD;
        }
        for(;n>q[i].n;n--) ans=(ans+C(n-1,m))*inv[2]%MOD;
        for(;m<q[i].m;m++) {
            ans=ans+C(n,m+1);
            if(ans>MOD) ans-=MOD;
        }
        for(;m>q[i].m;m--) {
            ans=ans-C(n,m);
            if(ans<0) ans+=MOD;
        }

        q[i].ans=ans;
    }
}

int main() {
    inv[0]=fac[0]=1; inv[1]=1;
    rep(i,1,N-1) fac[i]=fac[i-1]*i%MOD;
    rep(i,2,N-1) inv[i]=(MOD-MOD/i)*inv[MOD%i]%MOD;
    fac_inv[0]=1; rep(i,1,N-1) fac_inv[i]=fac_inv[i-1]*inv[i]%MOD;
    scanf("%d",&T);
    bsz=sqrt(T)+1;
    rep(i,1,T) {
        scanf("%d%d",&q[i].n,&q[i].m);
        q[i].id=i;
        q[i].posl=(q[i].m-1)/bsz+1;
    }
    sort(q+1,q+T+1,cmpq);
    solve();
    sort(q+1,q+T+1,cmpid);

    rep(i,1,T) printf("%lld
",q[i].ans);
    return 0;
}

1004 BPM136 垃圾题（小声bb

/* ***********************************************
Author        :BPM136
Created Time  :2018/8/1 12:39:04
File Name     :1004.cpp
************************************************ */

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<queue>
#include<ctime>
#include<set>
#include<map>
#include<vector>
#include<cassert>
#include<functional>
#define pb push_back
#define popb pop_back
#define MID ((l+r)>>1)
#define LSON (k<<1)
#define RSON (k<<1|1)
#define get(a,i) ((a)&(1<<(i-1)))
#define PAU putchar(32)
#define ENT putchar(10)
#define clr(a,b) memset(a,b,sizeof(a))
#define rep(_i,_a,_b) for(int _i=(_a);_i<=(_b);_i++)
#define down(_i,_a,_b) for(int _i=(_a);_i>=(_b);_i--)
#define FOR(_i,_b) for(int _i=1;_i<=(_b);_i++)
#define efo(_i,_a) for(int _i=last[(_a)];_i!=0;_i=e[_i].next)
#define Remax(a,b) if(b>a) a=b;
#define Remin(a,b) if(b<a) a=b;
#define filein(x) freopen(#x".in","r",stdin)
#define fileout(x) freopen(#x".out","w",stdout)
#define file(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout);
#define mkd(x) freopen(#x".in","w",stdout);
#define setlargestack(x) int _SIZE=x<<20;char *_PPP=(char*)malloc(size)+_SIZE;__asm__("movl %0, %%esp
" :: "r"(_PPP));
#define END system("pause")
#define read2(a,b) read(a),read(b)
#define read3(a,b,c) read(a),read(b),read(c)
#define readg(_x1,_y1,_x2,_y2) read(_x1),read(_y1),read(_x2),read(_y2)
using namespace std;

typedef long long ll;
typedef double DB;
typedef long double LD;
typedef unsigned int  UI;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef set<int> SI;
typedef set<int , greater<int> > SIG;
typedef map<int, int > MII;
typedef map<int, int, greater<int> > MIIG;

namespace fastIO{  
    #define BUF_SIZE 100000  
    #define OUT_SIZE 100000  
    //fread->read  
    bool IOerror=0;  
    inline char nc(){  
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;  
        if (p1==pend){  
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);  
            if (pend==p1){IOerror=1;return -1;}  
            //{printf("IO error!
");system("pause");for (;;);exit(0);}  
        }  
        return *p1++;  
    }  
    inline bool blank(char ch){return ch==32||ch==10||ch==13||ch==9;}  
    inline bool enter(char ch){return ch==10||ch==13;}
    inline void read(int &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(ll &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(double &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (ch==46){  
            double tmp=1; ch=nc();  
            for (;ch>=48&&ch<=57;ch=nc())tmp/=10.0,x+=tmp*(ch-48);  
        }  
        if (sign)x=-x;  
    }  
    inline void read(char *s){  
        char ch=nc();  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch;  
        *s=0;  
    }  
    inline void read(char *s,bool f) {
        char ch=nc();
        for (;blank(ch);ch=nc());
        if(IOerror)return;
        for(;!enter(ch)&&!IOerror;ch=nc())*s++=ch;
        *s=0;
    }
    inline void read(char &c){  
        for (c=nc();blank(c);c=nc());  
        if (IOerror){c=-1;return;}  
    } 
#undef OUT_SIZE  
#undef BUF_SIZE  
}; using namespace fastIO;

ll a[10000];


ll Ceil(ll sum,ll k) {
    ll ret=sum/k;
    if(sum%k) ret++;
    return ret;
}

int main() {
    ll T;
    read(T);
    while(T--) {
        ll n,m;
        read2(n,m);
        rep(i,1,n) {
            ll x,y;
            read2(x,y);
            a[i]=y;
        }
        sort(a+1,a+n+1);
        ll sum=m,ans=0;
        rep(i,1,n) {
            if(sum<a[i]+1) break;
            sum/=(a[i]+1);
            ans++;
        }
        printf("%lld
",ans);
    }
    return 0;
}

1005 BPM136 发现每2n*2n的矩阵都是相同的，所以熔池一下就好了qaq

/* ***********************************************
Author        :BPM136
Created Time  :2018/8/1 14:43:40
File Name     :1005.cpp
************************************************ */

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<queue>
#include<ctime>
#include<set>
#include<map>
#include<vector>
#include<cassert>
#include<functional>
#define pb push_back
#define popb pop_back
#define MID ((l+r)>>1)
#define LSON (k<<1)
#define RSON (k<<1|1)
#define get(a,i) ((a)&(1<<(i-1)))
#define PAU putchar(32)
#define ENT putchar(10)
#define clr(a,b) memset(a,b,sizeof(a))
#define rep(_i,_a,_b) for(int _i=(_a);_i<=(_b);_i++)
#define down(_i,_a,_b) for(int _i=(_a);_i>=(_b);_i--)
#define FOR(_i,_b) for(int _i=1;_i<=(_b);_i++)
#define efo(_i,_a) for(int _i=last[(_a)];_i!=0;_i=e[_i].next)
#define Remax(a,b) if(b>a) a=b;
#define Remin(a,b) if(b<a) a=b;
#define filein(x) freopen(#x".in","r",stdin)
#define fileout(x) freopen(#x".out","w",stdout)
#define file(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout);
#define mkd(x) freopen(#x".in","w",stdout);
#define setlargestack(x) int _SIZE=x<<20;char *_PPP=(char*)malloc(size)+_SIZE;__asm__("movl %0, %%esp
" :: "r"(_PPP));
#define END system("pause")
#define read2(a,b) read(a),read(b)
#define read3(a,b,c) read(a),read(b),read(c)
#define readg(_x1,_y1,_x2,_y2) read(_x1),read(_y1),read(_x2),read(_y2)
using namespace std;

typedef long long ll;
typedef double DB;
typedef long double LD;
typedef vector<int> VI;
typedef set<int> SI;
typedef set<int , greater<int> > SIG;
typedef map<int, int > MII;
typedef map<int, int, greater<int> > MIIG;

namespace fastIO{  
    #define BUF_SIZE 100000  
    #define OUT_SIZE 100000  
    //fread->read  
    bool IOerror=0;  
    inline char nc(){  
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;  
        if (p1==pend){  
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);  
            if (pend==p1){IOerror=1;return -1;}  
            //{printf("IO error!
");system("pause");for (;;);exit(0);}  
        }  
        return *p1++;  
    }  
    inline bool blank(char ch){return ch==32||ch==10||ch==13||ch==9;}  
    inline bool enter(char ch){return ch==10||ch==13;}
    inline void read(int &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(ll &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(double &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (ch==46){  
            double tmp=1; ch=nc();  
            for (;ch>=48&&ch<=57;ch=nc())tmp/=10.0,x+=tmp*(ch-48);  
        }  
        if (sign)x=-x;  
    }  
    inline void read(char *s){  
        char ch=nc();  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch;  
        *s=0;  
    }  
    inline void read(char *s,bool f) {
        char ch=nc();
        for (;blank(ch);ch=nc());
        if(IOerror)return;
        for(;!enter(ch)&&!IOerror;ch=nc())*s++=ch;
        *s=0;
    }
    inline void read(char &c){  
        for (c=nc();blank(c);c=nc());  
        if (IOerror){c=-1;return;}  
    } 
#undef OUT_SIZE  
#undef BUF_SIZE  
}; using namespace fastIO;

const int N = 105;

int M[N][N];
int A[N];
int L;
ll sum;

ll calc(ll x,ll y) {
    if(x<0 || y<0) return 0;
    ll numx=x/L+1;
    ll numy=y/L+1;
    ll dx=x%L;
    ll dy=y%L;
    ll ret=sum*(numx-1)*(numy-1);
    
    ll sumx=0;
    rep(i,0,dx) rep(j,0,L-1) sumx+=M[i][j];
    
    ll sumy=0;
    rep(i,0,L-1) rep(j,0,dy) sumy+=M[i][j];

    ret+=sumx*(numy-1)+sumy*(numx-1);

    rep(i,0,dx) rep(j,0,dy) ret+=M[i][j];
    return ret;
}

int t[1000][1000];
int main() {
    int T;
    read(T);
    while(T--) {
        int n;
        read(n);
        rep(i,0,n-1) read(A[i]);

        L=n*2;

        clr(M,0);
        int cursor = 0;
        for (int i = 0; i<L*3 ; ++i) {
            for (int j = 0; j <= i; ++j) { 
                if(j<L && i-j<L) M[j][i - j] = A[cursor];
                cursor = (cursor + 1) % n;
            }
        }
        sum=0;
        rep(i,0,L-1) rep(j,0,L-1) sum+=M[i][j];

        ll Q,x0,x1,y0,y1;
        read(Q);
        while(Q--) {
            readg(x0,y0,x1,y1);
            ll ans=calc(x0-1,y0-1)-calc(x0-1,y1)-calc(x1,y0-1)+calc(x1,y1);
            printf("%lld
",ans);
        }
    }
    return 0;
}

1007 BPM136 注意size使用的时候要转化成intQAQQQ

solve函数太恶心了最后偷偷去看了别人的= =

不过思路还是很明显的

#define FOR(_i,_b) for(int _i=1;_i<=(_b);_i++)
#define efo(_i,_a) for(int _i=last[(_a)];_i!=0;_i=e[_i].next)
#define Remax(a,b) if(b>a) a=b;
#define Remin(a,b) if(b<a) a=b;
#define SZ(x) ((int)(x).size())
#define filein(x) freopen(#x".in","r",stdin)
#define fileout(x) freopen(#x".out","w",stdout)
#define file(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout);
#define mkd(x) freopen(#x".in","w",stdout);
#define setlargestack(x) int _SIZE=x<<20;char *_PPP=(char*)malloc(size)+_SIZE;__asm__("movl %0, %%esp
" :: "r"(_PPP));
#define END system("pause")
#define read2(a,b) read(a),read(b)
#define read3(a,b,c) read(a),read(b),read(c)
#define readg(_x1,_y1,_x2,_y2) read(_x1),read(_y1),read(_x2),read(_y2)
using namespace std;

typedef long long ll;
typedef double DB;
typedef long double LD;
typedef unsigned int  UI;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef set<int> SI;
typedef set<int , greater<int> > SIG;
typedef map<int, int > MII;
typedef map<int, int, greater<int> > MIIG;

namespace fastIO{  
    #define BUF_SIZE 100000  
    #define OUT_SIZE 100000  
    //fread->read  
    bool IOerror=0;  
    inline char nc(){  
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;  
        if (p1==pend){  
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);  
            if (pend==p1){IOerror=1;return -1;}  
            //{printf("IO error!
");system("pause");for (;;);exit(0);}  
        }  
        return *p1++;  
    }  
    inline bool blank(char ch){return ch==32||ch==10||ch==13||ch==9;}  
    inline bool enter(char ch){return ch==10||ch==13;}
    inline void read(int &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(ll &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (sign)x=-x;  
    }  
    inline void read(double &x){  
        bool sign=0; char ch=nc(); x=0;  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        if (ch==45)sign=1,ch=nc();  
        for (;ch>=48&&ch<=57;ch=nc())x=x*10+ch-48;  
        if (ch==46){  
            double tmp=1; ch=nc();  
            for (;ch>=48&&ch<=57;ch=nc())tmp/=10.0,x+=tmp*(ch-48);  
        }  
        if (sign)x=-x;  
    }  
    inline void read(char *s){  
        char ch=nc();  
        for (;blank(ch);ch=nc());  
        if (IOerror)return;  
        for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch;  
        *s=0;  
    }  
    inline void read(char *s,bool f) {
        char ch=nc();
        for (;blank(ch);ch=nc());
        if(IOerror)return;
        for(;!enter(ch)&&!IOerror;ch=nc())*s++=ch;
        *s=0;
    }
    inline void read(char &c){  
        for (c=nc();blank(c);c=nc());  
        if (IOerror){c=-1;return;}  
    } 
#undef OUT_SIZE  
#undef BUF_SIZE  
}; using namespace fastIO;

const int N = 1000005;
const ll MOD = 1e9 + 7;

ll KSM(ll a,ll k) {
    ll ret=1%MOD;
    for(;k;k>>=1) {
        if(k&1) ret=ret*a%MOD;
        a=a*a%MOD;
    }
    return ret;
}

ll inv[N];
ll fac[N];
ll fac_inv[N];

VI E[N];
ll val[N];
ll val_inv[N];
int a[N];
int n;
ll ans;
int ind;

struct lowbit_tree {
    VI T;
    int n;
    void init(int _n) {
        n=_n;
        T.resize(n+1);
        rep(i,0,n) T[i]=0;
    }
    void add(int x,int val) {
        for(int i=x;i<=n;i+=i&-i) T[i]+=val;
    }
    ll sum(int x) {
        ll ret=0;
        if(x>n) x=n;
        for(int i=x;i>0;i-=i&-i) ret+=T[i];
        return ret;
    }
}t[N];

void prework() {
    inv[0]=fac[0]=inv[1]=fac_inv[0]=1;
    rep(i,1,N-1) fac[i]=fac[i-1]*i%MOD;
    rep(i,2,N-1) inv[i]=(MOD-MOD/i)*inv[MOD%i]%MOD;
    rep(i,1,N-1) fac_inv[i]=fac_inv[i-1]*inv[i]%MOD;
}

void init() {
    rep(i,1,n) E[i].clear();
    ans=0;
}

void dfs(int x,int pre) {
    sort(E[x].begin(),E[x].end());
    if(pre!=-1) E[x].erase(lower_bound(E[x].begin(),E[x].end(),pre));
    val[x]=fac[SZ(E[x])];
    for(auto v : E[x]) {
        dfs(v,x);
        val[x]=val[x]*val[v]%MOD;
    }
    val_inv[x]=KSM(val[x],MOD-2);
    t[x].init(SZ(E[x]));
    rep(i,0,SZ(E[x])-1) t[x].add(i+1,1);
}

/*
void dfs_(int x,int pre,int k) {
    ll mul=1;
    for(auto v : E[x]) mul=(mul*val[v])%MOD;

    if(lower_bound(E[x].begin(),E[x].end(),a[k+1])==E[x].end()) {
        ans=(ans+E[x].size()*fac[E[x].size()]%MOD*mul%MOD)%MOD;
        return ;
    }
    int cnt=lower_bound(E[x].begin(),E[x].end(),a[k+1])-E[x].begin();
    if(pre<a[k+1]) cnt--;
    ans=(ans+E[x].size()*fac[E[x].size()]*mul)%MOD;
    dfs_(a[k+1],a[k],k+1);
}
*/

bool solve(int x,int pre,ll _mul) {
    ll mul=1; ind++;
    for(auto v : E[x])  mul=mul*val[v]%MOD;
    rep(i,0,SZ(E[x])-1) {
        int dx=lower_bound(E[x].begin(),E[x].end(),a[ind+1])-E[x].begin();
        int cnt=t[x].sum(dx);
        ans=(ans+mul*fac[SZ(E[x])-i-1]%MOD*_mul%MOD*cnt%MOD)%MOD;
        if(dx==E[x].size() || E[x][dx]!=a[ind+1]) return 0;
        t[x].add(dx+1,-1);
        mul=mul*val_inv[E[x][dx]]%MOD;
        if(solve(E[x][dx], x, mul*fac[SZ(E[x])-i-1]%MOD*_mul%MOD)==0) return 0;
    }
    return 1;
}

int main() {
    prework();

    int T;
    read(T);
    while(T--) {
        read(n);

        init();

        rep(i,1,n) read(a[i]);
        rep(i,1,n-1) {
            int x,y;
            read2(x,y);
            E[x].pb(y);
            E[y].pb(x);
        }
        ll mul=1;
        rep(i,1,n) mul=(mul*fac[E[i].size()-1])%MOD;
        rep(i,1,a[1]-1) ans=(ans+mul*fac[E[i].size()]%MOD*fac_inv[E[i].size()-1]%MOD)%MOD;

        dfs(a[1],-1);
        //dfs_(a[1],n+1,1);
        ind=0;
        solve(a[1],-1,1);

        printf("%lld
",ans);
    }
    return 0;
}

1010 小洛洛

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdint>
using namespace std;

typedef uint16_t u16;

char s[16][17];
u16 tbl[4][4][4][2][4], room[4][4];

void rot_(u16 a[][4]) {
  u16 b[4][4];
  for(int i = 0; i < 4; ++i)
    for(int j = 0; j < 4; ++j)
      b[j][3 - i] = a[i][j];
  memcpy(a, b, sizeof b);
}

void load_room_(u16 arr[][2][4]) {
  for(int ifs = 0; ifs < 4; ++ifs, rot_(room)) {
    for(int i = 0; i < 4; ++i) {
      u16 row = 0;
      for(int j = 0; j < 4; ++j)
        row |= room[i][j];
      arr[ifs][0][i] = row;
    }
    for(int j = 0; j < 4; ++j) {
      u16 col = 0;
      for(int i = 0; i < 4; ++i)
        col |= room[i][j];
      arr[ifs][1][j] = col;
    }
  }
}

void load_() {
  for(int i = 0; i < 4; ++i)
    for(int j = 0; j < 4; ++j) {
      for(int x = 0; x < 4; ++x)
        for(int y = 0; y < 4; ++y) {
          char c = s[i * 4 + x][j * 4 + y];
          if('0' <= c && c <= '9')
            room[x][y] = 1u << (c - '0');
          else
            room[x][y] = 1u << (c - 'A' + 10);
        }
      load_room_(tbl[i][j]);
    }
}

int ans;
u16 row[16], col[16];

void dfs_(int ix, int iy, int cnt) {
  if(cnt >= ans) return;
  if(ix == 4 && iy == 0) {
    ans = cnt;
    return;
  }
  int nx, ny;
  if(iy == 3) nx = ix + 1, ny = 0;
  else nx = ix, ny = iy + 1;

  for(int ifs = 0; ifs < 4; ++ifs) {
    u16 (*blk)[4] = tbl[ix][iy][ifs];
    int i;
    for(i = 0; i < 4; ++i)
      if(row[ix * 4 + i] & blk[0][i])
        break;
      else
        row[ix * 4 + i] |= blk[0][i];
    if(i == 4) {
      int j;
      for(j = 0; j < 4; ++j)
        if(col[iy * 4 + j] & blk[1][j])
          break;
        else
          col[iy * 4 + j] |= blk[1][j];
      if(j == 4)
        dfs_(nx, ny, cnt + ifs);
      for(--j; j >= 0; --j)
        col[iy * 4 + j] ^= blk[1][j];
    }
    for(--i; i >= 0; --i)
      row[ix * 4 + i] ^= blk[0][i];
  }
}

int main() {
  int t;
  scanf("%d", &t);
  while(t--) {
    for(int i = 0; i < 16; ++i)
      scanf("%s", s[i]);
    load_();
    ans = 16 * 3;
    dfs_(0, 0, 0);
    printf("%d
", ans);
  }
  return 0;
}

1011 小洛洛

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

const int LEN = 505;
char s[LEN];

bool chk_(int n) {
  if(s[0] == '+' || s[0] == '*') return false;
  if(s[0] == '?') s[0] = '1';
  for(int i = 1; i < n; ++i) {
    if(s[i - 1] == '+' || s[i - 1] == '*') {
      if(s[i] == '+' || s[i] == '*')
        return false;
      else if(s[i] == '?')
        s[i] = '1';
    } else if(s[i - 1] == '0' &&
        (i - 1 == 0 || s[i - 2] == '+' || s[i - 2] == '*')) {
      if(s[i] >= '0' && s[i] <= '9')
        return false;
      else if(s[i] == '?')
        s[i] = '+';
    } else if(s[i] == '?')
      s[i] = '1';
  }
  if(s[n - 1] == '+' || s[n - 1] == '*') return false;
  return true;
}

int main() {
  int t;
  scanf("%d", &t);
  while(t--) {
    scanf("%s", s);
    int n = strlen(s);
    if(chk_(n))
      puts(s);
    else
      puts("IMPOSSIBLE");
  }
  return 0;
}

1012 小洛洛

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

const int N = 100002;
int w[N];

int main() {
  int t;
  scanf("%d", &t);
  while(t--) {
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; ++i)
      scanf("%d", w + i);
    double ans = sqrt((double)abs(w[0] - w[n - 1]));
    printf("%d
", (int)(ans + 1e-9));
  }
  return 0;
}