# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081037 | ten_xd | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9064 ms | 5868 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;
typedef long long ll;
typedef unsigned long long ull;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define all(t) t.begin(), t.end()
#define pb push_back
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
const int N = 5e5+5, INF = 2e9+54321;
const ull INF_L = (ll)2e18+54321;
int n,q,base,rozmiar_drzewa;
int B[N], XX[N], YY[N];
vector<int> tree;
void update(int v)
{
v += base, tree[v] += 1, v /= 2;
while(v > 0) tree[v] = tree[v*2] + tree[v*2+1], v /= 2;
}
int query(int l, int p)
{
l = l + base - 1, p = p + base + 1;
int res = 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... |