# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787529 | doowey | Measures (CEOI22_measures) | C++17 | 1573 ms | 5372 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;
typedef pair<ll, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll inf = (ll)1e18;
int main(){
fastIO;
int n, m;
ll d;
cin >> n >> m >> d;
vector<ll> p(n);
for(int i = 0 ; i < n; i ++ ){
cin >> p[i];
}
ll x;
ll big;
ll jv;
for(int i = 0 ; i < m ; i ++ ){
cin >> x;
p.push_back(x);
sort(p.begin(), p.end());
jv=-inf;
big=0ll;
for(int ii = 0 ; ii < p.size(); ii ++ ){
big=max(big, ii * 1ll * d - p[ii] + jv);
jv=max(jv,p[ii]-ii*1ll*d);
}
cout << big/2ll;
if(big % 2 == 0) cout << " ";
else cout << ".5 ";
}
return 0;
}
Compilation message (stderr)
# | 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... |