2023 Hubei Provincial Collegiate Programming Contest

https://codeforces.com/gym/104337

M. Different Billing

题意：有3种队伍a,b,c,花费分别为0, 1000, 2500.已知有x支队伍工花费y元，求各个队伍的数量

思路：1，枚举c的数量，方程为1000*(b+c)+1500*c=y.有c就可以算b. 

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define N 2000005
//#define int long long
int mod = 1e9 + 7;
using namespace std;

signed main() {
    int n, y,m;
    scanf("%d%d", &n, &y);
    int a = 0, b = 0, c = 0;
    m = y;
    for (int i = 0; i <= n; i++) {
        if ((m - 1500 * i) % 1000 == 0) {
            b = (y - 1500 * i) / 1000 - i;
            a = n - b - i;
            c = i;
            if (a >= 0 && c >= 0 && b >= 0) {
                printf("%d %d %d", a, b, c);
                return 0;
            }
        }
    }
    printf("-1");
}

J. Expansion

题意：能不能从1到n并且不能出现负的情况，每经过一个会获得相应的增长速度，可以停留并保持当前的总增长速度。第i个位置的增长速度是1到i的和，初始为0。

思路：前缀和算出每个位置总的增长速度，如果需要停留（有负的），则在当前最大的增长点停留相应的时间。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 2000005
#define int long long
//int mod = 1e9 + 7;
using namespace std;
int a[N],sum[N];
signed main() {
    int n; scanf("%lld", &n);
    for (int i = 1; i <= n; i++)scanf("%lld", &a[i]);
   
    int maxx = 0,cnt=0,ans=0;
    for (int i = 1; i <= n; i++) {
        sum[i] = sum[i - 1] + a[i];
    } 
    for (int i = 1; i <= n; i++) {
        if (sum[i] == 0)continue;
        if (sum[i] < 0) {
            printf("-1");
                return 0;
        }
        break;
    }
    if (sum[n] < 0) {
        printf("-1");
        return 0;
    }
    for (int i = 1; i <= n; i++) {
        ans++;
        cnt += sum[i];
        if (maxx < sum[i])maxx = sum[i];
        if (cnt < 0) {
            int p = -cnt / maxx;
            if (cnt % maxx)p++;
            ans += p;
            cnt += p * maxx;
        }
    }
    printf("%lld", ans);
}

 H. Binary Craziness

题意：一个无向图，给出n个点，m条双向边然后求(∑ni=1 ∑nj=i f(i,j))其中f（i,j）是

f(u,v)=(degu⊕degv)(degu|degv)(degu&degv)度的异或*度的按位或*度的按位与；

思路：暴力的话时间复杂度是O（n2）会超时，所以需要优化，很容易想到如果某一个点是零的话可以直接跳过，但还不够，还有如果度一样的话会重复计算，所以我们统计度出现的种类，而在m最多为10^6情况下度的种类约是√(2m)这个量级(近似服从正态分布的规律)。之后就是暴力枚举在乘上相应的数量

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 2000005
#define int long long
int mod = 998244353;
using namespace std;
int a[N], cnt[N], c[N];
signed main() {
    int n, m; scanf("%lld%lld", &n, &m);
    for (int i = 0; i < m; i++) {
        int t, t1; scanf("%lld%lld", &t, &t1);
        a[t]++, a[t1]++;
    }
    int p = 0;
    for (int i = 1; i <= n; i++) {
        if (!cnt[a[i]])c[p++] = a[i];
        cnt[a[i]]++;
    }
    int ans = 0; 
    for (int i = 0; i < p; i++) {
        for (int j = i + 1; j < p; j++) {
            ans = (ans % mod + ((c[i] ^ c[j]) * (c[i] | c[j]) * (c[i] & c[j])) % mod * (cnt[c[i]] * cnt[c[j]])%mod) % mod;
        }
    }
    printf("%lld", ans);
}

C. Darkness I 

 题意：如果白砖与两块或以上的黑砖相邻则会变成黑砖,给你n,m，问最少需要几块黑砖可以让n*m的砖块全变黑

思路：按最大的正方形对角线放置，之后隔一列放一个，最后一列必须要放。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 2000005
//#define int long long
int mod = 998244353;
using namespace std;
signed main() {
    int n, m; scanf("%d%d", &n, &m);
    if (n > m)swap(n, m);
    int ans = n + (m - n) / 2;
    if ((m - n) % 2)ans++;
    printf("%d", ans);
}