Submission #1241178

#TimeUsernameProblemLanguageResultExecution timeMemory
1241178porquenomedejainiciarsesion코끼리 (Dancing Elephants) (IOI11_elephants)C++20
26 / 100
9090 ms5852 KiB
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
int n,l;
multiset<int> S;
unordered_map<int,int> M;
vector<int> A;
void init(int N, int L, int X[])
{
  for(int i=0;i<N;i++){
    M[X[i]]++;
    S.insert(X[i]);
    A.push_back(X[i]);
  }
  l=L;
  n = N;
}

int update(int i, int y)
{
  int old = A[i];
  A[i] = y;
  auto it = S.find(old); 
  if (it != S.end()) S.erase(it);
  S.insert(y);
  int last=-1e9;
  int ans=0;
  for(auto x:S){
    if(last+l<x){
      last=x;
      ans++;
    }
  }
  return ans;
}
#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...