# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054096 | NeroZein | Bubble Sort 2 (JOI18_bubblesort2) | 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.
#include "bubblesort2.h"
#include "bits/stdc++.h"
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
const int M = 1e5 + 5;
int tree[M];
void upd (int id, int v) {
id++;
while (id < M) {
tree[id] += v;
id += id & -id;
}
}
int qry (int id) {
id++;
int ret = 0;
while (id) {
ret += tree[id];
id -= id & -id;
}
return ret;