# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541844 | tabr | Dancing Elephants (IOI11_elephants) | C++17 | 2 ms | 468 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.
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
const int N = 150015;
int B;
int n;
int l;
int x[N];
int cnt;
void init(int n_, int l_, int x_[]) {
n = n_;
l = l_;
B = (int) sqrt(n_);
for (int i = 0; i < n; i++) {
x[i] = x_[i];
}
}
void build() {
}
int update(int i, int y) {
if (cnt == 0) {
build();
}
cnt++;
if (cnt == n / B) {
cnt = 0;
}
}
#ifdef tabr
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}
#endif
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |