Submission #1249142

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249142		redacode	Dancing Elephants (IOI11_elephants)	C++20	26 / 100	9092 ms	1860 KiB

elephants

#include "elephants.h"
#include "bits/stdc++.h"
using namespace std;
int n;
int l;
bool cmp(pair<int, int>& a, 
        pair<int, int>& b) 
{ 
    return a.second < b.second; 
} 

vector<pair<int, int> > A; 

void sort_map(map<int, int>& M) 
{ 
    A.clear();
    for (auto& it : M) { 
        A.push_back(it); 
    } 

    sort(A.begin(), A.end(), cmp); 

} 

map<int,int> pos;

void init(int N, int L, int X[])
{
  n = N;
  l =L;
  for(int i=0;i<n;i++){
      pos[i]=X[i];
  }
}



int update(int i, int y)
{
    if(n==1){
        return 1;
    }
   pos[i]=y;
   sort_map(pos);
   int cnt =0;
   int start = A[0].second;
   for(int i=1;i<n;i++){
       if(A[i].second-start>l){
           start = A[i].second;
           cnt++;
       }
       if(i==n-1) cnt++;
   }
   if(cnt==0)cnt++;
   return cnt;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3