Submission #1094768

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1094768	2024-09-30 13:41:43	vjudge1	Bubble Sort 2 (JOI18_bubblesort2)	C++14	100 / 100	1260 ms	51648 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;
using pi = pair<int,int>;
struct Segtree{
  int n;
  vector<int> t,lz;
  Segtree(int _n){
    n=_n;
    int s=4<<(31-__builtin_clz(n));
    t.assign(s,0);
    lz.assign(s,0);
  }
  void push(int l,int r,int i){
    t[i]+=lz[i];
    if(l<r){
      lz[i*2]+=lz[i];
      lz[i*2+1]+=lz[i];
    }
    lz[i]=0;
  }
  void update(int l,int r,int i,int x,int y,int v){
    push(l,r,i);
    if(y<l||r<x)return;
    if(x<=l&&r<=y)return lz[i]=v,push(l,r,i);
    int m=(l+r)/2;
    update(l,m,i*2,x,y,v);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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