제출 #1241649

#제출 시각아이디문제언어결과실행 시간메모리
1241649adriines06코끼리 (Dancing Elephants) (IOI11_elephants)C++20
26 / 100
9090 ms3652 KiB
#include "elephants.h"
#include<bits/stdc++.h>
using namespace std;
int n,l;
multiset<int>s;
vector<int>p;
void init(int N, int L, int X[])
{
  n = N,l=L;
  p.resize(n);
  for(int i=0;i<n;i++){
    s.insert(X[i]);
    p[i]=X[i];
  }
}

int update(int i, int y)
{
  if(n==1) return 1;
  s.erase(p[i]);
  s.insert(y);
  p[i]=y;
  int cont=1, ant=*s.begin();
  for(int x: s){
    if(ant+l<x){
      cont++;
      ant=x;
    }
  }
  
  return cont;
}
#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...