QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#881093 | #9727. Barkley III | frankly6 | WA | 1ms | 9804kb | C++17 | 4.0kb | 2025-02-04 11:40:13 | 2025-02-04 11:40:13 |
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=-1;
int N, Q, cnt=0;
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;
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];
tag[ln]&=v; 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)
{
if(s==e) tv[n]=~(t[n]&v);
else tv[n]=(t[n]&(~v))|(tv[n]&v);
t[n]&=v; 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)
{
// cout << "n=" << n << ", s=" << s << ", e=" << e << ", L=" << L << ", R=" << R << ", v=" << v << '\n';
if(!(tv[n]&v)&&s>=L&&e<=R) return LIM;
if(s==e) return t[n];
int mid=(s+e)>>1, ln=2*n, rn=2*n+1;
pd(n,s,e);
if(L>mid) return askp(rn,mid+1,e,L,R,v);
if(R<=mid) return askp(ln,s,mid,L,R,v);
int res=askp(ln,s,mid,L,R,v);
return res==LIM?askp(rn,mid+1,e,L,R,v):res;
}
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';
cnt++;
int l=read(), r=read();
auto [v,sum]=asktv(1,1,N,l,r);
// cout << "v, sum=" << v << " " << sum << '\n';
if(!sum) {cout << v << '\n'; continue;}
for(int j=62;;j--) //top digit
{
if((1ll<<j)&sum)
{
int p=askp(1,1,N,l,r,(1ll<<j));
if(cnt==20) cout << "p=" << p << ", j=" << j << ", sum=" << sum << '\n';
for(int k=j;k!=-1;k--)
{
if (((1ll<<k)&sum) && (!((1ll<<k)&p)))
v|=(1ll<<k);
}
cout << v << '\n';
break;
}
}
}
}
return (0-0);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 9804kb
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: 1ms
memory: 9800kb
input:
100 100 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 625967318191814868 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072...
output:
576531121047601152 1 576460752303423488 4263579105072360993 1306043896232411137 4263579105072360993 576531121047601152 633397148123136 0 1153488865559840256 1152922054496880128 1730020640668059136 3533641810948498945 67108864 1730020640668059136 0 633397148123136 1729382296723653632 0 p=201937642696...
result:
wrong answer 20th lines differ - expected: '1730020640668059136', found: 'p=2019376426965286920, j=57, sum=227432408390895105'