/*************************************
* author: marvinthang *
* created: 23.04.2024 22:44:57 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
const long long INF = 1e18;
int n, m, d;
struct Node {
long long res, min_val, max_val;
int cnt;
Node(): res(0), min_val(INF), max_val(-INF), cnt(0) {}
Node(long long val): res(0), min_val(val), max_val(val), cnt(1) {}
Node operator + (const Node &ot) const {
Node ans;
ans.res = max({res, ot.res, ot.max_val + 1LL * cnt * d - min_val});
ans.min_val = min(min_val, ot.min_val + 1LL * cnt * d);
ans.max_val = max(max_val, ot.max_val + 1LL * cnt * d);
ans.cnt = cnt + ot.cnt;
return ans;
}
};
void process(void) {
cin >> n >> m >> d;
m += n;
vector <int> a(m); cin >> a;
vector <int> order(m);
iota(ALL(order), 0);
sort(ALL(order), [&] (int i, int j) { return a[i] < a[j]; });
vector <int> pos(m);
REP(i, m) pos[order[i]] = i;
vector <Node> st(n * 4 + 23);
auto update = [&] (auto &&self, int i, int l, int r, int p, int v) -> void {
if (r - l == 1) {
st[i] = Node(-v);
return;
}
int m = (l + r) / 2;
if (p < m) self(self, i << 1, l, m, p, v);
else self(self, i << 1 | 1, m, r, p, v);
st[i] = st[i << 1] + st[i << 1 | 1];
};
REP(i, m) {
update(update, 1, 0, m, pos[i], a[i]);
if (i >= n) cout << st[1].res / 2 << (st[1].res & 1 ? ".5" : "") << ' ';
}
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("measures");
// int t; cin >> t; while (t--)
process();
// cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:92:2: note: in expansion of macro 'file'
92 | file("measures");
| ^~~~
Main.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:92:2: note: in expansion of macro 'file'
92 | file("measures");
| ^~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
600 KB |
Output is correct |
| 2 |
Correct |
1 ms |
600 KB |
Output is correct |
| 3 |
Correct |
1 ms |
604 KB |
Output is correct |
| 4 |
Correct |
1 ms |
604 KB |
Output is correct |
| 5 |
Correct |
1 ms |
604 KB |
Output is correct |
| 6 |
Correct |
1 ms |
604 KB |
Output is correct |
| 7 |
Correct |
1 ms |
604 KB |
Output is correct |
| 8 |
Correct |
1 ms |
600 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
600 KB |
Output is correct |
| 2 |
Correct |
1 ms |
600 KB |
Output is correct |
| 3 |
Correct |
1 ms |
604 KB |
Output is correct |
| 4 |
Correct |
1 ms |
604 KB |
Output is correct |
| 5 |
Correct |
1 ms |
604 KB |
Output is correct |
| 6 |
Correct |
1 ms |
604 KB |
Output is correct |
| 7 |
Correct |
1 ms |
604 KB |
Output is correct |
| 8 |
Correct |
1 ms |
600 KB |
Output is correct |
| 9 |
Correct |
98 ms |
29780 KB |
Output is correct |
| 10 |
Correct |
100 ms |
29800 KB |
Output is correct |
| 11 |
Correct |
60 ms |
29772 KB |
Output is correct |
| 12 |
Correct |
81 ms |
29780 KB |
Output is correct |
| 13 |
Correct |
53 ms |
29276 KB |
Output is correct |
| 14 |
Correct |
64 ms |
29548 KB |
Output is correct |
| 15 |
Correct |
96 ms |
29008 KB |
Output is correct |
| 16 |
Correct |
53 ms |
29788 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
20 ms |
5212 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
20 ms |
5212 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
