前言
不能太重此轻彼，还是要平衡一些
D-操作序列1
#解题思路：利用并查集进行区间合并，每学习一种算法便将其并入位于find_set(r+1)的集合中，使得当之后再遇到此算法时，便可以直接判定此算法及直至r的算法，都已并入其他集合(数据结构类的题目的确是写少了，像靠并查集进行区间合并的做法都没有想到，还是要多写一些这类题目)
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ll Mod = 1e9 + 7;
const ll mod9 = 998244353;
const ll Max = 1e5 + 7;
const ll MAX = 2e5 + 100;
const ll N = 2e6 + 10;
const ll inf = 1e12 + 100;
const double pi=acos(-1.0);
const double E = exp(1);
const double eps=1e-8;
//char buf[1<<20],*p1,*p2;
#define nl "\n"
#define fir first
#define sec second
//#define re register
//#define int ll
//#define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define setbits1(x, n, m) (x) | ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define setbits0(x, n, m) (x) & ~((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define getbits(x, n, m) (x) & ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define get_reverse_bits(x, n, m) (x) ^ ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
#pragma comment (linker,"/STACK:102400000,102400000")
using namespace std;
inline ll read(){
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch>'9'){
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9'){
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
template<typename I,typename L,I mod> struct Modint {
I v;
I pow(L b) const {
L res=1,a=v;
while(b) { if(b&1) res=res*a%mod; b>>=1; a=a*a%mod; }
return res;
}
I inv() const { return pow(mod-2); }
Modint &operator+=(const Modint &x) { v+=x.v; v-=v>=mod?mod:0; return *this; }
Modint &operator-=(const Modint &x) { v-=x.v; v+=v<0?mod:0; return *this; }
Modint &operator*=(const Modint &x) { v=L(1)*v*x.v%mod; return *this; }
Modint &operator/=(const Modint &x) { v=L(1)*v*x.inv()%mod; return *this; }
friend Modint operator+(Modint l,const Modint &r) { return l+=r; }
friend Modint operator-(Modint l,const Modint &r) { return l-=r; }
friend Modint operator*(Modint l,const Modint &r) { return l*=r; }
friend Modint operator/(Modint l,const Modint &r) { return l/=r; }
Modint operator++(int) { auto res=*this; *this+=1; return res; }
Modint operator--(int) { auto res=*this; *this-=1; return res; }
Modint operator- () { return *this*-1; }
Modint &operator++() { return *this+=1; }
Modint &operator--() { return *this-=1; }
bool operator< (const Modint &x) const { return v< x.v; }
bool operator> (const Modint &x) const { return v> x.v; }
bool operator<=(const Modint &x) const { return v<=x.v; }
bool operator>=(const Modint &x) const { return v>=x.v; }
bool operator==(const Modint &x) const { return v==x.v; }
bool operator!=(const Modint &x) const { return v!=x.v; }
friend istream &operator>>(istream &is,Modint &x) { is>>x.v; x=Modint(x.v); return is; }
friend ostream &operator<<(ostream &os,const Modint &x) { return os<<x.v; }
Modint(L x=0): v((x%=mod)<0?x+mod:x) {}
static_assert(0ULL+mod+mod-2<1ULL<<(sizeof(I)*8-1), "Modint overflow");
static_assert(1ULL*(mod-1)*(mod-1)<1ULL<<(sizeof(L)*8-1), "Modint overflow");
};
using mint=Modint<int,long long,Mod>;
char arr[1000][1000];
ll dp[N][2],cntn[26],dt[N],f[N];
ll suma[Max],sumb[Max],sum[N];
int to[N];
string s;
char chs[27];
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
const int dxn[8] = { -1,-2,-2,-1,1,2,2,1 };
const int dyn[8] = { 2,1,-1,-2,2,1,-1,-2 };
vector<int>e[N];
//mp<pii,int>mp;
ll n,m,k;
bool check(int x,int y){
return x>=1&&x<=n&&y>=1&&y<=m;
}
void init(){//初始化，每个点都是一个独立的集
for(int i=1;i<=n+1;i++)//要到n+1,因为需要将点合并到find_set(r+1)
f[i]=i;
}
int find_set(int x){
if(x!=f[x])
f[x]=find_set(f[x]);//路径压缩
return f[x];
}
void solved(){
int i,j;
}
int main() {
ios;
//cout << fixed;
//cout.precision(18);
//cout.flush();
int i, j;
ll T,u,v,w,t,g,h,t1,t2,p,q,op,mx,mn,x,y,z,l,r,mid,pos,now,idx,dis,len,all,ave,cnt,cur,last,sumn,other;
string str,s1,s2,s3,te1,te2,sf,sk;
char ch,ch1,ch2;
bool flag,f1,f2,f3,cle;
suma[0]=0;sumb[0]=0;sum[0]=0;
T=1;
//cin>>T;
while(T--) {
//solved();
cin>>n>>m;
//map<int,int>mp;
//for(i=1;i<=n+1;i++) mp[i]=i;
init();
for(i=1;i<=m;i++){
cin>>l>>r;
cnt=0;
for(j=find_set(l);j<=r;j=find_set(j+1)){//若该点已经被学习，则find_set(x)的值会直接超过r
f[j]=find_set(r+1);//将点融入新的集合
cnt++;
}
cout<<cnt<<nl;
}
}
//system("pause");
return 0;
}
E-操作序列2
#解题思路：使用带懒惰标记的线段树进行维护，对操作1记录每个下标的数中1的位置，再进行区间修改，对操作2，对于目标区间内且满足条件的(数二进制中只有一个1了)则乘2，若是叶子节点，则单独进行操作(E的思路倒是运气好想到了大半，但代码量太大，调bug调了半天，遂失败，还是题目写少了，不够熟练)
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
//const ll Mod = 1e9 + 7;
const ll Mod = 998244353;
const ll Max = 1e5 + 7;
const ll MAX = 2e5 + 100;
const ll N = 2e5 + 10;
const ll inf = 1e12 + 100;
const double pi=acos(-1.0);
const double E = exp(1);
const double eps=1e-8;
//char buf[1<<20],*p1,*p2;
#define nl "\n"
#define fir first
#define sec second
//#define re register
//#define int ll
//#define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define setbits1(x, n, m) (x) | ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define setbits0(x, n, m) (x) & ~((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define getbits(x, n, m) (x) & ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define get_reverse_bits(x, n, m) (x) ^ ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
#pragma comment (linker,"/STACK:102400000,102400000")
using namespace std;
inline ll read(){
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch>'9'){
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9'){
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
template<typename I,typename L,I mod> struct Modint {
I v;
I pow(L b) const {
L res=1,a=v;
while(b) { if(b&1) res=res*a%mod; b>>=1; a=a*a%mod; }
return res;
}
I inv() const { return pow(mod-2); }
Modint &operator+=(const Modint &x) { v+=x.v; v-=v>=mod?mod:0; return *this; }
Modint &operator-=(const Modint &x) { v-=x.v; v+=v<0?mod:0; return *this; }
Modint &operator*=(const Modint &x) { v=L(1)*v*x.v%mod; return *this; }
Modint &operator/=(const Modint &x) { v=L(1)*v*x.inv()%mod; return *this; }
friend Modint operator+(Modint l,const Modint &r) { return l+=r; }
friend Modint operator-(Modint l,const Modint &r) { return l-=r; }
friend Modint operator*(Modint l,const Modint &r) { return l*=r; }
friend Modint operator/(Modint l,const Modint &r) { return l/=r; }
Modint operator++(int) { auto res=*this; *this+=1; return res; }
Modint operator--(int) { auto res=*this; *this-=1; return res; }
Modint operator- () { return *this*-1; }
Modint &operator++() { return *this+=1; }
Modint &operator--() { return *this-=1; }
bool operator< (const Modint &x) const { return v< x.v; }
bool operator> (const Modint &x) const { return v> x.v; }
bool operator<=(const Modint &x) const { return v<=x.v; }
bool operator>=(const Modint &x) const { return v>=x.v; }
bool operator==(const Modint &x) const { return v==x.v; }
bool operator!=(const Modint &x) const { return v!=x.v; }
friend istream &operator>>(istream &is,Modint &x) { is>>x.v; x=Modint(x.v); return is; }
friend ostream &operator<<(ostream &os,const Modint &x) { return os<<x.v; }
Modint(L x=0): v((x%=mod)<0?x+mod:x) {}
static_assert(0ULL+mod+mod-2<1ULL<<(sizeof(I)*8-1), "Modint overflow");
static_assert(1ULL*(mod-1)*(mod-1)<1ULL<<(sizeof(L)*8-1), "Modint overflow");
};
using mint=Modint<int,long long,Mod>;
char arr[1000][1000];
ll dp[N][2],cntn[26],dt[N];
ll suma[Max],sumb[Max],sum[N];
int to[N];
string s;
char chs[27];
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
const int dxn[8] = { -1,-2,-2,-1,1,2,2,1 };
const int dyn[8] = { 2,1,-1,-2,2,1,-1,-2 };
vector<ll>e[N];
//mp<pii,int>mp;
ll n,m,k;
bool check(int x,int y){
return x>=1&&x<=n&&y>=1&&y<=m;
}
ll get(ll x){
return x&(-x);//获取二进制数最右边的1
}
struct node{
ll l,r;
ll sum;
bool f;
ll lazymark;//懒惰标记
}tree[N<<2];
ll num[N];
void pushup(ll x){
tree[x].sum=(tree[x<<1].sum+tree[x<<1|1].sum)%Mod;
if(tree[x<<1].f&&tree[x<<1|1].f) //左子树右子树都满足
tree[x].f=true;
else
tree[x].f=false;
}
void pushdown(ll p){//使lz归1，并给子节点乘上自己的lz
//乘的时候保险还是要开ll,写的时候好像就是忘记开了
auto &root = tree[p], &left = tree[p << 1], &right = tree[p << 1 | 1];
if(root.lazymark!=1){
left.lazymark = (left.lazymark * root.lazymark)%Mod;
left.sum = (left.sum * root.lazymark)%Mod;
right.lazymark = (right.lazymark * root.lazymark)%Mod;
right.sum = (right.sum * root.lazymark)%Mod;
root.lazymark = 1;
}
}
void modify1(ll x,ll l,ll r){//操作1
if(!tree[x].sum)
return ;
if(tree[x].l==tree[x].r){
if(tree[x].f)//只剩一个1了
tree[x].sum=0;
else{
ll h=e[tree[x].l].back();//得到最左边1的位置
e[tree[x].l].pop_back();//进行删除
tree[x].sum=(tree[x].sum-(1LL<<h));//操作1
}
if(get(tree[x].sum)==tree[x].sum)
tree[x].f=true;
return ;
}
pushdown(x);//向下传递
ll mid=(tree[x].l+tree[x].r)>>1;
if(l<=mid)
modify1(x<<1,l,r);
if(r>mid)
modify1(x<<1|1,l,r);
pushup(x);//向上传递
}
void modify2(ll x,ll l,ll r){//操作2
if(!tree[x].sum)//本身是0，没1
return;
if(tree[x].l>=l&&tree[x].r<=r&&tree[x].f){//包括在目标区间中且满足条件
tree[x].sum=tree[x].sum*2%Mod;
tree[x].lazymark=tree[x].lazymark*2%Mod;
return;
}
if(tree[x].l==tree[x].r){//叶子
tree[x].sum+=get(tree[x].sum);//要单独加上
if(tree[x].sum==get(tree[x].sum)){
tree[x].f=true;
}
return;
}
pushdown(x);
ll mid=tree[x].l+tree[x].r>>1;
if(l<=mid) modify2(x<<1,l,r);
if(r>mid) modify2(x<<1|1,l,r);
pushup(x);
}
void build(ll now,ll l,ll r){//建树
tree[now]={l,r,0,false,1};
//tree[now].r=r;
if(l==r){//如果是叶子节点
tree[now].sum=num[l];
tree[now].f=(num[l]==get(num[l]));
tree[now].lazymark=1;
return;
}
ll mid=l+r>>1;
build(now<<1,l,mid);//左子树
build(now<<1|1,mid+1,r);//右子树
pushup(now);
}
/*void update(int now,int x,int y,int add){
if(x<=tree[now].l&&tree[now].r<=y){
tree[now].lazymark+=add;
tree[now].sum+=(tree[now].r-tree[now].l+1)*add;
return ;
}
if(tree[now].lazymark)
pushdown(now,tree[now].l,tree[now].r);
int mid=(tree[now].l+tree[now].r)/2;
if(y<=mid)
update(now*2,x,y,add);
else if(x>mid)
update(now*2+1,x,y,add);
else{
update(now*2,x,y,add);
update(now*2+1,x,y,add);
}
pushup(now);
}*/
/*int search(int now,int x,int y){
if(x<=tree[now].l&&tree[now].r<=y){
return tree[now].sum;
}
if(tree[now].lazymark)
pushdown(now,tree[now].l,tree[now].r);
int mid=(tree[now].l+tree[now].r)/2;
if(y<=mid)
return search(now*2,x,y);
else if(x>mid)
return search(now*2+1,x,y);
else{
return search(now*2,x,y)+search(now*2+1,x,y);
}
}*/
ll query(ll p, ll l, ll r){
if(tree[p].l >= l && tree[p].r <= r)//目标区间中
return tree[p].sum;
pushdown(p);//要在前面pushdown
ll mid = tree[p].l + tree[p].r >> 1;
ll res = 0;
if(l <= mid)res = query(p << 1, l, r)%Mod;//与左子树有交集
if(r > mid)res = (res+query(p << 1 | 1, l, r))%Mod;//与右子树有交集
return res;
}
void solved(){
int i,j;
}
int main() {
ios;
//cout << fixed;
//cout.precision(18);
//cout.flush();
int i, j;
ll T,u,v,w,t,g,h,t1,t2,p,q,op,mx,mn,x,y,z,l,r,mid,pos,now,idx,dis,len,all,ave,cnt,cur,last,sumn,other;
string str,s1,s2,s3,te1,te2,sf,sk;
char ch,ch1,ch2;
bool flag,f1,f2,f3,cle;
suma[0]=0;sumb[0]=0;sum[0]=0;
T=1;
//cin>>T;
while(T--) {
//solved();
cin>>n>>q;
for(i=1;i<=n;i++){
cin>>num[i];
for(j=0;j<30;j++)
if(num[i]>>j&1)
e[i].push_back(j);
}
build(1,1,n);
while(q--){
cin>>op>>l>>r;
if(op==1)
modify1(1,l,r);
else if(op==2)
modify2(1,l,r);
else{
ll ans=query(1,l,r);
cout<<ans<<nl;
}
}
}
//system("pause");
return 0;
}
F-NB数
#解题思路：贪心+二分+暴力枚举，二分得出次数，再放到check函数中检验(若a[i]<=cnt)则cnt++,不然若次数仍大于0，则消耗一次(写的时候二分那里居然写错了，调bug的时候居然也没往那看)
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ll Mod = 1e9 + 7;
const ll mod9 = 998244353;
const ll Max = 1e5 + 7;
const ll MAX = 2e5 + 100;
const ll N = 2e5 + 10;
const ll inf = 1e12 + 100;
const double pi=acos(-1.0);
const double E = exp(1);
const double eps=1e-8;
//char buf[1<<20],*p1,*p2;
#define nl "\n"
#define fir first
#define sec second
//#define re register
//#define int ll
//#define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define setbits1(x, n, m) (x) | ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define setbits0(x, n, m) (x) & ~((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define getbits(x, n, m) (x) & ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define get_reverse_bits(x, n, m) (x) ^ ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
#pragma comment (linker,"/STACK:102400000,102400000")
using namespace std;
inline ll read(){
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch>'9'){
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9'){
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
template<typename I,typename L,I mod> struct Modint {
I v;
I pow(L b) const {
L res=1,a=v;
while(b) { if(b&1) res=res*a%mod; b>>=1; a=a*a%mod; }
return res;
}
I inv() const { return pow(mod-2); }
Modint &operator+=(const Modint &x) { v+=x.v; v-=v>=mod?mod:0; return *this; }
Modint &operator-=(const Modint &x) { v-=x.v; v+=v<0?mod:0; return *this; }
Modint &operator*=(const Modint &x) { v=L(1)*v*x.v%mod; return *this; }
Modint &operator/=(const Modint &x) { v=L(1)*v*x.inv()%mod; return *this; }
friend Modint operator+(Modint l,const Modint &r) { return l+=r; }
friend Modint operator-(Modint l,const Modint &r) { return l-=r; }
friend Modint operator*(Modint l,const Modint &r) { return l*=r; }
friend Modint operator/(Modint l,const Modint &r) { return l/=r; }
Modint operator++(int) { auto res=*this; *this+=1; return res; }
Modint operator--(int) { auto res=*this; *this-=1; return res; }
Modint operator- () { return *this*-1; }
Modint &operator++() { return *this+=1; }
Modint &operator--() { return *this-=1; }
bool operator< (const Modint &x) const { return v< x.v; }
bool operator> (const Modint &x) const { return v> x.v; }
bool operator<=(const Modint &x) const { return v<=x.v; }
bool operator>=(const Modint &x) const { return v>=x.v; }
bool operator==(const Modint &x) const { return v==x.v; }
bool operator!=(const Modint &x) const { return v!=x.v; }
friend istream &operator>>(istream &is,Modint &x) { is>>x.v; x=Modint(x.v); return is; }
friend ostream &operator<<(ostream &os,const Modint &x) { return os<<x.v; }
Modint(L x=0): v((x%=mod)<0?x+mod:x) {}
static_assert(0ULL+mod+mod-2<1ULL<<(sizeof(I)*8-1), "Modint overflow");
static_assert(1ULL*(mod-1)*(mod-1)<1ULL<<(sizeof(L)*8-1), "Modint overflow");
};
using mint=Modint<int,long long,Mod>;
char arr[1000][1000];
ll dp[N][2],cntn[26],dt[N];
ll suma[Max],sumb[Max],sum[N];
int to[N];
string s;
char chs[27];
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
const int dxn[8] = { -1,-2,-2,-1,1,2,2,1 };
const int dyn[8] = { 2,1,-1,-2,2,1,-1,-2 };
vector<int>e[N];
//mp<pii,int>mp;
ll n,m,k;
bool check(int x){
int i,j;
ll cnt=0;
for(i=1;i<=n;i++){
if(cnt>=dt[i])
cnt++;
else if(x){
cnt++;
x--;
}
}
return cnt>=m;
}
void solved(){
int i,j;
}
int main() {
ios;
//cout << fixed;
//cout.precision(18);
//cout.flush();
int i, j;
ll T,u,v,w,t,g,h,t1,t2,p,q,op,mx,mn,x,y,z,l,r,mid,pos,now,idx,dis,len,all,ave,cnt,cur,last,sumn,other;
string str,s1,s2,s3,te1,te2,sf,sk;
char ch,ch1,ch2;
bool flag,f1,f2,f3,cle;
suma[0]=0;sumb[0]=0;sum[0]=0;
T=1;
//cin>>T;
while(T--) {
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>dt[i];
l=0;r=n;
while(l<r){
mid=(l+r)>>1;
if(check(mid)) r=mid;
else l=mid+1;
}
cout<<l<<nl;
}
//system("pause");
return 0;
}
扫一扫
145
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
