# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
957976 | 2024-04-04T15:22:26 Z | Nika533 | Rice Hub (IOI11_ricehub) | C++17 | 52 ms | 1372 KB |
#pragma GCC diagnostic warning "-std=c++11" #include <bits/stdc++.h> #include "ricehub.h" #define pb push_back #define f first #define s second #define MOD 1000000007 #define flush fflush(stdout) #define all(x) (x).begin(),(x).end() #define allr(x) (x).rbegin(), (x).rend() #define pii pair<int,int> using namespace std; int m,T,k; int besthub(int n, int L, int X[], long long B){ set<pair<int,int>> s; long long pref[n+1]; pref[0]=0; for (int i=0; i<n; i++) { s.insert({X[i],i}); pref[i+1]=pref[i]+X[i]; } int ans=0; for (int i=0; i<n; i++) { int l=0,r=L+5,val; while (l<=r) { int mid=(l+r)/2; set<pii> :: iterator it2=s.upper_bound({X[i]+mid,n}),it1=s.lower_bound({X[i]-mid,0}); it2--; long long a=(*it1).s,b=(*it2).s; long long num=X[i]; num*=(b+a-2*i); long long sum=(pref[b+1]-pref[i+1])-(pref[i]-pref[a])-num; if (sum<=B) { l=mid+1; val=num; } else { r=mid-1; } //cout<<"MID "<<mid<<" "<<num<<" "<<sum<<" "<<a<<" "<<b<<" "<<c<<" "<<d<<endl; } //cout<<"I "<<val<<endl; ans=max(ans,val); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 52 ms | 1372 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |