# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428638 | shenxy | Cheerleaders (info1cup20_cheerleaders) | C++11 | 1511 ms | 141148 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 <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
long long inv[17], niv[17];
struct seg {
int s, v;
seg *l, *r;
seg(int _s) {
s = _s, v = 0;
if (s) {
l = new seg(s - 1);
r = new seg(s - 1);
}
}
void update(int i) {
if (s) {
if (i < (1 << (s - 1))) l -> update(i), inv[s - 1] += r -> v;
else r -> update(i - (1 << (s - 1))), niv[s - 1] += l -> v;
v = l -> v + r -> v;
} else ++v;
}
} *root;
int main() {
int N, h;
scanf("%d", &N);
if (N == 0) {
printf("0\n11");
return 0;
}
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... |