Submission #954389

#	Time	Username	Problem	Language	Result	Execution time	Memory
954389		vjudge1	Dancing Elephants (IOI11_elephants)	C++98	26 / 100	9094 ms	9308 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

int n, k;
int diff[150001];
pair<int, int> arr[150001];

bool compare(const pair<int, int> &a, const pair<int, int> &b){
  return a.second<b.second;
}

void init(int N, int L, int X[]){
  n = N;
  k=L;
  for(int i=0; i<n; i++){
    arr[i].first=X[i];
    arr[i].second=i;
  }
}

int update(int i, int y){
  sort(arr, arr+n, compare);
  arr[i].first=y;
  sort(arr, arr+n);
  for(int i=0; i<n-1; i++)
    diff[i]=arr[i+1].first-arr[i].first;
  int cnt=0, l=0, r=0, ans=0;
  while(l<n){
    r=l;
    cnt=0;
    while(r<n && diff[r]+cnt<=k){
      cnt+=diff[r];
      r++;
    }
    ans++;
    l=r+1;
  }
  return ans;
}

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