这周学了点数学,之后就是在做codeforces,这周一开始做codeforces并不是很得心应手,前两个题都要错很多次,每次都是把问题想复杂了,后来慢慢的好多了,周六打的比赛一共出了两道水题,虽然比上一年出一题有一点进步,但还是远远不够,涉及到的很多知识还没有掌握,以后还是要加快学习进度 ,周日忘了写总结了,今天补上...
codeforces C Divan and bitwise operations
位运算的题目,利用整体的或和来求所有子集的异或和的总和
(9条消息) Codeforces-1614 C: Divan and bitwise operations_Sherlock_Holmewei的博客-CSDN博客
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn=1e9;
const int mod=1e9+7;
int l,r,x,t,n,m;
int main(){
//freopen("in.txt","r",stdin);
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
ll OR=0,poww=1;
for(int i=1;i<=m;i++) scanf("%d%d%d",&l,&r,&x),OR|=x;
for(int i=1;i<n;i++) poww=(poww*2)%mod;
cout<<(poww*OR)%mod<<endl;
}
return 0;
}
codeforces D Divan and Kostomuksha (hard version)
dp加数学,发现关于这种集合相加的都要思考每个元素对答案的贡献度,而不是真要去求每一个集合
(9条消息) Codeforces Round #757 div.2 A-D题解_月阁-CSDN博客
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn=100100;
const int maxm=20002000;
const int mod=1e9+7;
bool vis[maxm];
ll cnt[maxm],dp[maxm];
int main(){
//freopen("in.txt","r",stdin);
int n,x;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&x);
for(int j=1;j*j<=x;j++){
if(x%j==0){
cnt[j]++;
cnt[x/j]++;
if(j*j==x) cnt[j]--;//会加两次,所以要减一次
vis[j]=vis[x/j]=1;
}
}
}
ll ans=0;
for(int i=maxm-1;i>=1;i--){
if(!vis[i]) continue;
dp[i]=cnt[i]*i;
for(int j=i+i;j<maxm;j+=i){
if(!vis[j]) continue;
dp[i]=max(dp[i],dp[j]+i*(cnt[i]-cnt[j]));
}
ans=max(ans,dp[i]);
}
printf("%lld\n",ans);
return 0;
}
codeforces B Kalindrome Array
删除1个,2个。。。全部其实是一样的,所以直接删除一个数的全部即可,直接循环遍历,如果a[l]!=a[r],就让x=a[l]或x=a[r],然后碰到x就跳过,看看这两种情况是否有一种满足条件即可,一开始想的思路超时了,之后想改但再也没改出来。。。
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
int t,n,a[200005];
bool check(int x){
int l=1,r=n;
while(l<=r){
while(a[l]==x) l++;
while(a[r]==x) r--;
if(a[l]==a[r]) l++,r--;
else return 0;
}
return 1;
}
bool solve(){
for(int i=1;i<=n;i++){
if(a[i]!=a[n-i+1]) return check(a[i])|check(a[n-i+1]);
}
return 1;
}
int main(){
//freopen("in.txt","r",stdin);
scanf("%d",&t);int cnt=1;
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
if(solve()) printf("YES\n");
else printf("NO\n");
}
return 0;
}
codeforces C Keshi Is Throwing a Party
二分的一道题,现在还没正经学二分,如果不是题目有提示也看不出来是二分,等学到的时候专门在练练,好像只要满足单调性就可以使用二分。。。
(9条消息) Codeforces Global Round 17 C. Keshi Is Throwing a Party_ycqmydarling的博客-CSDN博客
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
int t,n,a[200005],b[200005];
bool check(int x){
int ren=0;
for(int i=1;i<=n;i++){
if(ren<=b[i]&&x-ren-1<=a[i])
ren++;
if(ren==x) return 1;
}
return 0;
}
int main(){
//freopen("in.txt","r",stdin);
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d%d",&a[i],&b[i]);
int l=1,r=n,mid=0,ans=0;
while(l<=r){
mid=(l+r)/2;
if(check(mid)){
ans=mid;
l=mid+1;
}else r=mid-1;
}
cout<<ans<<endl;
}
return 0;
}
codeforces B Team Composition: Programmers and Mathematicians
今天好像不适合做题,什么都思考不出来,竟然被B题卡住了。。。
以后要根据题目思考,不能乱猜!
(9条消息) 刷题之Codeforces Round #756 (Div. 3)_xxayt的博客-CSDN博客
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
int t;
ll a,b;
int main(){
//freopen("in.txt","r",stdin);
scanf("%d",&t);
while(t--){
scanf("%lld%lld",&a,&b);
printf("%lld\n",min(a,min(b,(a+b)/4)));
}
return 0;
}
hdu1521 指数型母函数模板题
贴在这做个模板留一下
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
int n,m,a[15];
double c1[15],c2[15],f[15];
int main(){
f[0]=1;
for(int i=1;i<11;i++) f[i]=f[i-1]*i;
while(scanf("%d%d",&n,&m)!=EOF){
memset(c1,0,sizeof(c1));
memset(c2,0,sizeof(c2));
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=0;i<=a[1];i++) c1[i]=1.0/f[i];
for(int k=2;k<=n;k++){//也是从第二部分开始
for(int i=0;i<=m;i++)//i循环第一部分
for(int j=0;j<=a[k]&&i+j<=m;j++)//j循环第二部分
c2[j+i]+=c1[i]*1.0/f[j];
for(int i=0;i<=m;i++)
c1[i]=c2[i],c2[i]=0;
}
printf("%.0f\n",c1[m]*f[m]);//c1[m]是除以阶乘,最后输出要乘回来
}
return 0;
}
hdu 5184
卡特兰数,因为通常需要对除法进行取模,所以还要用到逆元,这题的关键是要找到在n-m个空中如何去安排左括号和右括号,这也算是一个模板了
【HDU 5184】 Brackets (卡特兰数)_weixin_30646505的博客-CSDN博客
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int mod=1000000007;
const int maxn=1000010;
char s[maxn];
ll fac[maxn];
//拓展欧几里得求逆元
ll extgcd(ll a,ll b,ll &x,ll &y){
if(!b){
x=1;y=0;
return a;
}
ll gcd=extgcd(b,a%b,x,y);
ll t=x;
x=y;
y=t-(a/b)*y;
return gcd;
}
//拓展欧几里得求逆元
ll rev(ll t){//求逆元(因为需要对除法取模)
ll x,y;
extgcd(t,mod,x,y);
x=(x%mod+mod)%mod;
return x;
}
ll C(ll a,ll b){
return (fac[a]*rev(fac[b]*fac[a-b]%mod))%mod;
}
int main(){
// freopen("in.txt","r",stdin);
fac[0]=fac[1]=1;
for(int i=2;i<maxn;i++) fac[i]=(fac[i-1]*i)%mod;
ll n;
while(scanf("%lld",&n)!=EOF){
int flag=1;
scanf("%s",s+1);
ll m=strlen(s+1),now=0,sl=0;
for(int i=1;i<=m;i++){
if(s[i]=='(') now++,sl++;
else now--;
if(now<0) flag=0;
}
if(n&1||m>n||!flag||sl*2>n||(m-sl)*2>n){printf("0\n");continue;}
int l=n/2-sl;//剩下的序列中还需要选的左括号的个数
if(sl==n/2||m==n){printf("1\n");continue;}
//n-m表示剩下的序列一共需要选的个数
printf("%lld\n",(C(n-m,l)-C(n-m,l-1)+mod)%mod);
}
return 0;
}
codeforces C Delete Two Elements
sum是n个数的和,k=sum/n,要挑出一对数使得新的sum/n也是k,只要两个数相加等于2*sum/n,那么这两个数就满足条件,让每一个a[i]都乘以n,则两个数只要满足a[i]+a[j]==2*sum就可以被选中;
CF1598C. Delete Two Elements 1200——思维_m0_59273843的博客-CSDN博客
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int mod=1000000007;
const int maxn=1000010;
char s[3][110];
int dir[4][3]={
{1,0},
{0,1},
{1,1},
{-1,1},
};
ll n,a[200005],sum;
map<ll,ll>mp;
int main(){
//freopen("in.txt","r",stdin);
int t;cin>>t;
while(t--){
cin>>n;
sum=0;mp.clear();
for(int i=1;i<=n;i++) cin>>a[i],sum+=a[i];
ll ans=0;
for(int i=1;i<=n;i++){
ans+=mp[n*a[i]];
mp[2ll*sum-1ll*n*a[i]]++;
}
cout<<ans<<endl;
}
return 0;
}
codeforces C Poisoned Dagger
第一道自己做出来的二分题(不知道这是不是二分,反正我二分做出来了),先找到最大的区间maxx试试能不能到或超过h,如果是,则从1到maxx二分;若不是,则从maxx到h二分;在下的思路可能有点粗糙,但毕竟是AC了嘛~
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
ll t;
ll n,h,a[110];
ll po(ll maxx){
ll sum=0;
for(int i=1;i<=n-1;i++)
sum+=min(a[i+1]-a[i],maxx);
sum+=maxx;
return sum;
}
int main(){
//freopen("in.txt","r",stdin);
scanf("%lld",&t);
while(t--){
scanf("%lld%lld",&n,&h);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
ll maxx=0;
for(int i=1;i<=n+1;i++) maxx=max(maxx,a[i+1]-a[i]);
ll sum=0;
sum=po(maxx);
if(sum>=h){
ll l=1,r=maxx,mid;
while(l<r){
mid=(l+r)/2;
if(po(mid)>=h) r=mid;
else l=mid+1;
}
printf("%lld\n",l);
}
if(sum<h){
ll l=maxx,r=h,mid;
while(l<r){
mid=(l+r)/2;
if(po(mid)>=h) r=mid;
else l=mid+1;
}
printf("%lld\n",l);
}
}
return 0;
}
牛客小白月赛 I 体操队形
n=10,直接暴力全排列枚举所有排列看看有多少种符合情况即可;
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
int n,a[12],b[12];
bool check(){
for(int i=1;i<=n;i++){
if(a[i]==i) continue;
int flag=0;
for(int j=1;j<=n;j++){
//出现了a[i]这个数,但却没有出现i这个数
//说明此排列不符合情况
if(b[j]==a[i]&&flag==0) return false;
//出现了i这个数
if(b[j]==i) flag=1;
}
}
return true;
}
int main(){
//freopen("in.txt","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),b[i]=i;
int ans=0;
do{
if(check()) ans++;
}while(next_permutation(b+1,b+n+1));
printf("%d\n",ans);
return 0;
}
牛客小白月赛 E 分组
还是二分,直接从最大范围开始划分,每个组的人数每次为mid,然后不断缩小范围,最后出来答案
2021牛客月赛40 题解_ccsu_yuyuzi的博客-CSDN博客
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
int n,m,a[100005],sum[100005];
bool check(int x){
int res=0;
for(int i=1;i<=100000;i++)
res+=(sum[i]+x-1)/x;
return res<=m;
}
int main(){
//freopen("in.txt","r",stdin);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum[a[i]]++;
int l=1,r=100005,mid;
int ans=-1;
while(l<r){
mid=l+r>>1;
if(check(mid)) ans=mid,r=mid;
else l=mid+1;
//cout<<l<<endl;
}
printf("%d\n",ans);
return 0;
}