oj.uz

Submission #156811

# Submission time Handle Problem Language Result Execution time Memory
156811 2019-10-07T14:36:35 Z georgerapeanu Bubble Sort 2 (JOI18_bubblesort2) C++11
0 / 100
 209 ms 190984 KB 
#include "bubblesort2.h"
#pragma once
#include <vector>
#include <map>
#include <algorithm>
#include <set>

using namespace std;

const int NMAX = 5e5;
const int inf = 1 << 28;

int aint[4 * NMAX + 5];
int cnt_less[4 * NMAX + 5];
int lazy[4 * NMAX + 5];
set<int> wh[4 * NMAX + 5];

void propag(int nod,int st,int dr){
    if(lazy[nod] == 0 || st == dr){
        return ;
    }

    aint[2 * nod] -= lazy[nod];
    cnt_less[2 * nod] += lazy[nod];
    lazy[2 * nod] += lazy[nod];
    
    aint[2 * nod + 1] -= lazy[nod];
    cnt_less[2 * nod + 1] += lazy[nod];
    lazy[2 * nod + 1] += lazy[nod];

    lazy[nod] = 0;
}

void update(int nod,int st,int dr,int pos,int val,bool mode){
    propag(nod,st,dr);

    if(dr < pos || st > pos){
        return ;
    }

    if(st == dr){
        if(mode == false){
           wh[nod].erase(val); 
        }
        else{
            wh[nod].insert(val);
        }

        aint[nod] = (wh[nod].empty() ? -inf:*wh[nod].rbegin()) - cnt_less[nod];
        return ;
    }

    int mid = (st + dr) / 2;

    update(nod * 2,st,mid,pos,val,mode);
    update(nod * 2 + 1,mid + 1,dr,pos,val,mode);

    aint[nod] = max(aint[nod * 2],aint[nod * 2 + 1]);
}

void add_range(int nod,int st,int dr,int l,int r,int val){
    propag(nod,st,dr);

    if(dr < l || st > r){
        return ;
    }

    if(l <= st && dr <= r){
        cnt_less[nod] += val;
        aint[nod] -= val;
        lazy[nod] += val;
        return ;
    }

    int mid = (st + dr) / 2;

    add_range(nod * 2,st,mid,l,r,val);
    add_range(nod * 2 + 1,mid + 1,dr,l,r,val);

    aint[nod] = max(aint[nod * 2],aint[nod * 2 + 1]);
}

vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){

    map<int,int> to_norm;

    for(auto it:A){
        to_norm[it] = 1;
    }
    
    for(auto it:V){
        to_norm[it] = 1;
    }

    int lst = 0;

    for(auto &it:to_norm){
        it.second = ++lst;
    }

    for(int i = 0;i < (int)A.size();i++){
        update(1,1,lst,to_norm[A[i]],i + 1,1);
        add_range(1,1,lst,to_norm[A[i]],lst,1);
    }

    vector<int> answer;

    for(int i = 0;i < (int)X.size();i++){
        add_range(1,1,lst,to_norm[A[X[i]]],lst,-1);
        update(1,1,lst,to_norm[A[X[i]]],X[i] + 1,false);
        update(1,1,lst,to_norm[V[i]],X[i] + 1,true);
        add_range(1,1,lst,to_norm[V[i]],lst,1);
        A[i] = X[i];

        answer.push_back(aint[1]);
    }

    return answer;
}

Compilation message

bubblesort2.cpp:2:9: warning: #pragma once in main file
 #pragma once
         ^~~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 209 ms 190984 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 209 ms 190984 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 209 ms 190984 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -