# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974208 | 2024-05-03T06:20:56 Z | sleepntsheep | Bitwise (BOI06_bitwise) | C | 1 ms | 600 KB |
#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),l[j]=-2e10; } 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+=(l[j]<=set&&set<=r[j]); if(can==0) set=0; } if(set) for(int i=0;i<p;++i) { int tuna=0; for(int j=at[i];j<at[i+1];++j) if(l[j]<=set&&set<=r[j])tuna=j; l[tuna]-=set,r[tuna]-=set; } z|=set; } printf("%lld",z); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Incorrect | 1 ms | 348 KB | Output isn't correct |
6 | Incorrect | 0 ms | 348 KB | Output isn't correct |
7 | Incorrect | 0 ms | 600 KB | Output isn't correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Incorrect | 0 ms | 348 KB | Output isn't correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Incorrect | 0 ms | 348 KB | Output isn't correct |
12 | Correct | 1 ms | 348 KB | Output is correct |
13 | Incorrect | 0 ms | 348 KB | Output isn't correct |
14 | Incorrect | 0 ms | 348 KB | Output isn't correct |
15 | Incorrect | 0 ms | 348 KB | Output isn't correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Incorrect | 0 ms | 344 KB | Output isn't correct |
18 | Incorrect | 0 ms | 348 KB | Output isn't correct |
19 | Incorrect | 0 ms | 348 KB | Output isn't correct |
20 | Incorrect | 0 ms | 420 KB | Output isn't correct |