# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305538 | theshadow_04 | Watching (JOI13_watching) | C++14 | 1 ms | 384 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.
// W i B
#include <bits/stdc++.h>
#define F first
#define S second
#define MOD 998244353
#define pb push_back
#define bit(x,p) ((x>>p) & 1)
#define ll long long
#define Task "Ojuz"
using namespace std;
const int base = 100003;
const int maxn = 1000005;
int n,p,q;
int a[maxn];
bool Check(int x){
int s = p,l = q,i = 1;
for(;i <= n;){
int pos1 = upper_bound(a + 1,a + n + 1,a[i] + x - 1) - a - 1;
int pos2 = upper_bound(a + 1,a + n + 1,a[i] + 2 * x - 1) - a - 1;
if(pos2 > pos1 && l) i = pos2 + 1,l --;
else if(s) i = pos1 + 1,s--;
else break;
}
return (i >= n);
}
void Solve(){
cin >> n >> p >> q;
a[n + 1] = 2e9;
for(int i = 1;i <= n;++i) cin >> a[i];
sort(a + 1,a + n + 1);
int l = 0,r = 2e9;
while(r - l > 1){
int mid = l + r >> 1;
if(Check(mid)) r = mid;
else l = mid;
}
cout << r;
}
void NumTime(){
cerr << "Toi" << "\n";cerr << "Di" << "\n";cerr << "Chep" << "\n";cerr << "Code" << "\n";
}
int main(){
ios_base::sync_with_stdio(0);
cout.tie(0); cin.tie(0);
if(fopen(Task".inp","r")){
freopen(Task".inp","r",stdin);
freopen(Task".out","w",stdout);
}
int test = 1;
// cin >> test;
while(test --){
NumTime();
Solve();
}
}
// V T An
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |