hdu 2018 多校 第九场

jls的自闭场

1001 BPM136 差点首杀结果发现漏乘了一个系数还爆了ll，回来首杀就没了QAQQQ

/* ***********************************************
Author        :BPM136
Created Time  :2018/8/20 12:19:25
File Name     :1001.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<list>
#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 all(x) ((int) (x).size())
#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 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;

const int N = 81;

ll f[N*N][N][N];
int n,m,MOD;

int main() {
    int T;
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d%d",&n,&m,&MOD);
        clr(f,0);

        f[1][1][1]=n*m;
        rep(i,1,n*m-1) rep(j,1,min(i,n)) rep(k,1,min(i,m)) if(i<=j*k) {
            int leaf=j*k-i;
            if(leaf) f[i+1][j][k]=(f[i+1][j][k]+f[i][j][k]*leaf%MOD)%MOD;

            //col
            f[i+1][j][k+1]=(f[i+1][j][k+1]+f[i][j][k]*(m-k)*j%MOD)%MOD;
            //row
            f[i+1][j+1][k]=(f[i+1][j+1][k]+f[i][j][k]*(n-j)*k%MOD)%MOD;
        }
        cout<<f[n*m][n][m]<<endl;
    }
    return 0;
}

1002 BPM136 打了几个不同的版本然后不断用自己的暴力把自己疯狂hack，改了几次还是过了嘿嘿嘿（ 然后愉快的自闭10

/* ***********************************************
Author        :BPM136
Created Time  :2018/8/20 13:20:47
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<list>
#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 all(x) ((int) (x).size())
#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 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;

const int N = 2005;
const int MOD = 998244353;

int f[N][N];
int n,m,K;

int a[N][N];

char s[N];
ll sta_ans;
int sta_l,sta_r;

int add[N][N];
int minu[N][N];

int main() {
    int T;
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d%d",&n,&m,&K);
        rep(i,1,n) {
            scanf("%s",s+1);
            rep(j,1,m) if(s[j]=='1') a[i][j]=1; else a[i][j]=0;
            a[i][0]=-1;
        }


        clr(f,0); clr(add,0); clr(minu,0);
        rep(i,1,m) f[1][i]=1;
        rep(i,2,n) {
            sta_l=1,sta_r=0;
            sta_ans=0;
            rep(j,1,m) {
                while(sta_r<m && sta_r<j+K) {
                    sta_r++;
                    if(a[i-1][sta_r]!=a[i-1][sta_r-1]) {
                        sta_ans=sta_ans+f[i-1][sta_r];
                        add[i][j]+=f[i-1][sta_r];
                        if(sta_ans>MOD) sta_ans-=MOD;
                        if(add[i][j]>MOD) add[i][j]-=MOD;
                    } else {
                        sta_ans+=add[i-1][sta_r];
                        add[i][j]+=add[i-1][sta_r];
                        if(sta_ans>MOD) sta_ans-=MOD;
                        if(add[i][j]>MOD) add[i][j]-=MOD;
                    }
                }
                while(sta_l<sta_r && sta_l<j-K) {
                    sta_l++;
                    if(a[i-1][sta_l]!=a[i-1][sta_l-1]) {
                        sta_ans-=f[i-1][sta_l-1];
                        minu[i][j]+=f[i-1][sta_l-1];
                        if(sta_ans<0) sta_ans+=MOD;
                        if(minu[i][j]>MOD) minu[i][j]-=MOD;
                    } else {
                        sta_ans-=minu[i-1][sta_l];
                        minu[i][j]+=minu[i-1][sta_l];
                        if(sta_ans<0) sta_ans+=MOD;
                        if(minu[i][j]>MOD) minu[i][j]-=MOD;
                    }
                }
                f[i][j]=sta_ans;
            }
        }
        ll ans=0;
        rep(i,1,m) if(a[n][i]!=a[n][i-1]) {
            ans+=f[n][i];
            if(ans>MOD) ans-=MOD;
        } else {
            ans+=add[n][i];
            if(ans>MOD) ans-=MOD;
        }
        cout<<ans<<endl;
    }
    return 0;
}

1004 小洛洛 小甜甜 智障题然而大家一开始都不会QAQ

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <climits>

using namespace std;

void work(){
    long long a,b,c,aa,bb,cc;
    scanf("%lld%lld%lld",&a,&b,&c);
    scanf("%lld%lld%lld",&aa,&bb,&cc);

    long long down=(a+b+c);
    long long up=0;

    up+=aa*(c-b);
    up+=bb*(a-c);
    up+=cc*(b-a);

    long long g=__gcd(up,down);
    g=abs(g);
    up/=g;
    down/=g;

    if (down==1) printf("%lld
",up);
    else printf("%lld/%lld
",up,down);
}

int main(){
    int T;
    scanf("%d",&T);
    while (T--) work();
    return 0;
}

1010 有没有人告诉我为什么能直接取两个log啊？ 我们数分老师告诉我们不可以啊？ 取一个的话可以证明可以，但是两个的话绕不过一个e^(clnb)次方啊？ 是不是什么地方姿势不是很对啊。。。。

1011 小甜甜

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <climits>

using namespace std;

const int maxN=1e7+7;
const int mod=998244353;

long long fact[maxN],invf[maxN];
long long base[maxN];

long long poww(long long x,long long k){
    long long ret=1;
    while (k){
        if (k&1) ret=ret*x%mod;
        k>>=1;
        x=x*x%mod;
    }
    return ret;
}

void work(){
    int a,b,c,d;
    scanf("%d%d%d%d",&a,&b,&c,&d);

    long long ans=0;

    long long B=1;
    if (b>=1) B+=b;
    ans+=B*base[c];
    ans%=mod;

    ans+=base[b]-B;
    ans%=mod;
    
    if (d>=1) {
        ans+=base[c]*d;
        ans%=mod;
    }

    ans=ans*base[a]%mod;

    printf("%lld
",ans);
}

int main(){
    fact[0]=invf[0]=1;
    base[0]=1;
    for (int i=1;i<maxN;i++) fact[i]=fact[i-1]*i%mod,base[i]=base[i-1]*2%mod;
    invf[maxN-1]=poww(fact[maxN-1],mod-2);
    for (int i=maxN-2;i>0;i--) invf[i]=invf[i+1]*(i+1)%mod;

    int T;
    scanf("%d",&T);
    while (T--) work();
    return 0;
}