2019 Multi-University Training Contest 3

Distribution of books

这道题模型不熟练所以做不出来
首先二分答案，然后就是要分成k段，使得每一段的和小于等于x
定义$dp[i]$表示前i个最多能分多块
满足$dp[i]=dp[j]+1(sum[i]-sum[j]\le x)$
然后权值线段树维护就可以了

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 200010;
const ll inf = 2*1e14+1;
inline ll read()
{
  ll p=0; ll f=1; char ch=getchar();
  while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar();}
  while(ch>='0' && ch<='9'){p=p*10+(ch-'0'); ch=getchar();}
  return p*f;
}
ll a[N],sum[N],n,kk,dp[N];
ll b[N],blen;
map<ll,ll> mp;
ll lc[N<<2],rc[N<<2],rt,tot,c[N<<2];
void link(ll &u,ll L,ll R,ll k,ll x)
{
  if(!u) u=++tot,c[u] = -inf;
  if(L==R){c[u] = max(c[u] , x); return ;}
  ll mid=(L+R)>>1;
  if(k<=mid) link(lc[u],L,mid,k,x);
  else link(rc[u],mid+1,R,k,x);
  c[u] = max(c[lc[u]], c[rc[u]]);
}
ll qry(ll u,ll L,ll R,ll l,ll r)
{
  if(!u) return -inf;
  if(l>r) return -inf;
  if(L==l && R==r) return c[u];
  ll mid=(L+R)>>1;
  if(r<=mid) return qry(lc[u],L,mid,l,r);
  else if(l>mid) return qry(rc[u],mid+1,R,l,r);
  else return max(qry(lc[u],L,mid,l,mid) , qry(rc[u],mid+1,R,mid+1,r));
}
bool check(ll x)
{
  for(ll i=1;i<=tot;i++) lc[i] = rc[i] = 0; rt=tot=0;
  dp[0] = 0; link(rt,1,blen,mp[sum[0]],dp[0]);
  for(ll i=1;i<=n;i++)
  {
    ll y = lower_bound(b+1,b+blen+1,sum[i] - x) - b;
    dp[i] = qry(rt,1,blen,y,blen) + 1;
    if(dp[i] >= 0) link(rt,1,blen,mp[sum[i]],dp[i]);
    if(dp[i] >= kk) return 1;
  }return 0;
}
int main()
{
  ll T = read();
  while(T--)
  {
    n = read(); kk = read();
    for(ll i=1;i<=n;i++) a[i] = read(); a[0] = 0;
    blen = 0; sum[0] = 0; b[++blen] = sum[0]; for(ll i=1;i<=n;i++) b[++blen] = sum[i] = sum[i-1] + a[i];
    sort(b+1,b+blen+1); blen = unique(b+1,b+blen+1) - (b+1);
    mp.clear();
    for(ll i=1;i<=blen;i++) mp[b[i]] = i;
    // check(2);
    ll L = -inf; ll R = inf; ll ret;
    while(L<=R)
    {
      ll mid=(L+R)>>1;
      if(check(mid)) ret=mid,R=mid-1;
      else L=mid+1;
    }printf("%lld\n",ret);
  }
  return 0;
}

---

Fansblog

质数的密度决定了我们可以一个个枚举，然后有威尔逊定理：
$(p-1)!\equiv n-1(\mathrm{m}\mathrm{o}\mathrm{d}n)$
然后写个快速乘，快速幂，逆元，筛出1e7的质数就可以了

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e7+10;

inline ll read()
{
  ll p=0; ll f=1; char ch=getchar();
  while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar();}
  while(ch>='0' && ch<='9'){p=p*10+ch-'0'; ch=getchar();}
  return p*f;
}
int prime[N]; bool v[N]; int pri=0;
void get_prime()
{
  memset(v,1,sizeof(v)); v[1] = 0;
  for(int i=2;i<=(int)(1e7);i++)
  {
    if(v[i]) prime[++pri] = i;
    else
    {
      for(int j=1;(j<=pri) && (i*prime[j]<=(int)(1e7));j++)
      {
        v[i*prime[j]] = 0;
        if(i%prime[j] == 0) break;
      }
    }
  }
}
bool check(ll x)
{
  for(ll i=1;(i<=pri) && ((ll)prime[i] * prime[i] <= x);i++) if(x%prime[i]==0) return 0;

  return 1;
}
ll mul(ll x,ll y,ll mo)
{
  ll s=0;
  while(y)
  {
    if(y&1) s=(s+x)%mo;
    x = x * 2 % mo;
    y>>=1;
  }
  return s;
}
ll qpow(ll x,ll k,ll mo)
{
  ll s=1;
  while(k)
  {
    if(k&1) s=mul(s,x,mo);
    x=mul(x,x,mo); k>>=1;
  }return s;
}
int main()
{
  ll t = read(); get_prime();
  while(t--)
  {
    ll n = read(); ll s = n-1; ll inv = 1;
    for(ll i=n-1;i;i--)
    {
      // prllf("%lld %lld\n",s*inv%n,mul(s,inv,n));
      if(check(i))
      {
        // cout<<i<<":"<<endl;
        printf("%lld\n",mul(inv,s,n));
        
        break;
      }
      else inv = mul(inv,qpow(i,n-2,n),n);
    }
  }
  return 0;
}

---

Find the answer

