# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005310 | ErJ | Measures (CEOI22_measures) | C++17 | 504 ms | 16296 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;
#define ll long double
#define vi vector<ll>
#define pp pair<ll, ll>
#define vp vector<pp>
#define vvi vector<vi>
#define inf 1000000000000000
#define rep(i,n) for(int i = 0; i < n; i++)
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n, m;
ll d;
cin >> n >> m >> d;
d *= 2;
if(n != 0){
vi A(n);
rep(i, n) {
cin >> A[i];
A[i] *= 2;
}
ll M = m;
rep(i, M){
ll next;
cin >> next;
next *= 2;
A.push_back(next);
vi B(A.size());
rep(j, A.size()) B[j] = A[j];
sort(B.begin(), B.end());
ll m = B.size();
vp dp(m);
dp[0] = {0, B[0]};
for(int i = 1; i < m; i++){
ll pos = B[i] + dp[i - 1].first;
pos = min(pos, max(dp[i - 1].second + d, B[i] - dp[i-1].first));
ll plus = (dp[i-1].second + d - pos) / 2;
if(plus < 0) plus = 0;
dp[i] = {dp[i-1].first + plus, pos + plus};
}
long long x = dp[n + i].first;
cout << x / 2;
if(x % 2 == 1){
cout <<".5";
}
cout << " ";
}
}else{
vi A(m);
rep(i,m) {
cin >> A[i];
A[i] *= 2;
}
vp dp(m);
dp[0] = {0, A[0]};
for(int i = 1; i < m; i++){
ll pos = A[i] + dp[i - 1].first;
pos = min(pos, max(dp[i - 1].second + d, A[i] - dp[i-1].first));
ll plus = (dp[i-1].second + d - pos) / 2;
if(plus < 0) plus = 0;
dp[i] = {dp[i-1].first + plus, pos + plus};
}
rep(i, dp.size()){
long long x = dp[i].first;
cout << x / 2;
if(x %2 == 1){
cout <<".5";
}
cout << " ";
}
}
cout << endl;
}
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... |