Luogu 考前模拟Round. 1

A.情书

题目：http://www.luogu.org/problem/show?pid=2264

赛中：sb题，直接暴力匹配就行了，注意一下读入和最后一句话的分句

赛后：卧槽 怎么只有40

B.小朋友的球

题目：http://www.luogu.org/problem/show?pid=1655

赛中：sb题，第二类斯特林数，加个高精度就行了，我还写了个暴力对拍

赛后：卧槽 怎么只有80 未知错误怎么回事儿啊

C.命运的彼方

题目：http://www.luogu.org/problem/show?pid=2263

赛中：sb题，poi2008砖块，splay维护中位数，加减数即可，数据范围有点大，算一下好像也能过？

赛后：卧槽 怎么CE了 又交了4、5遍 怎么还是CE bzoj还能A啊

1.5h交完3t，然后坐等AK。。。

最后知道真相的我眼泪掉下来。。。

我已无力吐槽luogu。。。

3道sb题，结果一半分都没有，是我太sb还是我太sb。。。

明信片再见。。。

UPD:t2 数据出错

t3 long long 的常数需要在后面加 ll  。。。

luogu为何连CE都不报，以后还能不能快乐地做比赛了T_T

UPD:还是贴上代码吧。。。

A

 #include<cstdio>
 #include<cstdlib>
 #include<cmath>
 #include<cstring>
 #include<algorithm>
 #include<iostream>
 #include<vector>
 #include<map>
 #include<set>
 #include<queue>
 #include<string>
 #define inf 1000000000
 #define maxn 500+100
 #define maxm 500+100
 #define eps 1e-10
 #define ll long long
 #define pa pair<int,int>
 #define for0(i,n) for(int i=0;i<=(n);i++)
 #define for1(i,n) for(int i=1;i<=(n);i++)
 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
 #define mod 1000000007
 using namespace std;
 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}
     return x*f;
 }
 string a[],b[];
 inline bool find(int x,int y)
 {
     int l1=a[x].length(),l2=b[y].length();
     for0(i,l2-l1)
      {
          int j=i,k=;
          while(a[x][k]==b[y][j])k++,j++;
          if(k<l1-)continue;
          return ;
      }
     return ;
 }
 int main()
 {
     freopen("input.txt","r",stdin);
     freopen("output.txt","w",stdout);
     int n=read();
     for1(i,n+)
     {
         getline(cin,a[i]);
         int l=a[i].length();
         for0(j,l-)if(a[i][j]>='A'&&a[i][j]<='Z')a[i][j]+='a'-'A';
     }
     int m=;
     for0(i,a[n+].length()-)
     {
         if(a[n+][i]=='.')m++;
         b[m]=b[m]+a[n+][i];
     }
     m--;
     int ans=;
     for1(i,n)
      for1(j,m)
       if(find(i,j))ans++;
     printf("%d\n",ans);
     return ;
 }

B

 #include<cstdio>
 #include<cstdlib>
 #include<cmath>
 #include<cstring>
 #include<algorithm>
 #include<iostream>
 #include<vector>
 #include<map>
 #include<set>
 #include<queue>
 #include<string>
 #define inf 1000000000
 #define maxn 500
 #define maxm 500+100
 #define eps 1e-10
 #define ll long long
 #define pa pair<int,int>
 #define for0(i,n) for(int i=0;i<=(n);i++)
 #define for1(i,n) for(int i=1;i<=(n);i++)
 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
 #define mod 10000
 using namespace std;
 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}
     return x*f;
 }
 class bigg
 {
 public:
     int num[maxn],len;
     bigg(){memset(num,,sizeof(num));len=;}
     bigg operator =(const bigg &b)
     {
         memset(num,,sizeof(num));
         len=b.len;
         for1(i,len)num[i]=b.num[i];
         return (*this);
     }
     bigg operator =(int b)
     {
         memset(num,,sizeof(num));len=;
         while(b)num[++len]=b%mod,b/=mod;
         return (*this);
     }
     bigg operator *(int b)
     {
         bigg ans;
         ans.len=len;
         for1(i,len)ans.num[i]=num[i];
         int x=;
         for1(i,len)
         {
             x+=ans.num[i]*b;
             ans.num[i]=x%mod;
             x/=mod;
         }
         if(x)ans.num[++ans.len]=x;
         return ans;
     }
     bigg operator +(const bigg &b)
     {
         bigg ans;ans=;
         ans.len=max(len,b.len);
         for1(i,ans.len)
         {
             ans.num[i]+=num[i]+b.num[i];
             ans.num[i+]=ans.num[i]/mod;
             ans.num[i]%=mod;
         }
         if(ans.num[ans.len+])ans.len++;
         return ans;
     }
     void print()
     {
         printf("%d",num[len]);
         for3(i,len-,)printf("%04d",num[i]);printf("\n");
     }
 };
 bigg f[][];
 int main()
 {
     freopen("input.txt","r",stdin);
     freopen("output.txt","w",stdout);
     for1(i,)f[i][]=;
     for2(i,,)
      for2(j,,i)
       f[i][j]=f[i-][j]*j+f[i-][j-];
     int n,m;
     while(cin>>n>>m)f[n][m].print();
     return ;
 }

