# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523608 | DanerZein | Discharging (NOI20_discharging) | C++14 | 277 ms | 23748 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX_N=1e6+10;
const ll MAX=1e9;
ll val[MAX_N];
ll n,c;
ll mdp[MAX_N];
ll pre[MAX_N];
ll coste(ll i,ll x){
/* ll d=val[i]-x;
return d*d+pre[i];*/
ll tx=n+1; tx*=x;
ll b=pre[i]-i*x;
return tx+b;
}
ll time(ll i,ll j){
ll l=val[i],r=val[i];
while(coste(i,r)<coste(j,r)){
l=r+1;
r*=2;
}
while(r>l){
ll mid=(l+r)/2;
if(coste(i,mid)>=coste(j,mid)) r=mid;
else l=mid+1;
}
return r;
}
int main(){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |