Submission #799926

#	Time	Username	Problem	Language	Result	Execution time	Memory
799926		Sohsoh84	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	50 / 100	9075 ms	1796 KiB

elephants

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")

#include "elephants.h"
#include <bits/stdc++.h>

#pragma GCC target("avx2")

using namespace std;

const int MAXN = 70000 + 10;

int X[MAXN], n, L;
vector<int> vec; // TODO: multiset

void init(int N, int L_, int X_[]) {
	L = L_;
	for (int i = 0; i < N; i++) {
		X[i] = X_[i];	
		vec.push_back(X[i]);
	}

	n = N;
}

int update(int i, int y) {
	vec.erase(lower_bound(vec.begin(), vec.end(), X[i]));
	X[i] = y;
	vec.insert(lower_bound(vec.begin(), vec.end(), X[i]), X[i]);

	int ans = 0;
	int v = -(L + 1);
	
	for (int i = 0; i < n; i++) {
		if (vec[i] > v + L) {
			v = vec[i];
			ans++;
		}	
	}
	
	return ans;
}

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