Submission #411834

#	Time	Username	Problem	Language	Result	Execution time	Memory
411834		jeqcho	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9020 ms	2756 KiB

elephants

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

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define fi first
#define se second

int N;
int L;
int const n=5e4+3;
int X[n];
multiset<int> x;

// subtask 1,2

void init(int N1, int L1, int X1[])
{
	L=L1;
	N = N1;
	F0R(i,N)
	{
		X[i]=X1[i];
	  x.insert(X1[i]);
	}
}

int update(int idx, int y)
{
	x.erase(x.find(X[idx]));
	x.insert(y);
	X[idx]=y;
	int cnt=0;
	int b=-1;
	trav(e,x)
	{
		if(e>b)
		{
			++cnt;
			b = e+L;
		}
	}
	return cnt;
}

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