USACO 2018 February Contest
T1 Snow Boots
题目大意:Q个询问,询问一个长为N的序列有没有长度大于等于 di d i 的权值全部大于 vi v i 的子区间。
思路:将所有积雪按照深度排序,所有靴子按照承受深度排序,离线处理后,询问就变成了将一些积雪合并后有没有长度大于承受深度的区间。
采用双向链表实现。
1A
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<map>
#include<vector>
#include<ctime>
#include<stack>
#include<cctype>
#include<set>
#define mp make_pair
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned long long
using namespace std;
inline ll read()
{
long long f=1,sum=0;
char c=getchar();
while (!isdigit(c)){if (c=='-') f=-1;c=getchar();}
while (isdigit(c)){sum=sum*10+c-'0';c=getchar();}
return sum*f;
}
const int MAXN=100010;
struct node{
int next,pre;
};
node lk[MAXN];
struct node1{
int id,deep,len;
};
node1 a[MAXN],b[MAXN];
int cmp(const node1 a,const node1 b)
{
return a.deep<b.deep;
}
int ans[MAXN];
int main()
{
freopen("snowboots.in","r",stdin);
freopen("snowboots.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
scanf("%d",&a[i].deep),a[i].id=i;
for (int i=1;i<=m;i++)
scanf("%d%d",&b[i].deep,&b[i].len),b[i].id=i;
for (int i=1;i<=n;i++)
lk[i].pre=i-1,lk[i].next=i+1;
sort(a+1,a+1+n,cmp);
sort(b+1,b+1+m,cmp);
int j=n,maxx=1;
for (int i=m;i>=1;i--)
{
while (j>=1 && a[j].deep>b[i].deep)
{
lk[lk[a[j].id].next].pre=lk[a[j].id].pre;
lk[lk[a[j].id].pre].next=lk[a[j].id].next;
maxx=max(maxx,lk[a[j].id].next-lk[a[j].id].pre);
j--;
}
ans[b[i].id]=(b[i].len>=maxx);
}
for (int i=1;i<=m;i++)
printf("%d\n",ans[i]);
return 0;
}
T2 Directory Traversal
题目大意:给定一些文件和文件夹,按照给定的文件夹索引方式,求一个点文件夹,使得这个文件夹到所有文件的索引长度总和最短。
思路:很容易看出这是一棵树,所以很容易想到树形DP,统计一下每个点的子树有几个文件,推一下式子看看向上或向下会增加多少索引长度即可。
WA了一次,原因:答案的无穷大赋值小了。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<map>
#include<vector>
#include<ctime>
#include<stack>
#include<cctype>
#include<set>
#define mp make_pair
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned long long
using namespace std;
inline ll read()
{
long long f=1,sum=0;
char c=getchar();
while (!isdigit(c)){if (c=='-') f=-1;c=getchar();}
while (isdigit(c)){sum=sum*10+c-'0';c=getchar();}
return sum*f;
}
const int MAXN=100010;
struct edge{
int next,to;
};
edge e[MAXN*2];
int head[MAXN],cnt;
void addedge(int u,int v)
{
e[++cnt].next=head[u];
e[cnt].to=v;
head[u]=cnt;
}
bool isfile[MAXN];
int sz[MAXN],val[MAXN],tot;
ll dis[MAXN];
void dfs(int x)
{
for (int i=head[x];i;i=e[i].next)
{
int v=e[i].to;
dfs(v);
dis[x]+=dis[v]+(ll)sz[v]*(val[v]+(isfile[v]?0:1));
sz[x]+=sz[v];
}
if (isfile[x]) sz[x]++;
}
ll f[MAXN];
void get_ans(int x,ll dist)
{
f[x]=dis[x]+dist;
ll tmp=0;
for (int i=head[x];i;i=e[i].next)
{
int v=e[i].to;
tmp+=dis[v]+(ll)sz[v]*(val[v]+(isfile[v]?0:1));
}
for (int i=head[x];i;i=e[i].next)
{
int v=e[i].to;
get_ans(v,tmp+dist-(dis[v]+(ll)sz[v]*(val[v]+(isfile[v]?0:1)))+3*(tot-sz[v]));
}
}
char s[40];
int main()
{
freopen("dirtraverse.in","r",stdin);
freopen("dirtraverse.out","w",stdout);
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%s",s);
val[i]=strlen(s);
int num;
scanf("%d",&num);
if (!num) isfile[i]=1,tot++;
for (int j=1;j<=num;j++)
{
int x;
scanf("%d",&x);
addedge(i,x);
}
}
dfs(1);
get_ans(1,0);
ll ans=1e18;
for (int i=1;i<=n;i++)
if (!isfile[i])
ans=min(ans,f[i]);
cout<<ans;
return 0;
}
T3 Taming the Herd
题目大意:给定一个长为N的序列,已知该序列是由若干个从0开始的等差为1的等差数列组成。若干的取值范围是 1∼N 1 ∼ N ,求最少有几个位置和原序列不相等。
思路:注意到
N≤100
N
≤
100
,想到应该是个
n3,n4
n
3
,
n
4
的做法。
很容易想到DP。
设置一个很裸很裸的状态。
-
f[i][j]
f
[
i
]
[
j
]
表示
[i,j]
[
i
,
j
]
前i个数,有j次从0开始,最少几个不符合。
- 考虑转移,是从前一个0转移过来,故枚举转移的位置
k
k
,我们就需要知道这段区间若是一个等差数列有几个不相等,预处理一下,暴力转移,AC。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<map>
#include<vector>
#include<ctime>
#include<stack>
#include<cctype>
#include<set>
#define mp make_pair
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned long long
using namespace std;
inline ll read()
{
long long f=1,sum=0;
char c=getchar();
while (!isdigit(c)){if (c=='-') f=-1;c=getchar();}
while (isdigit(c)){sum=sum*10+c-'0';c=getchar();}
return sum*f;
}
const int MAXN=110;
int g[MAXN][MAXN],f[MAXN][MAXN];
int a[MAXN];
int main()
{
freopen("taming.in","r",stdin);
freopen("taming.out","w",stdout);
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
for (int i=1;i<=n;i++)
for (int j=i;j<=n;j++)
{
int tmp=0;
for (int k=i;k<=j;k++)
{
if (a[k]!=tmp)
g[i][j]++;
tmp++;
}
}
memset(f,inf,sizeof(f));
f[0][0]=0;
for (int i=1;i<=n;i++)
for (int j=1;j<=i;j++)
for (int k=0;k<i;k++)
f[i][j]=min(f[i][j],f[k][j-1]+g[k+1][i]);
for (int i=1;i<=n;i++)
printf("%d\n",f[n][i]);
return 0;
}