oj.uz

Submission #409243

# Submission time Handle Problem Language Result Execution time Memory
409243 2021-05-20T12:15:41 Z codebuster_10 Bubble Sort 2 (JOI18_bubblesort2) C++17
100 / 100
 4500 ms 85608 KB 
#include <bits/stdc++.h>

using namespace std ;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue

#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}

void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
}


/* 
  * Description segment tree for mass changes using lazy propagation
  * source: pashka edu course with very little own modifications 
  * verify commutivity and distributivity property for changes, assignement ans sum do not follow these property
  * set ID, NEUTRAL_ELEMENT, NO_OPERATION accordingly.
  * update on interval [l, r) and query val at range [l, r)
  * change x tells that at x this change is done but have to propogate to children
  * verification :- https://codeforces.com/edu/course/2/lesson/5/2/practice/status
*/

const int inf = 1e9;
template<class T, class H> struct lazy_segment_tree { 
	const T ID = 0, NEUTRAL_ELEMENT = 0;
  const H NO_OPERATION = 0;
  int size ;
  vector<T> segment_tree;
  vector<H> change;

  void apply_lazy_on_change(H &a, H b){ 
    a += b;
  }  

  T combiner_function(T a, T b){  
    return max(a,b);
  }

  void apply_lazy_on_node(T &a, H b){
    a += b;
  }
    
  void propogate(int x, int lx, int rx){
    if(rx - lx == 1) return ;
    apply_lazy_on_node(segment_tree[2 * x + 1], change[x]); 
    apply_lazy_on_node(segment_tree[2 * x + 2], change[x]);
    apply_lazy_on_change(change[2 * x + 1], change[x]);
    apply_lazy_on_change(change[2 * x + 2], change[x]);
    change[x] = NO_OPERATION;
  }
  
  void init(int n){ 
    size = 1;
    while(size < n) size *= 2;
    segment_tree.assign(2*size - 1, ID); 
		change.assign(2*size - 1, NO_OPERATION); 
  }
  
  void build(const vector<T> &initial){
  	int _size = int(initial.size());
  	init(_size);
  	assert(_size <= size);
  	build(0, 0, size, initial, _size);
  }
  void build(int x, int lx, int rx, const vector<T> &initial, int _size){
  	if(rx - lx == 1){
  		if(x >= size - 1 && x - size + 1 < _size){
  			segment_tree[x] = initial[x - size + 1];
  		}else{
  			segment_tree[x] = ID;
  		}
  	}else{
  		int mid = (lx + rx)/2;
  		build(2 * x + 1, lx, mid, initial, _size);
  		build(2 * x + 2, mid, rx, initial, _size);
  		segment_tree[x] = combiner_function(segment_tree[2 * x + 1], segment_tree[2 * x + 2]);
  	}
  }
  
	void update(int l, int r, int x, int lx, int rx, H value) { 
    propogate(x, lx, rx) ;
    if( lx >= r || l >= rx ){
      return;
    }
    if( lx >= l && rx <= r){
      apply_lazy_on_node(segment_tree[x], value);
      apply_lazy_on_change(change[x], value);  
      return ;
    }
    int mid = (rx + lx)/2 ;
  	update(l, r, 2 * x + 1, lx, mid, value); 
		update(l, r, 2 * x + 2, mid, rx, value); 
		segment_tree[x] = combiner_function(segment_tree[2 * x + 1], segment_tree[2 * x + 2]) ;
		return ;
  }
  
  void update(int l, int r, H value) { 
    update(l, r, 0, 0, size, value) ; return ;
  }
  
  T query(int l, int r, int x, int lx, int rx) { 
    propogate(x, lx, rx) ;
    if( lx >= r || l >= rx ){
      return NEUTRAL_ELEMENT;
    }
    if( lx >= l && rx <= r){
      return segment_tree[x] ;
    }
    int mid = (rx + lx)/2 ;
		return combiner_function(query(l, r, 2 * x + 1, lx, mid), query(l, r, 2 * x + 2, mid, rx)) ;
  }
  
	T query(int l, int r) { 
    return query(l, r, 0, 0, size) ;
  }
};

