# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
355599 | 2021-01-22T19:11:04 Z | David_M | Rice Hub (IOI11_ricehub) | C++14 | 4 ms | 620 KB |
#include "ricehub.h" #include<bits/stdc++.h> using namespace std; int besthub(int R,int L,int X[],long long B){ long long ans, pref[100005], l, r, m, b; for (int i=0; i<R; i++)pref[i]=X[i]+(!!i)*pref[i-1]; for (r=0; r<R; r++){ while(l<r){ m=l+r>>1; b=pref[r]+(!!l)*pref[l-1]-(pref[m]<<1); if((l+r+1)&1)b+=X[m]; if(b<=B)break; l++; } if(r-l>ans)ans=r-l; } return ans+1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 620 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |