# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67232 | MatheusLealV | Bubble Sort 2 (JOI18_bubblesort2) | C++11 | 5576 ms | 237596 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>
#define N 1000050
#define l (2*nod)
#define r (2*nod + 1)
#define mid ((a + b)/2)
using namespace std;
typedef long long ll;
int inf = 2000000000;
int n, v[N], c, bit[N], lim;
vector<int> val;
map<int, int> mapa;
set<int> pos[N];
struct T
{
int tree[4*N], lazy[4*N];
inline void init()
{
for(int i = 0; i < 4*N; i++) lazy[i] = tree[i] = 0;
}
inline void prop(int nod, int a, int b)
{
# | 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... |