| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 13748 | gs14004 | 코끼리 (Dancing Elephants) (IOI11_elephants) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int U = 1500; // 400 ~ 1500
const int B = 1500; // 400 ~ 1500
struct elem{
int val;
int next;
int cnt;
};
bool operator<(elem a, elem b){ return a.val < b.val; }
vector<elem> bucket[105];
int sentinel = 0;
int a[150005], n, l;
int q_cnt;
void make_arr(){
int piv = 0;
for (int i=0; i<sentinel; i++) {
for (int j=0; j<bucket[i].size(); j++) {
a[piv++] = bucket[i][j].val;
}
}
}
void bucket_clear(){
for (int i=0; i<sentinel; i++) {
bucket[i].clear();
int piv = min(n-i*B,B);
int pt = piv;
bucket[i].resize(piv);
for (int j=i*B+piv-1; j>=i*B; j--) {
while (pt && a[i*B+pt-1] > a[j] + l) pt--;
if(pt == piv){
bucket[i][j-i*B] = {a[j],-1,0};
}
else{
bucket[i][j-i*B].val = a[j];
if(bucket[i][pt-i*B].next == -1){
bucket[i][j-i*B].next = pt-i*B;
}
else{
bucket[i][j-i*B].next = bucket[i][pt-i*B].next;
}
bucket[i][j-i*B].cnt = bucket[i][pt-i*B].cnt + 1;
}
}
}
}
void single_bucket_update(int buck_num, int pos, int val){
}
int query(){
int pos = 0, ret = 0;
for (int i=0; i<sentinel; ) {
ret += bucket[i][pos].cnt + 1;
pos = bucket[i][pos].next;
int new_buck = i+1;
int new_pos = bucket[i][pos].val + l;
while (1){
if(new_buck == sentinel) break;
if(upper_bound(bucket[new_buck].begin(),bucket[new_buck].end(),(elem){new_pos,0,0})
!= bucket[new_buck].end()) break;
new_buck++;
}
if(new_buck == sentinel) break;
i = new_buck;
pos = (int)(upper_bound(bucket[new_buck].begin(),bucket[new_buck].end(),(elem){new_pos,0,0}) - bucket[new_buck].begin());
}
return ret;
}
void init(int N, int L, int* X){
memcpy(a,X,sizeof(int) * N);
n = N;
l = L;
while (sentinel * B < n) sentinel++;
bucket_clear();
}
int update(int i, int y){
q_cnt = (q_cnt + 1) % U;
/*
int piv = i;
int pos = -1;
for (int i=0; i*B<n; i++) {
if(piv >= bucket[i].size()){
piv -= bucket[i].size();
}
else{
pos = i;
break;
}
}
single_bucket_update(pos,piv,y);*/
if(1 || q_cnt == 0){
// make_arr();
a[i] = y;
sort(a,a+n);
bucket_clear();
}
return query();
}
int main(){
int n,l,m,p[150005];
scanf("%d %d %d",&n,&l,&m);
for (int i=0; i<n; i++) {
scanf("%d",&p[i]);
}
init(n,l,p);
for (int i=0; i<m; i++) {
int a,b;
scanf("%d %d",&a,&b);
printf("%d\n",update(a,b));
}
}