# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95126 | 2019-01-27T14:25:34 Z | figter001 | Watching (JOI13_watching) | C++14 | 5 ms | 420 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef unsigned long long ull; const int N = 1e5+50; const int M = 1e6; const ll oo = 1e18; const int mod = 1e9+7; vector<int> a; int n,p,q; bool can(int w){ int s = p,b = q; for(int i=0;i<n;i++){ int md,lo=i,hi=n-1,f = -1; while(lo <= hi){ int md = (lo+hi)/2; if(a[md] - a[i] + 1 <= 2*w){ lo = md+1; f = md; }else hi = md-1; } lo = i;hi=n-1; int f2 = -1; while(lo <= hi){ int md = (lo+hi)/2; if(a[md] - a[i] + 1 <= w){ lo = md+1; f2 = md; }else hi = md-1; } if(!s && !b)return 0; if(!s){ if(f == -1)return 0; b--; i = f; }else if(!b){ if(f2 == -1)return 0; s--; i = f2; }else if(f == f2){ if(f2 == -1)return 0; s--; i = f2; }else{ if(f == -1)return 0; b--; i = f; } if(i == n-1)return 1; } return 0; } int main(){ #ifndef ONLINE_JUDGE freopen("input.txt","r",stdin); #endif cin>>n>>p>>q; a.resize(n); for(int i=0;i<n;i++)cin>>a[i]; sort(a.begin(),a.end()); ll md,lo=0,hi=1e9,ans = 1e9; while(lo <= hi){ md = (lo+hi)/2; if(can(md)){ hi = md-1; ans = md; }else lo = md+1; } cout << ans << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 420 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |