Submission #441185

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
441185	2021-07-04 13:52:44	peijar	Bubble Sort 2 (JOI18_bubblesort2)	C++17	100 / 100	4003 ms	189776 KiB

bubblesort2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (1 << 21) + 1;
int iDeb[MAXN], iFin[MAXN], maxVal[MAXN], lazyAdd[MAXN];
set<int> ids[MAXN];
int curDelta[MAXN];
void pull(int iNoeud) {
  maxVal[iNoeud] = max(maxVal[2 * iNoeud], maxVal[2 * iNoeud + 1]);
}
void push(int iNoeud) {
  if (!lazyAdd[iNoeud])
    return;
  maxVal[iNoeud] += lazyAdd[iNoeud];
  if (iDeb[iNoeud] < iFin[iNoeud]) {
    lazyAdd[2 * iNoeud] += lazyAdd[iNoeud];
    lazyAdd[1 + 2 * iNoeud] += lazyAdd[iNoeud];
  } else {
    curDelta[iDeb[iNoeud]] += lazyAdd[iNoeud];
  }
  lazyAdd[iNoeud] = 0;
}
void buildTree(int iNoeud, int deb, int fin) {
  iDeb[iNoeud] = deb, iFin[iNoeud] = fin;
  maxVal[iNoeud] = -1e9;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 21 / 21
• Subtask 3: 22 / 22
• Subtask 4: 40 / 40