const int LOG = 25;
#undef int 
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
#define int int64_t
  setIO() ;
  int n = sz(A), q = sz(X); 
  vt<int> a(n);
  f(i,0,n) a[i] = A[i];
  vt<pr<int,int>> query(q);
  f(i,0,q){
  	query[i] = {X[i],V[i]};
  }
  
  vt<int> comp;
  f(i,0,n){
  	comp.pb((a[i]<<(int)LOG) + i);
  }
  for(auto& [i,x]:query){
  	comp.pb((x<<(int)LOG) + i);
  }
  sort(all(comp));
  comp.erase(unique(all(comp)),comp.end());
  int m = sz(comp);
  
  lazy_segment_tree<int,int> st;
  st.init(m);
  
  auto add = [&](int i){
  	int j = lower_bound(all(comp),(a[i]<<(int)LOG) + i) - comp.begin();
		//assert(comp[j] == (a[i]<<(int)LOG) + i);
  	st.update(j+1,m+1,-1);
  	st.update(j,j+1,i);
  };
  auto rem = [&](int i){
  	int j = lower_bound(all(comp),(a[i]<<(int)LOG) + i) - comp.begin();
		//assert(comp[j] == (a[i]<<(int)LOG) + i);
  	st.update(j+1,m+1,1);
  	st.update(j,j+1,-i);
  };
  
  f(i,0,n) add(i);
  vt<int> ans;
  for(auto [i,x]:query){
  	rem(i);
  	a[i] = x;
  	add(i);
  	ans.pb(st.query(0,m+1));
  }
#undef int 
	vt<int> _ans(q);
	f(i,0,q) _ans[i] = ans[i];
	return _ans; 
}

