# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978219 | 2024-05-09T04:06:05 Z | sleepntsheep | Fish 3 (JOI24_fish3) | C++17 | 133 ms | 11604 KB |
long long lo(long long a,long long b){return a<b?a:b;} #include<stdio.h> #include<assert.h> #include<string.h> #define N 300005 int n,q; long long d,c[N],t[N],b[N],pc[N],bo; int find(int p) { int l=0,r=bo-1,z=-1; while(l<=r) { int o=(l+r)/2; if(b[o]<=p)l=o+1,z=o; else r=o-1; } if(z==-1)return -1; return b[z]; } int main() { scanf("%d%lld",&n,&d); for(int i=1;i<=n;++i) { scanf("%lld",c+i),pc[i]=pc[i-1]+c[i]; if(!c[i])b[bo++]=i; } scanf("%d",&q); for(int l,r,i=0;i<q;++i) { scanf("%d%d",&l,&r); int zero=find(r); if(zero==-1||zero<l)zero=l-1; int ones=pc[zero]-pc[l-1]; if(d==1) { printf("%d\n",ones); } else { if(ones)puts("-1"); else puts("0"); } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 600 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 133 ms | 7860 KB | Output is correct |
2 | Correct | 106 ms | 7252 KB | Output is correct |
3 | Correct | 54 ms | 3804 KB | Output is correct |
4 | Correct | 104 ms | 11600 KB | Output is correct |
5 | Correct | 103 ms | 11604 KB | Output is correct |
6 | Correct | 83 ms | 11308 KB | Output is correct |
7 | Correct | 89 ms | 11328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 64 ms | 848 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 92 ms | 5204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 600 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |