| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 819833 |
2023-08-10T14:04:05 Z |
TB_ |
Measures (CEOI22_measures) |
C++17 |
|
1500 ms |
36592 KB |
#include <bits/stdc++.h>
using namespace std;
// #undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
struct Node{
Node *lnode, *rnode;
ll l, r, mval = -1e18, lval = 1e18, toAdd = 0;
Node(int l, int r) : l(l), r(r){
if(r-l > 1){
int mid = (l+r) / 2;
lnode = new Node(l, mid);
rnode = new Node(mid, r);
mval = max(lnode->mval, rnode->mval);
lval = min(lnode->lval, rnode->lval);
}
}
pl query(int lo, int hi){ // max, min
if(r <= lo || hi <= l) return {-1e18, 1e18};
if(r <= hi && lo <= l) return {mval, lval};
push();
pl res1 = lnode->query(lo, hi);
pl res2 = rnode->query(lo, hi);
return {max(res1.F, res2.F), min(res1.S, res2.S)};
}
void update(int lo, int hi, ll vals){
if(r <= lo || hi <= l) return;
if(r-l == 1){
mval = max(mval, vals);
lval = min(lval, vals);
return;
}
push();
lnode->update(lo, hi, vals);
rnode->update(lo, hi, vals);
mval = max(lnode->mval, rnode->mval);
lval = min(lnode->lval, rnode->lval);
}
void add(int lo, int hi, ll val){
if(r <= lo || hi <= l) return;
if(r <= hi && lo <= l){
toAdd+=val;
mval+=val;
lval+=val;
return;
}
push();
lnode->add(lo, hi, val);
rnode->add(lo, hi, val);
mval = max(lnode->mval, rnode->mval);
lval = min(lnode->lval, rnode->lval);
}
void push(){
if(toAdd){
lnode->mval += toAdd;
lnode->lval += toAdd;
lnode->toAdd += toAdd;
rnode->mval += toAdd;
rnode->lval += toAdd;
rnode->toAdd += toAdd;
toAdd = 0;
}
}
};
int main() {
// cout << fixed << setprecision(20);
// auto start = std::chrono::steady_clock::now(); // since(start).count()
cin.tie(0)->sync_with_stdio(0);
ll n, m, d, val;
cin >> n >> m >> d;
vpl v, order;
fo(i, n){
cin >> val;
v.pb({val, 0});
}
fo(x, m){
cin >> val;
v.pb({val, x+1});
}
sort(all(v));
n = v.size();
Node st(0, n);
fo(i, n) order.pb({v[i].S, i});
sort(all(order));
set<ll> lowerCount;
ll ans = 0;
for(auto &[addIndex, index] : order){
ll pos = v[index].F;
st.update(index, index+1, pos-d*distance(lowerCount.begin(), lower_bound(all(lowerCount), index)));
lowerCount.insert(index);
st.add(index+1, n, -d);
ans = max(ans, st.query(0, index+1).F-st.query(index, n).S);
if(!addIndex) continue;
if(ans%2 == 1) cout << fixed << setprecision(1) << ans/2.0 << " ";
else cout << ans/2 << " ";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
784 KB |
Output is correct |
| 2 |
Correct |
25 ms |
696 KB |
Output is correct |
| 3 |
Correct |
24 ms |
728 KB |
Output is correct |
| 4 |
Correct |
24 ms |
732 KB |
Output is correct |
| 5 |
Correct |
24 ms |
732 KB |
Output is correct |
| 6 |
Correct |
25 ms |
700 KB |
Output is correct |
| 7 |
Correct |
24 ms |
724 KB |
Output is correct |
| 8 |
Correct |
24 ms |
724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
784 KB |
Output is correct |
| 2 |
Correct |
25 ms |
696 KB |
Output is correct |
| 3 |
Correct |
24 ms |
728 KB |
Output is correct |
| 4 |
Correct |
24 ms |
732 KB |
Output is correct |
| 5 |
Correct |
24 ms |
732 KB |
Output is correct |
| 6 |
Correct |
25 ms |
700 KB |
Output is correct |
| 7 |
Correct |
24 ms |
724 KB |
Output is correct |
| 8 |
Correct |
24 ms |
724 KB |
Output is correct |
| 9 |
Execution timed out |
1568 ms |
36540 KB |
Time limit exceeded |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1560 ms |
36592 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1560 ms |
36592 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
