Noip模拟题解题报告

Pro

题目链接

Sol

打包

模拟一下过程就可以想到是一个裸的01背包，而且还是要恰好装满的那种，所以打一个恰好装满的01背包即可。

注意：本题求最小值，所以初始值设为正无穷，然后更新答案。

#include<iostream>
#include<cstdio>
#include<cstring>
#define INF 2147483647
using namespace std;

long long n , m , a[105] , b[105] , f[100005] , g[100005] , ma , mb , mm , ans = INF;
inline long long mymax(long long x , long long y) { return x>y?x:y; }
inline long long mymin(long long x , long long y) { return x<y?x:y; }

int main() {
	freopen("packs.in","r",stdin);
	freopen("packs.out","w",stdout);
	memset(f , 0x3f , sizeof(f));
	memset(g , 0x3f , sizeof(g));
	scanf("%lld",&n);
	for(long long i=1; i<=n; i++) {
		scanf("%lld",&a[i]);
		ma = mymax(ma , a[i]);	
	}
	scanf("%lld",&m);
	for(long long i=1; i<=m; i++) {
		scanf("%lld",&b[i]);
		mb = mymax(mb , b[i]);	
	}
	ma = ma*n;
	mb = mb*m;
	f[0] = g[0] = 0; 
	for(long long i=1; i<=n; i++)
		for(long long j=ma; j>=a[i]; j--)
			f[j] = mymin(f[j] , f[j-a[i]]+1);
	for(long long i=1; i<=m; i++)
		for(long long j=mb; j>=b[i]; j--)
			g[j] = mymin(g[j] , g[j-b[i]]+1); 
	for(long long i=1; i<=100000; i++)
		ans = mymin(f[i]+g[i] , ans);
	if(ans==INF)
		printf("impossible");
	else
		printf("%lld",ans);
	return 0;
}

小鸟

第一次打的模拟忽略了一个地方：小鸟活动的范围可能有覆盖。

正解是差分(我是用差分A过的……)：易得：每一只小鸟到监测站的曼哈顿距离一定是一个连续的区间。

我们把每一个小鸟的这个区间求出来，然后再原数组里差分搞一搞，最后O(1)求出询问。

细节就是，求区间的时候小鸟和监测站的相对关系有四种，自己推一下。

教练想的线段树，查询要O(logn)有兴趣的自己试试能不能过……

#include<iostream>
#include<cstdio>
#define INF 2147483647
using namespace std;

int n , m , X , Y , A[20000005] , B[2000005] , minn = INF , maxn;
inline int mymin(int a , int b) { return a<b?a:b; }
inline int mymax(int a , int b) { return a>b?a:b; }
inline int myabs(int a) { return a>0?a:(-a); }

int jud(int sx , int sy , int tx , int ty) {
	if(X>=sx&&X<=tx&&Y>=sy&&Y<=ty)
		return 1;
	if(X>=sx&&X<=tx&&(Y<sy||Y>ty))
		return 2;
	if(Y>=sy&&Y<=ty&&(X<sx||X>tx))
		return 3;
	return 4;
}

int qlen_max(int sx , int sy , int tx , int ty) {
	int len1 , len2 , len3 , len4;
	len1 = myabs(sx-X)+myabs(sy-Y);
	len2 = myabs(sx-X)+myabs(ty-Y);
	len3 = myabs(tx-X)+myabs(sy-Y);
	len4 = myabs(tx-X)+myabs(ty-Y);
	return mymax(mymax(len1,len2),mymax(len3,len4));
}

int qlen_min(int sx , int sy , int tx , int ty) {
	int len1 , len2 , len3 , len4;
	len1 = myabs(sx-X)+myabs(sy-Y);
	len2 = myabs(sx-X)+myabs(ty-Y);
	len3 = myabs(tx-X)+myabs(sy-Y);
	len4 = myabs(tx-X)+myabs(ty-Y);
	return mymin(mymin(len1,len2),mymin(len3,len4));
}

