CF557B Modulo Sum/Namomo Spring Camp 每日一题 Week1 Day4 选数

Namomo Spring Camp 2022 Week1 Day4 选数

Problem Statement

给$N$个数$a_1,a_2,\dots ,a_n$选出若干个数字, 使得数字的和$\mathrm{m}\mathrm{o}\mathrm{d}N=0$.

输出一个方案.

Solution

首先设$b_k=({\sum }_{i=1}^k{a}_i)\mathrm{m}\mathrm{o}\mathrm{d}N$. b k = { 0 , 1 , 2 , … , N − 1 } b_k=\{0,1,2,\dots,N-1\} bk​={0,1,2,…,N−1}.

• 如果$b_k=0$那么显然有$b_k=({\sum }_{i=1}^k{a}_i)\mathrm{m}\mathrm{o}\mathrm{d}N=0$即选择$[1,k]$的所有数即可.
• 否则$\forall k\in [1,N],b_k\ne 0$, 由于$b_k\ne 0$的值域为 { 1 , 2 , … , N − 1 } \{1,2,\dots,N-1\} {1,2,…,N−1}共$N-1$个数, 由鸽笼原理$N$个数$b_k$中至少有$2$个数使得$b_l=b_r(l<r)$. 那么显然有$b_r-b_l=({\sum }_{i=l+1}^r{a}_i)\mathrm{m}\mathrm{o}\mathrm{d}N=0$. 则选择$[l+1,r]$区间内的所有数即可.

时间复杂度为$O(N)$.

Code

# define Fast_IO std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
# include "unordered_map"
# include "algorithm"
# include "iostream"
# include "cstdlib"
# include "cstring"
# include "cstdio"
# include "vector"
# include "bitset"
# include "queue"
# include "cmath"
# include "map"
# include "set"

using namespace std;

const int maxm=1e5+10;

int N,A[maxm],B[maxm];
unordered_map<int,int> LH;

int main(){
	static int i,L,R; L=0,R=1;
	scanf("%d",&N);
	for(i=1;i<=N;i++) scanf("%d",&A[i]),B[i]=(B[i-1]+A[i]%N)%N;
	for(i=1;i<=N;i++){
		if(LH[B[i]] || B[i]==0){
			L=LH[B[i]],R=i;
			break;
		}else LH[B[i]]=i;
	}
	printf("%d\n",R-L);
	for(i=L+1;i<=R;i++) printf("%d ",i);
	return 0;
}

CF557B Modulo Sum

Problem Statement

给你$N$个数, 选出若干个数使得, 这若干个数的和$\mathrm{m}\mathrm{o}\mathrm{d}M=0$. 判断可不可行.

• $1\le N\le 10^6,2\le M\le 10^3$.

Solution

由上题性质可知若$N\ge M$至少存在一种方案, 使得和$\mathrm{m}\mathrm{o}\mathrm{d}M=0$.

如果$N<M$:

我们不妨设$f_{i,j}$表示前$i$个数是否能达到和在模意义下和为$j$. $A_i=a_i\mathrm{m}\mathrm{o}\mathrm{d}M$.

显然有$f_{i,(j+A_i)\text{ mod M}}=\{\begin{array}{ll}{f}_{i-1,j}\text{ or }{f}_{i-1,(j+A_i)\text{ mod }M}& ifj\ne 0\\ true& ifj=0\end{array}$.

Code

# define Fast_IO std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
# include "unordered_map"
# include "algorithm"
# include "iostream"
# include "cstdlib"
# include "cstring"
# include "cstdio"
# include "vector"
# include "bitset"
# include "queue"
# include "cmath"
# include "map"
# include "set"

using namespace std;

const int maxm=1e6+10;
const int maxn=3e3+10;

int N,M,A[maxm],DP[maxn][maxn],Find;
unordered_map<int,int> LH;

int main(){
	static int i,j,Find;
	scanf("%d%d",&N,&M);
	for(i=1;i<=N;i++) scanf("%d",&A[i]);
	if(N>=M){
		printf("YES");
		return 0;
	}
	DP[1][A[1]%M]=true;
	for(i=2;i<=N;i++){
		for(j=0;j<M;j++){
			DP[i][(j+A[i])%M]=DP[i-1][j]|DP[i-1][(A[i]+j)%M];
		}DP[i][A[i]%M]=true;
	}puts(DP[N][0]?"YES":"NO");
	return 0;
}

Link

Link1: Daimayuan Online Judge 456 选数

Link2: CF577B Modulo Sum