/*
#include <cstdio>
#include <cstdlib>
#include <vector>

int readInt(){
	int i;
	if(scanf("%d",&i)!=1){
		fprintf(stderr,"Error while reading input\n");
		exit(1);
	}
	return i;
}

int main(){
	int N,Q;
	N=readInt();
	Q=readInt();
	
	std::vector<int> A(N);
	for(int i=0;i<N;i++)
		A[i]=readInt();
	
	std::vector<int> X(Q),V(Q);
	for(int j=0;j<Q;j++){
		X[j]=readInt();
		V[j]=readInt();
	}
	
	std::vector<int> res=countScans(A,X,V);
	
	for(int j=0;j<int(res.size());j++)
		printf("%d\n",res[j]);
}

*/

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 8 ms 588 KB Output is correct
4 Correct 8 ms 588 KB Output is correct
5 Correct 8 ms 588 KB Output is correct
6 Correct 8 ms 588 KB Output is correct
7 Correct 8 ms 588 KB Output is correct
8 Correct 8 ms 556 KB Output is correct
9 Correct 8 ms 556 KB Output is correct
10 Correct 7 ms 556 KB Output is correct
11 Correct 7 ms 588 KB Output is correct
12 Correct 8 ms 640 KB Output is correct
13 Correct 7 ms 588 KB Output is correct
14 Correct 8 ms 636 KB Output is correct
15 Correct 8 ms 588 KB Output is correct
16 Correct 8 ms 636 KB Output is correct
17 Correct 8 ms 588 KB Output is correct
18 Correct 8 ms 640 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 8 ms 588 KB Output is correct
4 Correct 8 ms 588 KB Output is correct
5 Correct 8 ms 588 KB Output is correct
6 Correct 8 ms 588 KB Output is correct
7 Correct 8 ms 588 KB Output is correct
8 Correct 8 ms 556 KB Output is correct
9 Correct 8 ms 556 KB Output is correct
10 Correct 7 ms 556 KB Output is correct
11 Correct 7 ms 588 KB Output is correct
12 Correct 8 ms 640 KB Output is correct
13 Correct 7 ms 588 KB Output is correct
14 Correct 8 ms 636 KB Output is correct
15 Correct 8 ms 588 KB Output is correct
16 Correct 8 ms 636 KB Output is correct
17 Correct 8 ms 588 KB Output is correct
18 Correct 8 ms 640 KB Output is correct
19 Correct 29 ms 1484 KB Output is correct
20 Correct 35 ms 1612 KB Output is correct
21 Correct 34 ms 1612 KB Output is correct
22 Correct 34 ms 1672 KB Output is correct
23 Correct 35 ms 1624 KB Output is correct
24 Correct 34 ms 1612 KB Output is correct
25 Correct 34 ms 1612 KB Output is correct
26 Correct 34 ms 1640 KB Output is correct
27 Correct 33 ms 1628 KB Output is correct
28 Correct 34 ms 1612 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2288 KB Output is correct
2 Correct 148 ms 4968 KB Output is correct
3 Correct 263 ms 9028 KB Output is correct
4 Correct 260 ms 9004 KB Output is correct
5 Correct 273 ms 9036 KB Output is correct
6 Correct 276 ms 9024 KB Output is correct
7 Correct 282 ms 9040 KB Output is correct
8 Correct 274 ms 9040 KB Output is correct
9 Correct 253 ms 8992 KB Output is correct
10 Correct 230 ms 6976 KB Output is correct
11 Correct 234 ms 7064 KB Output is correct
12 Correct 231 ms 6976 KB Output is correct
13 Correct 227 ms 7020 KB Output is correct
14 Correct 212 ms 6932 KB Output is correct
15 Correct 221 ms 6976 KB Output is correct
16 Correct 220 ms 6976 KB Output is correct
17 Correct 213 ms 7044 KB Output is correct
18 Correct 211 ms 6976 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 8 ms 588 KB Output is correct
4 Correct 8 ms 588 KB Output is correct
5 Correct 8 ms 588 KB Output is correct
6 Correct 8 ms 588 KB Output is correct
7 Correct 8 ms 588 KB Output is correct
8 Correct 8 ms 556 KB Output is correct
9 Correct 8 ms 556 KB Output is correct
10 Correct 7 ms 556 KB Output is correct
11 Correct 7 ms 588 KB Output is correct
12 Correct 8 ms 640 KB Output is correct
13 Correct 7 ms 588 KB Output is correct
14 Correct 8 ms 636 KB Output is correct
15 Correct 8 ms 588 KB Output is correct
16 Correct 8 ms 636 KB Output is correct
17 Correct 8 ms 588 KB Output is correct
18 Correct 8 ms 640 KB Output is correct
19 Correct 29 ms 1484 KB Output is correct
20 Correct 35 ms 1612 KB Output is correct
21 Correct 34 ms 1612 KB Output is correct
22 Correct 34 ms 1672 KB Output is correct
23 Correct 35 ms 1624 KB Output is correct
24 Correct 34 ms 1612 KB Output is correct
25 Correct 34 ms 1612 KB Output is correct
26 Correct 34 ms 1640 KB Output is correct
27 Correct 33 ms 1628 KB Output is correct
28 Correct 34 ms 1612 KB Output is correct
29 Correct 47 ms 2288 KB Output is correct
30 Correct 148 ms 4968 KB Output is correct
31 Correct 263 ms 9028 KB Output is correct
32 Correct 260 ms 9004 KB Output is correct
33 Correct 273 ms 9036 KB Output is correct
34 Correct 276 ms 9024 KB Output is correct
35 Correct 282 ms 9040 KB Output is correct
36 Correct 274 ms 9040 KB Output is correct
37 Correct 253 ms 8992 KB Output is correct
38 Correct 230 ms 6976 KB Output is correct
39 Correct 234 ms 7064 KB Output is correct
40 Correct 231 ms 6976 KB Output is correct
41 Correct 227 ms 7020 KB Output is correct
42 Correct 212 ms 6932 KB Output is correct
43 Correct 221 ms 6976 KB Output is correct
44 Correct 220 ms 6976 KB Output is correct
45 Correct 213 ms 7044 KB Output is correct
46 Correct 211 ms 6976 KB Output is correct
47 Correct 1012 ms 32732 KB Output is correct
48 Correct 4104 ms 81960 KB Output is correct
49 Correct 4426 ms 85368 KB Output is correct
50 Correct 4435 ms 85396 KB Output is correct
51 Correct 4500 ms 85332 KB Output is correct
52 Correct 4470 ms 85500 KB Output is correct
53 Correct 4489 ms 85348 KB Output is correct
54 Correct 4059 ms 85476 KB Output is correct
55 Correct 4226 ms 85608 KB Output is correct
56 Correct 3988 ms 85432 KB Output is correct
57 Correct 4156 ms 85556 KB Output is correct
58 Correct 4094 ms 85544 KB Output is correct
59 Correct 3909 ms 84076 KB Output is correct
60 Correct 3377 ms 84264 KB Output is correct
61 Correct 3676 ms 84176 KB Output is correct
62 Correct 3636 ms 83924 KB Output is correct
63 Correct 3718 ms 84116 KB Output is correct
64 Correct 3684 ms 83968 KB Output is correct
65 Correct 3585 ms 83904 KB Output is correct
66 Correct 3562 ms 83820 KB Output is correct
67 Correct 3545 ms 83848 KB Output is correct