ZeptoLab Code Rush 2015

最新推荐文章于 2020-10-02 22:55:29 发布

ThinkingLion

最新推荐文章于 2020-10-02 22:55:29 发布

阅读量438

点赞数

分类专栏： codeforces 文章标签：模拟贪心

本文链接：https://blog.csdn.net/ThinkingLion/article/details/44923231

版权

codeforces 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

源地址：http://codeforces.com/contest/526

最近做题实在是没有感觉，，略颓废。。

A:暴力枚举

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
#define pi acos(-1.0);
int n,m;
#define Mod 1000000007
#define N 510
#define M 1000100
const int size = 10010;
const int mod = 9901;
char ch[110];
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    while(sf(n)!=EOF){
        sfs(ch);
        int flag = 0;
        for(int i=0;i<n;i++){
            if(ch[i] == '.') continue;
            for(int j=1;j<n;j++){
                int num = 1;
                if(i+4*j>n) break;
                int k = i;
                while(k+j<n && ch[k+j] == '*'){
                    k += j;
                    num++;
                    if(num>=5) break;
                }
                if(num >= 5){
                    flag = 1;
                    break;
                }
            }
            if(flag) break;
        }
        if(flag)
            printf("yes\n");
        else
            printf("no\n");
    }
return 0;
}

B:B题刚开始实在是没想好怎么做。。用了下搜索，，感觉不好使。。

最后看了下别人的想法。。就跟那种数塔一样的，从底层开始遍历，如果相邻两个数目不同，那就弄成相同的，然后把数目往上层叠加，直到第一层。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
#define pi acos(-1.0);
int n,m;
#define Mod 1000000007
#define N 510
#define M 1000100
const int size = 10010;
const int mod = 9901;
int a[M];
int mmax;
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    while(sf(n)!=EOF){
        int total = (1<<(n+1))-1;
        a[1] = 0;
        for(int i=2;i<=total;i++)
             sf(a[i]);
        int ans=0;
        for(int i=n;i>=1;i--){
            for(int j=(1<<i);j<=(1<<(i+1))-1;j+=2){
                int tmp = abs(a[j]-a[j+1]);
                ans += tmp;
                int mmax = Max(a[j],a[j+1]);
                a[(j>>1)] += mmax;
            }
        }
        printf("%d\n",ans);
    }
return 0;
}

C:数据范围好大，，本来想用背包的。。

那么我们可以知道，使得价值最大的背包的容量肯定是 <= 两种糖果重量倍数的公倍数，所以我们枚举数量时，只需要枚举到sqrt(c)就可以了。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
#define pi acos(-1.0);
int n,m;
#define Mod 1000000007
#define N 510
#define M 1000100
const int size = 10010;
const int mod = 9901;
int a[M];
int mmax;
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    ll c,hr,hb,wr,wb;
    while(scanf("%I64d%I64d%I64d%I64d%I64d",&c,&hr,&hb,&wr,&wb)!=EOF){
    	ll ans=0;
    	if(c<wr&&c<wb){
    		pfI(ans);
    	}else if(c<wr && c>=wb){
    		ans = c/wb*hb;
    		pfI(ans);
    	}else if(c>=wr && c<wb){
    		ans = c/wr*hr;
    		pfI(ans);
    	}else{
    		for(int i=0;i*i<=c;i++){	//因为可以存储的最大空间是i和c-i的公倍数，所以我们只需要枚举到sqrt(c)
    			if(c-i*wr>=0)
    				ans = Max(ans,i*hr+(c-i*wr)/wb*hb);
    			if(c-i*wb>=0)
    				ans = Max(ans,i*hb+(c-i*wb)/wr*hr);
    		}
    		pfI(ans);
    	}
    }
return 0;
}

ThinkingLion

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
ZeptoLab Code Rush 2015

源地址：http://codeforces.com/contest/526最近做题实在是没有感觉，，略颓废。。A:暴力枚举#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includ
复制链接

扫一扫