475. 小妹妹快递公司的新址
BOJ 470 diffsum
一开始思路有问题,但是实在是没有成功构建出能够hack自己的数据
思路有两个
第一个是,峰神神奇的证明出了,答案是由数列从大到小排列后,以 n-1 为首项, 2 为公差的等差数列 为系数的和
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#define eps 1e-9
#define ll long long
using namespace std;
template<class T>
inline bool read(T &n)
{
T x = 0, tmp = 1; char c = getchar();
while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
if(c == EOF) return false;
if(c == '-') c = getchar(), tmp = -1;
while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
n = x*tmp;
return true;
}
//-----------------------------------------------------------------------
const int MAXN=100010;
int n,m;
int a[MAXN];
int main()
{
while(read(n))
{
ll temp=n-1;
ll ans=0,fusum=0,zhsum=0;
ll zhnum=0,funum=0;
for(int i=0;i<n;i++)
scanf("%lld",&a[i]);
if(n==1)
{
printf("0\n");continue;
}
sort(a,a+n);
for(int i=n-1;i>=0;i--)
{
ans+=temp*a[i];temp-=2;
}
printf("%lld\n",ans);
}
return 0;
}
第二个则是我的想法
将数列按照递增排序,改点的角标乘以改点的值减去改点的前缀和
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#define eps 1e-9
#define ll long long
using namespace std;
template<class T>
inline bool read(T &n)
{
T x = 0, tmp = 1; char c = getchar();
while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
if(c == EOF) return false;
if(c == '-') c = getchar(), tmp = -1;
while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
n = x*tmp;
return true;
}
//-----------------------------------------------------------------------
const int MAXN=100010;
ll a[MAXN];
ll sum[MAXN];
int main()
{
int n, m, t;
ll ans=0;
while(read(n))
{
ans=0;
for(int i=0;i<n;i++)
read(a[i]);
sort(a,a+n);
sum[0]=a[0];
for(int i=1;i<n;i++)
{
sum[i]=sum[i-1]+a[i];
ans=ans-sum[i-1]+a[i]*i;
}
printf("%lld\n",ans);
}
return 0;
}
BOJ 474 小妹妹送很多快递
最小生成树
在边权不为0的时候,答案加上(左边集合的元素个数)*(右边集合的元素个数)*(边权)
在边权为1的时候,将边权特判为1,继续上面操作
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#define INF 0x3f3f3f3f
#define ll long long
using namespace std;
template<class T>
inline bool read(T &n)
{
T x = 0, tmp = 1; char c = getchar();
while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
if(c == EOF) return false;
if(c == '-') c = getchar(), tmp = -1;
while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
n = x*tmp;
return true;
}
//-----------------------------------------------------------------------
const int MAXN=10010;
const int MAXE=100010;
struct Edge
{
int u,v,w;
}e[MAXE];
int n,m;
int fa[10010],rank[MAXN],sum[MAXN];
int tot;
int find_fa(int x)
{
if(fa[x]==x)
return x;
else
return fa[x]=find_fa(fa[x]);
}
void Merge(int x,int y)
{
if(rank[x]>rank[y])
{
fa[y]=x;
sum[x]+=sum[y];
}
else
{
fa[x]=y;
sum[y]+=sum[x];
if(rank[x]==rank[y])
rank[y]++;
}
}
bool cmp(Edge a,Edge b)
{
return a.w<b.w;
}
void Kruskal()
{
sort(e+1,e+m+1,cmp);
ll ans=0;
for(int i=1;i<=m;i++)
{
int xx=find_fa(e[i].u);
int yy=find_fa(e[i].v);
if(xx!=yy)
{
tot--;
if(!e[i].w)
ans+=2*sum[xx]*sum[yy];
else
ans+=2*sum[xx]*sum[yy]*e[i].w;
Merge(xx,yy);
}
}
printf("%lld\n",ans);
}
int main()
{
int T;
read(T);
while(T--)
{
read(n);read(m);
memset(rank,0,sizeof(rank));
tot=n;
for(int i=1;i<=n;i++)
fa[i]=i,sum[i]=1;
for(int i=1;i<=m;i++)
{
read(e[i].u);read(e[i].v);read(e[i].w);
}
Kruskal();
}
return 0;
}
BOJ 477 新来的小妹妹
模板题
维护后缀树
计算后缀树中最长重复子串的位置(即height数组)
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#define EPS 1e-10
#define INF 0x3f3f3f3f
#define ll long long
using namespace std;
template<class T>
inline bool read(T &n)
{
T x = 0, tmp = 1; char c = getchar();
while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
if(c == EOF) return false;
if(c == '-') c = getchar(), tmp = -1;
while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
n = x*tmp;
return true;
}
template <class T>
inline void write(T n) {
if(n < 0) {
putchar('-');
n = -n;
}
int len = 0,data[20];
while(n) {
data[len++] = n%10;
n /= 10;
}
if(!len) data[len++] = 0;
while(len--) putchar(data[len]+48);
}
//-----------------------------------------------------------------------
const int MAXN=200000;
void radix(int *str,int *a,int *b,int n,int m)
{
static int count[200000];
memset(count,0,sizeof(count));
for(int i=0;i<n;++i)
++count[str[a[i]]];
for(int i=1;i<=m;++i)
count[i]+=count[i-1];
for(int i=n-1;i>=0;--i)
b[--count[str[a[i]]]]=a[i];
}
void suffix_array(int *str,int *sa,int n,int m)
{
static int rank[200000],a[200000],b[200000];
for(int i=0;i<n;i++)
rank[i]=i;
radix(str,rank,sa,n,m);
rank[sa[0]]=0;
for(int i=1;i<n;i++)
rank[sa[i]]=rank[sa[i-1]]+(str[sa[i]]!=str[sa[i-1]]);
for(int i=0;1<<i <n;++i)
{
for(int j=0;j<n;++j)
{
a[j]=rank[j]+1;
b[j]=j +(1<<i)>=n? 0:rank[j+(1<<i)] +1;
sa[j]=j;
}
radix(b,sa,rank,n,n);
radix(a,rank,sa,n,n);
rank[sa[0]]=0;
for(int j=1;j<n;j++)
{
rank[sa[j]]=rank[sa[j-1]]+(a[sa[j-1]]!=a[sa[j]]||b[sa[j-1]]!=b[sa[j]]);
}
}
}
string duplicate_substr(string str)
{
string rev;
static int s[3000],sa[3000],rank[3000],h[3000];
int n=str.length();
copy(str.begin(),str.end(),s);
suffix_array(s,sa,n,256);
for(int i=0;i<n;++i)
rank[sa[i]]=i;
int k=0;
int ans1=0,pos1=0;
for(int i=0;i<n;i++)
{
k= k==0? 0:k-1;
while(rank[i]>0&&s[i+k]==s[sa[rank[i]-1]+k])
++k;
h[rank[i]]=k;
if(h[rank[i]]>ans1)
{
ans1=h[rank[i]];
pos1=i;
}
}
return str.substr(pos1,ans1);
}
int main()
{
int T;
read(T);
while(T--)
{
string s;
cin>>s;
s=duplicate_substr(s);
printf("%d\n",s.length());
}
return 0;
}
BOJ 476 学妹去搬砖
最简单的轮廓线DP之一
模板题
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#define eps 1e-9
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef complex<ld> point;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
template<class T>
inline bool read(T &n)
{
T x = 0, tmp = 1; char c = getchar();
while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
if(c == EOF) return false;
if(c == '-') c = getchar(), tmp = -1;
while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
n = x*tmp;
return true;
}
template <class T>
inline void write(T n)
{
if(n < 0)
{
putchar('-');
n = -n;
}
int len = 0,data[20];
while(n)
{
data[len++] = n%10;
n /= 10;
}
if(!len) data[len++] = 0;
while(len--) putchar(data[len]+48);
}
//-----------------------------------
const int MAXN=11;
const int MOD=1000000007;
int n,m,k;
ll dp[2][1<<MAXN];
int color[MAXN][MAXN];
void DP()
{
ll *crt=dp[0],*next=dp[1];
crt[0]=1;
for(int i=n-1;i>=0;i--)
{
for(int j=m-1;j>=0;j--)
{
for(int used=0;used< 1<<m;used++)
{
if((used>>j & 1)||color[i][j])
next[used]=crt[used & ~(1<<j)];
else
{
ll res=0;
if(j+1<m && !(used>>(j+1) & 1) && !color[i][j+1])
{
res+=crt[used | 1<<(j+1)];
}
if(i+1<n && !color[i+1][j])
{
res+=crt[used | 1<<j];
}
next[used]= res % MOD;
}
}
swap(crt,next);
}
}
printf("%lld\n",crt[0]);
}
int main()
{
while(read(n)&&read(m)&&read(k))
{
int x,y;
memset(color,0,sizeof(color));
memset(dp,0,sizeof(dp));
for(int i=1;i<=k;i++)
{
read(x);read(y);
color[x][y]=1;
}
DP();
}
return 0;
}
BOJ 475 小妹妹快递公司的新址
先求出该树的重心,然后以重心为根重新计算子孙的个数
同时,更新dp[ i ][ j ] (表示以 i 为根,有 j 个节点的子树的个数)状态转移为 dp
【father】【num】 + = ( dp【father】【num - k 】* dp【child】【k】)
计算出来以后就开始一个神奇的DP,DP的思路是birdsrom写的.....
</pre></div><pre name="code" class="cpp">#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#define eps 1e-9
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef complex<ld> point;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
template<class T>
inline bool read(T &n)
{
T x = 0, tmp = 1;
char c = getchar();
while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
if(c == EOF) return false;
if(c == '-') c = getchar(), tmp = -1;
while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
n = x*tmp;
return true;
}
template <class T>
inline void write(T n)
{
if(n < 0)
{
putchar('-');
n = -n;
}
int len = 0,data[20];
while(n)
{
data[len++] = n%10;
n /= 10;
}
if(!len) data[len++] = 0;
while(len--) putchar(data[len]+48);
}
//-----------------------------------
const int MAXN=222;
const int MOD=10007;
struct Edge
{
int to,next;
} e[MAXN*2];
int n,mi;
int head[MAXN],tot=0;
int son[MAXN],cen,pre[MAXN];
int dp[MAXN][MAXN],sum[MAXN],child[MAXN];
bool vis[MAXN];
void add(int u,int v)
{
e[tot].next=head[u];
e[tot].to=v;
head[u]=tot++;
e[tot].next=head[v];
e[tot].to=u;
head[v]=tot++;
}
int dfsson(int x)
{
int y,mx=0;
vis[x]=true;
son[x]=1;
for(int i=head[x];~i;i=e[i].next)
{
y=e[i].to;
if(vis[y])
continue;
int tm=dfsson(y);
mx=max(tm,mx),son[x]+=tm;
}
mx=max(mx,n-son[x]);
if (mx<mi)
{
mi=mx,cen=x;
}
return son[x];
}
int dfs(int x)
{
dp[x][0]=dp[x][1]=1;child[x]=1;//cout<<x<<" "<<pre[x]<<endl;system("pause");
for(int i=head[x];~i;i=e[i].next)
{
int y=e[i].to;
if(pre[y])
continue;
pre[y]=x;
;
child[x]+=dfs(y);
}
for(int i=head[x];~i;i=e[i].next)
{
int y=e[i].to;
if(pre[x]==y)
continue;
for(int i=child[x];i>=2;i--)
for(int j=1;j<i&&j<=child[y];j++)
dp[x][i]=(dp[x][i]+dp[y][j]*dp[x][i-j])%MOD;
}
return child[x];
}
int main()
{
int T;
// freopen("data.txt","r",stdin);
read(T);
while(T--)
{
memset(head,-1,sizeof(head));
memset(dp,0,sizeof(dp));
memset(pre,0,sizeof(pre));
memset(vis,false,sizeof(vis));
tot=0;
read(n);mi=n;
int u,v;
for(int i=0; i<n-1; i++)
{
read(u),read(v);
add(u,v);
}
dfsson(1);
pre[cen]=-1;
dfs(cen);//cout<<cen<<endl;
int ret=0,ans=0;
for(int i=1;i<=n;i++)
ans=(ans+dp[cen][i])%MOD;
ret=ans;
for(int k=head[cen];~k;k=e[k].next)
{
for(int i=0;i<=n;i++)
sum[i]=dp[cen][i];
int y=e[k].to;
for(int i=1;i<=n;i++)
for(int j=1;j<i;j++)
sum[i]=((sum[i]-sum[i-j]*dp[y][j])%MOD+MOD)%MOD;
//下面是birdstorm的思路,我实在是写不下去了
sum[0]=1;
for(int i=1;i<n;i++)
sum[i]=(sum[i-1]+sum[i+1])%MOD;
for(int i=1;i<=n;i++)
ret=((ret-dp[y][i]*sum[i-1])%MOD+MOD)%MOD;
}
printf("%d\n",(ans-ret+MOD)%MOD);
}
return 0;
}