Submission #748033

#	Time	Username	Problem	Language	Result	Execution time	Memory
748033		Dan4Life	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	0 / 100	101 ms	262144 KiB

elephants

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second

const int mxN = (int)1.5e5+10;
const int INF = (int)1e9+10;
const int B = 350;
const int nmB = INF/B+2;

set<int> pos[nmB];
int n, L, p[mxN/B];
unordered_map<int,int> b;
set<array<int,3>> block[nmB];

void reUpd(int ind){
    block[ind].clear();
    auto itr = end(pos[ind]);
    while(itr!=begin(pos[ind])){
        itr--;
        auto itr2 = block[ind].lower_bound({*itr+L+1,-1,-1});
        
        if(itr2!=block[ind].end()){
            auto obj = *itr2;
            block[ind].insert({*itr,1+obj[1],obj[2]});
        }
        else block[ind].insert({*itr,1,*itr+L+1});
    }
}

void ins(int x){
    b[x]++; if(b[x]!=1) return;
    int ind = x/B; pos[ind].insert(x); reUpd(ind);
}

void del(int x){
    b[x]--; if(b[x]) return;
    int ind = x/B; pos[ind].erase(x); reUpd(ind);
}

void init(int N, int l, int X[])
{
    n = N; L = l;
    for(int i = 0; i < n; i++)
        p[i]=X[i], ins(p[i]);
}

int update(int i, int y)
{
    del(p[i]); p[i]=y; ins(y);
    int ans = 0, cur = 0;
    for(int i = 0; i < nmB; i++){
        auto itr = block[i].lower_bound({cur,-1,-1});
        if(itr!=block[i].end()) ans+=(*itr)[1], cur = (*itr)[2];
    }
    return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3