QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#880940 | #9727. Barkley III | frankly6 | WA | 0ms | 9808kb | C++17 | 4.2kb | 2025-02-04 01:50:51 | 2025-02-04 01:50:53 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<climits>
#define int unsigned long long
using namespace std;
typedef pair<int,int> PII;
const int MX=1000100;
const int inf=0x3fffffff;
const int LIM=(1ull<<63)-1;
int N, Q;
int ar[MX];
int t[4*MX], tv[4*MX]; //t[i]: &[l,r], tv[i]: 1/0
int tag[4*MX];
int read()
{
int r=0, f=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
return r*f;
}
void bt(int n, int s, int e)
{
if(s==e)
{
t[n]=ar[s];
tv[n]=~ar[s];
tag[n]=-1;
// cout << "tag=" << tag[n] << ", " << (tag[n]==-1) << '\n';
return;
}
int mid=(s+e)>>1, ln=2*n, rn=2*n+1;
bt(ln,s,mid); bt(rn,mid+1,e);
tag[n]=-1;
t[n]=t[ln]&t[rn];
tv[n]=(t[ln]&tv[rn])|(t[rn]&tv[ln]);
}
void pd(int n, int s, int e)
{
if(tag[n]==-1) return;
int mid=(s+e)>>1, ln=2*n, rn=2*n+1;
int v=tag[n];
tv[ln]=(t[ln]&(~v))|(tv[ln]&v);
tv[rn]=(t[rn]&(~v))|(tv[rn]&v);
t[ln]&=v; t[rn]&=v;
if(mid==s) tv[ln]=~t[ln];
if(mid+1==e) tv[rn]=~t[rn];
if(tag[ln]==-1) tag[ln]=v;
else tag[ln]&=v;
if(tag[rn]==-1) tag[rn]=v;
else tag[rn]&=v;
tag[n]=-1;
}
void upd(int n, int s, int e, int L, int R, int v, int tpe)
{
if(s>=L&&e<=R)
{
if(tpe==1)
{
t[n]&=v;
if(s==e) tv[n]=~t[n];
else tv[n]=(t[n]&(~v))|(tv[n]&v);
if(tag[n]==-1) tag[n]=v;
else tag[n]&=v;
}
else
{
t[n]=v; tv[n]=~v; tag[n]=-1;
}
return;
}
else if(s>R||e<L) return;
int mid=(s+e)>>1, ln=2*n, rn=2*n+1;
pd(n,s,e);
upd(ln,s,mid,L,R,v,tpe);
upd(rn,mid+1,e,L,R,v,tpe);
t[n]=t[ln]&t[rn];
tv[n]=(t[ln]&tv[rn])|(t[rn]&tv[ln]);
}
PII asktv(int n, int s, int e, int L, int R)
{
if(s>R||e<L) return {LIM,LIM};
if(s>=L&&e<=R) return {t[n],tv[n]};
int mid=(s+e)>>1, ln=2*n, rn=2*n+1;
pd(n,s,e);
auto [t1,v1]=asktv(ln,s,mid,L,R);
auto [t2,v2]=asktv(rn,mid+1,e,L,R);
if(R<=mid) return {t1,v1};
if(L>mid) return {t2,v2};
return {t1&t2,(t1&v2)|(t2&v1)};
}
int askp(int n, int s, int e, int L, int R, int v)
{
if(s>R||e<L) return LIM;
if(s==e) return s;
int mid=(s+e)>>1, ln=2*n, rn=2*n+1;
pd(n,s,e);
if((v&tv[ln])>=(v&tv[rn]))
{
int tmp=askp(ln,s,mid,L,R,v);
if(tmp==LIM) tmp=askp(rn,mid+1,e,L,R,v);
// cout << "ltmp=" << tmp << ", s=" << s << ", mid=" << mid << ", e=" << e << ", tvl=" << (tv[n]&tv[ln]) << ", tvr=" << (tv[n]&tv[rn]) << '\n';
return tmp;
}
else
{
int tmp=askp(rn,mid+1,e,L,R,v);
if(tmp==LIM) tmp=askp(ln,s,mid,L,R,v);
// cout << "rtmp=" << tmp << ", s=" << s << ", mid=" << mid << ", e=" << e << ", tvl=" << (tv[n]&tv[ln]) << ", tvr=" << (tv[n]&tv[rn]) << '\n';
return tmp;
}
}
int ask(int n, int s, int e, int L, int R)
{
if(s>=L&&e<=R) return t[n];
if(s>R||e<L||L>R) return LIM;
int mid=(s+e)>>1, ln=2*n, rn=2*n+1;
pd(n,s,e);
return ask(ln,s,mid,L,R)&ask(rn,mid+1,e,L,R);
}
signed main()
{
// freopen("testdata.in","r",stdin);
N=read(); Q=read();
for(int i=1;i<=N;i++)
{
ar[i]=read();
}
bt(1,1,N);
while(Q--)
{
int opt=read();
if(opt==1)
{
int l=read(), r=read(), x=read();
upd(1,1,N,l,r,x,1);
}
if(opt==2)
{
int s=read(), x=read();
// cout << "bef: "; for(int i=1;i<=N;i++) cout << ask(1,1,N,i,i) << " "; cout << '\n';
upd(1,1,N,s,s,x,2);
// cout << "aft: "; for(int i=1;i<=N;i++) cout << ask(1,1,N,i,i) << " "; cout << '\n';
}
if(opt==3)
{
// cout << "ar: "; for(int i=1;i<=N;i++) cout << ask(1,1,N,i,i) << " "; cout << '\n';
int l=read(), r=read();
int sum=asktv(1,1,N,l,r).second;
int p=askp(1,1,N,l,r,sum);
// cout << "p=" << p << '\n';
cout << (ask(1,1,N,l,p-1)&ask(1,1,N,p+1,r)) << '\n';
}
}
return (0-0);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 9808kb
input:
5 9 7 7 7 6 7 3 1 5 2 1 3 3 1 5 3 1 3 1 1 2 3 3 1 3 2 2 8 3 1 3 3 1 2
output:
7 6 7 3 3 8
result:
ok 6 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 9804kb
input:
10 10 6760061359215711796 1568091718842717482 1568091718842717482 1568091718842717482 5232472783634052627 8795942500783873690 1568091718842717482 1568091718842717482 1568091718842717482 1568091718842717482 1 3 5 7587422031989082829 3 6 10 1 7 8 5197616143400216932 2 4 2518604563805514908 2 2 4533959...
output:
1568091718842717482 35184908959744 176025477579040 8795942500783873690
result:
ok 4 lines
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 9808kb
input:
100 100 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 625967318191814868 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072...
output:
70368744185856 0 1 4263579105072360993 1306043896232411137 4263579105072360993 70368744177664 633397148123136 0 576531718266945536 562951027425280 1730020640668059136 3533641810948498945 67108864 1730020640668059136 0 633397148123136 1729382296723653632 0 1730020640668059136 3533641810948498945 0 56...
result:
wrong answer 1st lines differ - expected: '576531121047601152', found: '70368744185856'