一开始写了个带插入和删除的，被卡T了
发现直接写个权值线段树就可以艹过去了

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+10;
inline int read()
{
  char ch=getchar(); int p=0; int f=1;
  while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar();}
  while(ch>='0' && ch<='9'){p=p*10+(ch-'0'); ch=getchar();}
  return p*f;
}
ll sum[N<<2],num[N<<2]; int lc[N<<2],rc[N<<2],a[N],b[N],c[N]; int rt,tot; map<int,int> mp;
void link(int &u,int L,int R,int k)
{
  if(!u) u=++tot;
  if(L==R){sum[u] += c[k]; num[u] ++; return ;}
  int mid=(L+R)>>1;
  if(k<=mid) link(lc[u],L,mid,k);
  else link(rc[u],mid+1,R,k);
  sum[u] = sum[lc[u]] + sum[rc[u]];
  num[u] = num[lc[u]] + num[rc[u]];
}
ll qry(int u,int L,int R,ll s)
{
  if(L==R){if(s%c[L]==0) return s/c[L]; else return s/c[L]+1;}
  int mid=(L+R)>>1;
  if(sum[rc[u]] >= s) return qry(rc[u],mid+1,R,s);
  else return qry(lc[u],L,mid,s-sum[rc[u]]) + num[rc[u]];
}

int main()
{
  int T = read();
  while(T--)
  {
    int n = read(); int m = read();
    for(int i=1;i<=n;i++) b[i] = a[i] = read();
    rt=tot=0; memset(lc,0,sizeof(lc)); memset(rc,0,sizeof(rc));
    memset(num,0,sizeof(num)); memset(sum,0,sizeof(sum)); ll s = 0;
    sort(b+1,b+n+1); int l = 0; mp.clear();
    for(int i=1;i<=n;i++)
      if(!mp[b[i]]) mp[b[i]] = ++l,c[l]=b[i];
    
    for(int i=1;i<=n;i++)
    {
      ll x = a[i]; s+=x;
      if(s>m) printf("%lld ",qry(rt,1,l,s-m));
      else printf("0 ");
      link(rt,1,l,mp[x]);
    }
    printf("\n");
  }
  return 0;
}

---

K Subsequence

最长不下降子是经典的费用流的模型
写spfa被卡了。。。
问wcy学长，一手优化建边真妙
首先拆点，拆成出点和入点
每个点只和比当前点大的点连边，但是我们可以只和这些递减的大的点连边
然后与这些点连的时候，入点和出点连，入点和入点再连
入点和入点连是为了传递流量，还有可能隔开这个点不选选更大的点
反正是一个很好的模型记住

#include <bits/stdc++.h>
using namespace std;
const int N = 4010;
const int inf = 0x3f3f3f3f;
inline int read()
{
  int p=0; int f=1; char ch=getchar();
  while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar();}
  while(ch>='0' && ch<='9'){p=p*10+(ch-'0'); ch=getchar();}
  return p*f;
}
struct node
{
  int x,y,nex,c,other,d;
}edge[N*N*2]; int len,fir[N];
void ins(int x,int y,int c,int d)
{
  len++; int k1=len; edge[len].x=x; edge[len].y=y; edge[len].c=c; edge[len].d=d; edge[len].nex=fir[x]; fir[x]=len;
  len++; int k2=len; edge[len].x=y; edge[len].y=x; edge[len].c=0; edge[len].d=-d; edge[len].nex=fir[y]; fir[y]=len;
  edge[k1].other=k2; edge[k2].other=k1;
}
int s1,s2,d,a[N]; int dist[N]; queue<int>q; bool v[N]; int pre[N],pos[N];
bool spfa()
{
  while(!q.empty()) q.pop(); q.push(s1);
  for(int i=1;i<=d;i++) dist[i] = inf,v[i] = 0; dist[s1] = 0; v[s1] = 1;
  while(!q.empty())
  {
    int x = q.front();
    for(int k=fir[x];k!=-1;k=edge[k].nex)
    {
      int y = edge[k].y;
      if(dist[y] > dist[x] + edge[k].d && edge[k].c)
      {
        dist[y] = dist[x] + edge[k].d; pos[y] = x; pre[y] = k;
        if(!v[y]){v[y] = 1; q.push(y);}
      }
    }q.pop(); v[x] = 0;
  }
  return dist[d]!=inf;
}
int main()
{
  int T = read();
  while(T--)
  {
    int n = read(); int k = read(); s1 = n*2+1; s2 = n*2+2; d=s2+1;
    len = 0; memset(fir,-1,sizeof(fir));
    for(int i=1;i<=n;i++) ins(i*2-1,i*2,1,-(a[i]=read()));
    for(int i=1;i<=n;i++)
    {
      int q = inf;
      if(a[i] < q) ins(s2,i*2-1,inf,0),q=a[i];
    }
    for(int i=1;i<=n;i++) ins(i*2,d,1,0);
    for(int i=1;i<=n;i++)
    {
      int q = inf;
      for(int j=i+1;j<=n;j++)
      {
        if(a[i]<=a[j] && a[j] < q)
        {
          ins(i*2-1,j*2-1,inf,0);
          ins(i*2,j*2-1,1,0),q=a[j];
        }
      }
    }
    ins(s1,s2,k,0);
    
    int ans=0;
    while(spfa())
    {
      for(int i=d;i!=s1;i=pos[i]) ans+=edge[pre[i]].d,edge[pre[i]].c--,edge[edge[pre[i]].other].c++;
    }
    printf("%d\n",-ans);    
  }
  return 0;
}