제출 #345945

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345945		Kevin_Zhang_TW	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	50 / 100	9012 ms	1772 KiB

elephants

#pragma GCC optimize("Ofast")
#pragma GCC target("sse4", "avx2")
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
template<class T> bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
const int inf = 1e9 + 7;
int n, x[MAX_N], len, st[MAX_N];
inline bool cmp(int a, int b) {
	return x[a] < x[b];
}

void init(int N, int L, int X[]) {
	n = N, len = L;
	copy(X, X+N, x);
	copy(X, X+N, st+1);
	sort(st+1, st + N+1);
	st[0] = -inf, st[N+1] = inf;
}
 
int update(int i, int y) {
	int res = 0, lst = -inf, p = 1;
 
	while (st[p] != x[i]) ++p;
 
	x[i] = y;
 
	while (st[p+1] < y)
		st[p] = st[p+1], ++p;
 
	while (y < st[p-1])
		st[p] = st[p-1], --p;
 
	st[p] = y;
 
	for (int i = 1;i <= n;++i) {
		if (lst + len < st[i])
			lst = st[i], ++res;
	}
	return res;
}

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