C

 #include<cstdio>
 #include<cstdlib>
 #include<cmath>
 #include<cstring>
 #include<algorithm>
 #include<iostream>
 #include<vector>
 #include<map>
 #include<set>
 #include<queue>
 #include<string>
 #define inf 1000000000000000ll
 #define maxn 1500000
 #define eps 1e-10
 #define ll long long
 #define pa pair<int,int>
 #define for0(i,n) for(int i=0;i<=n;i++)
 #define for1(i,n) for(int i=1;i<=n;i++)
 #define for2(i,x,y) for(int i=x;i<=y;i++)
 using namespace std;
 inline ll read()
 {
     ll x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}
     return x*f;
 }
 int fa[maxn],c[maxn][],n,k,tot=,rt=;
 ll sum[maxn],s[maxn],v[maxn],a[maxn];
 inline void pushup(int x)
 {
     int l=c[x][],r=c[x][];
     s[x]=s[l]+s[r]+;
     sum[x]=sum[l]+sum[r]+v[x];
 }
 inline void rotate(int x,int &k)
 {
     int y=fa[x],z=fa[y],l=c[y][]==x,r=l^;
     if(y==k)k=x;else c[z][c[z][]==y]=x;
     fa[x]=z;fa[y]=x;fa[c[x][r]]=y;
     c[y][l]=c[x][r];c[x][r]=y;
     pushup(y);pushup(x);
 }
 inline void splay(int x,int &k)
 {
     while(x!=k)
      {
         int y=fa[x],z=fa[y];
         if(y!=k)
          {
             if(c[z][]==y^c[y][]==x)rotate(x,k);else rotate(y,k);
          }
         rotate(x,k);
      }
 }
 inline void ins(int &k,int kk,ll x)
 {
     if(!k)
     {
         k=++tot;s[tot]=;fa[tot]=kk;v[tot]=sum[tot]=x;return;
     }
     s[k]++;
     if(x<=v[k])ins(c[k][],k,x);else ins(c[k][],k,x);
     pushup(k);
 }
 inline int find(int k,int x)
 {
     int l=c[k][],r=c[k][];
     if(s[l]+==x)return k;
     else if(s[l]>=x)return find(l,x);
     else return find(r,x-s[l]-);
 }
 inline int pos(int k,ll val)
 {
     if(v[k]==val)return k;
     else if(val<v[k])return pos(c[k][],val);
     else return pos(c[k][],val);
 }
 inline void del(ll val)
 {
     splay(pos(rt,val),rt);
     int x=c[rt][],y=c[rt][];
     while(c[x][])x=c[x][];
     while(c[y][])y=c[y][];
     splay(x,rt);splay(y,c[x][]);
     fa[c[y][]]=c[y][]=;
     pushup(y);pushup(x);
 }
 int main()
 {
     freopen("input.txt","r",stdin);
     freopen("output.txt","w",stdout);
     n=read();k=read();
     for1(i,n)a[i]=read();
     ins(rt,,-);ins(rt,,1000000000001ll);
     for1(i,k-)ins(rt,,a[i]),splay(i+,rt);
     ll ans=inf,x,y;
     for1(i,n-k+)
      {
         ins(rt,,a[i+k-]);splay(i+k+,rt);
         x=find(rt,(s[rt]>>)+);y=v[x];
         splay(x,rt);
         ans=min(ans,s[c[x][]]*y-sum[c[x][]]+sum[c[x][]]-s[c[x][]]*y);
         del(a[i]);
         if(ans==1000000000002ll)break;
      }
     cout<<ans-1000000000002ll<<endl;
     return ;
 }