# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118183 | Bananabread | Bulldozer (JOI17_bulldozer) | C++14 | 2048 ms | 2384 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>
#define ll long long
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "APPLICATION"
#define frep freopen(taskname".inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
ll a[200001];
ll b[200001];
ll n=2e5,m=10,d;
bool check(ll p,vector<ll> &curr){
ll last=-2e16;
for(auto j:curr){
ll mn=max(last+d,j-p);
if(abs(j-mn)>p) return 0;
last=mn;
}
return 1;
}
void sub1(){
d*=2;
vector<ll> curr,nxt,bs;
for(int i=1;i<=n;i++) curr.push_back(2*a[i]);
for(int i=0;i<m;i++){
curr.push_back(2*b[i+1]);
sort(curr.begin(),curr.end());
ll ans=1e16;
ll lo=0,hi=1e16;
while(lo<=hi){
ll mid=(lo+hi)/2;
# | 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... |