# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974228 | sleepntsheep | Bitwise (BOI06_bitwise) | C11 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#define N 10000
int n,p,k[N],at[N+1];long long z,l[N],r[N];
int main()
{
scanf("%d%d",&n,&p);
for(int i=0;i<p;++i)
scanf("%d",k+i);
for(int i=0,len=0;i<p;++i)
{
at[i]=len;
at[i+1]=len+=k[i];
for(int j=at[i];j<at[i+1];++j)
scanf("%lld%lld",l+j,r+j);
}
for(long long b=31;b>=0;--b)
{
long long set=1ll<<b;
for(int i=0;i<p;++i)
{
int can=0;
for(int j=at[i];j<at[i+1];++j) can+=(set<=r[j]);
if(can==0)
set=0;
}
for(int i=0;set&&i<p;++i)
{
int tuna=-8686;
for(int j=at[i];j<at[i+1];++j)
{
if(l[j]>=0&&((1ll<<b)&l[j]))
{
l[j]-=set;
r[j]-=set;
tuna=-8787;
}
}
if (tuna==-8686)
{
for(int j=at[i];j<at[i+1];++j)
if(set<=r[j])
tuna=j;
l[tuna]-=-2e10;
r[tuna]-=set;
}
}
z|=set;
}
printf("%lld",z);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |