CS Academy Round #74 (Div. 2 only) A B C D E

A找出有多少独角兽

因为范围很小 所以枚举即可

    int a,l,h;
    sddd(a,l,h);
    for(int i=0;i<=a;++i)
    {
        int leg = l - i*4;
        int ho = h - i;
        if(ho&1)continue;
        if(ho*2>leg)continue;
        if(leg&1)continue;
        int b = ho/2;
        int c = (leg - 2*ho)/2;
        if(i+b+c==a)return 0*printf("%d",i);
    }

B
每一个站都有可能有人要到后面第n-1个站
所以做一次2*n的循环 记录最大值即可

    int n;
    sd(n);
    r1(i,n)r1(j,n)sd(a[i][j]);
    int ans = 0;
    for(int k=1;k<=2*n;++k)
    {
        int i = k;
        if(k>n)i-=n;
        cnt[i] = 0;
        int tot = 0;
        for(int j=1;j<=n;++j)
        {
            cnt[j] += a[i][j];
            tot += cnt[j];
        }
        ans = max(ans,tot);
    }
    ansn();

C
把题目转换成选两个正方形使得选中区域的1最多
考虑重合和不重合的情况
对每个正方形的1的数量处理一个前缀最大值
除了用加上不重合的正方形的最大值更新答案
再枚举重合部分更新答案
复杂度O(n* m *k^2)

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
//const ll mod = 1000000007 ;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn=  1e4+20;
const int maxm = 3e2+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
int in(int &ret) {
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}
int n,m,k;

int a[maxm][maxm];
int b[maxm][maxm];
int get(int x,int y) {
    int l = x +k-1,r = y+k-1;
    return a[l][r] - a[l][y-1] - a[x-1][r] + a[x-1][y-1];
}
int get(int x1,int y1,int x2,int y2) {
    return a[x2][y2] - a[x1-1][y2] - a[x2][y1-1] + a[x1-1][y1-1];
}
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL
//    int n,m,k;
    sddd(n,m,k);
    int zero = 0;
    r1(i,n)r1(j,m)sd(a[i][j]),zero += (a[i][j]==0);
    r1(i,n+k)r1(j,m+k)a[i][j] += a[i][j-1];
    r1(i,n+k)r1(j,m+k)a[i][j] += a[i-1][j];
    int ans = 0;
    r1(i,n)r1(j,m)b[i][j] = get(i,j),ans = max(ans,b[i][j]);
    r1(i,n)r1(j,m)b[i][j] = max(b[i][j],max(b[i][j-1],b[i-1][j]));
    r1(i,n)r1(j,m) {
        for(int x = i; x<=i+k-1&&x<=n; ++x)
            for(int y = j; y<=j+k-1&&y<=m; ++y) {
                int q = get(i,j) + get(x,y) ;
                int sub = get(x,y,i+k-1,j+k-1);
                ans = max(ans,q-sub);
            }
        if(i>k)ans = max(ans,get(i,j)+b[i-k][m]);
        if(j>k)ans = max(ans,get(i,j)+b[n][j-k]);
    }
    ans =ans + zero;
    ansn();
    return 0;
}

D
把所有组合都取一遍
假设对于ai有k个比它小 那么它会产生贡献2^k次
只有最小的会产生1次贡献

int num[100];
vector< vector<int> >g;
void dfs(int u,int f,int n,int mx)
{
    if(u>n)
    {
        vector<int>v;
        for(int i=1;i<=n;++i)v.pb(num[i]);
        g.pb(v);
        return ;
    }
    for(int i=f+1;i<=mx;++i)
    {
        num[u] = i;
        if(n-u<=mx-i)dfs(u+1,i,n,mx);
    }
}
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL
    int n;
    sd(n);
    rn(i,n)
    {
        dfs(1,0,i,n);
    }
    int ans = g.size();
    ansn();
    r0(i,ans)
    {
        vector<int>v = g[i];
        int sz = v.size();
        printf("%d",sz);
        r0(j,sz)
        {
            printf(" %d",v[j]);
        }
        puts("");
    }
    return 0;
}

E
压位对q处理一个状态子集的和
每个状态的为1的位置都比为0的位置小

dp
把2^k从小选到大不断增加状态里的1
对每个状态枚举下一个1
那么产生贡献的q一定需要为偶数

int a[maxn];
int b[maxn];
char s[maxm];
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    int n,m;
    sdd(n,m);
    while(m--)
    {
        ss(s);
        int len = strlen(s);
        int u = 0;
        for(int i=0;i<len;++i)
        {
            if(s[i]-'0')u+=(1<<i);
        }
        a[u]++;
    }
    for(int i=0;i<n;++i)
    {
        int sz = 1<<n;
        for(int j=0;j<sz;++j)
        {
            if(j&(1<<i))
            {
                a[j^(1<<i)] += a[j];
            }
        }
    }
    for(int i=0;i<n;++i)b[1<<i] = a[1<<i]&1;
    int sz = 1<<n;
    for(int i=1;i<sz;++i)
    {
        for(int j=0;j<n;++j)
        {
            if(((i>>j)&1)==0)
            {
                if((a[i^(1<<j)] - a[i])%2==0)
                {
                    b[i^(1<<j)] += b[i];
                }
            }
        }
    }
    int ans = b[sz-1];
    ansn();
    return 0;
}