# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1102663 | vladilius | Measures (CEOI22_measures) | C++17 | 1560 ms | 660 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;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, d; cin>>n>>m>>d;
vector<int> a;
for (int i = 1; i <= n; i++){
int x; cin>>x;
a.pb(x);
}
while (m--){
int x; cin>>x;
a.pb(x);
sort(a.begin(), a.end());
vector<ll> f(a.size());
f[0] = a[0];
for (int i = 1; i < a.size(); i++){
f[i] = max((ll) a[i], f[i - 1] + d);
}
ll out = 0;
for (int i = 0; i < f.size(); i++){
out = max(out, f[i] - a[i]);
}
cout<<1.0 * out / 2<<" ";
}
}
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... |