제출 #747986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
747986		Dan4Life	Dancing Elephants (IOI11_elephants)	C++17	0 / 100	0 ms	340 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN = (int)1.5e5+10;
const int B = 240;

set<int> S;
int n, L, ok, p[mxN/B];
unordered_map<int,int> a, b;
vector<pair<int,int>> block[mxN/B];

void ins(int x){
    b[x]++; if(b[x]!=1) return; a[x]=1;
    if(ok) { S.insert(x); return; }
}

void del(int x){
    b[x]--; if(!b[x]) return; a[x]=0;
    if(ok) { S.erase(x); return;}
}

void init(int N, int l, int X[])
{
    n = N; L = l;
    if(L > N/B or 1) ok=1;
    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;
    if(ok){
        auto itr = S.begin();
        while(itr!=S.end()) itr = S.upper_bound(*itr+L), ans++;
        return ans;
    }
    return ans;
}

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