Submission #233425

#TimeUsernameProblemLanguageResultExecution timeMemory
233425crossing0verDancing Elephants (IOI11_elephants)C++17
26 / 100
9022 ms2968 KiB
#include <bits/stdc++.h>
#include "elephants.h"
using namespace std;
int n,L,P[100000];
multiset<int> s;
void init(int N, int L1, int X[])
{
  n = N; L = L1; 
  for (int i = 0; i < n; i++) P[i+1] = X[i],s.insert(X[i]);
  
}

int update(int i, int y)
{
	i++;
  s.erase(s.find(P[i]));
  s.insert(y);
  P[i] = y;
  int last = INT_MIN,ans = 0;
  for (auto it = s.begin(); it != s.end(); it++) {
  	if (*it > last + L)
  		ans++, last = *it;
  }
  	
  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...