| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 345736 | Kevin_Zhang_TW | Dancing Elephants (IOI11_elephants) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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];
void init(int N, int L, int X[]) {
n = N, len = L;
copy(X, X+N, x);
iota(st, st+n, 0);
}
bool cmp(int a, int b) {
return x[a] < x[b];
}
int update(int i, int y) {
x[i] = y;
sort(st, st + n, cmp);
int res = 1, lst = x[st[0]];
for (int i = 0;i < n;++i)
if (lst + len < x[st[i]])
lst = x[st[i]], ++res;
return res;
}