제출 #248585

#제출 시각아이디문제언어결과실행 시간메모리
248585davi_bart코끼리 (Dancing Elephants) (IOI11_elephants)C++14
0 / 100
1 ms1152 KiB
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "elephants.h"
using namespace std;
typedef long long ll;
//#define int ll
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector<int> v(200010);
set<int> k;
int dim;
void init(int N, int L, int X[]){
  n=N;
  for(int i=0;i<N;i++){
      v[i]=X[i];
      k.insert(X[i]);
  }
  dim=L;
}

int update(int i,int y){
  k.erase(v[i]);
  v[i]=y;
  k.insert(v[i]);
  int tot=0;
  int pos=*k.begin();
  for(int x:k){
    if(x-pos<=dim)continue;
    tot++;
    pos=x;
  }
  return tot;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...