Submission #799940

#	Time	Username	Problem	Language	Result	Execution time	Memory
799940		Sohsoh84	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	26 / 100	9017 ms	2080 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;

int X[MAXN], n, L;
int A[MAXN]; // TODO: multiset

void init(int N, int L_, int X_[]) {
	L = L_;	
	fill(A, A + MAXN, -1);
	for (int i = 0; i < N; i++) {
		X[i] = X_[i];	
		A[i] = X[i];
	}
	
	n = N;
}

int update(int i, int y) {
	int ind = lower_bound(A, A + n, X[i]) - A;
	int tx = X[i];
	X[i] = y;
	A[ind] = y;
	
	if (tx < y) {
		for (int i = 0; i < MAXN - 1; i++)
			if (A[i] > A[i + 1] && A[i + 1] != -1)
				swap(A[i], A[i + 1]);
	} else {
		for (int i = MAXN - 1; i > 0; i--) {
			if (A[i] < A[i - 1] && A[i] != -1)
				swap(A[i], A[i - 1]);
		}
	}

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

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