# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
513760 | andrei_boaca | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 5187 ms | 168512 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 <bits/stdc++.h>
#include "bubblesort2.h"
//#include "grader.cpp"
using namespace std;
const int INF=1e9;
typedef pair<int,int> pii;
map<pii,int> nrm;
int arb[4000005],toprop[4000005];
int q,n;
vector<pii> query;
vector<int> v;
set<pii> s;
int nr=0;
void prop(int nod)
{
int val=toprop[nod];
for(int i=nod*2;i<=nod*2+1;i++)
{
arb[i]+=val;
toprop[i]+=val;
}
}
void update(int nod,int st,int dr,int a,int b,int val)
{
if(toprop[nod]!=0&&st!=dr)
prop(nod);
toprop[nod]=0;
if(st>=a&&dr<=b)
{
arb[nod]+=val;
# | 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... |