# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556477 | 2022-05-03T08:37:45 Z | Dan4Life | Rice Hub (IOI11_ricehub) | C++17 | 2 ms | 468 KB |
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; #define ll long long ll pref[100010]; ll sum(int i, int j){ return pref[j+1]-pref[i]; } int besthub(int n, int m, int a[], ll b) { pref[0] = 0; int ans = 0; for(int i = 0; i < n; i++) pref[i+1] = pref[i]+a[i]; for(int i = 0; i < n; i++){ int l = i, r = n-1; while(l<r){ int mid = (l+r+1)/2; int x = (i+mid+1)/2, xx = (i+mid-1)/2; if(sum(x,mid)-sum(i,x-1)<=b) l=mid; else r = mid-1; } ans = max(ans, l-i+1); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 1 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 468 KB | Output is correct |
2 | Incorrect | 2 ms | 468 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |