oj.uz

Submission #937072

# Submission time Handle Problem Language Result Execution time Memory
937072 2024-03-03T11:06:12 Z Ludissey Measures (CEOI22_measures) C++14
76 / 100
 356 ms 36916 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
 
struct Node {
    Node *left;
    Node *right;
    int mn,mx,lazy,children;
    Node() : left(NULL), right(NULL), mn(0), mx(0), lazy(0), children(0) {};
    void update(){
        mx=max(left->mx, right->mx);
        mn=min(left->mn, right->mn);
        children=left->children+right->children;
    }
};

Node *NODE;
int D;

void propagate(Node* root){
    if(root->lazy>0){
        if(root->left) root->left->lazy+=root->lazy;
        if(root->right) root->right->lazy+=root->lazy;
        root->mn+=D*root->lazy;
        root->mx+=D*root->lazy;
        root->lazy=0;
    }
}

void build(Node* root, int l, int r){
    if(l==r) {
        root->mx=-1e18;
        root->mn=1e18;
        return;
    }
    int mid=(l+r)/2;
    root->left=new Node;
    root->right=new Node;
    build(root->left,l,mid);
    build(root->right,mid+1,r);
    root->update();
}

pair<int,int> minmax(Node* root, int l, int r, int ql, int qr){
    propagate(root);
    if(qr<l||ql>r) return {1e18, -1e18};
    if(ql<=l&&r<=qr){
        return {root->mn, root->mx};
    }
    int mid=(l+r)/2;
    pair<int,int> a,b;
    a=minmax(root->left,l,mid,ql,qr);
    b=minmax(root->right,mid+1,r,ql,qr);
    return {min(a.first,b.first), max(a.second,b.second)};
}
int kthPos(Node* root, int l, int r, int ql, int qr){
    if(qr<l||ql>r) return 0;
    if(ql<=l&&r<=qr){
        return root->children;
    }
    int mid=(l+r)/2;
    pair<int,int> a,b;
    return kthPos(root->left,l,mid,ql,qr)+kthPos(root->right,mid+1,r,ql,qr);
}

void update(Node* root, int l, int r, int p, int v){
    propagate(root);
    if(r<p||l>p) return;
    if(l==p&&r==p){
        root->mn=v;
        root->mx=v;
        root->children=1;
        return;
    }
    int mid=(l+r)/2;
    update(root->left,l,mid,p,v);
    update(root->right,mid+1,r,p,v);
    root->update();
}

void updateLAZY(Node* root, int l, int r, int ql, int qr){
   if(r<ql||l>qr) return;
    if(l>=ql&&r<=qr){
        root->lazy++;
        propagate(root);
        return;
    }
    propagate(root);
    int mid=(l+r)/2;
    updateLAZY(root->left,l,mid,ql,qr);
    updateLAZY(root->right,mid+1,r,ql,qr);
    root->update();
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n,m; cin >> n >> m >> D;
    NODE=new Node;
    vector<pair<int,int>> asort(m);
    vector<pair<int,int>> a(m);
    for (int i = 0; i < m; i++)
    {
        cin >> a[i].first;
        asort[i]={a[i].first,i};
    }
    sort(asort.begin(),asort.end());
    for (int i = 0; i < m; i++) a[asort[i].second].second=i;
    build(NODE, 0, m-1);
    int retMax=0;
    for (int _i = 0; _i < m; _i++)
    {
        int x=a[_i].first;
        update(NODE, 0, m-1, a[_i].second, (kthPos(NODE, 0, m-1, 0, a[_i].second)*D)-x);
        updateLAZY(NODE, 0, m-1, a[_i].second+1, m-1);
        int cmin=minmax(NODE, 0, m-1, 0, a[_i].second).first;
        int cmax=minmax(NODE, 0, m-1, a[_i].second, m-1).second;
        retMax=max(cmax-cmin, retMax);
        if(retMax%2==0) cout << retMax/2LL << " ";
        else cout << retMax/2LL << ".5 ";
    }
    cout << "\n";
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 34612 KB Output is correct
2 Correct 208 ms 36632 KB Output is correct
3 Correct 211 ms 36420 KB Output is correct
4 Correct 231 ms 34360 KB Output is correct
5 Correct 215 ms 35600 KB Output is correct
6 Correct 204 ms 34604 KB Output is correct
7 Correct 210 ms 35724 KB Output is correct
8 Correct 229 ms 34388 KB Output is correct
9 Correct 203 ms 34216 KB Output is correct
10 Correct 243 ms 36564 KB Output is correct
11 Correct 203 ms 35156 KB Output is correct
12 Correct 208 ms 36436 KB Output is correct
13 Correct 203 ms 34280 KB Output is correct
14 Correct 229 ms 36064 KB Output is correct
15 Correct 215 ms 35932 KB Output is correct
16 Correct 199 ms 33872 KB Output is correct
17 Correct 208 ms 35412 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 34612 KB Output is correct
2 Correct 208 ms 36632 KB Output is correct
3 Correct 211 ms 36420 KB Output is correct
4 Correct 231 ms 34360 KB Output is correct
5 Correct 215 ms 35600 KB Output is correct
6 Correct 204 ms 34604 KB Output is correct
7 Correct 210 ms 35724 KB Output is correct
8 Correct 229 ms 34388 KB Output is correct
9 Correct 203 ms 34216 KB Output is correct
10 Correct 243 ms 36564 KB Output is correct
11 Correct 203 ms 35156 KB Output is correct
12 Correct 208 ms 36436 KB Output is correct
13 Correct 203 ms 34280 KB Output is correct
14 Correct 229 ms 36064 KB Output is correct
15 Correct 215 ms 35932 KB Output is correct
16 Correct 199 ms 33872 KB Output is correct
17 Correct 208 ms 35412 KB Output is correct
18 Correct 352 ms 34644 KB Output is correct
19 Correct 328 ms 36600 KB Output is correct
20 Correct 213 ms 36408 KB Output is correct
21 Correct 250 ms 34568 KB Output is correct
22 Correct 309 ms 34900 KB Output is correct
23 Correct 214 ms 34696 KB Output is correct
24 Correct 307 ms 35124 KB Output is correct
25 Correct 210 ms 34488 KB Output is correct
26 Correct 316 ms 34548 KB Output is correct
27 Correct 321 ms 36916 KB Output is correct
28 Correct 293 ms 34896 KB Output is correct
29 Correct 356 ms 36116 KB Output is correct
30 Correct 242 ms 34208 KB Output is correct
31 Correct 243 ms 36436 KB Output is correct
32 Correct 220 ms 36068 KB Output is correct
33 Correct 319 ms 33848 KB Output is correct
34 Correct 249 ms 35784 KB Output is correct