Submission #348556

#	Time	Username	Problem	Language	Result	Execution time	Memory
348556		Kerim	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9024 ms	1644 KiB

elephants

#include "elephants.h"
#include "bits/stdc++.h"
using namespace std;
#define MAXN 100004
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
set<int>s;
int arr[MAXN],n,l;
void init(int N, int L, int X[]){n=N;l=L;for(int i=0;i<n;i++)s.insert(X[i]),arr[i]=X[i];}
int update(int pos, int val){
	s.erase(arr[pos]);arr[pos]=val;s.insert(val);
	int ans=0,last=-1;
	__typeof((s).begin())it;
	while(1){
		it=s.upper_bound(last);
		if(it==s.end())break;
		ans++;last=*it+l;
	}
  	return ans;
}

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