int main() {
	freopen("bird.in","r",stdin);
	freopen("bird.out","w",stdout);
	scanf("%d%d%d%d",&n,&m,&X,&Y);
	for(int i=1; i<=n; i++) {
		int a , b , c , d , flag , l , r;
		int sx , sy , tx , ty;
		scanf("%d%d%d%d",&a,&b,&c,&d);
		sx = mymin(a , c);
		tx = mymax(a , c);
		sy = mymin(b , d);
		ty = mymax(b , d);
		flag = jud(sx,sy,tx,ty);
		if(flag == 1)
			l = 0 , r = qlen_max(sx,sy,tx,ty);
		if(flag == 2)
			l = mymin(myabs(sy-Y),myabs(ty-Y)) , r = qlen_max(sx,sy,tx,ty);
		if(flag == 3)
			l = mymin(myabs(sx-X),myabs(tx-X)) , r = qlen_max(sx,sy,tx,ty);
		if(flag == 4)
			l = qlen_min(sx,sy,tx,ty) , r = qlen_max(sx,sy,tx,ty);
		minn = mymin(minn , l);
		maxn = mymax(maxn , r);
		l++ , r++;
		B[l-1]++;
		B[r]--;
	}
	for(int i=1; i<=maxn+1; i++)
		A[i] = A[i-1] + B[i-1];
	for(int i=1; i<=m; i++) {
		int x;
		scanf("%d",&x);
		printf("%d\n",A[x+1]);
	}
	return 0;
}

包装

直接爆搜50分。

50分爆搜代码……

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define INF 9223372036854775807
using namespace std;

struct Node {
	long long a , b , c;
};
Node e[20];
long long n , k , del[20] , ans = INF , cnt[20] , let[20][20];
inline long long mymin(long long a , long long b) { return a<b?a:b; }
inline long long mymax(long long a , long long b) { return a>b?a:b; }
inline long long myabs(long long a) { return a>0?a:(-a); }

void sol() {
	long long lm = 0 , rm = 0 , s , res = 0;
	for(long long i=1; i<=n; i++) {
		scanf("%lld%lld%lld",&e[i].a,&e[i].b,&e[i].c);
		lm = mymax(lm , e[i].a);
		rm = mymax(rm , e[i].b);		
	}
	s = lm*rm;
	for(long long i=1; i<=n; i++) {
		long long area = e[i].a*e[i].b;
		res = res + (s-area)*e[i].c;
	}
	printf("%lld",res);
}

long long qans() {
	long long res = 0 , f[20];
	memset(f , 0x3f , sizeof(f));
	for(long long i=1; i<=k; i++) {
		long long siz = cnt[i] , lm = 0 , rm = 0 , qaq = 0;
		for(long long j=0; j<siz; j++) {
			lm = mymax(lm , e[let[i][j]].a);
			rm = mymax(rm , e[let[i][j]].b);
		}
		for(long long j=0; j<siz; j++)
			qaq = qaq + (lm*rm-e[let[i][j]].a*e[let[i][j]].b)*e[let[i][j]].c;
		res += qaq;
	}
	return res;
}

void dfs(long long u) {
	if(u==n) {
		ans = mymin(ans , qans());
		return ;
	}
	for(long long j=1; j<=k; j++) {
		let[j][cnt[j]++] = u+1;
		dfs(u+1);
		cnt[j]--;	
	}
}

int main() {
	freopen("envelope.in","r",stdin);
	freopen("envelope.out","w",stdout);
	scanf("%lld%lld",&n,&k);
	if(k==1) {
		sol();
		return 0;
	}	
	if(n<=k) {
		printf("0");
		return 0;
	}
	for(long long i=1; i<=n; i++)
		scanf("%lld%lld%lld",&e[i].a,&e[i].b,&e[i].c);	
	dfs(0);
	printf("%lld",ans);
	return 0;
}