# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156816 | georgerapeanu | Bubble Sort 2 (JOI18_bubblesort2) | C++11 | 1759 ms | 312272 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"
#pragma once
#include <vector>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
const int NMAX = 5e5;
const int inf = 1 << 28;
int aint[4 * NMAX + 5];
int cnt_less[4 * NMAX + 5];
int lazy[4 * NMAX + 5];
set<int> wh[4 * NMAX + 5];
void propag(int nod,int st,int dr){
if(lazy[nod] == 0 || st == dr){
return ;
}
aint[2 * nod] -= lazy[nod];
cnt_less[2 * nod] += lazy[nod];
lazy[2 * nod] += lazy[nod];
aint[2 * nod + 1] -= lazy[nod];
cnt_less[2 * nod + 1] += lazy[nod];
lazy[2 * nod + 1] += lazy[nod];
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... |