# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102505 | IOrtroiii | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 2941 ms | 62384 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;
using Arr = array<int, 3>;
const int N = 500500;
const int inf = 1e9;
int lz[N << 3];
int cnt[N << 3];
int val[N << 3];
void push(int v,int l,int r) {
if (lz[v]) {
val[v] += lz[v];
if (l < r) {
lz[v << 1] += lz[v];
lz[v << 1 | 1] += lz[v];
}
lz[v] = 0;
}
}
void upd(int v,int l,int r,int p,int x,int y) {
push(v, l, r);
if (p > r || p < l) return;
if (l == r) {
val[v] = x;
cnt[v] = y;
# | 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... |